Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 fat Cantor set has positive length and dimension one

Example

Assume the Axiom of Countable Choice. For the Smith–Volterra–Cantor set S,

H1(S)=λ1(S)=12,dimHS=1.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

The stage-n set Sn consists of 2n intervals of length n, with 0=1 and n+1=(n4n1)/2; the stages decrease to S. 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

[F2]

The fat Cantor set is closed and bounded; every interval cover has total length at least 1/2. The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero

[F3]

Under the standing Countable Choice hypothesis, on the line H1 equals Lebesgue outer measure. One-dimensional Hausdorff measure on the line is Lebesgue outer measure

[F4]

Finite positive measure at exponent one forces dimension one. Hausdorff dimension is the unique critical exponent

[F5]

For decreasing measurable sets, continuity from above holds if some member has finite measure. Continuity from above when one set has finite measure

Verification

1.1

The construction intervals at a fixed level are disjoint, and induction in the defining recursion gives 2nn=12+2n1. Thus λ1(Sn)=12+2n1. The stages are closed, and λ1(S0)=1<. Their intersection is the closed set S.

F1F2
2.1

Continuity from above yields λ1(S)=limnλ1(Sn)=1/2. The equality with H1 and the finite-positive criterion give the stated measure and dimension. Thus the earlier cover lower bound has been matched by an exact measure calculation here.

F3F4F5step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

49 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