Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Absorption, factorization, and homogeneous truth in the Solovay collapse

Statement

For every f:ω→Ord in V[G], there are a real t and an ordinal β such that f∈V[t] and f is definable there from (t,β). There is also an Lv⁡(κ)V[f]-generic H over V[f] such that V[G]=V[f][H]. A sentence with parameters in V[f] and no occurrence of H has homogeneous Boolean value 0 or 1. The same factorization is available after adjoining one random or Cohen real.

Facts & Assumptions

Given: The Solovay collapse setup and a supplied generic extension.

[F1]

The Lévy collapse localizes countable ordinal data: every countable ordinal sequence belongs to a small initial-collapse extension.

[F2]

Forcing theorem: deciding conditions and the truth lemma compute forcing truth.

[F3]

The Axiom of Choice: ambient AC enumerates the dense sets and maximal antichains used in the absorption recursion.

Proof

1.1

By F1, choose ξ<κ with f∈V[Gξ]. Solovay's small-collapse factorization replaces this initial extension by V[F], where F:ω↠λ is a V-generic collapsing map for some ordinal λ<κ and f∈V[F]. Define

t={⟨m,n⟩:F(m)≤F(n)}.

Then t is a real. In V[t], quotienting ω by equality in the coded preorder and taking its well-order type reconstructs λ and F; hence V[F]=V[t]. Finally choose the canonically least constructible-ground name for f and let β be its ordinal code. Valuation by the generic recovered from t defines f from (t,β). This is the cited real-capture argument; constructibility is used only to replace the ground name parameter by β. [F1, F2, F3]

2.1F1F2F3step 1.1

The initial forcing has size below κ. Solovay's absorption construction recursively embeds its Boolean completion and the tail collapse into a fresh copy of Lv⁡(κ) over V[f]: at stage α<κ, put the next maximal antichain and the next dense set into coordinates above all earlier supports. Regularity of κ bounds each stage, and the union is a dense complete embedding. The image of G is therefore a generic H with both inclusions V[G]⊆V[f][H]⊆V[G]. F3 is used exactly to enumerate those dense sets and maximal antichains.

3.1F2step 2.1

The collapse is weakly homogeneous. Given p,q, first move the finitely many coordinates of p away from those of q by coordinate permutations; the moved p is compatible with q. If some condition forced a sentence φ(a⃗) and another forced its negation, apply such an automorphism. It fixes every a⃗∈V[f] and yields compatible conditions forcing opposites, contrary to forcing consistency. Density of decision then makes the Boolean value 0 or 1. The omission of H is essential.

4.1F1F2F3step 2.1step 3.1∎

Random and Cohen forcing have cardinal below κ in each localized model. Insert their Boolean completion as the first small factor in the same absorption recursion. Thus, after adjoining its generic real x, the remaining extension is again a homogeneous Lévy collapse over V[f,x].

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