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 , defined on the Cantor set through ternary digits and extended constantly across each removed interval
Definition
Let be the Cantor set, the set of sequences with values in and the bijection of The Cantor set is exactly the set of with every , and this gives a bijection with . Since is a bijection it has a two-sided inverse , and that inverse is a single function, determined and not selected (Injection, surjection, bijection).
On the Cantor set. For write and put
Each coefficient is or , so all the terms are nonnegative and every partial sum is at most (For , , and for the series diverges, Integer powers , Laws of integer exponents); hence the series converges and (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 : the nine order-convex forms, nondegeneracy, and length). In words: halves each ternary digit of and reads the result as a binary expansion.
On all of . The Cantor function is ,
The supremum exists and is a single real number. The set on the right is nonempty, because (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds) and , and it is bounded above by , because takes values in ; 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 , the values of lie in .
That really extends , that is, for every
, is not an observation but a small theorem: it needs to be
nondecreasing along . It is claim 1 of The Cantor function is well defined, satisfies whenever , is surjective onto , 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
-
Why the extension is a supremum and not a case distinction. Writing " is constant across each interval removed in the construction of " presupposes a description of those intervals; the supremum formula presupposes nothing, is defined at every point of at once, and yields the constancy as a theorem (claim 4 of The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set ↗). It also makes the monotonicity of immediate, since the set whose supremum is taken grows with .
-
Nothing is claimed here about continuity. No definition of continuity for a real function of a real variable is available at this point in the reading order, so no statement about it is made, in either direction; the properties proved on this page are well-definedness, monotonicity in the sense for , surjectivity onto and constancy across the gaps of .
-
The name. The function is also called the devil's staircase, because it climbs from to while being constant across every gap of , and the gaps fill up all of except a set of measure zero (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points).
-
The digits are halved, not truncated. sends the ternary digit sequence with values in to the binary sequence with values in , which is the bijection of claim 3 of The Cantor set is exactly the set of with every , and this gives a bijection with read backwards. So is the composition of with that bijection and with the binary summation, and its surjectivity onto is exactly the statement that every real of has a binary expansion, proved where it is used.
Depends on
- The Cantor set is exactly the set of $\sum_{k \ge 1} a_k 3^{-k}$ with every $a_k \in \{0,2\}$, and this gives a bijection with $\{0,1\}^{\mathbb{N}}$
- The Cantor middle-thirds set as the intersection of the sets $C_n$ obtained by removing open middle thirds
- Series, partial sums, convergence and the sum, divergence, and the tail series
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum
- Complete ordered field (least-upper-bound property)
- Lower bound, bounded below, bounded set
- Suprema and infima are unique
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Injection, surjection, bijection
- Integer powers $a^m$
- Laws of integer exponents
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Ordered field
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
Used by
- The Cantor function is continuous on [0,1] Corollary
- The Cantor function takes the value 1/2 on all of [1/3, 2/3], and its values at 1/9, 1/4 and 7/9 Example
- The Cantor set has measure zero, yet the Cantor function maps it onto all of [0,1]: a null set can have image an interval of length 1 Example
- The Cantor function is continuous and nondecreasing, climbs from 0 to 1, and is constant on every interval removed in the construction of the Cantor set, so all of its increase happens on a set of measure zero Remark
- The Cantor function is well defined, satisfies c(x) ≤ c(y) whenever x ≤ y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set Theorem
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
- Cantor function (Wikipedia) (standard reference, not scraped)
- Cantor set (Wikipedia) (standard reference, not scraped)
- Stanford Math 205A, Homework 1 (standard reference, not scraped)