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

The Smith-Volterra-Cantor set has Lebesgue measure exactly 1/2

Example

Assume the Axiom of Countable Choice and let S be the Smith-Volterra-Cantor set. Then

λ1(S)=12.

This is the exact value behind the published statement that S is not null.

Facts & Assumptions

Given: The Axiom of Countable Choice and the stage lengths (λn)nN and stage sets (Sn)nN of The Smith-Volterra-Cantor set: the same construction removing, at stage n1, an open middle interval of length 4n from each of the 2n1 remaining intervals.

[L1]

Assuming countable choice, a box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai) (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[F2]

Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then μ(nEn)=infnμ(En) (Continuity from above when one set has finite measure).

Verification

technique · direct
1.1

At stage n, the set Sn is a disjoint union of 2n closed intervals of common length λn, so λ1(Sn)=2nλn.

F1F3L1algebra
2.1

Put un:=2nλn. Then u0=1 and un+1=un2n2 by [F1], so an induction together with [F4] gives un=12+2n1 for every nN.

step 1.1F1F4algebra
3.1

The sets Sn decrease to S, and λ1(S0)=1<+, so [F2] yields λ1(S)=infnλ1(Sn)=limn(12+2n1)=12.

step 2.1F2F3algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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.