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 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: .
Solovay L(R) satisfies ZF and Dependent Choice: is ZF+DC with all ambient reals and ordinals, and its canonical map codes every element from one real and one ordinal.
Random and Cohen generics over an intermediate model are conull and comeagre and Homogeneous truth about a generic real has Borel representatives: localized definitions have Borel representatives off null/meagre generic exceptions.
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.
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.
Forcing theorem: a true statement about a name in a generic extension is forced by some condition in that generic.
Vitali set on , Bernstein subset of , Choice gives a Bernstein set with no perfect-set, Baire or measure regularity, AC implies DC implies countable choice, Countable unions of at most countable sets, assuming , is uncountable (Cantor's nested intervals, 1874), Finite and countable subadditivity of measures, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, is countably infinite, and The Axiom of Choice: these are the exact ZF, countable-choice, measure, and reductio inputs for the Vitali/Bernstein and failure-of-AC consequences.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , A Lebesgue measurable subgroup of of positive measure is all of , If a Lebesgue measurable subset of has positive measure, its difference set contains an open ball about the origin, and Six regularity conditions each force an additive to be : continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in : these supply unique Hamel coordinates, measurable-subgroup rigidity, and measurable additive-map regularity.
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 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.
Solovay L(R) satisfies ZF and Dependent Choice and AC implies DC implies countable choice: has DC and hence Countable Choice.
Proof
If lies in , choose with . Thus membership in is expressed by the canonical hierarchy definition from the single real and ordinal ; no unlisted earlier-stage parameters remain. Localize by F4. Since is canonically definable from the class of all reals, the remaining homogeneous forcing fixes the membership formula. F2 gives Borel with 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 by F1. Absoluteness and internal DC therefore give LM and BP in .
Use F8's half-open binary coding . Let be the Borel conull set of for which none of the three residue-class subsequences is eventually . Splitting those subsequences and decoding them gives a Borel bijection ; its inverse interleaves the three canonical codes. A length- cylinder has measure and maps to a product of three length- dyadic intervals, also of measure . The monotone-class argument from these generating cylinders, followed by the product-completion theorem in F8, shows that and 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.
Let be the bounded intermediate stage containing . By F4, has in the final extension an enumeration coded by a real, so that enumeration belongs to by F1. If is uncountable in , some therefore exists. Localize to for some and choose in a name for over the interval collapse .
In let . The actual generic misses . Since is a dense set of , some is incompatible with , so no extension of forces a ground-real value. The truth lemma and homogeneous tail forcing give forcing the canonical membership formula from step 1.1. Take below both. Apply F3 below : 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 . Thus has a perfect subset. This uses the forcing predicate only on set parameters in , never the external formula “.” If no such exists, the displayed enumeration instead proves countable.
If were a Hamel basis, choose one and take its rational coefficient homomorphism . Its proper measurable kernel is either positive measure, when F7 gives , or null, when F8 preserves nullness under translation and F6 makes the rational cosets cover by a null set, contradicting the unit interval. For arbitrary additive , the measurable sets cover ; one has positive measure, so F7 bounds near zero and gives .
For in , the set lies in . Step 1.1 supplies Borel with null and . After intersecting with , bimeasurability and null preservation from step 1.2 give , so completeness makes measurable. Integer translates then cover . F9 supplies Countable Choice, exactly the hypothesis of the product and orthogonal-invariance interfaces. Thus every subset of in is measurable. If a positive-radius closed ball of measure had a one-use finite partition whose rigid images partitioned two disjoint copies, F8 and finite additivity would give , while inner and outer cubes from F6 give . A radius-zero ball has one source point and hence one rigid image, not the two target points.
A Vitali selector would be measurable by step 1.1. If it were null, its explicitly rational-indexed translates would cover by a null set; if it had positive measure, arbitrarily many disjoint translates inside would exceed that interval's finite measure. Translation invariance here is F8. For a Bernstein , F1 and F6 make a two-term union of countable sets countable, so one of and its complement is uncountable; each has no nonempty perfect subset, contradicting step 1.3. If satisfied AC, F6 would construct a Bernstein set, so full AC fails.
Consequently all stated regularity and anti-choice conclusions hold in , without identifying it with or importing a theorem whose subject is .
Depends on
- Solovay L(R) satisfies ZF and Dependent Choice
- The inaccessible Lévy-collapse setup for Solovay's construction
- Valuation of names and M[G]
- The Lévy collapse localizes countable ordinal data
- Absorption, factorization, and homogeneous truth in the Solovay collapse
- Forcing theorem
- Monotonicity, density, and decision for forcing
- Borel-code, measure, category, and perfect-set absoluteness
- Random and Cohen generics over an intermediate model are conull and comeagre
- Homogeneous truth about a generic real has Borel representatives
- A perfect tree of mutually generic name interpretations
- Vitali set on $[0,1]$
- Bernstein subset of $\mathbb{R}$
- Choice gives a Bernstein set with no perfect-set, Baire or measure regularity
- AC implies DC implies countable choice
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- $\mathbb{R}$ is uncountable (Cantor's nested intervals, 1874)
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- A Lebesgue measurable subgroup of $(\mathbb{R}^n,+)$ of positive measure is all of $\mathbb{R}^n$
- If a Lebesgue measurable subset of $\mathbb{R}^n$ has positive measure, its difference set contains an open ball about the origin
- Six regularity conditions each force an additive $f : \mathbb{R} \to \mathbb{R}$ to be $x \mapsto f(1)x$: continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in $\mathbb{R}^{2}$
- Finite and countable subadditivity of measures
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- $\mathbb{Q}$ is countably infinite
- 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
- Lebesgue measure on $\mathbb{R}^n$ is invariant under every orthogonal linear map
- The Axiom of Choice
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
- Solovay 1970, Theorem 1 and Parts II–III (standard reference, not scraped)
- Unger 2015, pp. 1–2 (standard reference, not scraped)
- Kanamori, The Higher Infinite, proof of Theorem 11.1 (standard reference, not scraped)