Alphabeta Math
TheoremStatement: 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.

Every set of reals in the Solovay model is Lebesgue measurable

Statement

In M, every subset of R is Lebesgue measurable.

Facts & Assumptions

Given: AR with AM.

[F1]

The Solovay inner model satisfies ZF and every real set has a real–ordinal definition: A has a definition from one real and finitely many ordinals.

[F2]

The Lévy collapse localizes countable ordinal data: the real parameter lies in a bounded intermediate model N whose relevant real codes are countable in the final extension.

[F3]

Random and Cohen generics over an intermediate model are conull and comeagre: the N-random reals are conull in the final extension; its proof obtains the null exception by ambiently enumerating the N-coded null Borel sets.

[F4]

Homogeneous truth about a generic real has Borel representatives: an N-coded Borel B agrees with A on every N-random real.

[F5]

Borel-code, measure, category, and perfect-set absoluteness: the codes and nullness transfer to M, whose DC supplies completeness of the null ideal.

Proof

1.1

Use F2 to choose a bounded N containing F1's sole real definition parameter; the finitely many ordinal parameters require no localization. F4 gives an N-coded Borel set B agreeing with A on every N-random real. In the ambient final extension enumerate the N-coded null Borel sets as (Cn)n<ω, as in F3's proof, and let c be the real Borel code of their union C. Every nonrandom real lies in C, so ABC. The code c generally need not lie in N, but F1 says that M and the final extension have the same reals; hence cM.

F1F2F3F4
2.1

The code of B is a real of N, hence a real of the final extension; F1's same-reals conclusion puts that code in M without requiring the false class inclusion NM. Step 1.1 likewise puts the code of C in M. F5 makes B Borel and C null internally and supplies completeness of the null ideal, so every subset of C is measurable; hence A=B(AB) is measurable. This includes A=, A=R, and zero exception C=.

F1F5step 1.1

Depends on

Used by

Dependency tree · two levels

25 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