Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Absoluteness, idempotence and minimality of L

Statement

In ZF, if N is a transitive model of ZF and αOrdN, then (Lα)N=Lα. If N is a definable transitive class inner model containing every ordinal, then LN=LN. In particular LL=L, and L satisfies V=L.

Facts & Assumptions

Given: ZF. External induction compares internal histories using Def absoluteness, not Power Set absoluteness. Minimality and idempotence are derived only after the previously authored ZF axioms license N=L.

[F1]

Absoluteness of the definable power-set operation: For a set A in a transitive ZF model, the internal Def set equals the external Def set.

[F2]

Elementary ZF axioms inside L: The six elementary ZF axioms already hold in L.

[F3]

Separation in the constructible universe: Every fixed instance of Separation holds in L.

[F4]

Internal Power Set in L: Internal Power Set holds in L.

[F5]

Replacement in L: Every Replacement instance holds in L.

Proof

1.1

Internal ZF gives N its hierarchy history on each ordinal interval in N. External induction identifies its values: at zero both are empty; if the value at γ is the actual LγN, F1 identifies its internal Def with Lγ+1. At a limit λN, transitivity makes the internal history have every actual index γ<λ, and its internal union has exactly the union of their actual values. Thus (Lα)N=LαN for every ordinal α of N.

F1given
2.1

If N contains all ordinals, every actual L level is therefore in N. Transitivity gives LN, and the internal existential definition of constructibility ranges over precisely all actual ordinals, so its union is exactly L. For a set model the same argument stops at its ordinal height; no higher level is asserted to belong to N.

step 1.1
3.1

The six axioms in F2, Separation in F3, internal Power Set in F4, and Replacement in F5 establish all of ZF in L. Earlier level properties give transitivity and all ordinals. Thus L itself meets the hypotheses of step 2.1, which now yields LL=L. Every element of L is internally constructible, exactly the relativization of V=L. This application occurs only after ZF in L has been established.

F2F3F4F5step 2.1

Depends on

Used by

Dependency tree · two levels

10 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