Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Finite support for constructibility absoluteness

Statement

There is a fixed finite fragment KLZF such that every nonempty transitive set M satisfying KL has a limit ordinal δM=OrdM and

LM=LδMM.

Consequently, if MN are nonempty transitive KL-models with the same ordinals, then LM=LNM. In particular, every xNM witnesses NVL.

Here KL is a finite list of actual ZF axiom sentences and schema instances, not the assertion that either set models all of ZF.

Facts & Assumptions

Given: The fixed first-order presentation of ZF and the fixed formulas for ordinals, constructible histories and membership in L.

[F1]

Absoluteness, idempotence and minimality of L proves the comparison of internal and external constructible histories for transitive ZF models by one fixed induction using absoluteness of the definable-subset operation.

[F2]

Finite support, weakening, and composition of derivations extracts the finitely many nonlogical axiom occurrences from any fixed formal derivation and permits weakening by further axioms.

[F3]

Transitive models and finite-fragment transfer data defines what it means for a transitive set to satisfy a fixed finite sentence fragment; no full-theory satisfaction predicate is implicit.

Proof

1.1

Expand the proof used in F1 into the fixed first-order formulas named in the Given. Its induction says simultaneously that, for every internal ordinal α, the internally constructed history through α is the actual history and hence (Lα)M=Lα. At a successor, finite satisfaction over the transitive set Lβ is absolute, so the two definable-subset operations agree. At a limit, transitivity gives exactly the actual earlier indices and union gives exactly their union. The proof uses only finitely many instances of Separation, Replacement and Foundation, together with finitely many of the remaining ZF axioms. By F2, let K0 be the exact finite set of ZF axiom sentences occurring in this expanded derivation. Thus the comparison holds for every transitive K0-model; no occurrence of the hypothesis "model of ZF" remains unexpanded.

F1F2F3induction
2.1

Add to K0 the finitely many axiom occurrences in the fixed proofs that Infinity supplies an internal nonzero limit ordinal, that the ordinals of a nonempty transitive set form an ordinal with no largest member, and that the fixed formula xL is equivalent internally to membership in some level of its hierarchy. Call the resulting finite fragment KL. If M is a transitive KL-model and δM=OrdM, these fixed proofs make δM a nonzero limit ordinal and give LM=α<δM(Lα)M. By step 1.1 every summand is the actual Lα. Each such level is an element of M, and transitivity puts all of its elements in M. Therefore LM=LδMM.

F2F3step 1.1
3.1

Suppose MN are transitive KL-models with the same ordinals. Then δM=δN, so step 2.1 gives LM=LδM=LδN=LNM.

step 2.1
4.1

If xNM, step 3.1 gives xLN. Since x is an element of the universe of N but is not internally constructible there, NVL. This last implication uses the fixed internal formula for xL and does not compare LN with constructible levels above the common ordinal height.

step 3.1

Depends on

Used by

Dependency tree · two levels

14 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