Alphabeta Math
RemarkSession-authored (Fable 5 assisted) sources checked 2026-07-26 not proved here
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Gödel 1938: ZF does not refute the Axiom of Choice

Statement

If ZF is consistent, then ZF + AC + GCH is consistent. Here AC is the Axiom of Choice and GCH is the generalised continuum hypothesis.

Equivalently, and this is the form the library uses: if ZF is consistent, then ZF does not refute the Axiom of Choice, and ZFC does not refute GCH.

The witness is an inner model. Gödel (1938) defines the class LL of constructible sets by transfinite recursion along the ordinals, L0=,Lα+1=Def(Lα),Lλ=α<λLα  for limit λ,L=αOrdLα,L_0 = \emptyset, \quad L_{\alpha+1} = \mathrm{Def}(L_\alpha), \quad L_\lambda = \bigcup_{\alpha < \lambda} L_\alpha \ \text{ for limit } \lambda, \quad L = \bigcup_{\alpha \in \mathrm{Ord}} L_\alpha, where Def(X)\mathrm{Def}(X) is the set of subsets of XX definable over (X,)(X, \in) with parameters from XX. Working inside any model of ZF, one shows that LL satisfies every axiom of ZF, and in addition satisfies AC and GCH. Since a model of ZF yields a model of ZF + AC + GCH, the consistency of the second follows from the consistency of the first.

The conclusion is relative: it is an implication between consistency statements, and it is not, and cannot be, a proof that ZFC is consistent. By Gödel's second incompleteness theorem the consistency of ZF is not provable in ZF, so the hypothesis of the statement cannot be discharged here or anywhere.

Remarks

  • Not proved in this library. Nothing about LL is developed here. The definition above is recorded so the statement is precise, not as a construction this library carries out.

  • What would prove it. The theory of the constructible universe: the definability operator Def\mathrm{Def}, absoluteness of Δ0\Delta_0 formulas, the reflection and Löwenheim-Skolem arguments behind the condensation lemma, and from condensation the two consequences that LL has a definable global well-ordering (giving AC) and that every constructible subset of LωαL_{\omega_\alpha} appears by stage ωα+1\omega_{\alpha+1} (giving GCH). That is an inner-model track, and this library has not built it.

  • Why it matters here. This is the half of the independence of choice that says the Axiom of Choice is safe to assume: adding it to ZF cannot introduce a contradiction that was not already there. Every result in the library proved from The Axiom of Choice leans on that reassurance, and the accounting in The choice ledger: what costs the Axiom of Choice and what does not names this result as one of the two external facts it quotes. Its partner, that ZF cannot prove the Axiom of Choice either, is Cohen 1963: ZF does not prove the Axiom of Choice and is what FALSE: Zorn's lemma is a theorem of ZF actually uses.

  • Conditional discipline. The statement is never asserted unconditionally in this library. "ZF does not refute AC" is shorthand for the implication above, whose antecedent is the consistency of ZF.

Used by

Dependency tree · next 3 levels

Nothing. This result depends on no other item in the library.

Sources