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.

All sets of reals in Solovay L(R) have LM, BP, and PSP

Statement

Every set of reals in L(R) is Lebesgue measurable, has BP, and has PSP. The no-Vitali, no-Bernstein, no-Hamel-basis, linear-additive-map, failure-of-AC, and no-Banach–Tarski conclusions hold there as well.

Facts & Assumptions

Given: K=L(R)V[G].

[F1]

Solovay L(R) satisfies ZF and Dependent Choice: K is ZF+DC with all ambient reals and ordinals, and its canonical map F:Ord×RK codes every element from one real and one ordinal.

[F2]
[F3]

The inaccessible Lévy-collapse setup for Solovay's construction, Valuation of names and M[G], Absorption, factorization, and homogeneous truth in the Solovay collapse, Monotonicity, density, and decision for forcing, A perfect tree of mutually generic name interpretations, and Borel-code, measure, category, and perfect-set absoluteness: a real in a bounded extension has a name over its interval collapse; a condition excluding every ground-real value gives a coded perfect family of interpretations, and homogeneous tail truth preserves the fixed membership formula.

[F4]

The Lévy collapse localizes countable ordinal data: real parameters localize to bounded collapse stages, whose reals are countable in the final extension. The interval-forcing name used below comes instead from the generic-extension definition cited in F3.

[F5]

Forcing theorem: a true statement about a name in a generic extension is forced by some condition in that generic.

[F8]

Dyadic coding supplies coin measure and its completed Lebesgue transfer, The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, and Lebesgue measure on Rn is invariant under every orthogonal linear map: canonical binary cylinders have their dyadic measures, Euclidean measure completes the product measure under Countable Choice, and translations and orthogonal maps preserve measurability and measure under their stated hypotheses.

Proof

1.1

If AR lies in K, choose (α,r) with A=F(α,r). Thus membership in A is expressed by the canonical hierarchy definition from the single real r and ordinal α; no unlisted earlier-stage parameters remain. Localize r by F4. Since L(R) is canonically definable from the class of all reals, the remaining homogeneous forcing fixes the membership formula. F2 gives Borel B with AB contained in a coded null set, and likewise an open representative modulo a coded meagre set. All witness codes are reals and hence lie in K by F1. Absoluteness and internal DC therefore give LM and BP in K.

F1F2F4
1.2

Use F8's half-open binary coding b:[0,1)2ω. Let D be the Borel conull set of x for which none of the three residue-class subsequences kb(x)(3k+j) is eventually 1. Splitting those subsequences and decoding them gives a Borel bijection T:D[0,1)3; its inverse interleaves the three canonical codes. A length-3k cylinder has measure 23k and maps to a product of three length-k dyadic intervals, also of measure 23k. The monotone-class argument from these generating cylinders, followed by the product-completion theorem in F8, shows that T and T1 preserve Borel sets and send Borel null sets to Borel null sets. This conclusion is derived here, not attributed to the one-way statement of the dyadic lemma.

F8F9
1.3

Let N=V[Gξ] be the bounded intermediate stage containing r. By F4, NR has in the final extension an enumeration coded by a real, so that enumeration belongs to K by F1. If A is uncountable in K, some zAN therefore exists. Localize z to V[Gη]=N[H] for some η>ξ and choose in N a name τ˙ for z over the interval collapse Q.

2.1

In N let D={qQ:(yRN) qτ˙=yˇ}. The actual generic H misses D. Since D{q:qD} is a dense set of N, some p0H is incompatible with D, so no extension of p0 forces a ground-real value. The truth lemma and homogeneous tail forcing give p1H forcing the canonical membership formula from step 1.1. Take pH below both. Apply F3 below p: every branch interpretation satisfies that membership formula, and the resulting injective continuous image is perfect. Its tree and image codes are reals and hence belong to K. Thus A has a perfect subset. This uses the forcing predicate only on set parameters in N, never the external formula “τ˙N.” If no such z exists, the displayed enumeration instead proves A countable.

F1F3F4F5step 1.1step 1.3
2.2

If H were a Hamel basis, choose one bH and take its rational coefficient homomorphism cb. Its proper measurable kernel W is either positive measure, when F7 gives W=R, or null, when F8 preserves nullness under translation and F6 makes the rational cosets qb+W cover R by a null set, contradicting the unit interval. For arbitrary additive f, the measurable sets {x[1,1]:f(x)n} cover [1,1]; one has positive measure, so F7 bounds f near zero and gives f(x)=xf(1).

F6F7F8step 1.1
2.3

For E[0,1)3 in K, the set A=T1[E] lies in K. Step 1.1 supplies Borel B,N with N null and ABN. After intersecting with D, bimeasurability and null preservation from step 1.2 give ET[BD]T[ND], so completeness makes E measurable. Integer translates then cover R3. F9 supplies Countable Choice, exactly the hypothesis of the product and orthogonal-invariance interfaces. Thus every subset of R3 in K is measurable. If a positive-radius closed ball of measure V had a one-use finite partition whose rigid images partitioned two disjoint copies, F8 and finite additivity would give V=2V, while inner and outer cubes from F6 give 0<V<. A radius-zero ball has one source point and hence one rigid image, not the two target points.

F6F8F9step 1.1step 1.2
2.4

A Vitali selector V would be measurable by step 1.1. If it were null, its explicitly rational-indexed translates would cover [0,1] by a null set; if it had positive measure, arbitrarily many disjoint translates inside [1,2] would exceed that interval's finite measure. Translation invariance here is F8. For a Bernstein B, F1 and F6 make a two-term union of countable sets countable, so one of B and its complement is uncountable; each has no nonempty perfect subset, contradicting step 1.3. If K satisfied AC, F6 would construct a Bernstein set, so full AC fails.

F1F6F8step 1.1step 1.3
3.1

Consequently all stated regularity and anti-choice conclusions hold in K=L(R), without identifying it with M or importing a theorem whose subject is M.

step 1.1step 1.2step 1.3step 2.1step 2.2step 2.3step 2.4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

175 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