Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2007/iii/paper-26/2/i/solution
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 26 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Order the collection of all chains in a partial order, including the empty chain, by inclusion. Suppose that were an order-preserving injection. The chain-poset nonembedding lemma follows by a transfinite recursion of length the Hartogs ordinal :Inductively, the previously constructed points form a strictly increasing chain. If , then , since belongs to the latter but not the former. Monotonicity gives , and injectivity makes this inequality strict. Thus the recursion continues at every and gives an injection , contradicting the defining property of the Hartogs ordinal. Therefore The empty chain is part of the convention: excluding it would make a one-point poset a counterexample.
New to topics? Read the docs here!