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

Homogeneous truth about a generic real has Borel representatives

Statement

For a formula over a localized intermediate N=V[f] to which the Solovay absorption factorization applies, an N-coded Borel set represents its truth in the final collapse extension for every N-random real. The Cohen analogue gives a Borel, hence open-mod-meagre, representative on N-Cohen generics.

Facts & Assumptions

Given: A formula φ(x,a,α) with parameters in N and the canonical generic-real name x˙.

[F1]

Absorption, factorization, and homogeneous truth in the Solovay collapse: after the real forcing, the remaining collapse is homogeneous over N[x].

[F2]

Forcing theorem: Boolean values have the truth-lemma interpretation.

[F3]

The Axiom of Choice: ambient AC supplies the maximal-antichain and Boolean-completion presentations used to form the Boolean values.

Proof

1.1

For a random real x over N, F1 factors the final extension as N[x][Hx] with homogeneous tail forcing Rx. In the random forcing language over N, let ψ(x˙) be the assertion that the top condition of Rx˙ forces φ(x˙,a,α). Use F3 to form b=ψ(x˙) in the completed random algebra and choose an N-coded Borel representative B of b. For every N-random x, the random-forcing truth lemma gives xB iff N[x]ψ(x). Homogeneity says the Boolean value of φ(x,a,α) in Rx is 0 or 1, and the tail truth lemma applied to the actual Hx therefore gives N[x]ψ(x) iff N[x][Hx]=V[G]φ(x,a,α). Thus B represents final-extension truth on every N-random real; no absoluteness from N[x] to its tail extension was used.

F1F2F3
2.1

In Cohen forcing use the analogous assertion ψ(x˙) that the top of the homogeneous tail forces φ(x˙,a,α). F3 supplies its regular-open Boolean value, with an N-coded regular-open representative U whose boundary is nowhere dense. The Cohen-forcing truth lemma and the same homogeneous-tail argument from step 1.1 show that, for every N-Cohen generic x, final-extension truth is equivalent to xU. Thus U is already a Borel representative, and it differs from an open set by the empty, hence meagre, set. The statement deliberately leaves all nongenerics as exceptions; their largeness is used only by later items after its countability hypothesis has been verified.

F1F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

9 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