Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

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

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Every at most countable subset ERn (Finite, countably infinite, countable, uncountable) is Lebesgue measurable with

λn(E)  =  0,

so E is a λn-null set (Measure-null sets and almost-everywhere statements relative to a measure). In particular every singleton is null, and on the real line the set QR of rational reals (The rationals embed densely in the reals) satisfies λ1(QR)=0.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and an at most countable set ERn.

[L1]

Every set R with RRR is Lebesgue measurable with λn(R)=i<n(biai), and this gives measure 0 to all of them whenever ai=bi for some i<n (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L2]

Assuming countable choice, L(Rn) is a sigma-algebra and λn is a complete measure on it (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F1]

A is at most countable if it is finite or countably infinite (Finite, countably infinite, countable, uncountable); a nonempty A is at most countable if and only if there is a surjection s:NA (A nonempty set is at most countable iff it is a surjective image of N).

[F2]

For a measure μ and measurable (Ek)kN, μ(kNEk)k=0μ(Ek) (Finite and countable subadditivity of measures).

[F3]

QN: the rationals are countably infinite (Q is countably infinite), and QR denotes the image of Q in R under the canonical order-preserving field embedding (The rationals embed densely in the reals).

[F4]

A measurable set NA is μ-null if μ(N)=0 (Measure-null sets and almost-everywhere statements relative to a measure); a sigma-algebra is closed under countable unions (Sigma-algebras).

[F5]

[a,b]:={xRm:ajxjbj (j<m)} (Axis-parallel rectangles in Rm and their volume).

Proof

technique · direct
1.1

A singleton {x}Rn is the closed rectangle [x,x], whose sides all satisfy ai=bi=xi, so it is Lebesgue measurable with λn({x})=0.

L1F5
1.2

The empty set is Lebesgue measurable with measure 0.

L2F4
2.1

Let E be nonempty and at most countable and fix a surjection s:NE; then E=kN{s(k)} is a countable union of measurable sets, hence measurable, and countable subadditivity gives λn(E)k=0λn({s(k)})=0.

step 1.1L2F1F2F4
3.1

Steps 1.2 and 2.1 cover both cases, and QR is a countably infinite subset of R, so λ1(QR)=0.

step 1.2step 2.1F3

Depends on

Used by

Dependency tree · two levels

67 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