Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-09-04
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.

Steinhaus follows in two lines from the density theorem

Example

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

If ERn is Lebesgue measurable and λ(E)>0, then the difference set EE:={xy:x,yE} contains an open neighbourhood of 0.

Facts & Assumptions

Given: The Axiom of Countable Choice and a measurable set ERn with λ(E)>0.

[L1]

Almost every point of E is a density-one point of E. (Lebesgue density theorem)

Verification

technique · direct
1.1

By [L1], choose a density-one point xE. Then there is r>0 such that [L1, L3, given, choose] λ(EB(x,r))>34λ(B(x,r)). Because [L3] makes the ball measure continuous in the radius, choose 0<δ<r with λ(B(x,r+δ)B(x,rδ))<14λ(B(x,r)). If h2<δ, then B(x,rδ)B(x+h,r)B(x,r+δ), so B(x+h,r)B(x,r)B(x,r+δ)B(x,rδ). Therefore λ(B(x+h,r)B(x,r))<14λ(B(x,r)).

L1L3givenchoosealgebra
2.1

Fix h2<δ. Translation invariance [L2] gives [L2, step 1.1, algebra] λ((Eh)B(x,r))=λ(EB(x+h,r))λ(EB(x,r))λ(B(x+h,r)B(x,r))>12λ(B(x,r)). Together with step 1.1, both EB(x,r) and (Eh)B(x,r) have measure greater than half of λ(B(x,r)), so they intersect. Choose zE(Eh). Then zE and z+hE, so h=(z+h)zEE.

L2step 1.1algebra
3.1

Every h with h2<δ lies in EE, so EE contains the open [step 2.1] ball B(0,δ).

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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