Blancmange curve explained

In mathematics, the blancmange curve is a self-affine fractal curve constructible by midpoint subdivision. It is also known as the Takagi curve, after Teiji Takagi who described it in 1901, or as the Takagi–Landsberg curve, a generalization of the curve named after Takagi and Georg Landsberg. The name blancmange comes from its resemblance to a Blancmange pudding. It is a special case of the more general de Rham curve.

Definition

The blancmange function is defined on the unit interval by

\operatorname{blanc}(x) = \sum ^{inf ty} _{n =0} {s( 2 ^{n} x)\over 2 ^{n},}

where

s(x) is the triangle wave, defined by s(x) =min _{n\in{Z} }|x-n|,that is, s(x) is the distance from x to the nearest integer.

The Takagi–Landsberg curve is a slight generalization, given by

T _{w(x)} = \sum ^{inf ty} _{n =0} w ^{n} s( 2 ^{n} x)

for a parameter

w ; thus the blancmange curve is the case w =1 / 2 . The value H =-log _{2} w is known as the Hurst parameter.

The function can be extended to all of the real line: applying the definition given above shows that the function repeats on each unit interval.

Functional equation definition

The periodic version of the Takagi curve can also be defined as the unique bounded solution

T = T _{w:\R\to\R} to the functional equationT(x) = s(x) + w T( 2 x).

Indeed, the blancmange function

T _{w} is certainly bounded, and solves the functional equation, since T _{w(x)} : = \sum ^{inf ty} _{n =0} w ^{n} s( 2 ^{n} x) = s(x) + \sum ^{inf ty} _{n =1} w ^{n} s( 2 ^{n} x) = s(x) + w\sum ^{inf ty} _{n =0} w ^{n} s( 2 ^{n+1} x) = s(x) + wT _{w(2x).} Conversely, if T:\R\to\R is a bounded solution of the functional equation, iterating the equality one has for any NT(x) = \sum ^{N} _{n =0} w ^{n} s( 2 ^{n} x) + w ^{N+1} T( 2 ^{N+1} x) = \sum ^{N} _{n =0} w ^{n} s( 2 ^{n} x) + o( 1 ), for N\to inf ty,

whence

T = T _{w} . Incidentally, the above functional equations possesses infinitely many continuous, non-bounded solutions, e.g.T _{w(x)+} c |x| ^{-log _{2} w} .

Graphical construction

The blancmange curve can be visually built up out of triangle wave functions if the infinite sum is approximated by finite sums of the first few terms. In the illustrations below, progressively finer triangle functions (shown in red) are added to the curve at each stage.

Properties

Convergence and continuity

The infinite sum defining

T _{w(x)} converges absolutely for all x. Since 0 \le s(x) \le 1 / 2 for all x\in R , \sum ^{inf ty} _{n =0} |w ^{n} s( 2 ^{n} x)| \le (1)/(2) \sum ^{inf ty} _{n =0} |w| ^{n} = (1)/(2) ⋅ (1)/(1- |w|)

if

|w|< 1 . The Takagi curve of parameter w is defined on the unit interval (or R ) if |w|< 1 . The Takagi function of parameter w is continuous. The functions T _{w,n} defined by the partial sums T _{w,n} (x) = \sum ^{n} _{k =0} w ^{k} s( 2 ^{k} x)

are continuous and converge uniformly toward

T _{w:} \begin{align} \left|T _{w(x)} - T _{w,n} (x)\right| & = \left|\sum ^{inf ty} _{k = n +1} w ^{k} s( 2 ^{k} x)\right| \\ & = \left|w ^{n+1} \sum ^{inf ty} _{k =0} w ^{k} s( 2 ^{k+n+1} x)\right| \\ &\le (|w| ^{n+1})/(2) ⋅ (1)/(1- |w|) \end{align}

for all x when

|w| < 1 . This bound decreases as n\to inf ty. By the uniform limit theorem, T _{w} is continuous if |w| < 1.

Subadditivity

Since the absolute value is a subadditive function so is the function

s(x) =min _{n\in{Z} }|x-n|, and its dilations s( 2 ^{kx)} ; since positive linear combinations and point-wise limits of subadditive functions are subadditive, the Takagi function is subadditive for any value of the parameter w .

The special case of the parabola

For

w =1 / 4 , one obtains the parabola: the construction of the parabola by midpoint subdivision was described by Archimedes.

Differentiability

For values of the parameter

0 < w < 1 / 2 , the Takagi function T _{w} is differentiable in the classical sense at any x\in\R which is not a dyadic rational. By derivation under the sign of series, for any non dyadic rational x\in\R, one findsT ^{\prime(x)} _{w} = \sum ^{inf ty} _{n =0} ( 2 w) ^{n} ( 2 b _{n-1)}

where

(b _{n)} _{n\in\N} \in\{ 0 , 1 \} ^{\N} is the sequence of binary digits in the base 2 expansion of x :x = \sum ^{inf ty} _{n =- k} b ^{- n -1} _{n 2} .

Equivalently, the bits in the binary expansion can be understood as a sequence of square waves, the Haar wavelets, scaled to width

2 ^{-n} . This follows, since the derivative of the triangle wave is just the square wave:(d)/(dx) s(x) =sgn ( 1 / 2- (x \mod 1 ))

and so

T ^{\prime(x)} _{w} = \sum ^{inf ty} _{n =0} ( 2 w) ^{n} sgn ( 1 / 2- ( 2 ^{nx} \mod 1 ))

For the parameter

0 < w < 1 / 2 , the function T _{w} is Lipschitz of constant 1 /( 1-2 w). In particular for the special value w =1 / 4 one finds, for any non dyadic rational x\in[ 0 , 1 ] T _{1/4} '(x) = 2 - 4 x , according with the mentioned T _{1/4} (x) = 2 x( 1 - x).

For

w =1 / 2 the blancmange function T _{w} it is of bounded variation on no non-empty open set; it is not even locally Lipschitz, but it is quasi-Lipschitz, indeed, it admits the function \omega(t): = t(| log _{2} t| +1 / 2 ) as a modulus of continuity .

Fourier series expansion

The Takagi–Landsberg function admits an absolutely convergent Fourier series expansion:

T _{w(x)} = \sum ^{inf ty} _{m =0} a _{m\cos(2\pi} m x) with a _{0=1/4(1-w)} and, for m\ge 1 a _{m: =- (2)/(\pi ^{2m} ^{2})} ( 4 w) ^{\nu(m)} , where 2 ^{\nu(m)} is the maximum power of 2 that divides m .Indeed, the above triangle wave s(x) has an absolutely convergent Fourier series expansions(x) = (1)/(- 4) (2)/(\pi ^{2}) \sum ^{inf ty (1)/(( 2 k +1 ) ^{2})} _{k =0} \cos ( 2 \pi ( 2 k +1 )x ) . By absolute convergence, one can reorder the corresponding double series for T _{w(x)} :T _{w(x):=\sum} ^{inf ty} ^{n =0} w ^{n} s( 2 ^{nx)=} (1)/(4) \sum ^{inf ty} _{n =0} w ^{n} - (2)/(\pi ^{2}) \sum ^{inf ty} _{k =0} (w ^{n})/(( 2 k +1 ) ^{2}) \cos ( 2 \pi 2 ^{n(2k+1)x)} :

putting

m =2 ^{n(2k+1)} yields the above Fourier series for T _{w(x).}

Self similarity

The recursive definition allows the monoid of self-symmetries of the curve to be given. This monoid is given by two generators, g and r, which act on the curve (restricted to the unit interval) as

[g ⋅ T _{w](x)} = T _{w} \left(g ⋅ x\right) = T _{w\left( (x)/(2)} \right) = (x)/(2) + w T _{w(x)} and[r ⋅ T _{w](x)} = T _{w(r} ⋅ x) = T _{w(1-x)} = T _{w(x).}

A general element of the monoid then has the form

\gamma = g ^{a _{1}} r g ^{a _{2}} r … r g ^{a _{n}} for some integers a _{1,} a _{2,} … , a _{n} This acts on the curve as a linear function: \gamma ⋅ T _{w} = a + bx + cT _{w} for some constants a, b and c. Because the action is linear, it can be described in terms of a vector space, with the vector space basis:1 \mapsto e _{1} = \begin{bmatrix} 1 \ 0 \ 0 \end{bmatrix} x \mapsto e _{2} = \begin{bmatrix} 0 \ 1 \ 0 \end{bmatrix} T _{w} \mapsto e _{3} = \begin{bmatrix} 0 \ 0 \ 1 \end{bmatrix}

In this representation, the action of g and r are given by

g = \begin{bmatrix} 1 & 0 & 0 \ 0 & (1)/(2) & (1)/(2) \ 0 & 0 & w \end{bmatrix} andr = \begin{bmatrix} 1 & 1 & 0 \ 0 & -1 & 0 \ 0 & 0 & 1 \end{bmatrix}

That is, the action of a general element

\gamma maps the blancmange curve on the unit interval [0,1] to a sub-interval [m/ 2 ^{p,} n/ 2 ^{p]} for some integers m, n, p. The mapping is given exactly by [\gamma ⋅ T _{w](x)} = a + bx + cT _{w(x)} where the values of a, b and c can be obtained directly by multiplying out the above matrices. That is:\gamma = \begin{bmatrix} 1 & (m)/(2 ^{p}) & a \ 0 & (n - m)/(2 ^{p}) & b \ 0 & 0 & c \end{bmatrix}

Note that

p = a _{1+a} _{2+ …} + a _{n} is immediate.

The monoid generated by g and r is sometimes called the dyadic monoid; it is a sub-monoid of the modular group. When discussing the modular group, the more common notation for g and r is T and S, but that notation conflicts with the symbols used here.

The above three-dimensional representation is just one of many representations it can have; it shows that the blancmange curve is one possible realization of the action. That is, there are representations for any dimension, not just 3; some of these give the de Rham curves.

Integrating the Blancmange curve

Given that the integral of

\operatorname{blanc}(x) from 0 to 1 is 1/2, the identity \operatorname{blanc}(x) = \operatorname{blanc}( 2 x)/ 2+ s(x) allows the integral over any interval to be computed by the following relation. The computation is recursive with computing time on the order of log of the accuracy required. DefiningI(x) = \int ^{x\operatorname{blanc}(y)dy} _{0} one has thatI(x) = \begin{cases} I( 2 x)/ 4+ x ^{2/2} & if 0 \leq x \leq 1 / 2 \\ 1 / 2- I( 1- x) & if 1 / 2 \le x \le 1 \\ n/ 2+ I(x - n) & if n \le x \le (n +1 ) \\ \end{cases} The definite integral is given by:\int ^{b\operatorname{blanc}(y)dy} _{a} = I(b) - I(a).

A more general expression can be obtained by defining

S(x) = \int ^{x} _{0} s(y)dy = \begin{cases} x ^{2/} 2 , & 0 \le x \le (1)/(2) \ - x ^{2} / 2 + x - 1 / 4 , & (1)/(2) \le x \le 1 \\ n/ 4 + S(x - n), & (n \le x \le n +1 ) \end{cases} which, combined with the series representation, givesI _{w(x)=} \int ^{x} _{0} T _{w(y)} dy = \sum ^{inf ty} _{n =0} (w/ 2 ) ^{n} S( 2 ^{n} x)

Note that

I _{w( 1 ) = (1)/(4 ( 1- w))}

This integral is also self-similar on the unit interval, under an action of the dyadic monoid described in the section Self similarity. Here, the representation is 4-dimensional, having the basis

\{e _{1,e} _{2,e} _{3,e} _{4\}=\{1,} x, x ^{2,} I _{w(x)\}} . The action of g on the unit interval is the commuting diagram[g ⋅ I _{w](x)} = I _{w\left(g} ⋅ x\right) = I _{w\left( (x)/(2)} \right) = (x ^{2})/(8) + (w)/(2) I _{w(x).}

From this, one can then immediately read off the generators of the four-dimensional representation:

g = \begin{bmatrix} 1 & 0 & 0 & 0 \ 0 & (1)/(2) & 0 & 0 \ 0 & 0 & (1)/(4) & (1)/(8) \ 0 & 0 & 0 & (w)/(2) \end{bmatrix} andr = \begin{bmatrix} 1 & 1 & 1 & (1)/(4 ( 1- w)) \ 0 & -1 & -2 & 0 \ 0 & 0 & 1 & 0 \ 0 & 0 & 0 & -1 \end{bmatrix}

Repeated integrals transform under a 5,6,... dimensional representation.

Relation to simplicial complexes

Let

N = \binom{n _{t}{t}+\binom{n} _{t-1} }+\ldots+\binom,\quadn_t > n_ > \ldots > n_j \geq j\geq 1.

Define the Kruskal–Katona function

\kappa _{t(N)={n} _{t} \choose t +1 } + {n _{t-1} \choose t} + ... + {n _{j} \choose j +1 }.

The Kruskal–Katona theorem states that this is the minimum number of (t - 1)-simplexes that are faces of a set of N t-simplexes.

As t and N approach infinity,

\kappa _{t(N)-N} (suitably normalized) approaches the blancmange curve.

See also

• Cantor function (also known as the Devil's staircase)
• Minkowski's question mark function
• Weierstrass function
• Dyadic transformation

References

• • • Benoit Mandelbrot, "Fractal Landscapes without creases and with rivers", appearing in The Science of Fractal Images, ed. Heinz-Otto Peitgen, Dietmar Saupe; Springer-Verlag (1988) pp 243 - 260.
• Linas Vepstas, Symmetries of Period-Doubling Maps, (2004)
• Donald Knuth, The Art of Computer Programming, volume 4a. Combinatorial algorithms, part 1. . See pages 372–375.

External links

• Takagi Explorer
• (Some properties of the Takagi function)