Question: Let (A, R) be a poset, and let C A. If (C C) R = , then for all distinct

Let (A, R) be a poset, and let ∅ ≠ C ⊆ A. If (C × C) ⋂ R = ∅, then for all distinct x, y ∈ C we have x R y and y R x. The elements of C are said to form an antichain in the poset (A, R).
(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

1 Expert Approved Answer
Step: 1 Unlock

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

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (7910).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!