How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
FALSE: transfinite induction and recursion need the Axiom of Choice
Statement
FALSE. Transfinite induction (Transfinite induction) and transfinite recursion (Transfinite recursion) require the Axiom of Choice (The Axiom of Choice): arguments that run along a well-order past the finite stages are not available in ZF alone.
The claim is plausible because the constructions one meets first do cost the Axiom of Choice. Well ordering an arbitrary set, extending a linearly independent family to a basis, building a maximal object stage by stage: each of these is usually presented as a transfinite recursion, and each really does need choice. The confusion is about which half of the argument is expensive. It is never the recursion.
Facts & Assumptions
Given: The axioms of ZF. The two theorems named in the claim are proved earlier on this page, and the point at issue is which axioms those proofs consume.
The Axiom of Choice is the statement that every family of nonempty sets has a choice function (The Axiom of Choice).
Transfinite induction is proved from a single property of the well-order, that every nonempty subset has a least element, with no selection anywhere (Transfinite induction).
Transfinite recursion is proved from Separation, Union and Replacement, and at every stage the object used is the unique attempt with the given domain, so nothing is selected (Transfinite recursion).
The place where this development genuinely spends the Axiom of Choice is Zorn's lemma (Zorn's lemma), consumed once inside the well-ordering theorem (The well-ordering theorem).
Refutation
By [L1], transfinite induction is a theorem of ZF: its proof takes the least element of the complement of the given set and derives a contradiction, and no family of sets is ever chosen from.
By [L2], transfinite recursion is a theorem schema of ZF: Replacement collects the attempts, and uniqueness of the attempt with a given domain means the construction is determined rather than selected.
Both principles are therefore available in ZF without any choice principle, so the claim is false.
The correct diagnosis is that the recursion is never itself the cost: by [L2] it is a theorem schema of ZF for every class function given by a formula. What can cost the Axiom of Choice is obtaining that class function, which happens when its defining formula carries a parameter that ZF does not supply, or when ZF does not prove the formula total and functional. A formula whose only parameters are available in ZF, as with the order type assignment and the Hartogs construction on this page, gives a choice-free construction; the informal rule "at stage take some element not yet used" becomes such a formula only after a choice function has been supplied as a parameter, and supplying it is exactly how the well-ordering theorem spends the axiom, whether through Zorn's lemma or through Zermelo's direct recursion along a choice function.
Transfinite induction and transfinite recursion are theorems of ZF, and the claim is refuted.
Remarks
A useful test. Ask what the value at stage is. If the answer is a definite description, "the least ordinal such that", "the order type of", "the union of the earlier values", and every object the description mentions is one ZF supplies, then the construction is choice-free. If the answer is "some element with the following property", and there is generally more than one, then a choice function is being used and must be paid for. The parameter clause is not decoration: "the element picks from the set of points not yet used" is a perfectly definite description, and it is Zermelo's construction, whose whole cost is obtaining .
Three choice-free constructions on this page. The collapsing map of Every well-order has a unique order type, the family of order types in Hartogs: an ordinal that does not inject into a given set, and the comparison map of Comparability of well-orders are all defined by formulas, which is why each is a ZF theorem. Their proofs say so explicitly, and the reason is always the same: rigidity of well-orders makes the relevant witnesses unique (Rigidity of well-orders).
Dependent choice is the usual hidden cost. A construction along that picks an object at each step, using the previous one, needs the principle of dependent choice (DC). It is not transfinite recursion that costs this; it is the picking. Where DC sits is a separate question and a strictly metamathematical one: if ZF is consistent, then DC is not a theorem of ZF and DC does not imply the Axiom of Choice, so DC is then strictly between the two. Both separations are external results, established by forcing and permutation models, quoted from the references and proved nowhere in this library; the consistency hypothesis cannot be dropped and cannot be proved inside ZF. The refutation above needs none of this, because transfinite induction and transfinite recursion are outright theorems of ZF and the claim is refuted by exhibiting their proofs. The ledger of principles is The choice ledger: what costs the Axiom of Choice and what does not.
Ordinary induction is the same story. Nobody suspects induction on (The principle of mathematical induction) of using choice, and transfinite induction is the same theorem with replaced by an arbitrary well-order. The proofs are the same length and use the same single ingredient.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 22 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Transfinite induction (Wikipedia) (standard reference, not scraped)
- Axiom of choice (Wikipedia) (standard reference, not scraped)
- Axiom schema of replacement (Wikipedia) (standard reference, not scraped)
- Axiom of dependent choice (Wikipedia) (standard reference, not scraped)
- The Axiom of Choice (Stanford Encyclopedia of Philosophy) (standard reference, not scraped)