Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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 Cantor set has measure zero, yet the Cantor function maps it onto all of [0,1][0,1]: a null set can have image an interval of length 11

Example

Let CC be the Cantor set (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) and let c:[0,1]Rc : [0,1] \to \mathbb{R} be the Cantor function (The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval). Then:

  1. CC has measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover));
  2. c[C]=[0,1]c[C] = [0,1]: the Cantor function maps the Cantor set onto the whole of [0,1][0,1] (Injection, surjection, bijection);
  3. [0,1][0,1] does not have measure zero (A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero).

So a continuous function can carry a set of measure zero onto a set that is not of measure zero, and indeed onto an interval of length 11: being null is not preserved by continuous images.

Facts & Assumptions

Given: The Cantor set CC and the Cantor function c:[0,1]Rc : [0,1] \to \mathbb{R}.

[L2]

cc is surjective onto [0,1][0,1] as a function on [0,1][0,1], that is c[[0,1]]=[0,1]c[\,[0,1]\,] = [0,1]; and cc is constant on [u,v][u,v] whenever u<vu < v lie in CC with (u,v)C=(u,v) \cap C = \varnothing, while every point of [0,1]C[0,1] \setminus C lies in the open interval (u,v)(u,v) of such a pair (The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set, claims 3 and 4).

[L4]

cc is continuous on [0,1][0,1] (The Cantor function is continuous on [0,1][0,1]).

Verification

technique · direct
1.1

Claim 1 is claim 2 of the Cantor set theorem.

L1
1.2

Claim 3 is the nondegenerate-interval lemma applied to [0,1][0,1], whose endpoints 00 and 11 are distinct.

L3
1.3

c[C][0,1]c[C] \subseteq [0,1], since c[[0,1]]=[0,1]c[\,[0,1]\,] = [0,1] and C[0,1]C \subseteq [0,1].

L2
1.4

[0,1]c[C][0,1] \subseteq c[C]: let y[0,1]y \in [0,1] and take x[0,1]x \in [0,1] with c(x)=yc(x) = y. If xCx \in C we are done. Otherwise x[0,1]Cx \in [0,1] \setminus C, so xx lies in the open interval (u,v)(u,v) of a pair u<vu < v of points of CC with (u,v)C=(u,v) \cap C = \varnothing, and cc is constant on [u,v][u,v]; hence y=c(x)=c(u)y = c(x) = c(u) with uCu \in C, so yc[C]y \in c[C].

L2
2.1

Claim 2 follows from steps 1.3 and 1.4: c[C]=[0,1]c[C] = [0,1]. With claims 1 and 3 this says that the null set CC has image the set [0,1][0,1], which is not null, under the continuous function cc.

step 1.1step 1.2step 1.3step 1.4L4

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 130 results over 22 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources