Alphabeta Math
LemmaStatement: 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.

The local-GCH Hartogs dichotomy

Statement

Work in ZF. Suppose ω⪯X and CH(X). If h(X)⪯P(X), then X is well-orderable and P(X)≈h(X). Otherwise h(P(X))=h(X).

Facts & Assumptions

[F1]

Local GCH absorbs sums and squares: Under the hypotheses, X absorbs its square and two copies; the power set absorbs its square.

[F2]

Power-set fibres force well-orderability: An injection X×P(X)→X⊔α well-orders X.

[F3]

Hartogs: an ordinal that does not inject into a given set: No injection h(X)→X exists, and every smaller ordinal embeds.

[F5]

The Schröder-Bernstein theorem: Opposite injections yield a bijection.

Proof

Given: The objects and hypotheses in the statement.

1.1F1F3

Put P=P(X) and h=h(X). Suppose h⪯P. Then X≺X⊔h⪯P⊔P≈P. Strictness holds because X⊔h≈X would embed h into X. For the last bijection, P⊔P≈P(X⊔1)≈P, using the omega shift. Local GCH therefore gives X⊔h≈P.

2.1F1F2F5step 1.1

Singleton injection in the first coordinate and square absorption give X×P⪯P2≈P, while P⪯X×P using one fixed point of X. Thus X×P≈P≈X⊔h, and the fibre lemma well-orders X.

3.1F3F4F5step 1.1step 2.1

Let λ be the least ordinal equipotent with this well-orderable X. Hartogs h is an infinite initial ordinal: an equipotent smaller ordinal would contradict its least-nonembedding property. Moreover λ<h. Both X and h embed in h, so X⊔h injects into h×h≈h, and the reverse injection is immediate. Hence P≈h.

4.1F3∎

If instead h(X) does not inject into P, its least nonembedding ordinal satisfies h(P)≤h(X). Since X injects into P by singletons, every ordinal embedding into X embeds into P, so h(X)≤h(P). This yields the second branch.

Depends on

Used by

Dependency tree · two levels

32 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