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.
Under AD and DC every real set is Lebesgue measurable
Statement
In ZF+AD+DC every subset of is Lebesgue measurable. DC is separately assumed, not deduced from AD; no AC-based determinacy or analytic regularity theorem is used.
Facts & Assumptions
Winning measure-game strategies bound inner and outer measure gives both rational-game strategy bounds under DC, for the closed inner and open outer envelopes.
Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation preserves Lebesgue measurability under translations.
Every complete ordered field is Archimedean ensures the integer unit intervals cover .
Dyadic coding supplies coin measure and its completed Lebesgue transfer supplies the injective dyadic map, envelope bounds, and completed Lebesgue transfer under DC.
The rationals embed densely in the reals supplies a rational strictly between two distinct real bounds.
Proof
Given: ZF, A1 and A2.
Fix . If its closed inner and open outer bounds differed, their bounds in [0,1] give by F5 a rational strictly between them, with . Each rational measure game has the explicit natural-number coding in F1's game convention, so A1 determines it. If I won, F1 under A2 would give , a contradiction; if II won it would give , also a contradiction. Thus the two envelope values agree. The dyadic interface F4 applies under the same A2 and gives Lebesgue measurable.
For any take E=b[A]. By F4 the dyadic is injective, so : forward membership gives b(x)=b(a) for some a in A and therefore x=a, and reverse membership is immediate. Step 1.1 thus makes every such A measurable.
For arbitrary , set for each integer m. These are subsets of [0,1), hence measurable by step 2.1. F2 makes each translate measurable. Enumerate the integers ; by F3 their corresponding pieces have union A. The Lebesgue sigma-algebra under A2 (countable choice is derived from DC in F4's proof) is closed under this sequence of unions. Hence A is measurable. No choices of pieces are involved: each is defined by A and m. QED.
Depends on
- Axiom of determinacy for natural-number games
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Winning measure-game strategies bound inner and outer measure
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- Every complete ordered field is Archimedean
- Dyadic coding supplies coin measure and its completed Lebesgue transfer
- The rationals embed densely in the reals
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
50 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.