Question: Let (A, R) be a poset in which the length of a longest (maximal) chain is n 2. Let M be the set of

Let (A, R) be a poset in which the length of a longest (maximal) chain is n ≥ 2. Let M be the set of all maximal elements in (A, R), and let B = A - M. If R' = (B × B) ⋂ R, prove that the length of a longest chain in (B, R') is n - 1.

Step by Step Solution

3.42 Rating (161 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Let a 1 Ra 2 RRa n1 Ra n be a longest maximal chain in A R Then a n is a m... 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 (7909).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!