Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Rado (1949), the theorem in §4, part (ii), statement on printed p. 341 and proof on pp. 342–343 (canonical PDF).
Statement. Part (ii) of the Theorem: If and is independent, there is a base of containing . In particular, every subset of , including the empty set, has a base.
Proof. Let
partially ordered by inclusion. It is a set and is nonempty because .
Let be a nonempty chain and set . Then . Every nonempty finite is contained in one member of : first choose, for each element of , a chain member containing it, then take the largest of these finitely many members under inclusion. That member is independent, so . For the same equality is (R1). Thus is independent and lies in , where it is an upper bound for . The empty chain has the upper bound .
The exact Zorn lemma therefore supplies a maximal . If an independent set satisfied , it would still contain , so it would contradict maximality in . Hence is a base of . Taking gives the last assertion.
Source correction. On printed p. 343 the chain is denoted and its union . The source prints . What has been proved, and what Zorn's lemma requires, is , the ambient poset. A chain need not contain its own union. For example, the increasing chain of finite initial segments of has union , which is not one of those segments. The proof above uses the correct ambient membership and also treats the empty chain. This is a compilation clarification, not a claim of an author-issued erratum.
This part uses only finite character of independence and Zorn's lemma. It does not depend on the representative theorem or on augmentation.