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.

Clubs are ranges of normal enumerations

Statement

In ZFC, any unbounded C⊆κ, with κ regular uncountable, has a unique increasing enumeration e:κ→C. The set C is closed iff this enumeration is normal. Consequently the range of a strictly increasing f:κ→κ is club iff f is normal.

Proof

Given: The objects and hypotheses in the statement.

1.1F2

The inherited ordinal order enumerates C by an ordinal η≤κ, successively taking the least unused point. Unboundedness and regularity force η≥κ, hence η=κ. The least-unused rule also proves uniqueness.

2.1F1F2step 1.1

If C is closed and 0<λ<κ is limit, δ=sup⁡ξ<λe(ξ)<κ is a limit point of C, hence lies in C. Strict increase and least-unused enumeration force e(λ)=δ. Thus e is normal.

3.1F1F2step 1.1∎

Conversely, if e is normal and δ<κ is a nonzero limit point of C, the indices of the points in C∩δ form an initial segment λ<κ with no last element. (They cannot be all kappa since C is unbounded.) Continuity gives e(λ)=δ, so C is closed. Finally, a strictly increasing map on kappa has unbounded range: a bounded range cannot contain kappa distinct ordinals. It is the increasing enumeration of its range, giving the last equivalence.

Depends on

Used by

Dependency tree · two levels

21 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