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

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

Depends on

Used by

Dependency tree · two levels

71 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