Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

The Solovay model has no Vitali or Bernstein set

Statement

M contains no Vitali selector modulo Q and no Bernstein subset of R.

Facts & Assumptions

Given: The universal LM and PSP theorems above.

[F1]

Every set of reals in the Solovay model is Lebesgue measurable: every alleged selector is measurable in M.

[F2]

Vitali set on [0,1] and Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation: rational translates of a selector are disjoint and measurable with one common measure.

[F3]

Measures on sigma-algebras, Finite and countable subadditivity of measures, A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included, and Q is countably infinite: finite additivity handles disjoint finite families, subadditivity handles the null countable union, and the containing intervals have their stated finite positive measures.

[F4]

Bernstein subset of R and Every uncountable Solovay-model set of reals has a perfect subset: a Bernstein set and its complement meet every nonempty perfect set but contain no nonempty perfect set.

Proof

1.1

Suppose V were a Vitali selector. F1 makes it measurable. If λ(V)=0, the countably many rational translates covering [0,1] have null union, contradicting λ([0,1])=1. If λ(V)>0, finitely many pairwise disjoint translates inside [1,2] have arbitrarily large total measure, contradicting λ([1,2])=3. The selector and translation facts are F2, while F3 supplies subadditivity, finite additivity and the interval values.

F1F2F3
1.2

Suppose B were Bernstein. Both B and RB contain no nonempty perfect subset. They cannot both be countable: F5 would make their two-term union R countable, contrary to its uncountability. Therefore one is uncountable, and F4 gives it a nonempty perfect subset, a contradiction. This repairs the tempting but unsupported assertion that the definition alone makes B uncountable.

F4F5
2.1

The two contradictions exclude both supplied pathologies without using their ZFC existence constructions.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

86 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