Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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 R is Lebesgue measurable. DC is separately assumed, not deduced from AD; no AC-based determinacy or analytic regularity theorem is used.

Facts & Assumptions

[F1]

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.

[F3]

Every complete ordered field is Archimedean ensures the integer unit intervals cover R.

[F4]

Dyadic coding supplies coin measure and its completed Lebesgue transfer supplies the injective dyadic map, envelope bounds, and completed Lebesgue transfer under DC.

[F5]

The rationals embed densely in the reals supplies a rational strictly between two distinct real bounds.

Proof

Given: ZF, A1 and A2.

1.1

Fix EC. If its closed inner and open outer bounds differed, their bounds in [0,1] give by F5 a rational v strictly between them, with 0<v1. 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 νin(E)v, a contradiction; if II won it would give νout(E)v, also a contradiction. Thus the two envelope values agree. The dyadic interface F4 applies under the same A2 and gives b1[E] Lebesgue measurable.

A1A2F1F4F5
2.1

For any A[0,1) take E=b[A]. By F4 the dyadic b is injective, so b1[E]=A: 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.

F4step 1.1
3.1

For arbitrary AR, set Am=(A[m,m+1))m for each integer m. These are subsets of [0,1), hence measurable by step 2.1. F2 makes each translate Am+m measurable. Enumerate the integers 0,1,1,2,2,; 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.

A2F4F2F3step 2.1

Depends on

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.

Sources