Alphabeta Math
Remark‡ 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.

The Feferman-Levy model: the reals as a countable union of countable sets

Statement

If ZF is consistent, then ZF is consistent with all of the following holding simultaneously:

  • R is a countable union of countable sets;
  • the first uncountable ordinal ω1 is singular, indeed cf(ω1)=ω;
  • consequently "a countable union of countable sets is countable" fails, and ω1 is not regular.

Feferman and Levy (1963) obtain this by collapsing: starting from a model of ZFC, force with the finite-support product that makes each ℵn of the ground model countable, for n∈N, and take the symmetric submodel with finite supports. The ground model's ℵω becomes the new ω1, and it is the supremum of the countably many ordinals ℵn, each now countable, so its cofinality is ω. The reals of the extension are the union over n of the reals added at stage n, and each of those layers is countable in the extension.

Note what does not fail: ω1 still exists, and R is still uncountable. A countable union of countable sets is being exhibited whose union is uncountable, which is possible exactly because no enumeration of the layers can be chosen uniformly.

Remarks

  • Not proved in this library. The Levy collapse and the symmetric submodel are not developed here.

  • What would prove it. The forcing track of Cohen 1963: ZF does not prove the Axiom of Choice ‡, specialised to the Levy collapse Coll(ω,<ℵω) with finite supports, plus the cofinality computation in the symmetric model. Ordinal and cardinal arithmetic beyond Cardinal (initial ordinal) and cardinality ↗ is also needed to state the cofinality claim properly.

  • Why it matters later. The countable union theorem Countable unions of at most countable sets, assuming ACω ↗ is proved here from The Axiom of Countable Choice (ACω) ↗. Once this model is constructed locally, it will show that the hypothesis cannot simply be dropped. It is also the standing warning attached to ω1: any counterexample built on the ordinal space [0,ω1) and its sequential compactness is silently spending a choice principle, because in this model ω1 has countable cofinality and those arguments collapse. Note also that R is uncountable (Cantor's nested intervals, 1874) ↗ survives untouched: it is a theorem of ZF, and it is not in tension with R being a countable union of countable sets.

  • Conditional discipline. Everything above is relative to the consistency of ZF, and this library never asserts that the reals are a countable union of countable sets, only that ZF alone cannot refute it.

Depends on

Used by

Dependency tree · two levels

2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources