Let (A, R) be a poset in which the length of a longest (maximal) chain is n

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 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.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: