Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-07-26 (claude-opus-5)‡ rests on unproved material
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.

‡ Rests on 1 statement not proved in this library. Every dependency marked ‡ below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: the well-ordering theorem is a theorem of ZF

Statement

FALSE. Every set can be well ordered, and this is a theorem of ZF: the well-ordering theorem can be proved from the Zermelo-Fraenkel axioms without assuming the Axiom of Choice (The Axiom of Choice).

The claim is plausible because the intended construction looks like plain bookkeeping: line the elements of XX up one at a time, and keep going until none is left. Transfinite recursion really is a theorem of ZF, so the machinery for "keep going" is free. What is not free is the instruction "take an element not yet used": that is a selection, made simultaneously at every stage, and it is exactly the content of the Axiom of Choice. The proof of The well-ordering theorem isolates the cost in a single place.

Facts & Assumptions

Given: The axioms of ZF, assumed to be consistent, together with the external metamathematical result cited below. Every conclusion here is relative to that consistency assumption, which cannot be dropped and cannot be proved inside ZF.

‡ [A1]

If ZF is consistent, then ZF does not prove the Axiom of Choice (Cohen 1963, Cohen 1963: ZF does not prove the Axiom of Choice ‡). This is an external result, established by forcing, and it is NOT proved in this library; it presupposes the consistency of ZF assumed in the Given.

[L1]

If every set can be well ordered then the Axiom of Choice holds, and this implication is itself proved in ZF (The well-ordering theorem implies the Axiom of Choice).

[L2]

Over ZF the Axiom of Choice, Zorn's lemma and the well-ordering theorem are equivalent (Choice, Zorn and well-ordering are equivalent).

[L3]

The same conditional discipline, for Zorn's lemma in place of the well-ordering theorem, is recorded in FALSE: Zorn's lemma is a theorem of ZF.

Refutation

technique · contradiction
1.1

Suppose the well-ordering theorem were a theorem of ZF.

assume-contra
1.2

The implication from the well-ordering theorem to the Axiom of Choice is proved in ZF and uses no choice principle.

L1L2
2.1

Chaining a ZF theorem with a ZF-provable implication yields a ZF theorem, so the Axiom of Choice would be a theorem of ZF.

step 1.1step 1.2
3.1

This contradicts [A1], which holds under the consistency of ZF assumed in the Given; so, under that assumption, the well-ordering theorem is not a theorem of ZF. Equivalently and without any assumption: if ZF proves that every set can be well ordered, then ZF proves the Axiom of Choice and ZF is therefore inconsistent.

step 2.1‡ A1L3discharge-contradiction∎

Remarks

What is and is not proved here. The refutation is a genuine ZF argument given the cited independence result, but that result itself is not proved in this library: Cohen's theorem requires forcing, which is deferred. The honest reading is therefore conditional, namely that the well-ordering theorem is a theorem of ZF only if ZF is inconsistent. It is recorded this way deliberately rather than presented as fully derived, exactly as in FALSE: Zorn's lemma is a theorem of ZF.

The companion half. That ZF cannot refute the Axiom of Choice is Gödel's 1938 constructible universe result. Together with Cohen's, it says the Axiom of Choice, and hence the well-ordering theorem, is genuinely independent of ZF.

What is true. "Every set can be well ordered" is a theorem of ZFC (The well-ordering theorem), and it is also true outright for many particular sets in ZF alone: N\mathbb{N} is well ordered by The well-ordering principle, every subset of a well-ordered set inherits a well-order, and every ordinal is well ordered by membership (Ordinal (von Neumann)). The false statement is about ZF proving it for every set.

Concretely what fails. In Cohen's models there are sets of real numbers that carry no well-order at all. The reader should resist the reflex that such a set must still be well orderable "somehow": in those models no well-ordering of it exists, full stop, and the reflex is precisely the Axiom of Choice being assumed without notice.

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: 27 results over 8 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