Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Dedekind infinitude is equivalent to a countable subset

Statement

In ZF the following are equivalent: X is Dedekind-infinite; ωX; and X{}X. Equivalently, X is Dedekind-finite iff h(X)ω. Here h is the Hartogs number.

Facts & Assumptions

[F1]

Dedekind-infinite and Dedekind-finite sets: Dedekind infinitude is witnessed by an injective nonsurjective self-map.

[F2]

The recursion theorem: Iterates of a specified self-map form an omega sequence.

[F3]

Hartogs: an ordinal that does not inject into a given set: An ordinal below h(X) embeds into X, while h(X) does not.

Proof

Given: The objects and hypotheses in the statement.

1.1

For an injective nonsurjective f:XX, fix af[X] and put an=fn(a). If am=an with m<n, cancel f repeatedly to get a=fnm(a)f[X], impossible. Thus nan injects omega into X.

F1F2
1.2

Given an injection nan, send to a0, each an to an+1, and every other point of X to itself. This is a bijection X{}X. Conversely, restricting any such bijection to X is injective and misses the image of , proving Dedekind infinitude.

F1
2.1

By the least-nonembedding definition, omega embeds into X exactly when ω<h(X). Negating gives the asserted Dedekind-finite characterization. For finite X, including the empty set, no injective nonsurjective self-map exists, as finite counting also shows.

F3step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

13 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