Main Page | See live article | Alphabetical index

# Cantor function

The Cantor function is a function c : [0,1] → [0,1] defined as follows:

1. Express x in base 3.
2. Replace the first 1 with a 2 and everything after it with 0.
3. Replace all 2s with 1s.
4. Interpret the result as a binary number. The result is c(x).

(It may be much easier to understand this definition by looking at the graph below than by grasping the algorithm.)

This function is the most frequently cited example of a real function that is continuous but not absolutely continuous. It has no derivative at any member of the Cantor set; its derivative is 0 elsewhere. Extended to the left with value 0 and to the right with value 1, it is the cumulative probability distribution function of a random variable that is uniformly distributed on the Cantor set. This probability distribution has no discrete part, i.e., it does not concentrate positive probability at any point. It also has no part that can be represented by a 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. See Cantor distribution. The Cantor function is the standard example of what is sometimes called a devil's staircase.

## Alternative definition

Below we define a sequence of functions fn on the interval that converges to the Cantor function.

Let f0(x) = x.

Then fn+1(x) will be defined in terms of fn(x).

Let fn+1(x) = 0.5 fn(3x) when 0 ≤ x ≤ 1/3.

Let fn+1(x) = 0.5 when 1/3 ≤ x ≤ 2/3.

Let fn+1(x) = 0.5 + 0.5 fn(3 (x − 2/3)) when 2/3 ≤ x ≤ 1.

Observe that fn converges to the Cantor function. Also notice that the choice of starting function does not really matter, provided f0(0) = 0 and f0(1) = 1 and f0 is bounded.