Minkowski's question-mark function

Minkowski question-mark function.

Left: Template:Math. Right: Template:Math.

In mathematics, Minkowski's question-mark function, denoted Template:Math, is a function with unusual fractal properties, defined by Hermann Minkowski in 1904.Template:Sfnp It maps quadratic irrational numbers to rational numbers on the unit interval, via an expression relating the continued fraction expansions of the quadratics to the binary expansions of the rationals, given by Arnaud Denjoy in 1938.Template:Sfnp It also maps rational numbers to dyadic rationals, as can be seen by a recursive definition closely related to the Stern–Brocot tree.

Definition and intuition

One way to define the question-mark function involves the correspondence between two different ways of representing fractional numbers using finite or infinite binary sequences. Most familiarly, a string of 0s and 1s with a single point mark ".", like "11.0010010000111111..." can be interpreted as the binary representation of a number. In this case this number is $$2+1+\frac{1}{8}+\frac{1}{64}+\cdots =\pi .$$ There is a different way of interpreting the same sequence, however, using continued fractions. Interpreting the fractional part "0.00100100001111110..." as a binary number in the same way, replace each consecutive block of 0's or 1's by its run length (or, for the first block of zeroes, its run length plus one), in this case generating the sequence $[3;3,1,2,1,4,6,\dots ]$. Then, use this sequence as the coefficients of a continued fraction:Template:SfnpTemplate:Sfnp $$3+\frac{1}{3+\frac{1}{1+\frac{1}{2+\frac{1}{1+\frac{1}{4+\frac{1}{6+\dots }}}}}}\approx 3.2676$$

The question-mark function reverses this process: it translates the continued-fraction of a given real number into a run-length encoded binary sequence, and then reinterprets that sequence as a binary number.Template:SfnpTemplate:Sfnp For instance, for the example above, $\mathrm{?}(3.2676)\approx \pi$. To define this formally, if an irrational number $x$ has the (non-terminating) continued-fraction representation $$x=a_0+\frac{1}{a_1+\frac{1}{a_2+\cdots }}=[a_0;a_1,a_2,\dots ]$$ then the value of the question-mark function on $x$ is defined as the value of the infinite series $$\mathrm{?}(x)=a_0+2\sum _{n=1}^{\mathrm{\infty }}\frac{{(-1)}^{n+1}}{2^{a_1+\cdots +a_n}}.$$ A rational number $x$ has a terminating continued-fraction representation $[a_0;a_1,a_2,\dots ,a_m]$, so the value of the question-mark function on $x$ reduces to the dyadic rational defined by a finite sum, $$\mathrm{?}(x)=a_0+2\sum _{n=1}^m\frac{{(-1)}^{n+1}}{2^{a_1+\cdots +a_n}}.$$ A quadratic irrational number $x$ is represented by a periodic continued fraction, so the value of the question-mark function on $x$ is a periodic binary fraction and thus a non-dyadic rational number.

Self-symmetry

The question mark is clearly visually self-similar. A monoid of self-similarities may be generated by two operators Template:Mvar and Template:Mvar acting on the unit square and defined as follows: $$\begin{array}{cc}S(x,y)& =(\frac{x}{x+1},\frac{y}{2}),\\ [5px]R(x,y)& =(1-x,1-y).\end{array}$$

Visually, Template:Mvar shrinks the unit square to its bottom-left quarter, while Template:Mvar performs a point reflection through its center.

A point on the graph of Template:Math has coordinates Template:Math for some Template:Mvar in the unit interval. Such a point is transformed by Template:Mvar and Template:Mvar into another point of the graph, because Template:Math satisfies the following identities for all Template:Math: $$\begin{array}{cc}\mathrm{?}\left(\frac{x}{x+1}\right)& =\frac{\mathrm{?}(x)}{2},\\ [5px]\mathrm{?}(1-x)& =1-\mathrm{?}(x).\end{array}$$

These two operators may be repeatedly combined, forming a monoid. A general element of the monoid is then $$S^{a_1}R{S}^{a_2}R{S}^{a_3}\cdots$$

for positive integers Template:Math. Each such element describes a self-similarity of the question-mark function. This monoid is sometimes called the period-doubling monoid, and all period-doubling fractal curves have a self-symmetry described by it (the de Rham curve, of which the question mark is a special case, is a category of such curves). The elements of the monoid are in correspondence with the rationals, by means of the identification of Template:Math with the continued fraction Template:Math. Since both $$S:x\mapsto \frac{x}{x+1}$$ and $$T:x\mapsto 1-x$$ are linear fractional transformations with integer coefficients, the monoid may be regarded as a subset of the modular group Template:Math.

Quadratic irrationals

The question mark function provides a one-to-one mapping from the non-dyadic rationals to the quadratic irrationals, thus allowing an explicit proof of countability of the latter. These can, in fact, be understood to correspond to the periodic orbits for the dyadic transformation. This can be explicitly demonstrated in just a few steps.

Dyadic symmetry

Define two moves: a left move and a right move, valid on the unit interval $0\le x\le 1$ as $$L_D(x)=\frac{x}{2}$$ and $L_C(x)=\frac{x}{1+x}$ and $$R_D(x)=\frac{1+x}{2}$$ and $R_C(x)=\frac{1}{2-x}$ The question mark function then obeys a left-move symmetry $$L_D\circ \text{?}=\text{?}\circ L_C$$ and a right-move symmetry $$R_D\circ \text{?}=\text{?}\circ R_C$$ where $\circ$ denotes function composition. These can be arbitrarily concatenated. 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 \text{?}=\text{?}\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_1{b}_2{b}_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 question mark 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_0{g}_1{g}_0$ and generally, $g_A{g}_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 question mark function: $${\gamma }_D\circ \text{?}=\text{?}\circ {\gamma }_C$$

Isomorphism

An explicit mapping between the rationals and the dyadic rationals can be obtained providing a reflection operator $$r(x)=1-x$$ and noting that both $$r\circ R_D\circ r=L_D$$ and $r\circ R_C\circ r=L_C$ Since $r^2=1$ is the identity, an arbitrary string of left-right moves can be re-written as a string of left moves only, followed by a reflection, followed by more left moves, a reflection, and so on, that is, as $L^{a_1}r{L}^{a_2}r{L}^{a_3}\cdots$ which is clearly isomorphic to $S^{a_1}T{S}^{a_2}T{S}^{a_3}\cdots$ from above. Evaluating some explicit sequence of $L_D,R_D$ at the function argument $x=1$ gives a dyadic rational; explicitly, it is equal to $y=0.b_1{b}_2{b}_3\cdots b_m$ where each $b_k\in \{0,1\}$ is a binary bit, zero corresponding to a left move and one corresponding to a right move. The equivalent sequence of $L_C,R_C$ moves, evaluated at $x=1$ gives a rational number $p/q.$ It is explicitly the one provided by the continued fraction $p/q=[a_1,a_2,a_3,\dots ,a_j]$ keeping in mind that it is a rational because the sequence $(a_1,a_2,a_3,\dots ,a_j)$ was of finite length. This establishes a one-to-one correspondence between the dyadic rationals and the rationals.

Periodic orbits of the dyadic transform

Consider now the periodic orbits of the dyadic transformation. These correspond to bit-sequences consisting of a finite initial "chaotic" sequence of bits $b_0,b_1,b_2,\dots ,b_{k-1}$, followed by a repeating string $b_k,b_{k+1},b_{k+2},\dots ,b_{k+m-1}$ of length $m$. Such repeating strings correspond to a rational number. This is easily made explicit. Write $$y=\sum _{j=0}^{m-1}{b}_{k+j}{2}^{-j-1}$$ one then clearly has $$\sum _{j=0}^{\mathrm{\infty }}{b}_{k+j}{2}^{-j-1}=y\sum _{j=0}^{\mathrm{\infty }}{2}^{-jm}=\frac{y}{1-2^m}$$ Tacking on the initial non-repeating sequence, one clearly has a rational number. In fact, every rational number can be expressed in this way: an initial "random" sequence, followed by a cycling repeat. That is, the periodic orbits of the map are in one-to-one correspondence with the rationals.

Periodic orbits as continued fractions

Such periodic orbits have an equivalent periodic continued fraction, per the isomorphism established above. There is an initial "chaotic" orbit, of some finite length, followed by a repeating sequence. The repeating sequence generates a periodic continued fraction satisfying $x=[a_n,a_{n+1},a_{n+2},\dots ,a_{n+r},x].$ This continued fraction has the formTemplate:Sfnp $$x=\frac{\alpha x+\beta }{\gamma x+\delta }$$ with the $\alpha ,\beta ,\gamma ,\delta$ being integers, and satisfying $\alpha \delta -\beta \gamma =\pm 1.$ Explicit values can be obtained by writing $$S\mapsto \left(\begin{array}{cc}1& 0\\ 1& 1\end{array}\right)$$ for the shift, so that $$S^n\mapsto \left(\begin{array}{cc}1& 0\\ n& 1\end{array}\right)$$ while the reflection is given by $$T\mapsto \left(\begin{array}{cc}-1& 1\\ 0& 1\end{array}\right)$$ so that $T^2=I$. Both of these matrices are unimodular, arbitrary products remain unimodular, and result in a matrix of the form $$S^{a_n}T{S}^{a_{n+1}}T\cdots T{S}^{a_{n+r}}=\left(\begin{array}{cc}\alpha & \beta \\ \gamma & \delta \end{array}\right)$$ giving the precise value of the continued fraction. As all of the matrix entries are integers, this matrix belongs to the projective modular group $PSL(2,\mathbb{Z}).$

Solving explicitly, one has that $\gamma x^2+(\delta -\alpha )x-\beta =0.$ It is not hard to verify that the solutions to this meet the definition of quadratic irrationals. In fact, every quadratic irrational can be expressed in this way. Thus the quadratic irrationals are in one-to-one correspondence with the periodic orbits of the dyadic transform, which are in one-to-one correspondence with the (non-dyadic) rationals, which are in one-to-one correspondence with the dyadic rationals. The question mark function provides the correspondence in each case.

Properties of Template:Math

Template:Wide image The question-mark function is a strictly increasing and continuous,Template:Sfnp but not absolutely continuous function. The derivative is defined almost everywhere, and can take on only two values, 0 (its value almost everywhere, including at all rational numbers) and $+\mathrm{\infty }$.Template:Sfnp There are several constructions for a measure that, when integrated, yields the question-mark function. One such construction is obtained by measuring the density of the Farey numbers on the real number line. The question-mark measure is the prototypical example of what are sometimes referred to as multi-fractal measures.

The question-mark function maps rational numbers to dyadic rational numbers, meaning those whose base two representation terminates, as may be proven by induction from the recursive construction outlined above. It maps quadratic irrationals to non-dyadic rational numbers. In both cases it provides an order isomorphism between these sets,Template:Sfnp making concrete Cantor's isomorphism theorem according to which every two unbounded countable dense linear orders are order-isomorphic.Template:Sfnp It is an odd function, and satisfies the functional equation Template:Math; consequently Template:Math is an odd periodic function with period one. If Template:Math is irrational, then Template:Mvar is either algebraic of degree greater than two, or transcendental.

The question-mark function has fixed points at 0, Template:Sfrac and 1, and at least two more, symmetric about the midpoint. One is approximately 0.42037.Template:Sfnp It was conjectured by Moshchevitin that they were the only 5 fixed points.Template:Sfnp

In 1943, Raphaël Salem raised the question of whether the Fourier–Stieltjes coefficients of the question-mark function vanish at infinity.Template:Sfnp In other words, he wanted to know whether or not $$\underset{n\to \mathrm{\infty }}{\lim }\underset{0}{\overset{1}{\int }}{e}^{2\pi inx}\mathrm{d?}(x)=0.$$

This was answered affirmatively by Jordan and Sahlsten, as a special case of a result on Gibbs measures.Template:Sfnp

The graph of Minkowski question mark function is a special case of fractal curves known as de Rham curves.

Algorithm

The recursive definition naturally lends itself to an algorithm for computing the function to any desired degree of accuracy for any real number, as the following C function demonstrates. The algorithm descends the Stern–Brocot tree in search of the input Template:Mvar, and sums the terms of the binary expansion of Template:Math on the way. As long as the loop invariant Template:Math remains satisfied there is no need to reduce the fraction Template:Math, since it is already in lowest terms. Another invariant is Template:Math. The for loop in this program may be analyzed somewhat like a while loop, with the conditional break statements in the first three lines making out the condition. The only statements in the loop that can possibly affect the invariants are in the last two lines, and these can be shown to preserve the truth of both invariants as long as the first three lines have executed successfully without breaking out of the loop. A third invariant for the body of the loop (up to floating point precision) is Template:Math, but since Template:Mvar is halved at the beginning of the loop before any conditions are tested, our conclusion is only that Template:Math at the termination of the loop.

To prove termination, it is sufficient to note that the sum q + s increases by at least 1 with every iteration of the loop, and that the loop will terminate when this sum is too large to be represented in the primitive C data type long. However, in practice, the conditional break when y + d == y is what ensures the termination of the loop in a reasonable amount of time.

/* Minkowski's question-mark function */
double minkowski(double x) {
    long p = x;
    long q = 1, r = p + 1, s = 1, m, n;
    double d = 1, y = p;
    if (x < p || (p < 0) ^ (r <= 0))
        return x; /* out of range ?(x) =~ x */
    while (true) { /* invariants: q * r - p * s == 1 && p / q <= x && x < r / s */
        d /= 2;
        if (y + d == y)
            break; /* reached max possible precision */
        m = p + r;
        if ((m < 0) ^ (p < 0))
            break; /* sum overflowed */
        n = q + s;
        if (n < 0)
            break; /* sum overflowed */

        if (x < (double)m / n) {
            r = m;
            s = n;
        } else {
            y += d;
            p = m;
            q = n;
        }
    }
    return y + d; /* final round-off */
}

Probability distribution

Restricting the Minkowski question mark function to  ?:[0,1] → [0,1], it can be used as the cumulative distribution function of a singular distribution on the unit interval. This distribution is symmetric about its midpoint, with raw moments of about m₁ = 0.5, m₂ = 0.290926, m₃ = 0.186389 and m₄ = 0.126992,Template:Sfnp and so a mean and median of 0.5, a standard deviation of about 0.2023, a skewness of 0, and an excess kurtosis about −1.147.

See also

• Cantor function, which can be understood as reinterpreting ternary numbers as binary numbers, analogously to the way the question-mark function reinterprets continued fractions as binary numbers.
• Hermite's problem, to which one of the approaches uses generalization of Minkowski's question-mark function.
• Pompeiu derivative

References

Historical sources

• Template:Citation
• Template:Citation

Bibliography

• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation; reprinted by Dover Publications, 1997
• Template:Citation
• Template:Citation
• Template:Citation

Further reading

• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Cite arXiv

External links

• An extensive bibliography list
• Template:Mathworld
• Simple IEEE 754 implementation in C++