Question: Let (A, R) be a poset, and let C A. If (C C) R = , then for all distinct
(a) Find an antichain with three elements for the poset given in the Hasse diagram of Fig. 7.18(d). Determine a largest antichain containing the element 6. Determine a largest antichain for this poset.
(b) If U = {1, 2, 3, 4}, let A = P(U). Find two different antichains for the poset (A, ⊆). How many elements occur in a largest antichain for this poset?
(c) Prove that in any poset (A, R), the set of all maximal elements and the set of all minimal elements are antichains.
Step by Step Solution
3.51 Rating (154 Votes )
There are 3 Steps involved in it
a 2 3 5 5 6 7 11 2 3 5 7 11 b 1 2 3 4 1 2 3 2 3 4 4 c Consider the set M of a... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (7910).docx
120 KBs Word File
