Cantor function

To define the Cantor function c:[0,1]\to[0,1], let x be any number in [0,1] and obtain c(x) by the following steps: • Express x in base 3, using digits 0, 1, 2. • If the base-3 representation of x contains a 1, replace every digit strictly after the first 1 with 0. • Replace any remaining 2s with 1s. • Interpret the result as a binary number. The result is c(x). For example: • \tfrac14 has the ternary representation 0.02020202... There are no 1s so the next stage is still 0.02020202... This is rewritten as 0.01010101... This is the binary representation of \tfrac13, so c(\tfrac14)=\tfrac13. • \tfrac15 has the ternary representation 0.01210121... The digits after the first 1 are replaced by 0s to produce 0.01000000... This is not rewritten since it has no 2s. This is the binary representation of \tfrac14, so c(\tfrac15)=\tfrac14. • \tfrac{200}{243} has the ternary representation 0.21102 (or 0.211012222...). The digits after the first 1 are replaced by 0s to produce 0.21. This is rewritten as 0.11. This is the binary representation of \tfrac34, so c(\tfrac{200}{243})=\tfrac34. Equivalently, letting \mathcal{C} be the Cantor set on [0,1], the Cantor function c:[0,1]\to[0,1] can be defined as c(x) =\begin{cases} \displaystyle \sum_{n=1}^\infty \frac{a_n}{2^n}, & \displaystyle \text{if } x = \sum_{n=1}^\infty \frac{2a_n}{3^n}\in\mathcal{C}\ \text{for}\ a_n\in\{0,1\}; \\ \displaystyle \sup_{y\leq x,\, y\in\mathcal{C}} c(y), & \displaystyle \text{if } x\in [0,1] \setminus \mathcal{C}. \end{cases} This formula is well-defined, since every member of the Cantor set has a unique base 3 representation that only contains the digits 0 or 2. (For some members of \mathcal{C}, the ternary expansion is repeating with trailing 2's and there is an alternative non-repeating expansion ending in 1. For example, \tfrac13 = 0.13 = 0.02222...3 is a member of the Cantor set). Since c(0)=0 and c(1)=1, and c is monotonic on \mathcal{C}, it is clear that 0\le c(x)\le 1 also holds for all x\in[0,1]\smallsetminus\mathcal{C}. ==Properties==

The Cantor function challenges naive intuitions about continuity and measure; though it is continuous everywhere and has zero derivative almost everywhere, c(x) goes from 0 to 1 as x goes from 0 to 1, and takes on every value in between. The Cantor function is the most frequently cited example of a real function that is uniformly continuous (precisely, it is Hölder continuous of exponent \alpha = \log_3(2)) but not absolutely continuous. It is constant on intervals of the form (0.x1x2x3...xn022222..., 0.x1x2x3...xn200000...), and every point not in the Cantor set is in one of these intervals, so its derivative is 0 outside of the Cantor set. On the other hand, it has no derivative at any point in an uncountable subset of the Cantor set containing the interval endpoints described above. The Cantor function can also be seen as the cumulative probability distribution function of the 1/2-1/2 Bernoulli measure μ supported on the Cantor set: c(x)=\mu([0,x]). This probability distribution, called the Cantor distribution, has no discrete part. That is, the corresponding measure is atomless. This is why there are no jump discontinuities in the function; any such jump would correspond to an atom in the measure. However, no non-constant part of the Cantor function can be represented as an integral of a probability density function; integrating any putative probability density function that is not almost everywhere zero over any interval will give positive probability to some interval to which this distribution assigns probability zero. In particular, as pointed out, the function is not the integral of its derivative even though the derivative exists almost everywhere. The Cantor function is the standard example of a singular function. The Cantor function is also a standard example of a function with bounded variation but, as mentioned above, is not absolutely continuous. However, every absolutely continuous function is continuous with bounded variation. The Cantor function is non-decreasing, and so in particular its graph defines a rectifiable curve. showed that the arc length of its graph is 2. Note that the graph of any nondecreasing function such that f(0)=0 and f(1)=1 has length not greater than 2. In this sense, the Cantor function is extremal. Lack of absolute continuity The Lebesgue measure of the Cantor set is 0. Therefore, for any positive ε  0, there exists a finite sequence of pairwise disjoint sub-intervals with total length  0 there are finitely many pairwise disjoint intervals (xk,yk) (1 ≤ k ≤ M) with \sum\limits_{k=1}^M (y_k-x_k) and \sum\limits_{k=1}^M (c(y_k)-c(x_k))=1. == Alternative definitions ==

Iterative construction Below we define a sequence (f_n)_n of functions on the unit interval that converges to the Cantor function. Let f_0(x) = x. Then, for every integer n \geq 0, the next function f_{n + 1}(x) will be defined in terms of f_n(x) as follows:f_{n + 1}(x) = \begin{cases} \displaystyle \frac{1}{2} f_n(3 x) &\text{if } 0 \leq x \leq \frac{1}{3} \\ \displaystyle \frac{1}{2} &\text{if } \frac{1}{3} \leq x \leq \frac{2}{3} \\ \displaystyle \frac{1}{2} + \frac{1}{2} f_n(3 x - 2) &\text{if } \frac{2}{3} \leq x \leq 1 \end{cases}The three definitions are compatible at the end-points \tfrac{1}{3} and \tfrac{2}{3}, because f_n(0) = 0 and f_n(1) = 1 for every n, by induction. One may check that (f_n)_n converges pointwise to the Cantor function defined above. Furthermore, the convergence is uniform. Indeed, separating into three cases, according to the definition of f_{n + 1}, one sees that :\max_{x \in [0, 1]} |f_{n+1}(x) - f_n(x)| \le \frac 1 2 \, \max_{x \in [0, 1]} |f_{n}(x) - f_{n-1}(x)|, \quad n \ge 1. If f denotes the limit function, it follows that, for every n \geq 0, :\max_{x \in [0, 1]} |f(x) - f_n(x)| \le 2^{-n+1} \, \max_{x \in [0, 1]} |f_1(x) - f_0(x)|. Fractal volume The Cantor function is closely related to the Cantor set. The Cantor set C can be defined as the set of those numbers in the interval [0, 1] that do not contain the digit 1 in their base-3 (triadic) expansion, except if the 1 is followed by zeros only (in which case the tail 1000\ldots can be replaced by 0222\ldots to get rid of any 1). It turns out that the Cantor set is a fractal with (uncountably) infinitely many points (zero-dimensional volume), but zero length (one-dimensional volume). Only the D-dimensional volume H_D (in the sense of a Hausdorff-measure) takes a finite positive value, where D = \log_3(2) is the fractal dimension of C. We may define the Cantor function alternatively as the D-dimensional volume of sections of the Cantor set : f(x)=H_D(C \cap (0,x)). ==Self-similarity==

The Cantor function possesses several symmetries. For 0\le x\le 1, there is a reflection symmetry :c(x)=1-c(1-x) and a pair of magnifications, one on the left and one on the right: :c\left(\frac{x}{3}\right) = \frac{c(x)}{2} and :c\left(\frac{x+2}{3}\right) = \frac{1+c(x)}{2} The magnifications can be cascaded; they generate the dyadic monoid. This is exhibited by defining several helper functions. Define the reflection as :r(x)=1-x The first self-symmetry can be expressed as :r\circ c = c\circ r where the symbol \circ denotes function composition. That is, (r\circ c)(x)=r(c(x))=1-c(x) and likewise for the other cases. For the left and right magnifications, write the left-mappings :L_D(x)= \frac{x}{2} and L_C(x)= \frac{x}{3} Then the Cantor function obeys :L_D \circ c = c \circ L_C Similarly, define the right mappings as :R_D(x)= \frac{1+x}{2} and R_C(x)= \frac{2+x}{3} Then, likewise, :R_D \circ c = c \circ R_C The two sides can be mirrored one onto the other, in that :L_D \circ r = r\circ R_D and likewise, :L_C \circ r = r\circ R_C These operations can be stacked arbitrarily. Consider, for example, the sequence of left-right moves LRLLR. Adding the subscripts C and D, and, for clarity, dropping the composition operator \circ in all but a few places, one has: :L_D R_D L_D L_D R_D \circ c = c \circ L_C R_C L_C L_C R_C Arbitrary finite-length strings in the letters L and R correspond to the dyadic rationals, in that every dyadic rational can be written as both y=n/2^m for integer n and m and as finite length of bits y=0.b_1b_2b_3\cdots b_m with b_k\in \{0,1\}. Thus, every dyadic rational is in one-to-one correspondence with some self-symmetry of the Cantor function. Some notational rearrangements can make the above slightly easier to express. Let g_0 and g_1 stand for L and R. Function composition extends this to a monoid, in that one can write g_{010}=g_0g_1g_0 and generally, g_Ag_B=g_{AB} for some binary strings of digits A, B, where AB is just the ordinary concatenation of such strings. The dyadic monoid M is then the monoid of all such finite-length left-right moves. Writing \gamma\in M as a general element of the monoid, there is a corresponding self-symmetry of the Cantor function: :\gamma_D\circ c= c\circ \gamma_C The dyadic monoid itself has several interesting properties. It can be viewed as a finite number of left-right moves down an infinite binary tree; the infinitely distant "leaves" on the tree correspond to the points on the Cantor set, and so, the monoid also represents the self-symmetries of the Cantor set. In fact, a large class of commonly occurring fractals are described by the dyadic monoid; additional examples can be found in the article on de Rham curves. Other fractals possessing self-similarity are described with other kinds of monoids. The dyadic monoid is itself a sub-monoid of the modular group SL(2,\mathbb{Z}). Note that the Cantor function bears more than a passing resemblance to Minkowski's question-mark function. In particular, it obeys analogous symmetry relations, with only a slightly altered form. == Generalizations ==

Let : y=\sum_{k=1}^\infty b_k 2^{-k} be the dyadic (binary) expansion of the real number 0 ≤ y ≤ 1 in terms of binary digits bk ∈ {0,1}. This expansion is discussed in greater detail in the article on the dyadic transformation. Then consider the function : C_z(y)=\sum_{k=1}^\infty b_k z^{k}. For z = 1/3, the inverse of the function x = 2 C1/3(y) is the Cantor function. That is, y = y(x) is the Cantor function. In general, for any z < 1/2, Cz(y) looks like the Cantor function turned on its side, with the width of the steps getting wider as z approaches zero. As mentioned above, the Cantor function is also the cumulative distribution function of a measure on the Cantor set. Different Cantor functions, or Devil's Staircases, can be obtained by considering different atom-less probability measures supported on the Cantor set or other fractals. While the Cantor function has derivative 0 almost everywhere, current research focuses on the question of the size of the set of points where the upper right derivative is distinct from the lower right derivative, causing the derivative to not exist. This analysis of differentiability is usually given in terms of fractal dimension, with the Hausdorff dimension the most popular choice. This line of research was started in the 1990s by Darst, who showed that the Hausdorff dimension of the set of non-differentiability of the Cantor function is the square of the dimension of the Cantor set, (\log_3(2))^2. Subsequently Falconer showed that this squaring relationship holds for all Ahlfors's regular, singular measures, i.e.\dim_H\left\{x : f'(x)=\lim_{h\to0^+}\frac{\mu([x,x+h])}{h}\text{ does not exist}\right\}=\left(\dim_H\operatorname{supp}(\mu)\right)^2Later, Troscheit obtain a more comprehensive picture of the set where the derivative does not exist for more general normalized Gibb's measures supported on self-conformal and self-similar sets. Hermann Minkowski's question mark function loosely resembles the Cantor function visually, appearing as a "smoothed out" form of the latter; it can be constructed by passing from a continued fraction expansion to a binary expansion, just as the Cantor function can be constructed by passing from a ternary expansion to a binary expansion. The question mark function has the interesting property of having vanishing derivatives at all rational numbers. == See also==