Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27
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 function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval

Definition

Let CC be the Cantor set, DD the set of sequences with values in {0,2}\{0,2\} and Φ:DC\Phi : D \to C the bijection Φ(a)=k0ak3k1\Phi(a) = \sum_{k \ge 0} a_k 3^{-k-1} of The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}. Since Φ\Phi is a bijection it has a two-sided inverse Φ1:CD\Phi^{-1} : C \to D, and that inverse is a single function, determined and not selected (Injection, surjection, bijection).

On the Cantor set. For xCx \in C write a:=Φ1(x)a := \Phi^{-1}(x) and put

γ(x)  :=  k=0(ak21)2k1.\gamma(x) \;:=\; \sum_{k=0}^{\infty} \big(a_k \cdot 2^{-1}\big)\, 2^{-k-1} .

Each coefficient ak21a_k \cdot 2^{-1} is 00 or 11, so all the terms are nonnegative and every partial sum is at most k<n2k1k=02k1=1\sum_{k<n} 2^{-k-1} \le \sum_{k=0}^{\infty} 2^{-k-1} = 1 (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Integer powers ama^m, Laws of integer exponents); hence the series converges and γ(x)[0,1]\gamma(x) \in [0,1] (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). In words: γ\gamma halves each ternary digit of xx and reads the result as a binary expansion.

On all of [0,1][0,1]. The Cantor function is c:[0,1]Rc : [0,1] \to \mathbb{R},

c(x)  :=  sup{γ(t):tC and tx}.c(x) \;:=\; \sup\{\, \gamma(t) : t \in C \text{ and } t \le x \,\} .

The supremum exists and is a single real number. The set on the right is nonempty, because 0C0 \in C (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) and 0x0 \le x, and it is bounded above by 11, because γ\gamma takes values in [0,1][0,1]; so it has a least upper bound by completeness (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set), and that bound is unique (Suprema and infima are unique). Since 0γ(0)c(x)10 \le \gamma(0) \le c(x) \le 1, the values of cc lie in [0,1][0,1].

That cc really extends γ\gamma, that is, c(t)=γ(t)c(t) = \gamma(t) for every tCt \in C, is not an observation but a small theorem: it needs γ\gamma to be nondecreasing along CC. It is claim 1 of 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 , recorded in this item's justified_by, and until it is proved the two symbols are kept apart.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 110 results over 29 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