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

Constructible subsets appear before successor cardinals

Statement

In ZF, if κ is an infinite cardinal and xL with xκ, then xLκ+. More generally, if xL and xLκ, then xLβ for some β<κ+.

Here κ+ is the Hartogs successor cardinal, so no ambient Choice is assumed.

Facts & Assumptions

Given: Ambient ZF, an infinite cardinal κ, and a constructible set x satisfying one of the displayed subset hypotheses.

[F1]

Canonical L-hulls are elementary and small makes the canonical hull of an infinite well-orderable seed elementary and of the same cardinality as that seed, without invoking Choice.

[F2]

Condensation for constructible levels identifies the collapse of an elementary substructure of a nonzero limit L-level as an actual level Lβ.

[F3]

What the collapse fixes says that the collapse fixes a transitive subset included in the hull, and determines images by images of their members.

[F4]

Cardinality of infinite constructible levels gives Lκ=κ and a well-order of Lκ.

[F6]

Transitivity, growth, ordinals and rank in L gives transitivity and nesting of the constructible levels.

Proof

1.1

Choose a nonzero limit θ large enough that x,κ,Lκ and the relevant finite seed belong to Lθ; this is possible because x is constructible and the L-levels are nested and exhaustive for L. For the first clause set A=κ{κ,x}, and for the second set A=Lκ{Lκ,κ,x}. Each seed is a subset of Lθ. In the first case A=κ because κ is infinite; in the second F4 gives the same conclusion. Both seeds are well-orderable.

F4F6given
2.1

Let H=HullLθ(A). By F1, HLθ and H is well-orderable with H=κ. Collapse H to M. By F2 there is an ordinal β with M=Lβ. Since β=OrdMM and the collapse bijects H with M, there is an injection βκ; F5 therefore gives β<κ+.

F1F2F5step 1.1
3.1

In the first case, κAH, so F3 fixes every ordinal below κ. Since xH and xκ, the recursive collapse equation gives π(x)={π(ξ):ξx}=x. Thus xM=Lβ. In the second case, LκH is transitive by F6, so F3 fixes it pointwise; again xH and xLκ imply π(x)=x, whence xLβ.

F3F6step 2.1
4.1

We have proved the general clause with β<κ+. For the first clause, nesting gives LβLκ+, so xLκ+. The case x= is included, and no selection from a family of sets occurred: the hull is canonical and the cardinal bound uses only the Hartogs successor.

F5F6step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

24 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