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 ordinary Cantor set at its critical exponent

Example

Assume the Axiom of Countable Choice. Let C be the middle-thirds Cantor set and s=log2/log3. Its level-m basic cover has s-cost exactly one. In the small-scale limit,

Hs(C)=1,dimHC=s,H1(C)=0.

Facts & Assumptions

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

[F1]

Under the standing Countable Choice hypothesis, the middle-thirds Cantor set has critical measure one and dimension s=log2/log3. The Cantor set has dimension log 2 / log 3 and critical measure one

[F2]

Finite measure at exponent s gives zero measure at every larger exponent. Increasing the exponent past finite measure gives zero

Verification

1.1

There are 2m basic intervals of diameter 3m, and 3s=2. Thus their total cost is 2m3ms=1. The sharp Cantor theorem provides the matching lower bound, so the infimum cannot fall below one in the limit.

F1
2.1

Since 0<s<1 and the critical measure equals the finite value one, exponent comparison gives H1(C)=0. At level zero the cover is [0,1] and also costs one; shrinking scales require arbitrarily large levels.

F2step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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