Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-14
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 Blass ultrafilter-free construction is finitely formalizable

Statement

For every externally fixed finite fragment Δ of ZF together with the assertion that every ultrafilter on every set is principal, a suitable finite ZFC source proves that Blass's parameter-HOD construction yields a set model of Δ.

Facts & Assumptions

Given: One externally fixed finite list Δ containing finitely many ZF axiom instances and the displayed all-ultrafilters sentence. The quantification over Δ is metatheoretic; no uniform truth predicate or single countable transitive model of full ZF is assumed.

[F1]

Every ultrafilter on every set is principal in Blass's model proves, by the displayed parameter-HOD, tail-automorphism, least-ordinal, small-forcing, Scott, and W-rank argument, that every ultrafilter on every set of the constructed model is principal. In this lemma that displayed proof is the proof text whose formula instances are traced; none of its ingredients is being attributed to the theorem's statement as an additional conclusion.

[F2]

Forcing transfer for finite ZFC fragments extracts the finite source instances used by one fixed forcing verification and constructs a generic extension of a countable transitive model of those instances.

[F3]

Finite-fragment interpretation in L with GCH translates any fixed finite ZFC+GCH source fragment into a finite ZF fragment interpreted in its constructible universe.

[F4]

The Axiom of Choice records the ambient Choice used for the countable elementary-submodel construction and for the source-side cardinal and ultrapower arguments.

[F5]

Finite support, weakening, and composition of derivations proves that every formal derivation uses only finitely many assumptions.

Proof

technique · direct finite proof tracing through a constructible reflected source
1.1

Expand the proofs of the finitely many ZF instances in Δ and the displayed all-ultrafilters proof recorded at F1. Retain every actually used fixed formula: the Cohen forcing and truth recursions; finite-parameter definition and hereditary-closure formulas; tail automorphisms; ultrafilter and least-partition calculations; the finite-coordinate forcing relation; every fixed instance in the small-forcing restriction and normal ultrapower; the Scott V=L calculation; bounded definition-code satisfaction; and the two W-rank inductions. By F5 a formal proof has finite assumption support, so this expansion uses only finitely many Separation, Replacement, Reflection, recursion, satisfaction, and forcing-absoluteness instances. Let Σ be their finite source union, including the finite assertion that the source is constructible.

F1F5given
2.1

Enlarge Σ by the finitely many ZFC+GCH instances needed to define Fn(ω×ω,2), form its generic extension, and prove the following conditional contradiction used at F1: if the assumed free ultrafilter first produces a nonprincipal κ-complete ultrafilter in a finite-coordinate extension, then the small-forcing restriction produces one in the ground; its normal ultrapower gives Scott's contradiction to V=L. The source fragment contains the finite ultrapower and Łoś derivations under that displayed hypothesis. It contains no measurable-cardinal axiom and does not assert that a normal measure exists outright. Apply F3 to obtain a finite ΓZF proving the L-relativizations of all those source instances; include the finite proof that the interpretation domain satisfies V=L. This does not assert that one finite fragment proves every ZFC theorem: Γ depends externally on the fixed proof expansion in step 1.1.

F1F3step 1.1
3.1

Use the source-model and generic construction of F2 with enough of ambient ZFC to obtain a countable transitive CΓ. The external set M=LC is countable and transitive, and step 2.1 makes it satisfy every retained source instance as well as V=L. Enumerate its dense subsets of the Cohen forcing and construct an M-generic G. The parameter-HOD class defined in M[G] is an external subset of the set M[G], hence is itself a set structure. Every verification retained in step 1.1 is valid over this M and shows that the structure satisfies each member of Δ, including the assertion that all its ultrafilters are principal. Thus it is a set model of Δ.

F2F3step 1.1step 2.1
4.1

The construction is repeated separately for each externally supplied finite Δ. If the selected ZF subfragment is empty, the all-ultrafilters sentence and the finite source proof it requires are still retained; duplicate instances do no harm. Ambient AC is used only in F2's reflected countable source and in the explicitly retained source-side cardinal and ultrapower steps, as recorded by F4. The resulting parameter-HOD structure verifies only the selected target formulas and the displayed sentence: no full-ZF set model, uniform satisfaction predicate, or internal quantification over fragments has been inferred.

F2F4step 3.1

Depends on

Used by

Dependency tree · two levels

27 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