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.

Cohen's first model: an infinite Dedekind-finite set of reals

Statement

If ZF is consistent, then ZF is consistent with the existence of a set A⊆R that is infinite and Dedekind-finite: A is not equinumerous with any natural number, yet A has no countably infinite subset, equivalently A is not equinumerous with any proper subset of itself.

This is the model Cohen produced first, in 1963. Adjoin a countable family (an)n∈N of mutually generic Cohen reals to a countable transitive model of ZFC, and pass to the symmetric submodel determined by finite supports and the full permutation group of the indices. In that submodel the set A={an:n∈N} exists, but the sequence n↦an does not: a hereditarily symmetric name for an injection N→A has a finite support E, and a permutation of the indices fixing E but moving some index outside E then fixes the injection while moving one of its values, which is impossible. So A is infinite and has no countably infinite subset in the model.

Remarks

  • Not proved in this library. The symmetric-extension construction is not developed here; the description above is a statement of what is built, not a construction carried out.

  • What would prove it. Forcing with finite partial functions Fn(N×N,2), the automorphism action on names, and the finite-support symmetric submodel, together with the standard genericity argument showing that no name for an injection N→A is hereditarily symmetric. That is the same forcing track named in Cohen 1963: ZF does not prove the Axiom of Choice ‡.

  • Why it matters later. The natural argument "A is infinite, so pick a0, then a1, and so on" uses a choice principle (The Axiom of Countable Choice (ACω) ↗). Once the symmetric-model construction is proved, this model will witness that such an extraction is not available in ZF. It also explains why Finite, countably infinite, countable, uncountable ↗ keeps ordinary and Dedekind finiteness distinct at the definitional level.

  • Conditional discipline. As always, the statement is an implication between consistency statements. This library never asserts that an infinite Dedekind-finite set exists, only that ZF cannot rule one out unless ZF is inconsistent.

Depends on

Used by

Nothing in the library uses this result yet.

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