Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Every Lebesgue measurable proper subgroup of (R,+) is null, and Z and Q are instances

Example

Assume the Axiom of Countable Choice. If G(R,+) is Lebesgue measurable and proper, then λ1(G)=0. In particular both Z and Q are Lebesgue null subgroups of the line.

Facts & Assumptions

Given: The Axiom of Countable Choice.

[L1]

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

[L2]
[F1]

The rationals are countably infinite (Q is countably infinite).

[F2]

The real numbers are uncountable (R is uncountable (Cantor's nested intervals, 1874)).

Verification

technique · direct
1.1

If G(R,+) is measurable and proper, then the contrapositive of [L1] gives λ1(G)=0.

L1
2.1

The integers and rationals are at most countable subgroups of (R,+), so [L2] gives them Lebesgue measure zero; they are proper because [F1] and [F2] show QR, and ZQ.

step 1.1L2F1F2
3.1

Step 1.1 uses measurability in an essential way: it says nothing about subgroups of R that are not Lebesgue measurable.

step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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