Rademacher functions
1 Binary expansions
Define by
For example, for and ,
for and , ,
Let . If there is some such that and for all , then defining
we have
One proves that if either (i) there is some such that and for all or (ii) there is some such that and for all , then contains exactly two elements, and that otherwise contains exactly one element.
In words, except for the sequence whose terms are only 0 or the sequence whose terms are only 1, contains exactly two elements when is eventually or eventually , and contains exactly one element otherwise.
We define by taking to be the unique element of if contains exactly one element, and to be the element of that is eventually if contains exactly two elements. For we define by
Then, for all ,
(1) |
which we call the binary expansion of .
2 Rademacher functions
Define by
where denotes the greatest integer . Thus, for we have , for we have , and has period .
Lemma 1.
For any ,
In the following theorem we use the Rademacher functions to prove an identity for trigonometric functions.11 1 Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, p. 4, §3.
Theorem 2.
For any nonzero real ,
Proof.
Let and let . The function
is constant on each of the intervals
(3) |
There is a bijection between and the collection of intervals (3). Without explicitly describing this bijection, we have
giving
(4) |
We now give an explicit formula for the measure of those for which exactly of are equal to .22 2 Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, pp. 8–9. We denote by Lebesgue measure on . We can interpret the following formula as stating the probability that out of tosses of a coin, exactly of the outcomes are heads.
Theorem 3.
For and ,
Proof.
We now prove that the expected value of a product of distinct Rademacher functions is equal to the product of their expected values.33 3 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 185, Solution 13.2.
Theorem 4.
If are positive integers and , then
Proof.
Write and define
which satisfies
Hence, as has period and has period ,
But, as has period ,
hence , proving the claim. ∎
For each , if is a function defined on the integers we define
Lemma 5.
For any ,
Our proof of the next identity follows Hata.44 4 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 188, Solution 13.6.
Lemma 6.
For any ,
Proof.
For and ,
and since (4) tells us that the left-hand side of the above is real, it follows that we can write (4) as
(7) |
Suppose that is a positive real number. Using and doing integration by parts,
It is thus apparent that for any real ,
For any , applying the above with we get
Applying (7) with for each , this is equal to
completing the proof. ∎
We use the above formula for to obtain an asymptotic formula for .55 5 Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, p. 12, Masayoshi Hata, Problems and Solutions in Real Analysis, p. 188, Solution 13.6.
Theorem 7.
Proof.
Let . Until the end of the proof, at which point we take , we shall keep fixed. For we have, using ,
hence
On the other hand,
so and for all , giving
and hence
Collecting what we have established so far, for we have
This shows that
and therefore
On the other hand,
so
Now summarizing what we have obtained, we have
(8) |
For , doing the change of variable ,
As , the right-hand side of this is asymptotic to
Dividing (8) by and taking the limsup then gives
or
indeed depends on , but , which does not depend on . Taking yields
On the other hand, taking the liminf of (8) divided by gives
or
Combining the limsup and the liminf inequalities proves the claim. ∎
Lemma 8.
For any and ,
We will use the following theorem to establish an estimate similar to but weaker than the law of the iterated logarithm.66 6 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 189, Solution 13.7.
Theorem 9.
For any , for almost all ,
Proof.
Define by
Applying Lemma 8 with ,
It is not obvious, but we take as given the asymptotic expansion
and using this,
Thus
Because each is nonnegative, using this with the monotone convergence theorem gives the claim. ∎
Theorem 10.
For almost all ,
Proof.
Let . By Theorem 9, for almost all there is some such that implies that , where we are talking about the functions defined in the proof of that theorem; certainly the terms of a convergent series are eventually less than . That is, for almost all there is some such that implies that (taking logarithms),
and rearranging,
For each , let be those such that
For each , taking we get that almost all do not belong to . That is, for each , the set has measure . Therefore
has measure . That is, for almost all , for all we have , i.e.
and this holding for all yields
completing the proof. ∎
3 Hypercubes
Let be Lebesgue measure on , and let .77 7 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 161, Solution 11.1.
Theorem 11.
If , then
Proof.
Define by
We have
and we define
Suppose that is a sequence of positive real numbers tending to , and define to be those such that
Then
so
Take , giving
Let . Because is continuous, there is some such that implies that ; furthermore, we take such that
Set . For and ,
and so
This gives us
which proves the claim. ∎