Minkowski's question-mark function explained

In mathematics, Minkowski's question-mark function, denoted, is a function with unusual fractal properties, defined by Hermann Minkowski in 1904. 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. 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.001001000011111..." can be interpreted as the binary representation of a number. In this case this number is$$2+1+\backslash frac18+\backslash frac1+\backslash cdots=\backslash pi.$$There is a different way of interpreting the same sequence, however, using continued fractions. Interpreting the fractional part "0.001001000011111..." 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 , 5 , ... ] . Then, use this sequence as the coefficients of a continued fraction:$$3+\backslash frac\backslash 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. For instance, for the example above,

\operatorname{?}( 3 . 2676 ) ≈ \pi . To define this formally, if an irrational number x has the (non-terminating) continued-fraction representation$$x=a\_0+\backslash frac=[a\_0;a\_1,a\_2,\backslash dots]$$then the value of the question-mark function on x is defined as the value of the infinite series$$\backslash operatorname(x)\; =\; a\_0\; +\; 2\; \backslash sum\_^\backslash infty\; \backslash frac.$$In the same way, if a rational number x has the terminating continued-fraction representation [a _{0;a} _{1,a} _{2,...,a} _{m]} then the value of the question-mark function on x reduces to a finite sum,$$\backslash operatorname(x)\; =\; a\_0\; +\; 2\; \backslash sum\_^m\; \backslash frac.$$

Analogously to the way the question-mark function reinterprets continued fractions as binary numbers, the Cantor function can be understood as reinterpreting ternary numbers as binary numbers.

Self-symmetry

The question mark is clearly visually self-similar. A monoid of self-similarities may be generated by two operators and acting on the unit square and defined as follows:

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

A point on the graph of has coordinates for some in the unit interval. Such a point is transformed by and into another point of the graph, because satisfies the following identities for all :

These two operators may be repeatedly combined, forming a monoid. A general element of the monoid is then$$S^\; R\; S^\; R\; S^\; \backslash cdots$$

for positive integers . 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 with the continued fraction . Since both$$S\; :\; x\; \backslash mapsto\; \backslash frac$$and$$T\; :\; x\; \backslash mapsto\; 1\; -\; x$$are linear fractional transformations with integer coefficients, the monoid may be regarded as a subset of the modular group .

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

0 \le x\le 1 as$$L\_D(x)\; =\; \backslash frac$$ and L _{C(x)} = (x)/(1+ x) and$$R\_D(x)\; =\; \backslash frac$$ and R _{C(x)} = (1)/(2- x) The question mark function then obeys a left-move symmetry$$L\_D\; \backslash circ\; \backslash text\; =\; \backslash text\; \backslash circ\; L\_C$$and a right-move symmetry$$R\_D\; \backslash circ\; \backslash text\; =\; \backslash text\; \backslash circ\; R\_C$$where \circ denotes function composition. These can be arbitrary 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\; \backslash circ\; \backslash text\; =\; \backslash text\; \backslash 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 …} 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 _{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 question mark function:$$\backslash gamma\_D\backslash circ\; \backslash text\; =\; \backslash text\backslash circ\; \backslash 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\backslash circ\; R\_D\backslash 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}} rL ^{a _{2}} rL ^{a _{3}} … which is clearly isomorphic to S ^{a _{1}} TS ^{a _{2}} TS ^{a _{3}} … 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 _{1b} _{2b} _{3 …} 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,\ldots,a} _{j]} keeping in mind that it is a rational because the sequence (a _{1,a} _{2,a} _{3,\ldots,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,\ldots,} b _{k-1} , followed by a repeating string b _{k,b} _{k+1} ,b _{k+2} ,\ldots, b _{k+m-1} of length m . Such repeating strings correspond to a rational number. This is easily made explicit. Write$$y=\backslash sum\_^\; b\_2^$$one then clearly has$$\backslash sum\_^\backslash infty\; b\_2^\; =\; y\backslash sum\_^\backslash infty\; 2^\; =\; \backslash frac$$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} ,\ldots,a _{n+r} ,x]. This continued fraction has the form$$x\; =\; \backslash frac$$with the \alpha,\beta,\gamma,\delta being integers, and satisfying \alpha \delta - \beta \gamma = \pm 1 . Explicit values can be obtained by writing for the shift, so that while the reflection is given byso that T ^{2=I} . Both of these matrices are unimodular, arbitrary products remain unimodular, and result in a matrix of the formgiving 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 , 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

The question-mark function is a strictly increasing and continuous, 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

+inf ty . 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, making concrete Cantor's isomorphism theorem according to which every two unbounded countable dense linear orders are order-isomorphic. It is an odd function, and satisfies the functional equation ; consequently is an odd periodic function with period one. If is irrational, then is either algebraic of degree greater than two, or transcendental.

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

In 1943, Raphaël Salem raised the question of whether the Fourier–Stieltjes coefficients of the question-mark function vanish at infinity. In other words, he wanted to know whether or not$$\backslash lim\_\backslash int\_0^1\; e^\; \backslash ,\; \backslash operatorname(x)=0.$$

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

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 , and sums the terms of the binary expansion of on the way. As long as the loop invariant remains satisfied there is no need to reduce the fraction, since it is already in lowest terms. Another invariant is . 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, but since is halved at the beginning of the loop before any conditions are tested, our conclusion is only that 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)

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, 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

• Pompeiu derivative
• Hermite's problem, to which one of the approaches uses generalization of Minkowski's question-mark function.

References

Bibliography

reprinted by Dover Publications, 1997

Further reading

• • • • • • • Vepstas . L. . On the Minkowski Measure . 0810.1265 . 2008 . cs2. math.DS .

External links

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