Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

Assuming the Axiom of Countable Choice, a Bernstein set is not Lebesgue measurable

Statement

Assume the Axiom of Countable Choice. Let BR be a Bernstein set. Then B is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Countable Choice and a Bernstein set BR.

[L1]

A Bernstein set has inner measure 0, and in every nondegenerate bounded interval its intersection has full outer measure (A Bernstein set has inner measure 0, and in every nondegenerate interval its intersection has full outer measure).

[L2]

For bounded subsets of R, Lebesgue measurability is equivalent to equality of inner and outer measure (For bounded subsets of R, Lebesgue measurability is equivalent to equality of inner and outer measure).

Proof

technique · direct
1.1

Let I=[0,1]. Step [L1] gives λ(BI)=0 and λ(BI)=λ(I)=1.

L1
2.1

The bounded set BI therefore has unequal inner and outer measure, so [L2] says it is not Lebesgue measurable. If B itself were Lebesgue measurable, then its intersection with the measurable interval I would be too, contradiction. Hence B is not Lebesgue measurable.

step 1.1L2

Depends on

Used by

Dependency tree · two levels

21 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