Rademacher functions

Jordan Bell
July 16, 2014

1 Binary expansions

Define S:{0,1}ℕ→[0,1] by

S⁢(σ)=∑k=1∞σk2k,σ∈{0,1}ℕ.

For example, for σ1=0 and σ2=1,σ3=1,…,

S⁢(σ)=02+14+18+⋯=12;

for σ1=1 and σ2=0, σ3=0,…,

S⁢(σ)=12+04+08+⋯=12.

Let σ∈{0,1}ℕ. If there is some n∈ℕ such that σn=0 and σk=1 for all k≥n+1, then defining

τk={σkk≤n-11k=n0k≥n,

we have

S⁢(σ)=∑k=1n-1σk2k+∑k=n+1∞12k=∑k=1n-1σk2k+12n=S⁢(τ).

One proves that if either (i) there is some n∈ℕ such that σn=0 and σk=1 for all k≥n+1 or (ii) there is some n∈ℕ such that σn=1 and σk=0 for all k≥n+1, then S-1⁢(S⁢(σ)) contains exactly two elements, and that otherwise S-1⁢(S⁢(σ)) contains exactly one element.

In words, except for the sequence whose terms are only 0 or the sequence whose terms are only 1, S-1⁢(S⁢(σ)) contains exactly two elements when σ is eventually 0 or eventually 1, and S-1⁢(S⁢(σ)) contains exactly one element otherwise.

We define ϵ:[0,1]→{0,1}ℕ by taking ϵ⁢(t) to be the unique element of S-1⁢(t) if S-1⁢(t) contains exactly one element, and to be the element of S-1⁢(t) that is eventually 0 if S-1⁢(t) contains exactly two elements. For k∈ℕ we define ϵk:[0,1]→{0,1} by

ϵk⁢(t)=ϵ⁢(t)k,t∈[0,1].

Then, for all t∈[0,1],

t=S⁢(ϵ⁢(t))=∑k=1∞ϵk⁢(t)2k, (1)

which we call the binary expansion of t.

2 Rademacher functions

For k∈ℕ, the kth Rademacher function rk:[0,1]→{-1,+1} is defined by

rk⁢(t)=1-2⁢ϵk⁢(t),t∈[0,1].

We can rewrite the binary expansion of t∈[0,1] in (1) as

∑k=1∞rk⁢(t)2k=∑k=1∞(12k-2⋅ϵk⁢(t)2k)=1-2⁢∑k=1∞ϵk⁢(t)2k=1-2⁢t. (2)

Define r:ℝ→{-1,+1} by

r⁢(x)=(-1)[x],

where [x] denotes the greatest integer ≤x. Thus, for 0≤x<1 we have r⁢(x)=1, for 1≤x<2 we have r⁢(x)=-1, and r has period 2.

Lemma 1.

For any n∈N,

rn⁢(t)=(-1)[2n⁢t]=r⁢(2n⁢t),t∈[0,1]

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

∏k=1∞cos⁡x2k=sin⁡xx.
Proof.

Let n∈ℕ and let c1,…,cn∈ℝ. The function

∑k=1nck⁢rk

is constant on each of the intervals

[s2n,s+12n),0≤s≤2n-1. (3)

There is a bijection between Δn={-1,+1}n and the collection of intervals (3). Without explicitly describing this bijection, we have

∫01exp⁡(i⁢∑k=1nck⁢rk⁢(t))⁢𝑑t = ∑s=02n-1∫s⋅2-n(s+1)⋅2-nexp⁡(i⁢∑k=1nck⁢rk⁢(t))⁢𝑑t
= ∑δ∈Δn12n⁢exp⁡(i⁢∑k=1nδk⁢ck)
= ∑δ∈Δn∏k=1nei⁢δk⁢ck2
= ∏k=1nei⁢ck+e-i⁢ck2,

giving

∫01exp⁡(i⁢∑k=1nck⁢rk⁢(t))⁢𝑑t=∏k=1ncos⁡ck. (4)

We have

∫01ei⁢x⁢(1-2⁢t)⁢𝑑t=ei⁢x⁢e-2⁢i⁢x⁢t-2⁢i⁢x|01=ei⁢x⁢(e-2⁢i⁢x-2⁢i⁢x+12⁢i⁢x)=sin⁡xx. (5)

Using (2) we check that the sequence of functions ∑k=1nrk⁢(t)2k converges uniformly on [0,1] to 1-2⁢t, and hence using (5) we get

∫01exp(ix∑k=1nrk⁢(t)2k)dt→∫01eix(1-2t)dt=sin⁡xx

as n→∞. Combining this with (4), which we apply with ck=x2k, we get

∏k=1ncos⁡x2k→sin⁡xx

as n→∞, proving the claim. ∎

We now give an explicit formula for the measure of those t for which exactly l of r1⁢(t),…,rn⁢(t) are equal to 1.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 n tosses of a coin, exactly l of the outcomes are heads.

Theorem 3.

For n∈N and 0≤l≤n,

μ⁢{t∈[0,1]:r1⁢(t)+⋯+rn⁢(t)=2⁢l-n}=12n⁢(nl).
Proof.

Define ϕ:[0,1]→ℝ by

ϕ⁢(t)=12⁢π⁢∫02⁢πei⁢x⁢(-(2⁢l-n)+∑k=1nrk⁢(t))⁢𝑑x

But for m∈ℤ,

12⁢π⁢∫02⁢πei⁢m⁢x⁢𝑑x=δm,0={1m=00m≠0, (6)

hence

ϕ⁢(t)={1∑k=1nrk⁢(t)=2⁢l-n0∑k=1nrk⁢(t)≠2⁢l-n.

Therefore

μ⁢{t∈[0,1]:∑k=1nrk⁢(t)=2⁢l-n} = ∫01ϕ⁢(t)⁢𝑑t
= ∫0112⁢π⁢∫02⁢πei⁢x⁢(-(2⁢l-n)+∑k=1nrk⁢(t))⁢𝑑x⁢𝑑t
= 12⁢π⁢∫02⁢πe-i⁢x⁢(2⁢l-n)⁢∫01ei⁢x⁢∑k=1nrk⁢(t)⁢𝑑t⁢𝑑x
= 12⁢π⁢∫02⁢πe-i⁢x⁢(2⁢l-n)⁢cosn⁡x⁢d⁢x;

the last equality uses (4) with c1=x,…,cn=x. Furthermore, writing

cosn⁡x=2-n⁢(ei⁢x+e-i⁢x)=2-n⁢∑k=0n(nk)⁢ei⁢x⁢(2⁢k-n),

we calculate using (6) that

12⁢π⁢∫02⁢πe-i⁢x⁢(2⁢l-n)⁢cosn⁡x⁢d⁢x = 2-n⁢∑k=0n(nk)⁢12⁢π⁢∫01e-i⁢x⁢(2⁢l-n)⁢ei⁢x⁢(2⁢k-n)⁢𝑑x
= 2-n⁢∑k=0n(nk)⁢12⁢π⁢∫01ei⁢x⁢(2⁢k-2⁢l)⁢𝑑x
= 2-n⁢∑k=0n(nk)⁢δ2⁢k-2⁢l,0
= 2-n⁢∑k=0n(nk)⁢δk,l
= 2-n⁢(nl),

proving the claim. ∎

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 k1,…,kn are positive integers and k1<⋯<kn, then

∫01rk1⁢(t)⁢⋯⁢rkn⁢(t)⁢𝑑t=0.
Proof.

Write J=∫01rk1⁢(t)⁢⋯⁢rkn⁢(t)⁢𝑑t and define

ϕ⁢(x)=∏s=2nr⁢(2ks-k1⁢x),x∈ℝ,

which satisfies

ϕ⁢(x+1)=∏s=2nr⁢(2ks-k1⁢x+2ks-k1)=∏s=2nr⁢(2ks-k1⁢x)=ϕ⁢(x).

Hence, as ϕ has period 1 and r has period 2,

J = ∫01rk1⁢(t)⁢ϕ⁢(2k1⁢t)⁢𝑑t
= ∫01r⁢(2k1⁢t)⁢ϕ⁢(2k1⁢t)⁢𝑑t
= 12k1⁢∫02k1r⁢(x)⁢ϕ⁢(x)⁢𝑑x
= 12k1⁢∑j=02k1-1-1∫2⁢j2⁢j+2r⁢(x)⁢ϕ⁢(x)⁢𝑑x
= 12k1⁢∑j=02k1-1-1∫02r⁢(x)⁢ϕ⁢(x)⁢𝑑x
= 12⁢∫02r⁢(x)⁢ϕ⁢(x)⁢𝑑x.

But, as ϕ has period 1,

∫02r⁢(x)⁢ϕ⁢(x)⁢𝑑x=∫01ϕ⁢(x)⁢𝑑x-∫12ϕ⁢(x)⁢𝑑x=∫01ϕ⁢(x)⁢𝑑x-∫01ϕ⁢(x)⁢𝑑x=0,

hence J=0, proving the claim. ∎

For each n∈ℕ, if f is a function defined on the integers we define

In⁢(f)=∫01f⁢(∑k=1nrk⁢(t))⁢𝑑t.
Lemma 5.

For any n∈N,

In⁢(x2)=n,In⁢(x4)=3⁢n2-2⁢n.
Proof.

Using Theorem 4 we get

In⁢(x2) = ∫01(∑k=1nrk⁢(t))2⁢𝑑t
= ∫01∑k=1nrk⁢(t)2+∑j≠krj⁢(t)⁢rk⁢(t)⁢d⁢t
= ∫01∑k=1nrk⁢(t)2⁢d⁢t
= n.

Using Theorem 4 we get, since rj⁢(t)4=rj⁢(t)2=1 and rj⁢(t)3=rj⁢(t),

In⁢(x4) = ∫01(∑k=1nrk⁢(t))4⁢𝑑t
= ∫01∑k=1nrk⁢(t)4+(43)⁢∑j=1n∑k≠jrj⁢(t)3⁢rk⁢(t)+(42)⁢∑j=1n∑k≠jrj⁢(t)2⁢rk⁢(t)2
+(42)⁢∑j=1n∑j,k,l all distinctrj⁢(t)2⁢rk⁢(t)⁢rl⁢(t)
+∑j,k,l,m all distinctrj⁢(t)⁢rk⁢(t)⁢rl⁢(t)⁢rm⁢(t)⁢d⁢t
= n+(42)⁢n⁢(n-1).

∎

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 n∈N,

In⁢(|x|)=2π⁢∫0∞1-cosn⁡xx2⁢𝑑x.
Proof.

For n∈ℕ and c1,…,cn∈ℝ,

∫01exp⁡(i⁢∑k=1nck⁢rk⁢(t))⁢𝑑t=∫01cos⁡(∑k=1nck⁢rk⁢(t))⁢𝑑t+i⁢∫01sin⁡(∑k=1nck⁢rk⁢(t))⁢𝑑t,

and since (4) tells us that the left-hand side of the above is real, it follows that we can write (4) as

∫01cos⁡(∑k=1nck⁢rk⁢(t))⁢𝑑t=∏k=1ncos⁡ck. (7)

Suppose that ξ is a positive real number. Using t=x⁢ξ and doing integration by parts,

∫0∞1-cos⁡x⁢ξx2⁢𝑑x = ξ⁢∫0∞1-cos⁡tt2⁢𝑑t
= ξ⁢1-cos⁡t-t|0∞+ξ⁢∫0∞sin⁡tt⁢𝑑t
= ξ⁢∫0∞sin⁡tt⁢𝑑t
= ξ⁢π2.

It is thus apparent that for any real ξ,

∫0∞1-cos⁡x⁢ξx2⁢𝑑x=|ξ|⁢π2.

For any n∈ℕ, applying the above with ξ=∑k=1nrk⁢(t) we get

In⁢(|x|) = 2π⁢∫01|∑k=1nrk⁢(t)|⁢π2⁢𝑑t
= 2π⁢∫01∫0∞1-cos⁡(x⁢∑k=1nrk⁢(t))x2⁢𝑑x⁢𝑑t
= 2π⁢∫0∞1x2⁢∫011-cos⁡(x⁢∑k=1nrk⁢(t))⁢d⁢t⁢d⁢x
= 2π∫0∞1x2(1-In(cosx⋅))dx.

Applying (7) with ck=x for each k, this is equal to

2π⁢∫0∞1x2⁢(1-∏k=1ncos⁡x)⁢𝑑x=2π⁢∫0∞1-cosn⁡xx2⁢𝑑x,

completing the proof. ∎

We use the above formula for In⁢(|x|) to obtain an asymptotic formula for In⁢(|x|).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.
In⁢(|x|)∼2π⁢n.
Proof.

By Lemma 6,

In⁢(|x|)=2π⁢∫0∞1-cosn⁡xx2⁢𝑑x.

For 0≤ϵ<1, define ϕϵ:[0,π2)→ℝ by

ϕϵ⁢(x)=x22⁢(1-ϵ)+log⁡cos⁡x.

We also define

αϵ=arccos⁡1-ϵ,βϵ=∫αϵ∞1-cosn⁡xx2⁢𝑑x,

and for σ>0,

Kϵ,σ=∫0αϵ1-exp⁡(-n⁢x2σ)x2⁢𝑑x.

Let 0<ϵ<1. Until the end of the proof, at which point we take ϵ→0, we shall keep ϵ fixed. For 0<x<αϵ we have, using arccos⁡1-ϵ≤ϵ,

ϕ0⁢(x)=x22+log⁡cos⁡x<ϵ2+log⁡1-ϵ=ϵ2+12⁢log⁡(1-ϵ)<0,

hence

cos⁡x<exp⁡(-x22).

On the other hand,

ϕϵ′⁢(x)=x1-ϵ-tan⁡x,ϕϵ′′⁢(x)=11-ϵ-sec2⁡x,

so ϕϵ⁢(0)=ϕϵ′⁢(0)=0 and ϕϵ′′⁢(t)>0 for all 0≤t<αϵ, giving

ϕϵ⁢(x)>0,

and hence

exp⁡(-x22⁢(1-ϵ))<cos⁡x.

Collecting what we have established so far, for 0<x<αϵ we have

exp⁡(-x22⁢(1-ϵ))<cos⁡x<exp⁡(-x22).

This shows that

Kϵ,2⁢(1-ϵ)=∫0αϵ1-exp⁡(-n⁢x22⁢(1-ϵ))x2⁢𝑑x≥∫0αϵ1-cosn⁡xx2⁢𝑑x,

and therefore

Kϵ,2⁢(1-ϵ)+βϵ≥π2⁢In⁢(|x|).

On the other hand,

Kϵ,2=∫0αϵ1-exp⁡(-n⁢x22)x2⁢𝑑x≤∫0αϵ1-cosn⁡xx2⁢𝑑x,

so

Kϵ,2+βϵ≤π2⁢In⁢(|x|).

Now summarizing what we have obtained, we have

Kϵ,2+βϵ≤π2⁢In⁢(|x|)≤Kϵ,2⁢(1-ϵ)+βϵ. (8)

For σ>0, doing the change of variable t=nσ⁢x,

Kϵ,σ=∫0αϵ1-exp⁡(-n⁢x2σ)x2⁢𝑑x=nσ⁢∫0nσ⁢αϵ1-e-t2t2⁢𝑑t.

As n→∞, the right-hand side of this is asymptotic to

nσ⁢∫0∞1-e-t2t2⁢𝑑t=nσ⁢π.

Dividing (8) by n and taking the limsup then gives

lim supn→∞⁡π2⁢In⁢(|x|)n≤π2⁢(1-ϵ),

or

lim supn→∞⁡In⁢(|x|)n≤2π⁢(1-ϵ);

indeed βϵ depends on n, but βϵ<2αϵ, which does not depend on n. Taking ϵ→0 yields

lim supn→∞⁡In⁢(|x|)n≤2π.

On the other hand, taking the liminf of (8) divided by n gives

lim infn→∞⁡π2⁢In⁢(|x|)n≥π2,

or

lim infn→∞⁡In⁢(|x|)n≥2π.

Combining the limsup and the liminf inequalities proves the claim. ∎

Lemma 8.

For any ξ∈R and n∈N,

In⁢(eξ⁢|x|)<In⁢(eξ⁢x)+In⁢(e-ξ⁢x)=2⁢(cosh⁡ξ)n.

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 ϵ>0, for almost all t∈[0,1],

∑n=1∞1n2+ϵ⁢exp⁡(2⁢log⁡nn⁢|∑k=1nrk⁢(t)|)⁢d⁢t<∞.
Proof.

Define fn:[0,1]→(0,∞) by

fn⁢(t)=1n2+ϵ⁢exp⁡(2⁢log⁡nn⁢|∑k=1nrk⁢(t)|).

Applying Lemma 8 with ξ=2⁢log⁡nn,

∫01fn⁢(t)⁢𝑑t≤1n2+ϵ⋅2⋅(cosh⁡2⁢log⁡nn)n.

It is not obvious, but we take as given the asymptotic expansion

(cosh⁡2⁢log⁡nn)n=n-13⁢(log⁡n)2+845⁢(log⁡n)3+118⁢(log⁡n)4n+O⁢(n-3/2),

and using this,

1n2+ϵ⋅2⋅(cosh⁡2⁢log⁡nn)n=2n1+ϵ+O⁢((log⁡n)2n2+ϵ)=2n1+ϵ+O⁢(n-2).

Thus

∑n=1∞∫01fn⁢(t)⁢𝑑t=∑n=1∞(2n1+ϵ+O⁢(n-2))<∞.

Because each fn is nonnegative, using this with the monotone convergence theorem gives the claim. ∎

Theorem 10.

For almost all t∈[0,1],

lim supn→∞⁡|∑k=1nrk⁢(t)|n⁢log⁡n≤2.
Proof.

Let ϵ>0. By Theorem 9, for almost all t∈[0,1] there is some nt such that n≥nt implies that fn⁢(t)<1, where we are talking about the functions fn defined in the proof of that theorem; certainly the terms of a convergent series are eventually less than 1. That is, for almost all t∈[0,1] there is some nt such that n≥nt implies that (taking logarithms),

(-2-ϵ)⁢log⁡n+2⁢log⁡nn⁢|∑k=1nrk⁢(t)|<0,

and rearranging,

|∑k=1nrk⁢(t)|n⁢log⁡n<2+ϵ2=2+ϵ′.

For each s∈ℕ, let Es be those t∈[0,1] such that

lim supn→∞⁡|∑k=1nrk⁢(t)|n⁢log⁡n>2+1s.

For each s, taking 0<ϵ′<1s we get that almost all t∈[0,1] do not belong to Es. That is, for each s, the set Es has measure 0. Therefore

E=⋃s=1∞Es

has measure 0. That is, for almost all t∈[0,1], for all s∈ℕ we have t∉Es, i.e.

lim supn→∞⁡|∑k=1nrk⁢(t)|n⁢log⁡n≤2+1s,

and this holding for all s∈ℕ yields

lim supn→∞⁡|∑k=1nrk⁢(t)|n⁢log⁡n≤2,

completing the proof. ∎

3 Hypercubes

Let mn be Lebesgue measure on ℝn, and let Qn=[0,1]n.77 7 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 161, Solution 11.1.

Theorem 11.

If f∈C⁢([0,1]), then

limn→∞⁡∫Qnf⁢(x1+⋯+xnn)⁢𝑑mn⁢(x)=f⁢(12).
Proof.

Define Xn:Qn→ℝ by

Xn=x1+⋯+xnn,x∈Qn.

We have

∫QnXn⁢𝑑mn⁢(x)=1n⁢∑k=1n∫01xk⋅1⁢𝑑xk=1n⁢∑k=1n12=12,

and we define

Vn = ∫Qn(Xn-12)2⁢𝑑mn⁢(x)
= ∫Qn∑k=1nxk2n2+∑j≠kxj⁢xkn2-Xn+14⁢d⁢mn⁢(x)
= 1n2⁢∑k=1n∫01xk2⁢𝑑xk+1n2⁢∑j=1n∑k≠j∫01xj⁢𝑑xj⁢∫01xk⁢𝑑xk-12+14
= 1n2⁢∑k=1n13+1n2⁢∑j=1n∑k≠j14-14
= 13⁢n+n-14⁢n-14
= n-112.

Suppose that cn is a sequence of positive real numbers tending to 0, and define Jn=Jn⁢(c) to be those x∈Qn such that

|Xn⁢(x)-12|≥cn.

Then

Vn = ∫Qn(Xn-12)2⁢𝑑mn⁢(x)
≥ ∫Jn(Xn-12)2⁢𝑑mn⁢(x)
≥ ∫Jncn2⁢𝑑mn⁢(x)
= cn2⁢mn⁢(Jn),

so

mn⁢(Jn)≤Vncn2=n-112⁢cn2.

Take cn=n-1/3, giving

mn⁢(Jn)≤n-1/312.

Let ϵ>0. Because f is continuous, there is some δ>0 such that |t-12|<δ implies that |f⁢(t)-f⁢(12)|<ϵ; furthermore, we take δ such that

∥f∥∞⁢δ6<ϵ.

Set N>δ-3. For n≥N and x∈Qn∖Jn,

|Xn⁢(x)-12|<cn=n-1/3≤N-1/3<δ,

and so

|(f(Xn(x))-f(12)|<ϵ.

This gives us

|∫Qnf⁢(Xn⁢(x))⁢𝑑mn⁢(x)-f⁢(12)| = |∫Qnf⁢(Xn⁢(x))-f⁢(12)⁢d⁢mn⁢(x)|
≤ ∫Jn|f⁢(Xn⁢(x))-f⁢(12)|⁢𝑑mn⁢(x)
+∫Qn∖Jn|f⁢(Xn⁢(x))-f⁢(12)|⁢𝑑mn⁢(x)
≤ ∫Jn2⁢∥f∥∞⁢𝑑mn⁢(x)+∫Qn∖Jnϵ⁢𝑑mn⁢(x)
≤ 2⁢∥f∥∞⁢mn⁢(Jn)+ϵ
≤ 2⁢∥f∥∞⁢n-1/312+ϵ
< ∥f∥∞⁢δ6+ϵ
< 2⁢ϵ,

which proves the claim. ∎