Alphabeta Math
Session-authored (Fable 5 assisted)
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.

28 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 16 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Non Measurable Sets and the Cost of Choice

1 · Prerequisites

2 · Summary

Lebesgue outer measure, translation invariance, Steinhaus's theorem, the Cantor function, perfect sets, and the published choice ledger are the background of this page. They let the development pass from measurable approximation to inner measure, from rational cosets to Vitali selectors, from the Cantor set to a measure-one compact witness, and from perfect sets to Bernstein constructions, while keeping the exact choice assumptions visible at each step.

The page begins with inner measure and the bounded criterion λ=λ, then builds the Vitali obstruction and its translation invariant measure corollary. It next turns the Cantor function into a concrete homeomorphism witness for continuous-image, continuous-preimage, and measurable non-Borel pathologies. The last third introduces Bernstein sets, proves their extremal inner and outer measure behaviour, and closes with a finite-digit zero-one principle, the free-ultrafilter nonmeasurability theorem, and a final remark separating the three different costs in choice.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-26Open item page →

Lebesgue inner measure on the real line

Definition

For a set ER, the Lebesgue inner measure of E is

λ(E):=sup{λ(K):KE and K is compact},

the supremum being taken in [0,+].

This is well defined without a measurability assumption on E or on its compact subsets: Lebesgue outer measure is defined on every subset of R, the family contains , and λ()=0. Assuming the Axiom of Countable Choice, compact subsets of R are Borel and hence Lebesgue measurable, so λ(K)=λ(K) and the displayed definition agrees with the usual compact-inner-approximation formula.

Remarks

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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

Statement

Assume the Axiom of Countable Choice. Let ER be bounded. Then E is Lebesgue measurable if and only if

λ(E)=λ(E),

where λ(E) is the inner measure of Lebesgue inner measure on the real line and λ(E) is the Lebesgue outer measure.

Facts & Assumptions

Given: The Axiom of Countable Choice and a bounded set ER.

[F1]

λ(E)=sup{λ(K):KE and K is compact} (Lebesgue inner measure on the real line).

[L1]

Assuming countable choice, a subset of R is Lebesgue measurable if and only if for every real ε>0 there is an open UE with λ(UE)<ε, and if and only if for every real ε>0 there is a closed FE with λ(EF)<ε (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn, clauses 1 and 3).

[L2]

Assuming countable choice, λ(E)=inf{λ(U):UR open and EU} (Assuming countable choice, the Lebesgue outer measure of an arbitrary subset of Rn is the infimum of the measures of the open sets containing it).

[L3]

A subset of R is compact if and only if it is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

[L4]

Assuming countable choice, every Borel subset of R is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

Proof

technique · direct
1.1

For the forward implication, assume E is Lebesgue measurable and fix a real ε>0. By [L1] choose a closed FE with λ(EF)<ε; since E is bounded, so is F, hence [L3] makes F compact. The set F is Borel and therefore measurable by [L4], so λ(F)λ(E)λ(E) by [F1]; and E=F(EF) with both pieces measurable by [L4] and [L5], so λ(E)=λ(E)=λ(F)+λ(EF)<λ(E)+ε. As ε>0 was arbitrary, λ(E)λ(E); together with λ(E)λ(E) from [F1], this gives λ(E)=λ(E).

F1L1L3L4L5
1.2

For the converse implication, assume λ(E)=λ(E) and fix a real ε>0. By [F1] choose a compact KE with λ(K)>λ(E)ε/2, and by [L2] choose an open UE with λ(U)<λ(E)+ε/2. The compact set K is Borel by [L3], hence measurable by [L4], and KEU; therefore UEUK, so [L5] gives λ(UE)λ(UK)=λ(U)λ(K)<λ(E)λ(E)+ε=ε.

F1L2L3L4L5choose
2.1

Step 1.2 gives open supersets of arbitrarily small outer excess, so [L1] makes E Lebesgue measurable. This is the reverse implication.

step 1.2L1

Remarks

  • The boundedness hypothesis is used only to turn the closed set F of step 1.1 into a compact set, which is what allows the inner measure to see it.

  • On an unbounded measurable set the equality λ(E)=λ(E) can be vacuous, since both sides may be +.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

Vitali set on [0,1]

Definition

Define an equivalence relation on [0,1] by

xy:xyQ.

A subset V[0,1] is a Vitali set on [0,1] when every equivalence class of this relation meets V in exactly one point. Equivalently, for every x[0,1] there is a unique vV with xvQ.

Remarks

  • The definition names a Vitali set, not the Vitali set. Different choice functions produce different selectors.

  • The relation is taken on [0,1], not on all of R, because the later countable-translate argument only needs one selector on one bounded interval.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists

Statement

Assume the Axiom of Choice. Then there exists a Vitali set V[0,1] in the sense of Vitali set on [0,1].

Facts & Assumptions

Given: The Axiom of Choice.

[F1]

A Vitali set on [0,1] is a subset meeting every equivalence class of xy    xyQ in exactly one point (Vitali set on [0,1]).

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice).

[F2]

A choice function for a family F is a function g with domain F such that g(S)S for every SF (Choice function).

Proof

technique · direct
1.1

Let F be the family of all sets of the form (x+Q)[0,1] with x[0,1]. Each member of F is nonempty because it contains its defining point, and distinct members are exactly the equivalence classes of the relation in [F1].

F1construct
2.1

By [A1] and [F2] there is a choice function g on F. Put V:={g(S):SF}[0,1]. Then V meets every member of F, and it meets each of them in exactly one point because g assigns one value to each set in its domain.

step 1.1A1F2construct
3.1

Since the members of F are exactly the equivalence classes of xy    xyQ on [0,1], step 2.1 says precisely that V is a Vitali set on [0,1].

step 1.1step 2.1F1

Remarks

  • The proof uses one simultaneous selector on the family of Q-cosets meeting [0,1]. Nothing in the proof reduces that family to a countable one.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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

Statement

Assume the Axiom of Choice. Let V[0,1] be a Vitali set. Then V is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice and a Vitali set V[0,1].

[L2]

Assuming countable choice, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[L3]

Assuming countable choice, [0,1] and [1,2] are Lebesgue measurable with measures 1 and 3 respectively (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L4]

Q is countably infinite (Q is countably infinite).

[L5]

A measure vanishes on and is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras).

[L6]

For every real M there is a natural number n1 with M<n (Every complete ordered field is Archimedean).

Proof

technique · contradiction
1.1

Enumerate Q[1,1] as (qk)kN by [L4]. The translates V+qk are pairwise disjoint: if v1+qi=v2+qj then v1v2=qjqiQ, so the selector property of V forces v1=v2 and then qi=qj. They cover [0,1], because every x[0,1] differs by a rational in [1,1] from the unique vV in its equivalence class, and each lies inside [1,2] because 0v1 and 1qk1.

givenL4algebra
2.1

Suppose, for contradiction, that V is Lebesgue measurable with λ(V)=0. Then every translate V+qk is measurable with measure 0 by [L2], and countable additivity applied to the pairwise disjoint family of step 1.1 gives 1=λ([0,1])λ ⁣(kN(V+qk))=k=0λ(V+qk)=0, contradicting [L3].

step 1.1L2L3L5assume-contra
2.2

Suppose instead that V is Lebesgue measurable with λ(V)>0. By [L6] choose a natural number m1 with 3<mλ(V). The first m translates of step 1.1 are pairwise disjoint and all lie inside [1,2], so [L2], [L3] and finite additivity from [L5] give 3=λ([1,2])k<mλ(V+qk)=mλ(V), contradicting the choice of m.

step 1.1L2L3L5L6assume-contra
3.1

Steps 2.1 and 2.2 rule out both possible values of the measure of a measurable Vitali set, so V is not Lebesgue measurable.

step 2.1step 2.2discharge-contradiction

Remarks

  • The proof uses only countably many rational translates after the initial selector has been fixed. The countable part is not where the choice cost sits.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Assuming the Axiom of Choice, no translation-invariant measure on P(R) is both finite and nonzero on [0,1]

Statement

Assume the Axiom of Choice. There is no measure μ on P(R) such that

  1. μ(E+q)=μ(E) for every subset ER and every rational q;
  2. 0<μ([0,1])<+.

Facts & Assumptions

Given: The Axiom of Choice, a measure μ on P(R), rational-translation invariance of μ, and 0<μ([0,1])<+.

[L1]

Assuming the Axiom of Choice, a Vitali set in [0,1] exists (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists).

[L2]

Q is countably infinite (Q is countably infinite).

[L3]

A measure vanishes on and is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras).

[L4]

For every real M there is a natural number n1 with M<n (Every complete ordered field is Archimedean).

Proof

technique · contradiction
1.1

By [L1] fix a Vitali set V[0,1], and enumerate Q[1,1] as (qk)kN by [L2]. Exactly as in the Vitali argument, the translates V+qk are pairwise disjoint, they cover [0,1], and they all lie inside [1,2].

L1L2construct
1.2

Since [1,2][1,0][0,1][1,2], translation invariance and finite subadditivity from [L3] give μ([1,2])3μ([0,1])<+.

givenL3algebra
2.1

If μ(V)=0, then every translate V+qk has measure 0 and countable additivity on the disjoint family of step 1.1 gives μ([0,1])=0, contradicting the hypotheses.

step 1.1L3assume-contra
2.2

If μ(V)>0, choose a natural number m1 with μ([1,2])<mμ(V) by [L4]. The first m translates from step 1.1 are pairwise disjoint subsets of [1,2], so [L3] gives μ([1,2])k<mμ(V+qk)=mμ(V), contradicting the choice of m.

step 1.1step 1.2L3L4assume-contra
3.1

Steps 2.1 and 2.2 rule out both possibilities for μ(V), so no such translation-invariant measure μ exists.

step 2.1step 2.2discharge-contradiction
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset

Statement

Assume the Axiom of Choice. Let AR satisfy λ(A)>0. Then A contains a subset that is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice and a subset AR with λ(A)>0.

[L0]

Assuming the Axiom of Choice, a Vitali set V[0,1] exists (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists).

[L2]

Assuming countable choice, if a Lebesgue measurable subset of R has positive measure then its difference set contains an open ball about 0 (If a Lebesgue measurable subset of Rn has positive measure, its difference set contains an open ball about the origin).

[L3]

Q is countably infinite (Q is countably infinite).

[L5]

A measure vanishes on and is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras).

Proof

technique · contradiction
1.1

By [L0] fix a Vitali set V[0,1]. For each rational q put Aq:=A(V+q). The sets Aq are pairwise disjoint because the translates V+q are, and they cover A because the rational translates of a Vitali selector cover all of R.

givenL0L3construct
2.1

Suppose some Aq were Lebesgue measurable with positive measure. Then [L2] would give an open interval about 0 inside AqAq. But if x,yAqV+q, then xyQ implies (xq)(yq)Q with both terms in V, so the selector property forces x=y; thus AqAq contains no nonzero rational. Every open interval about 0 contains a nonzero rational, contradiction. Hence every measurable Aq has measure 0.

step 1.1L2assume-contra
3.1

Suppose, for contradiction, that every Aq is Lebesgue measurable. Then step 2.1 gives λ(Aq)=0 for every rational q, and by [L4] each Aq is measurable with outer measure 0. Since the family is pairwise disjoint and covers A, countable additivity from [L5] gives λ(A)=0, hence λ(A)=0, contradicting the hypothesis. Therefore at least one set Aq is not Lebesgue measurable, and it is a subset of A.

step 1.1step 2.1L3L4L5discharge-contradiction
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]

Statement

Let c:[0,1]R be the Cantor function. Define

ψ:[0,1]R,ψ(x):=x+c(x).

Then ψ is a homeomorphism from [0,1] onto [0,2].

Facts & Assumptions

Given: The Cantor function c:[0,1]R and the map ψ(x)=x+c(x).

[L1]

The Cantor function is continuous on [0,1], is nondecreasing, and satisfies c(0)=0 and c(1)=1 (The Cantor function is continuous on [0,1]).

[L2]

The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval (The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval).

Proof

technique · direct
1.1

The map ψ is continuous on [0,1], being the sum of the identity map and the continuous function c.

L1algebra
1.2

If 0x<y1, then c(x)c(y) by [L1], so ψ(y)ψ(x)=(yx)+(c(y)c(x))>0. Therefore ψ is strictly increasing and hence injective.

L1algebra
2.1

By [L1], ψ(0)=0 and ψ(1)=2. Also 0x1 and 0c(x)1 for every x[0,1], so ψ([0,1])[0,2]. Since step 1.1 makes ψ continuous, [L2] makes ψ([0,1]) an interval, and the same step shows that this interval contains the endpoints 0 and 2, so it is exactly [0,2].

step 1.1L1L2
3.1

The interval [0,1] is compact by [L4], and [0,2] is a Hausdorff subspace of R. Steps 1.1, 1.2 and 2.1 therefore make ψ a continuous bijection from a compact space to a Hausdorff space, so [L3] gives that ψ is a homeomorphism.

step 1.1step 1.2step 2.1L3L4
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

The homeomorphism xx+c(x) sends the Cantor set onto a compact set of Lebesgue measure 1

Statement

Assume the Axiom of Countable Choice. Let C[0,1] be the Cantor set and let ψ(x)=x+c(x) be the homeomorphism of The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]. Then

K:=ψ[C][0,2]

is compact and Lebesgue measurable, with λ(K)=1.

Facts & Assumptions

Given: The Axiom of Countable Choice, the Cantor set C[0,1], and the map ψ(x)=x+c(x).

[L1]

ψ is a homeomorphism from [0,1] onto [0,2] (The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]).

[L2]

The Cantor set is an uncountable subset of R of Lebesgue measure zero (The Cantor set is an uncountable subset of R of Lebesgue measure zero).

[L3]

The Cantor function is constant on every interval [u,v] with u<v, u,vC and (u,v)C=, and every point of [0,1]C lies in such an interval (The Cantor function is well defined, satisfies c(x)c(y) whenever xy, is surjective onto [0,1], and is constant on every interval removed from the Cantor set, claim 4).

[L4]

Every open subset of R is a countable disjoint union of open intervals, namely its order components (Every open subset of R is a countable disjoint union of open intervals, namely its order components).

[L5]

Assuming countable choice, every interval with endpoints included or excluded in any pattern is Lebesgue measurable with its usual length (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L7]

Finite and countable subadditivity of measures (Finite and countable subadditivity of measures).

Proof

technique · direct
1.1

The complement (0,1)C is open, because C is closed by the definition of the Cantor set. By [L4] write it as a countable disjoint union kNIk of nonempty open intervals. For each k there are endpoints uk<vk in C with Ik=(uk,vk) and (uk,vk)C=.

L3L4construct
2.1

Fix k. By [L3] the Cantor function is constant on [uk,vk]; write that value as αk. Then ψ(x)=x+αk for every xIk, so ψ[Ik]=(uk+αk, vk+αk) is an open interval and λ(ψ[Ik])=λ(Ik)=vkuk by [L5].

step 1.1L3L5construct
3.1

The intervals ψ[Ik] are pairwise disjoint because ψ is injective by [L1]. They cover ψ[(0,1)C], so countable additivity on the disjoint family and step 2.1 give λ(ψ[(0,1)C])=k=0λ(ψ[Ik])=k=0λ(Ik)=λ((0,1)C)=1, because [L2] says λ(C)=0 and [L5] says λ([0,1])=1.

step 2.1L1L2L5L6L7
4.1

The set K=ψ[C] is compact: C is closed and bounded, hence compact by [L8], and the continuous map ψ carries compact sets to compact sets by [L1]. Also [0,2]=Kψ[(0,1)C], with disjointness from injectivity of ψ, so [L5] and step 3.1 give 2=λ([0,2])=λ(K)+1. Therefore λ(K)=1.

step 3.1L1L5L8
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

A continuous image of a Lebesgue measurable subset of R can be nonmeasurable

Statement

Assume the Axiom of Choice. Then there exist a Lebesgue measurable set ER and a continuous map f:ER whose image f[E] is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset (Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset).

[L2]

The image K=ψ[C] of the Cantor set under ψ(x)=x+c(x) is compact and has Lebesgue measure 1 (The homeomorphism xx+c(x) sends the Cantor set onto a compact set of Lebesgue measure 1).

[L3]

The Cantor set is Lebesgue measurable with measure 0 (The Cantor set is an uncountable subset of R of Lebesgue measure zero).

[L5]

ψ is a homeomorphism from [0,1] onto [0,2] (The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]).

Proof

technique · direct
1.1

By [L2] the set K has positive outer measure, so [L1] supplies a subset NK that is not Lebesgue measurable.

L1L2choose
2.1

Let E:=ψ1[N]C. Since C is measurable and has measure 0 by [L3], completeness from [L4] makes every subset of C, and in particular E, Lebesgue measurable.

step 1.1L3L4L5
3.1

The restriction f:=ψE:ER is continuous, because E[0,1] and ψ is continuous by [L5]. Its image is f[E]=N, which is not Lebesgue measurable by step 1.1.

step 1.1step 2.1L5
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

A continuous preimage of a Lebesgue measurable subset of R can be nonmeasurable

Statement

Assume the Axiom of Choice. Then there exist a Lebesgue measurable set ER, a subset XR, and a continuous map g:XR such that g1[E] is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset (Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset).

[L2]

The image K=ψ[C] of the Cantor set under ψ(x)=x+c(x) is compact and has Lebesgue measure 1 (The homeomorphism xx+c(x) sends the Cantor set onto a compact set of Lebesgue measure 1).

[L3]

The Cantor set is Lebesgue measurable with measure 0 (The Cantor set is an uncountable subset of R of Lebesgue measure zero).

[L5]

ψ is a homeomorphism from [0,1] onto [0,2] (The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]).

Proof

technique · direct
1.1

By [L2] the compact set K has positive outer measure, so [L1] supplies a nonmeasurable subset NK.

L1L2choose
2.1

Let E:=ψ1[N]C. Since C is measurable and has measure 0 by [L3], completeness from [L4] makes E Lebesgue measurable.

step 1.1L3L4L5
3.1

Let g:=ψ1K:KR. The map g is continuous because ψ is a homeomorphism by [L5]. For every xK, one has g(x)E exactly when xN, because g is the inverse of ψ on K. Therefore g1[E]=N, and this preimage is not Lebesgue measurable.

step 1.1step 2.1L5
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

There is a Lebesgue measurable subset of R that is not Borel

Statement

Assume the Axiom of Choice. Then there exists a Lebesgue measurable subset of R that is not a Borel set.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset (Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset).

[L2]

The image K=ψ[C] of the Cantor set under ψ(x)=x+c(x) is compact and has Lebesgue measure 1 (The homeomorphism xx+c(x) sends the Cantor set onto a compact set of Lebesgue measure 1).

[L3]

The Cantor set is Lebesgue measurable with measure 0 (The Cantor set is an uncountable subset of R of Lebesgue measure zero).

[L5]

The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra (The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra).

[L6]

Continuous preimages of Borel sets are Borel (A continuous map has Borel preimages of Borel sets).

[L7]

Assuming countable choice, every Borel subset of R is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[L8]

ψ is a homeomorphism from [0,1] onto [0,2] (The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]).

Proof

technique · direct
1.1

By [L2] the compact set K has positive outer measure, so [L1] supplies a nonmeasurable subset NK.

L1L2choose
2.1

Let E:=ψ1[N]C. Since C is measurable of measure 0 by [L3], completeness [L4] makes E Lebesgue measurable.

step 1.1L3L4L8
3.1

If E were Borel in R, then [L5] would make E Borel as a subset of the subspace C. The inverse homeomorphism ψ1K:KC is continuous by [L8], so [L6] would make N=(ψ1K)1[E] Borel in the subspace K. Applying [L5] again, there would be a Borel set BR with N=KB. Now [L7] makes B Lebesgue measurable, [L2] makes K Lebesgue measurable, and measurable sets are closed under intersection; hence N would be Lebesgue measurable, contradicting step 1.1. Therefore E is not Borel.

step 1.1step 2.1L2L5L6L7L8
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

Bernstein subset of R

Definition

A set BR is a Bernstein set when every nonempty perfect subset of R meets both B and RB.

Remarks

  • The definition is symmetric in B and its complement, so RB is Bernstein whenever B is.

  • A Bernstein set cannot contain any nonempty perfect set, and its complement cannot either, by the definition itself.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

Every nonempty perfect subset of R has the cardinality of the continuum

Statement

Let PR be nonempty and perfect. Then P has the cardinality of the continuum, equivalently PR.

Facts & Assumptions

Given: A nonempty perfect set PR.

[L1]

Strictly between any two reals lies a rational, and the canonical embedding of Q into R is injective (The rationals embed densely in the reals).

[L2]
[L3]

The rationals and every finite Cartesian power of them are countable, so rational quadruples admit a fixed enumeration (Q is countably infinite, A product of two at most countable sets is at most countable).

[L6]

If there is an injection AB and an injection BA, then AB (The Schröder-Bernstein theorem, Equinumerous sets, AB and AB, Injection, surjection, bijection).

Proof

technique · direct
1.1

Splitting claim. Let J=(a,b) be a nonempty open interval with JP, and let η>0 be real. Choose xJP. Since x is not isolated in P, there is yPJ with yx; after swapping if necessary, take x<y. Put δ:=min{η/4, (yx)/4, (xa)/2, (by)/2}, a positive real. By [L1] choose rationals r0<s0<r1<s1 with x(r0,s0), y(r1,s1), each interval contained in (xδ,x+δ) or (yδ,y+δ) respectively. Then J0:=(r0,s0) and J1:=(r1,s1) are disjoint nonempty open intervals, their closures lie inside J, each meets P, and each has length <η.

F1L1construct
2.1

Fix an enumeration of the rational quadruples using [L3]. By recursion on nN, construct for every binary word s:n{0,1} a nonempty open interval Js with rational endpoints such that: JsP; if t extends s then JtJs; sibling closures are disjoint; and every Js at level n has length <1/(n+1). At level 0, take the first rational interval in the enumeration that meets P and has length <1. At the successor stage, for each of the finitely many parent words in lexicographic order, take the first rational quadruple in the enumeration that gives the two children supplied by step 1.1 with η=1/(n+2). The “first” rule makes the successor operation a function, so recursion produces one coherent family through all levels without any choice principle.

step 1.1L3construct
3.1

Let α:N{0,1} be a binary sequence, and for each n let In:=Jαn, where αn is the restriction of α to n. By step 2.1 the intervals In are nonempty, closed and bounded, nested, and have lengths <1/(n+1); [L5] therefore makes their lengths tend to 0, so [L4] gives a unique point xαnIn. Each In meets P and P is closed, so xαP. If αβ, let n be the first index at which they differ; then In+1 for α and β are closures of disjoint siblings from step 2.1, so xαxβ. Thus αxα is an injection from {0,1}N into P.

step 2.1L4L5
4.1

Fix a bijection e:NQ from [L2]. For each real x define Sx:={nN:e(n)^<x}. If x<y, [L1] gives a rational q with x<q^<y; writing q=e(n) yields nSySx, so xSx is an injection RP(N). Characteristic functions identify P(N) with {0,1}N, and step 3.1 gives an injection {0,1}NP; composing these two injections yields an injection RP. The inclusion PR is also injective, so [L6] gives PR.

step 3.1L1L2L6algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming the real line can be well ordered, a Bernstein set exists

Statement

Assume the real line can be well ordered. Then there exists a Bernstein set BR.

Facts & Assumptions

Given: A well-order of R.

[F1]

A Bernstein set is a subset of R that meets every nonempty perfect subset of R, and whose complement does too (Bernstein subset of R).

[L1]

Every nonempty perfect subset of R has the cardinality of the continuum, equivalently is equinumerous with R (Every nonempty perfect subset of R has the cardinality of the continuum).

[L2]

The Cantor-set ternary-description theorem gives a bijection between {0,1}N and a subset of R (The Cantor set is exactly the set of k1ak3k with every ak{0,2}, and this gives a bijection with {0,1}N, claim 3), and QN with rationals dense in R (Q is countably infinite, The rationals embed densely in the reals).

[L3]

If there are injections both ways then the two sets are equinumerous; a set equinumerous with a well-orderable set is well-orderable and has the same cardinality, and that cardinality is a cardinal (The Schröder-Bernstein theorem, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality).

[L5]

Transfinite recursion along a well-order is available in ZF (Transfinite recursion, Well-order and well-ordered set).

Proof

technique · direct
1.1

Let Pperf be the family of nonempty perfect subsets of R. Every such set is closed, so it is determined by the set of rational open intervals disjoint from it; since rational intervals are countably coded, [L2] gives an injection PperfR. Conversely the map a[a,a+1] is an injection RPperf, because each interval [a,a+1] is nonempty and perfect in the sense of Perfect subset of R: closed with no isolated points. Hence [L3] gives PperfR. Let κ:=R. The given well-order of R makes R well-orderable, so [L3] gives Pperf=κ and shows that κ is a cardinal. The interval [0,1] is a nonempty perfect subset of R, so [L1] shows κ is infinite; therefore [L4] gives Pperf×2=κ. Fix a bijection e:κPperf×2.

givenL1L2L3L4construct
2.1

For ακ, write e(α)=(Pα,εα) with εα2. Suppose zβ has been defined for every β<α, and put Zα:={zβ:β<α}. By construction each new zβ is chosen outside the earlier set Zβ, so the map βzβ is a bijection from α onto Zα. Hence Zα=α<κ, because ακ and κ is a cardinal. The set Pα is nonempty perfect, so [L1] and [L3] give Pα=κ; therefore PαZα is nonempty. Let zα be the -least point of PαZα. By transfinite recursion [L5], this defines a function αzα on κ.

step 1.1L1L3L5construct
3.1

Put B:={zα:ακ and εα=0}. Let P be any nonempty perfect subset of R. Since e is onto, there exist α,βκ with e(α)=(P,0) and e(β)=(P,1). Step 2.1 gives zαP and zβP. Moreover zαB by definition, while zβB because εβ=1. Thus every nonempty perfect subset of R meets both B and RB, so [F1] makes B a Bernstein set.

step 2.1F1
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Every compact subset of a Bernstein set is countable

Statement

Assume the Axiom of Countable Choice. Let BR be a Bernstein set. Then every compact subset of B is countable.

Facts & Assumptions

Given: The Axiom of Countable Choice, a Bernstein set BR, and a compact subset KB.

[F1]

A Bernstein set meets every nonempty perfect subset of R, and so does its complement (Bernstein subset of R).

[L1]

A subset of R is compact if and only if it is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

[L4]

A perfect subset of R is closed and has no isolated points (Perfect subset of R: closed with no isolated points).

[L5]

Rational open intervals form a countable family, and assuming countable choice, a countable union of countable sets is countable (Q is countably infinite, A product of two at most countable sets is at most countable, Countable unions of at most countable sets, assuming ACω).

Proof

technique · direct
1.1

Suppose, for contradiction, that K is uncountable. Since K is compact, [L1] makes it closed. Let C be the set of condensation points of K, that is, the points xK for which every neighbourhood of x meets K in uncountably many points. For each xKC, take the first rational open interval in a fixed enumeration that contains x and meets K countably. Thus KC is covered by a countable family of countable intersections with K, and [L5] makes it countable. Hence C is uncountable and nonempty.

L1L3L5assume-contra
2.1

The set C is perfect. It is closed, because if xC then some neighbourhood of x meets K only countably, and that same neighbourhood avoids C; and it has no isolated points, because every neighbourhood of a point of C meets K uncountably, while KC is countable by step 1.1, so the same neighbourhood meets C in a point different from the centre. Thus [L4] applies to C.

step 1.1L4algebra
3.1

Now CKB, so the nonempty perfect set C misses the complement of B, contradicting [F1]. Therefore the assumption in step 1.1 was false, and K is countable.

step 2.1F1discharge-contradiction
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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

Statement

Assume the Axiom of Countable Choice. Let BR be a Bernstein set.

  1. λ(B)=0.
  2. For every nondegenerate bounded interval IR, λ(BI)=λ(I).

Facts & Assumptions

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

[L1]

Every compact subset of a Bernstein set is countable (Every compact subset of a Bernstein set is countable).

[F1]

λ(E)=sup{λ(K):KE and K is compact} (Lebesgue inner measure on the real line).

[L2]

Every at most countable subset of R has measure zero (Every at most countable subset of R has measure zero).

[L3]

Assuming countable choice, λ(E)=inf{λ(U):UR open and EU} (Assuming countable choice, the Lebesgue outer measure of an arbitrary subset of Rn is the infimum of the measures of the open sets containing it).

[L4]

Assuming countable choice, every interval with any endpoint convention is Lebesgue measurable with its usual length (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L5]

Every open subset of R is a countable disjoint union of open intervals (Every open subset of R is a countable disjoint union of open intervals, namely its order components).

[L7]

A perfect subset of R is closed and has no isolated points (Perfect subset of R: closed with no isolated points).

Proof

technique · direct
1.1

Every compact subset of B is countable by [L1], hence has Lebesgue measure 0 by [L2]. Since 0 is attained by the compact set , the supremum in [F1] is exactly 0. Therefore λ(B)=0.

L1L2F1
1.2

Let I be a nondegenerate bounded interval, and assume λ(BI)<λ(I). Choose a closed nondegenerate interval JI with λ(BI)<λ(J); this is possible by moving any omitted endpoints inward by a sufficiently small amount. By [L3] choose an open set UBI with λ(U)<λ(J). Then F:=JU is closed in R, satisfies FIB, and is measurable. Because UJ is measurable and contained in U, [L4] gives λ(F)=λ(J)λ(UJ)λ(J)λ(U)>0. In particular F is uncountable by [L2]. The closed uncountable set F has a nonempty perfect subset: its set of condensation points is closed, nonempty, and has no isolated points by the argument of Every compact subset of a Bernstein set is countable. That perfect subset lies inside IB, contradicting the Bernstein property. Therefore λ(BI)=λ(I).

L2L3L4L5L6L7
2.1

Step 1.1 is claim 1, and step 1.2 is claim 2.

step 1.1step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A Lebesgue measurable subset of [0,1] that is invariant under changing finitely many binary digits has measure 0 or 1

Statement

Assume the Axiom of Countable Choice. Let A[0,1] be Lebesgue measurable, and suppose that whenever two points of [0,1] have binary expansions that differ at only finitely many indices, either both lie in A or both lie outside A. Then λ(A) is either 0 or 1.

Facts & Assumptions

Given: The Axiom of Countable Choice and a Lebesgue measurable set A[0,1] invariant under finite changes of binary digits.

[L1]

Assuming countable choice, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[L2]

Assuming countable choice, every interval with any endpoint convention is Lebesgue measurable with its usual length (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L3]

Assuming countable choice, a measurable subset of R admits closed inner approximation and open outer approximation (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn, clauses 1 and 3); a closed subset of the bounded set A[0,1] is compact by A subset of R is compact if and only if it is closed and bounded.

[L4]

Every at most countable subset of R has measure zero (Every at most countable subset of R has measure zero).

[L5]

Q is countably infinite (Q is countably infinite).

Proof

technique · contradiction
1.1

Let m:=λ(A) and let D be the set of dyadic rationals in [0,1], that is the numbers k/2n with nN and 0k2n. The set D is at most countable, hence null by [L4]. For fixed nN and 0k<2n, write In,k:=[k/2n,(k+1)/2n), and for k=2n1 replace the right endpoint by 1 so that the family (In,k)k<2n partitions [0,1].

L2L4L5construct
1.2

Suppose, for contradiction, that 0<m<1. Choose a real ε>0 with mε>m(m+ε). By [L3] choose a compact set KA with λ(K)>mε and an open set UA with λ(U)<m+ε.

L3L6assume-contrachoose
2.1

Fix n and k,<2n. Away from the dyadics, translating In,k onto In, changes only the first n binary digits, so the invariance hypothesis and [L1] give λ(AIn,k)=λ(AIn,). Summing over the partition from step 1.1 and using [L2] gives λ(AIn,k)=m2n for every k, and therefore for every union J of generation-n dyadic intervals one has λ(AJ)=mλ(J).

step 1.1L1L2algebra
2.2

For each xK, openness of U gives a real rx>0 with (xrx,x+rx)U. The smaller interval (xrx/2,x+rx/2) still contains x, so compactness of K gives finitely many points x1,,xNK such that the intervals Ji:=(xiri/2, xi+ri/2), where ri:=rxi, cover K. Let ρ:=min1iN(ri/2)>0, choose n with 2n<ρ, and let J be the union of the generation-n dyadic intervals meeting K. Then KJ. To prove JU, let D be one of those dyadic intervals and choose zDK. Pick i with zJi. For any yD one has yxiyz+zxi<2n+ri/2<ri, because D has length 2n and zJi. Hence y(xiri,xi+ri)U. So every such dyadic interval D lies in U, and therefore JU.

step 1.2L2L6choose
3.1

Step 2.1 applied to the set J gives λ(AJ)=mλ(J). Since KAJU, steps 1.2 and 2.2 imply mε<λ(K)λ(AJ)=mλ(J)mλ(U)<m(m+ε), contradicting the choice of ε. Therefore m cannot lie strictly between 0 and 1, and λ(A){0,1}.

step 2.1step 1.2step 2.2discharge-contradiction
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A free ultrafilter on N, viewed as a subset of {0,1}N and hence of [0,1], is not Lebesgue measurable

Statement

Assume the Axiom of Countable Choice. Let U be a free ultrafilter on N, let D be the dyadic rationals in [0,1], and put X:=[0,1]D. Every xX has a unique binary expansion x=0.b0b1b2; write Sx:={nN:bn=1}. Define

EU:={xX:SxU}.

Then EU is not Lebesgue measurable. This is what the title means by viewing U as a subset of {0,1}N and hence of [0,1]: the dyadic ambiguity is removed on the null set D.

Facts & Assumptions

Given: The Axiom of Countable Choice, a free ultrafilter U on N, and the associated sets D, X, and EUX.

[L1]

A measurable subset of [0,1] that is invariant under changing finitely many binary digits has measure 0 or 1 (A Lebesgue measurable subset of [0,1] that is invariant under changing finitely many binary digits has measure 0 or 1).

[L2]

In an ultrafilter on a set X, for every AX exactly one of A and XA lies in the ultrafilter (Characterisation of ultrafilters: every set or its complement).

[L3]

A free ultrafilter is a non-principal ultrafilter (Ultrafilter).

[L4]

Every at most countable subset of R has measure zero (Every at most countable subset of R has measure zero).

[L5]

Assuming countable choice, every interval with any endpoint convention is Lebesgue measurable with its usual length (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L6]

Assuming countable choice, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[L7]

Assuming countable choice, reflection in the origin preserves Lebesgue measurability and Lebesgue measure (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by cn, and reflection in the origin preserves it).

Proof

technique · contradiction
1.1

No singleton belongs to U: if {n}U, then every set containing n lies in U by upward closure, and [L2] excludes every set omitting n, so U is principal at n, contradicting [L3]. Consequently no finite set belongs to U, by induction on the size of the finite set using [L2] and the implication ABUAU or BU. Therefore every cofinite subset of N belongs to U.

L2L3algebra
2.1

If A,BN differ by finitely many points, then AU if and only if BU. Indeed, with F:=N(AB), step 1.1 gives FU; if AU then AF=BFU, hence BU by upward closure, and the converse is symmetric. A binary expansion represents a dyadic point exactly when it is eventually 0 or eventually 1, and finite digit changes preserve that property. Thus two points represented by expansions differing at finitely many indices are either both in D, hence both outside EU, or both in X, where their unique expansions give sets with finite symmetric difference. Therefore EU is invariant under changing finitely many binary digits.

step 1.1L2algebra
3.1

Suppose, for contradiction, that EU is Lebesgue measurable. Then step 2.1 and [L1] give λ(EU){0,1}.

step 2.1L1assume-contra
4.1

The set D is countable, hence null by [L4]. For xX, the unique binary expansion of r(x):=1x is obtained by complementing every digit, so Sr(x)=NSx. Therefore r maps X to itself and [L2] gives xEU if and only if r(x)EU. For measurable MX, one has r[M]=(M)+1, so reflection invariance [L7] followed by translation invariance [L6] gives λ(r[M])=λ(M). Applying this to M=EU and using λ(D)=0 and λ([0,1])=1 from [L5] yields λ(EU)=λ(r[EU])=λ(XEU)=1λ(EU), so λ(EU)=1/2.

step 3.1L2L4L5L6L7
5.1

The value 1/2 from step 4.1 contradicts the dichotomy of step 3.1. Therefore EU is not Lebesgue measurable.

step 3.1step 4.1discharge-contradiction
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-26 rests on unproved materialOpen item page →
Rests on 2 statements not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

What the Vitali set, Bernstein sets and free ultrafilters cost in choice

Choice enters this page in three genuinely different ways.

First, Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists uses a selector on the family of rational-equivalence classes meeting [0,1]. The later theorem that a Vitali set is nonmeasurable uses only countably many translates of an already chosen selector, so the cost is concentrated in the existence step, not in the measure argument.

Second, Assuming the real line can be well ordered, a Bernstein set exists uses a well-order of the real line and a transfinite construction through the perfect subsets. That is a different cost from the Vitali selector: the page isolates it because a Bernstein set is built by repeatedly choosing fresh points from a well-ordered development, not by one choice function on one fixed family.

Third, A free ultrafilter on N, viewed as a subset of {0,1}N and hence of [0,1], is not Lebesgue measurable is intentionally one-directional. It proves what follows from being given a free ultrafilter, namely nonmeasurability; it does not produce a free ultrafilter. The existence cost is recorded elsewhere in What the ultrafilter lemma costs: a choice principle strictly weaker than AC.

The published remarks Solovay's model: ZF + DC with every set of reals measurable and Shelah 1984: the inaccessible is needed for measurability, not for the Baire property explain why none of these pathologies can be read as consequences of ZF + DC alone: relative to the stated consistency hypotheses, ZF + DC can coexist with all sets of reals being measurable, and with all sets of reals having the Baire property.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

The cosets of Q in R meet [0,1] in pairwise disjoint classes, and rational translates of a Vitali set count them

Example

Fix a Vitali set V[0,1]. The equivalence classes of xy    xyQ meet [0,1] in pairwise disjoint pieces, and the rational translates of V count those classes exactly:

[0,1]qQ[1,1](V+q)[1,2].

Facts & Assumptions

Given: A Vitali set V[0,1].

[F1]

A Vitali set on [0,1] meets each class of xy    xyQ in exactly one point (Vitali set on [0,1]).

[L2]

Q is countably infinite (Q is countably infinite).

Verification

technique · direct
1.1

Two points x,y[0,1] lie in the same class exactly when they differ by a rational, and [F1] says that V contributes one and only one representative to each such class. Thus the pieces (x+Q)[0,1] are pairwise disjoint and each is hit once by V.

F1
2.1

If t[0,1], let vV be the unique representative of its class. Then tvQ and, because 0t,v1, also 1tv1; so tV+q for some qQ[1,1]. Conversely every v+q with vV and q[1,1] lies in [1,2].

step 1.1L2algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

The map xx+c(x) carries the Cantor set onto a compact set of Lebesgue measure 1 inside [0,2]

Example

Let ψ(x)=x+c(x). The gap (1/3,2/3) of the Cantor set is sent to (5/6,7/6), because c is constant there with value 1/2, while ψ(0)=0 and ψ(1)=2. The A-page lemmas show that ψ is a homeomorphism from [0,1] onto [0,2] and that ψ[C] is a compact set of Lebesgue measure 1.

Facts & Assumptions

Given: The Cantor function c and the map ψ(x)=x+c(x).

[L1]

ψ is a homeomorphism from [0,1] onto [0,2] (The map xx+c(x) is a homeomorphism from [0,1] onto [0,2]).

Verification

technique · direct
1.1

Step [L3] gives ψ(x)=x+1/2 for x(1/3,2/3), so ψ(1/3)=5/6, ψ(2/3)=7/6, and ψ[(1/3,2/3)]=(5/6,7/6). Also ψ(0)=0 and ψ(1)=2.

L1L3algebra
2.1

These computations sit inside the global picture from [L1] and [L2]: the map is a homeomorphism of the whole interval, and the image of the Cantor set itself is the compact measure-one set obtained by removing the translated gaps.

L1L2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A Vitali set shows that not every subset of R is Lebesgue measurable

Statement refuted

Refuted claim: every subset of R is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Assuming the Axiom of Choice, a Vitali set in [0,1] exists (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists).

[L2]

Every Vitali set is not Lebesgue measurable (Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable).

Counterexample

technique · direct
1.1

By [L1] choose a Vitali set V[0,1].

L1
2.1

The set V is a subset of R and is not Lebesgue measurable by [L2], so it refutes the claim.

step 1.1L2
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming countable choice and a well-ordering of the real line, a Bernstein set is dense, has inner measure 0, and is not Lebesgue measurable

Statement refuted

Refuted claim: every dense subset of R of inner measure 0 is Lebesgue measurable.

Assume the Axiom of Countable Choice and that the real line can be well ordered. Then a Bernstein set refutes the claim: it is dense in R, has inner measure 0, and is not Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Countable Choice and a well-ordering of the real line.

[L1]

Assuming the real line can be well ordered, a Bernstein set exists (Assuming the real line can be well ordered, a Bernstein set exists).

[L2]

Assuming countable choice, 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).

[L3]

Assuming countable choice, a Bernstein set is not Lebesgue measurable (Assuming the Axiom of Countable Choice, a Bernstein set is not Lebesgue measurable).

Counterexample

technique · direct
1.1

By [L1] choose a Bernstein set B. If some nonempty open interval were disjoint from B, it would contain a nondegenerate closed subinterval, hence a nonempty perfect subset of R, contradicting the Bernstein property. So B meets every nonempty open interval and is dense in R.

L1algebra
2.1

The given Axiom of Countable Choice supplies the hypothesis of [L2] and [L3]. Hence λ(B)=0 by [L2], and B is not Lebesgue measurable by [L3].

step 1.1L2L3
3.1

Therefore B is a dense subset of R of inner measure 0 that is not Lebesgue measurable, so it refutes the claim.

step 1.1step 2.1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

Two disjoint nonmeasurable subsets of [0,1] can have the measurable union [0,1]

Statement refuted

Refuted claim: if E and F are disjoint subsets of [0,1] and EF is Lebesgue measurable, then both E and F are Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Assuming the Axiom of Choice, a Vitali set in [0,1] exists (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists).

[L2]

Every Vitali set is not Lebesgue measurable (Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable).

Counterexample

technique · direct
1.1

Choose a Vitali set V[0,1] by [L1], and put W:=[0,1]V. Then V and W are disjoint and VW=[0,1], which is measurable by [L3].

L1L3construct
2.1

The set V is not measurable by [L2]. If W were measurable, then V=[0,1]W would also be measurable because [0,1] is measurable, contradiction. So W is not measurable either, and the pair (V,W) refutes the claim.

step 1.1L2L3
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Assuming Choice, a proper subgroup of (R,+) can be nonmeasurable

Statement refuted

Refuted claim: every proper subgroup of (R,+) is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L2]

A Lebesgue measurable subgroup of (R,+) of positive measure is all of R (A Lebesgue measurable subgroup of (Rn,+) of positive measure is all of Rn).

[L4]

Q is countably infinite (Q is countably infinite).

[L5]

Lebesgue measurability and Lebesgue measure are invariant under translation (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[L6]

A countable union of measurable null sets is null (Finite and countable subadditivity of measures).

Counterexample

technique · direct
1.1

By [L1] choose a Hamel basis B, a basis vector bB, and the corresponding coefficient map Λb:RQ. Its kernel W:={xR:Λb(x)=0} is a subgroup of (R,+), and it is proper because Λb(b)=1. Every real is of the form qb+w with qQ and wW.

L1construct
2.1

If W were measurable with positive measure, [L2] would force W=R, contradicting step 1.1.

step 1.1L2
2.2

If W were measurable with measure 0, then every translate qb+W would also be measurable with measure 0 by [L5], and step 1.1 says these countably many translates cover R. Their union would be null by [L4] and [L6], yet it contains the measurable interval [0,1] of measure 1 by [L3], a contradiction.

step 1.1L3L4L5L6
3.1

So the proper subgroup W is not Lebesgue measurable, and it refutes the claim.

step 2.1step 2.2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: assuming the Axiom of Choice, every subset of R is Lebesgue measurable

Statement

Assume the Axiom of Choice. Every subset of R is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

Assuming the Axiom of Choice, a Vitali set in [0,1] exists (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists).

[L2]

Assuming the Axiom of Choice, every Vitali set is not Lebesgue measurable (Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable).

Refutation

technique · direct
1.1

By [L1] choose a Vitali set V[0,1].

L1
2.1

The set V is a subset of R and is not Lebesgue measurable by [L2], so the universal claim is false.

step 1.1L2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: every continuous image of a Lebesgue measurable subset of R is Lebesgue measurable

Statement

Every continuous image of a Lebesgue measurable subset of R is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

A continuous image of a Lebesgue measurable subset of R can be nonmeasurable (A continuous image of a Lebesgue measurable subset of R can be nonmeasurable).

Refutation

technique · direct
1.1

By [L1] choose a measurable subset ER and a continuous map f:ER whose image is not measurable.

L1
2.1

This single witness (E,f) refutes the universal claim.

step 1.1
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: every continuous preimage of a Lebesgue measurable subset of R is Lebesgue measurable

Statement

Every continuous preimage of a Lebesgue measurable subset of R is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice.

[L1]

A continuous preimage of a Lebesgue measurable subset of R can be nonmeasurable (A continuous preimage of a Lebesgue measurable subset of R can be nonmeasurable).

Refutation

technique · direct
1.1

By [L1] choose a measurable subset ER and a continuous map g whose preimage of E is not measurable.

L1
2.1

This witness refutes the universal claim.

step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

FALSE: a dense subset of R of outer measure zero and a dense subset of full inner measure cannot both meet every open interval

Statement

A dense subset of R of outer measure zero and a dense subset of full inner measure cannot both meet every open interval.

Facts & Assumptions

Given: The rational reals QRR.

[L1]

QR is dense in R, its complement is dense, and every nonempty open subset of R is uncountable (Both Q and RQ are dense in R, and every nonempty open subset of R is uncountable).

[L2]

Every at most countable subset of R is Lebesgue null; in particular λ(QR)=0 (Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0).

[L3]

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).

[L4]

λ(E)=sup{λ(K):KE compact} (Lebesgue inner measure on the real line).

Refutation

technique · direct
1.1

The set QR is dense by [L1], and it has outer measure 0 because it is countably infinite and therefore Lebesgue null by [L2].

L1L2
2.1

Let IR be a bounded nondegenerate interval. Then IQR is measurable, because I is measurable by [L5] and QR has measure 0 by step 1.1. Also λ(IQR)=λ(I), so [L3] gives λ(IQR)=λ(I).

step 1.1L3L4L5algebra
3.1

Every nonempty open interval contains both a rational and an irrational by [L1]. So QR is dense, and RQR is also dense. Step 2.1 shows that inside every bounded nondegenerate interval the latter has full inner measure. These two dense sets therefore coexist, and the statement is false.

step 2.1L1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26 rests on unproved materialOpen item page →
Rests on 2 statements not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE, relative to an inaccessible cardinal: ZF + DC proves that a nonmeasurable subset of R exists

Statement

Assume ZFC together with the existence of an inaccessible cardinal is consistent. FALSE. ZF + DC proves that a nonmeasurable subset of R exists. Equivalently, relative to this consistency hypothesis, ZF + DC alone cannot guarantee a construction of such a set.

Facts & Assumptions

Given: The consistency of ZFC together with the existence of an inaccessible cardinal, and the external consistency-strength results recorded on the published choice pages.

[L1]

If ZFC together with the existence of an inaccessible cardinal is consistent, then so is ZF + DC + "every set of reals is Lebesgue measurable" (Solovay's model: ZF + DC with every set of reals measurable ).

[L2]

If ZF + DC + “every set of reals is Lebesgue measurable” is consistent, then so is ZFC + “there exists an inaccessible cardinal”; in contrast, Con(ZF) implies the consistency of ZF + DC + “every set of reals has the Baire property” (Shelah 1984: the inaccessible is needed for measurability, not for the Baire property ).

Refutation

technique · direct
1.1

By [L1], the stated consistency hypothesis supplies a model of ZF + DC in which every set of reals is Lebesgue measurable.

L1
2.1

If ZF + DC proved that a nonmeasurable subset of R exists, every model of ZF + DC would contain one. The model from step 1.1 contains none, so the asserted theorem of ZF + DC is false relative to the stated consistency hypothesis. This is precisely the consistency-strength obstruction recorded in [L2].

step 1.1 L2

Sources