|
Proof: Blancmange function is the sum of the series : Let x be a
point in [0,1].
For each natural n, select xn in [0, 1] such that either:
or
, chosen such that the interval between x and xn lies, for some k<2n, entirely inside [k2n-1, (k+1)2n-1]. Clearly, xnà x. The terms wn(x) are periodic with period 2-m, and for m>n , 2-n is multiple of 2-m. So for m≥n:
For m<n, since the terms wn(x) are linear with slope 1 or –1 on the
segment between x and xn, we have:
As a consequence, for each n:
where im are all 1 or –1. Since all xn ≠x, either {xn}n has a subsequence with terms less then x, or {xn}n has a subsequence with terms more then x. Lets consider the first case, e.g. {xn}n has a subsequence with terms less then x, and let’s call that sequence {yn}n. In general, , where {kn}n is an increasing sequence of natural numbers. Let’s consider {Dn}n , where . From previous calculations:
Considering that (im)m<n are calculated for each n, we should have written (im,n)m<n instead of (im)m<n. However, im,n1=im,n2 for m<min(n1,n2), since [y1,x] contains all [yn,x] and all series terms are linear on [y1, x]. So, for each n, either Dn+1=Dn+1 or Dn+1=Dn-1. As a consequence, Dn is not convergent. If Blancmange would be differentiable at x, then Dnàf’(x),
but we proved that Dn is not convergent. As a consequence, the
function is not differentiable at x █ |
|