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

Generics over countable transitive models in ZF

Statement

In ZF, let e:ω→M be an external surjective enumeration of a transitive set model M of ZF. If M contains a forcing preorder P and its order, then for each p∈P an M-generic filter through p exists. The existence of M and its enumeration are hypotheses.

Facts & Assumptions

Given: ZF with supplied external enumeration of M. Enumerate all ground dense sets with P as fallback, refine by least e-indices, and verify the resulting filter directly; no AC-dependent theorem is consumed.

[F1]

Dense open sets and generic filters over a model: Density is absolute, and genericity means meeting every ground-model dense set.

[F2]

Transfinite recursion: A unique definable successor rule gives a sequence on omega in ZF.

Proof

1.1F1F2construct

Set Dn=e(n) if e(n) is a dense subset of P, and Dn=P otherwise. Every ground-model dense subset occurs. For q in P let h(n,q)=e(k) for the least k such that e(k)∈Dn and e(k)≤q. Transitivity gives P⊆M, so surjectivity of e and density ensure such k exists. This is a uniquely defined rule, not a choice function obtained by AC. Recursively put p0=p and pn+1=h(n,pn).

2.1F1step 1.1∎

Put G={q∈P:∃n pn≤q}. Then p belongs to G; transitivity gives upward closure; and the term with index max(n,m) strengthens any two members witnessed by n,m. Thus G is a filter. Each pn+1∈Dn∩G, so F1 makes G M-generic. Neither the sequence nor G is asserted to be an element of M.

Depends on

Dependency tree · 2 levels

Sources