Haar wavelets and multiresolution analysis

Jordan Bell
April 3, 2014

1 Introduction

Let

ψ⁢(x)={0x<0,10≤x<12,-112≤x<1,0x≥1.

For n,k∈ℤ, we define

ψn,k⁢(x)=2n/2⁢ψ⁢(2n⁢x-k),x∈ℝ.

L2⁢(ℝ) is a complex Hilbert space with the inner product

⟨f,g⟩=∫ℝf⁢(x)⁢g⁢(x)¯⁢𝑑x.

We will prove that ψ satisfies the following definition of an orthonormal wavelet.11 1 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 303, Definition 6.4.1.

Definition 1 (Orthonormal wavelet).

If Ψ∈L2⁢(ℝ), Ψn,k⁢(x)=2n/2⁢Ψ⁢(2n⁢x-k), and the set {Ψn,k:n,k∈ℤ} is an orthonormal basis for L2⁢(ℝ), then Ψ is called an orthonormal wavelet.

Lemma 2.

{ψn,k:n,k∈ℤ} is an orthonormal set in L2⁢(ℝ).

Proof.

If n,n′,k,k′∈ℤ, then

∫ℝψn,k⁢(x)⁢ψn′,k′⁢(x)¯⁢𝑑x = ∫ℝ2n/2⁢ψ⁢(2n⁢x-k)⁢2n′/2⁢ψ⁢(2n′⁢x-k′)⁢𝑑x
= ∫ℝ2(n′-n)/2⁢ψ⁢(x-k)⁢ψ⁢(2n′-n⁢x-k′)⁢𝑑x
= 2(n′-n)/2⁢δk,k′⁢∫01ψ⁢(x)⁢ψ⁢(2(n′-n)/2⁢x)⁢𝑑x
= δk,k′⋅δn,n′,

hence {ψn,k:n,k∈ℤ} is an orthonormal set. ∎

Bessel’s inequality states that if ℰ is an orthonormal set in a Hilbert space H, then for any f∈H we have ∑e∈ℰ|⟨f,e⟩|2≤∥f∥22, from which it follows that ∑e∈ℰ⟨f,e⟩⁢e∈H. To say that a subset ℰ of a Hilbert space H is an orthonormal basis is equivalent to saying that ℰ is an orthonormal set and that

idH=∑e∈ℰe⊗e

in the strong operator topology. In other words, for ℰ to be an orthonormal basis of H means that ℰ is an orthonormal set and that for every f∈H we have

f=∑e∈ℰ⟨f,e⟩⁢e.

From Lemma 2 and Bessel’s inequality, we know that for each f∈L2⁢(ℝ),

∑n,k∈ℤ|⟨f,ψn,k⟩|2≤∥f∥22,∑n,k∈ℤ⟨f,ψn,k⟩⁢ψn,k∈L2⁢(ℝ).

We have not yet proved that f is equal to the series ∑n,k∈ℤ⟨f,ψn,k⟩⁢ψn,k, and this will not be accomplished until later in this note.

2 Coarser sigma-algebras

For n,k∈ℤ, let

In,k=[k2n,k+12n),

and let ℱn be the σ-algebra generated by {Ik,n:k∈ℤ}. ℝ=⋃k∈ℤIn,k, and if k≠k′ then In,k∩In,k′=∅. If n<n′ then

ℱn⊂ℱn′⊂ℱ,

where ℱ is the σ-algebra of Lebesgue measurable subsets of ℝ. An element of L2⁢(ℝ,ℱn) is an element of L2⁢(ℝ,ℱ) that is constant on each set In,k, k∈ℤ. In other words, an element of L2⁢(ℝ,ℱn) is a function f:ℝ→ℂ such that if k∈ℤ then the image f⁢(In,k) is a single element of ℝ and such that

∥f∥22=∫ℝ|f⁢(x)|2⁢𝑑x=∑k∈ℤ∫In,k|f⁢(x)|2⁢𝑑x=∑k∈ℤ12n⋅|f⁢(In,k)|2<∞.

If n<n′, then

L2⁢(ℝ,ℱn)⊂L2⁢(ℝ,ℱn′)⊂L2⁢(ℝ,ℱ).

3 Integral kernels

We define

ϕ⁢(x)={0x<0,10≤x<1,0x≥1.

For n∈ℤ we define

Kn⁢(x,y)=2n⁢∑k∈ℤϕ⁢(2n⁢x-k)⁢ϕ⁢(2n⁢y-k),x,y∈ℝ.

We have

Kn⁢(x,y)∈{0,2n}.

Kn⁢(x,y)=2n if and only if there is some k∈ℤ such that 2n⁢x-k,2n⁢y-k∈[0,1), equivalently there is some k∈ℤ with 2n⁢x,2n⁢y∈[k,k+1), which is equivalent to there being some k∈ℤ such that

x,y∈[k2n,k+12n)=In,k.

We define

Pn⁢f⁢(x)=∫ℝKn⁢(x,y)⁢f⁢(y)⁢𝑑y.

If x∈ℝ then there is a unique kx∈ℤ with x∈In,kx, and

Pn⁢f⁢(x)=2n⁢∫In,kxf⁢(y)⁢𝑑y. (1)

It is straightforward to check that L2⁢(ℝ,ℱn) is a closed subspace of L2⁢(ℝ,ℱ), and in the following theorem we prove that Pn is the orthogonal projection onto L2⁢(ℝ,ℱn).

Lemma 3.

If n∈ℤ, then Pn is the orthogonal projection of L2⁢(ℝ,ℱ) onto L2⁢(ℝ,ℱn).

Proof.

For each k∈ℤ, the function Pn⁢f is constant on the interval In,k, and using (1) and the Cauchy-Schwarz inequality,

∥Pn⁢f∥22 =∑k∈ℤ∫In,k|Pn⁢f⁢(x)|2⁢𝑑x
=∑k∈ℤ∫In,k|2n⁢∫In,kf⁢(y)⁢𝑑y|2⁢𝑑x
=2n⁢∑k∈ℤ|∫In,kf⁢(y)⁢𝑑y|2
≤2n⁢∑k∈ℤ(∫In,k|f⁢(y)|2⁢𝑑y)⁢(∫In,k𝑑y)
=∑k∈ℤ∫In,k|f⁢(y)|2⁢𝑑y
=∫ℝ|f⁢(y)|2⁢𝑑y.

Therefore, Pn:L2⁢(ℝ,ℱ)→L2⁢(ℝ,ℱn). Moreover, the left-hand side of the above inequality is equal to ∥Pn⁢f∥22 and the right-hand side is equal to ∥f∥22, hence we have ∥Pn⁢f∥2≤∥f∥2, giving ∥Pn∥≤1.

If f∈L2⁢(ℝ,ℱn), then

Pn⁢f⁢(x) =∫ℝKn⁢(x,y)⁢f⁢(y)⁢𝑑y
=2n⁢∫In,kxf⁢(y)⁢𝑑y
=f⁢(In,kx)
=f⁢(x),

hence if f∈L2⁢(ℝ,ℱn) then Pn⁢f=f. ∎

For n∈ℤ, we define

Ln=Kn+1-Kn,

and the following lemma gives a different expression for Ln.22 2 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 293, §6.3.2.

Lemma 4.

If n∈ℤ, then

Ln⁢(x,y)=∑k∈ℤψn,k⁢(x)⁢ψn,k⁢(y),x,y∈ℝ.
Proof.

ψ⁢(2n⁢x-k)=1 means that 0≤2n⁢x-k<12, which is equivalent to k2n≤x<k+122n, which is equivalent to 2⁢k2n+1≤x<2⁢k+12n+1, which is equivalent to x∈In+1,2⁢k. ψ⁢(2n⁢x-k)=-1 means that 12≤2n⁢x-k<1, which is equivalent to k+122n≤x<k+12n, and this is equivalent to x∈In+1,2⁢k+1. ψ⁢(2n⁢x-k)=0 if and only if x∉In+1,2⁢k∪In+1,2⁢k+1. Therefore,

ψn,k⁢(x)⁢ψn,k⁢(y)={2n(x,y)∈In+1,2⁢k×In+1,2⁢k∪In+1,2⁢k+1×In+1,2⁢k+1,-2n(x,y)∈In+1,2⁢k×In+1,2⁢k+1∪In+1,2⁢k+1×In+1,2⁢k,0otherwise.

If there is no k∈ℤ such that (x,y)∈In,k×In,k, then Ln⁢(x,y)=0. Otherwise, suppose that k∈ℤ and that (x,y)∈In,k×In,k. We have

In,k=In+1,2⁢k∪In+1,2⁢k+1.

If (x,y)∈In+1,2⁢k×In+1,2⁢k, then

Ln⁢(x,y)=Kn+1⁢(x,y)-Kn⁢(x,y)=2n+1-2n=2n;

if (x,y)∈In+1,2⁢k+1×In+1,2⁢k+1, then

Ln⁢(x,y)=Kn+1⁢(x,y)-Kn⁢(x,y)=2n+1-2n=2n;

if (x,y)∈In+1,2⁢k×In+1,2⁢k+1, then

Ln⁢(x,y)=Kn+1⁢(x,y)-Kn⁢(x,y)=0-2n=-2n;

and if (x,y)∈In+1,2⁢k+1×In+1,2⁢k, then

Ln⁢(x,y)=Kn+1⁢(x,y)-Kn⁢(x,y)=0-2n=-2n.

It follows that

Ln⁢(x,y)=∑k∈ℤψn,k⁢(x)⁢ψn,k⁢(y).

∎

4 Continuous functions

Let C0⁢(ℝ) denote those continuous functions f:ℝ→ℂ such that if ϵ>0 then there is some compact subset K of ℝ such that x∉K implies that |f⁢(x)|<ϵ. We say that an element of C0⁢(ℝ) is a continuous function that vanishes at infinity. Let Cc⁢(ℝ) denote the set of continuous functions f:ℝ→ℂ such that

supp⁢(f)={x∈ℝ:f⁢(x)≠0}¯

is a compact set.

In the following lemma, we prove that the larger the intervals over which we average a continuous function vanishing at infinity, the smaller the supremum of the averaged function.33 3 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 295, Lemma 6.3.2.

Lemma 5.

If f∈C0⁢(ℝ), then ∥Pn⁢f∥∞→0 as n→-∞.

Proof.

If g∈Cc⁢(ℝ) and x∈ℝ, then

|Pn⁢g⁢(x)| =|∫ℝKn⁢(x,y)⁢g⁢(y)⁢𝑑y|
=|∫supp⁢(g)Kn⁢(x,y)⁢g⁢(y)⁢𝑑y|
≤∫supp⁢(g)Kn⁢(x,y)⁢|g⁢(y)|⁢𝑑y
≤∫supp⁢(g)2n⁢|g⁢(y)|⁢𝑑y
≤2n⋅μ⁢(supp⁢(g))⋅∥g∥∞,

hence

∥Pn⁢g∥∞≤2n⋅μ⁢(supp⁢(g))⋅∥g∥∞. (2)

If f∈C0⁢(ℝ) and ϵ>0 then there is some g∈Cc⁢(ℝ) with ∥f-g∥∞<ϵ. Hence,

∥Pn⁢f∥∞≤∥Pn⁢(f-g)∥∞+∥Pn⁢g∥∞.

If x∈ℝ, then

|Pn⁢(f-g)⁢(x)|=2n⁢|∫In,kx(f-g)⁢(y)⁢𝑑y|≤2n⁢∫In,kx|(f-g)⁢(y)|⁢𝑑y≤∥f-g∥∞,

hence ∥Pn⁢(f-g)∥∞≤∥f-g∥∞. Using this and (2) we obtain

∥Pn⁢f∥∞≤∥f-g∥∞+2n⋅μ⁢(supp⁢(g))⋅∥g∥∞<ϵ+2n⋅μ⁢(supp⁢(g))⋅∥g∥∞.

Hence,

lim supn→-∞⁡∥Pn⁢f∥∞≤lim supn→-∞⁡(ϵ+2n⋅μ⁢(supp⁢(g))⋅∥g∥∞)=ϵ.

This is true for every ϵ>0, so

limn→-∞⁡∥Pn⁢f∥∞=0.

∎

Lemma 6.

If f∈L2⁢(ℝ), then ∥Pn⁢f∥2→0 as n→-∞.

Proof.

If ϵ>0 then there is some g∈Cc⁢(ℝ) such that ∥f-g∥2<ϵ. Say supp⁢(g)⊆[-K,K]. If 2m>K, then we have by (1) and because supp⁢(g)⊆I-m,-1∪I-m,0,

∥P-m⁢g∥22 =∫ℝ|2-m⁢∫I-m,kxg⁢(y)⁢𝑑y|2⁢𝑑x
=2m⁢|2-m⁢∫I-m,-1g⁢(y)⁢𝑑y|2+2m⁢|2-m⁢∫I-m,0g⁢(y)⁢𝑑y|2
=2-m⁢|∫-K0g⁢(y)⁢𝑑y|2+2-m⁢|∫0Kg⁢(y)⁢𝑑y|2
≤2-m⁢μ⁢([-K,0])⁢∥g∥22+2-m⁢μ⁢([0,K])⁢∥g∥22
=2⁢K⋅2-m⁢∥g∥22.

Therefore, when 2m>K we have ∥P-m⁢g∥2≤2-m2⁢2⁢K⁢∥g∥2, and so, as the operator norm of P-m on L2⁢(ℝ) is 1,

∥P-m⁢f∥2 ≤∥P-m⁢(f-g)∥2+∥P-m⁢g∥2
≤∥f-g∥2+∥P-m⁢g∥2
<ϵ+2-m2⁢2⁢K∥⁢g∥2.

Thus, if ϵ>0 then

lim supm→∞⁡∥P-m⁢f∥2≤ϵ.

This is true for all ϵ>0, so we obtain

limm→∞⁡∥P-m⁢f∥2=0.

∎

The following lemma shows that if f∈Cc⁢(ℝ), then Pn⁢f converges to f in the L2 norm and in the L∞ norm as n→∞.44 4 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 296, Lemma 6.3.3.

Lemma 7.

If f∈Cc⁢(ℝ), then Pn⁢f→f in the L2 norm and in the L∞ norm as n→∞.

Proof.

Suppose that supp⁢(f)⊆[-2M,2M] for M≥0. f is uniformly continuous on the compact set [-2M,2M], thus, if ϵ>0 then there is some δ>0 such that x,y∈[-2M,2M] and |x-y|<δ imply that |f⁢(x)-f⁢(y)|<ϵ2M. Let 2-n≤δ. For each x∈ℝ, there is some kx∈ℤ such that x∈In,kx and we have

|Pn⁢f⁢(x)-f⁢(x)| =|2n⁢∫In,kxf⁢(y)⁢𝑑y-f⁢(x)|
=2n⁢|∫In,kxf⁢(y)-f⁢(x)⁢d⁢y|
≤2n⁢∫In,kx|f⁢(y)-f⁢(x)|⁢𝑑y
<2n⁢∫In,kxϵ2M⁢𝑑y
=ϵ2M.

This tells us that if 2-n≤δ then ∥Pn⁢f-f∥∞≤ϵ2M. Therefore, if ϵ>0 then for sufficiently large n we have ∥Pn⁢f-f∥∞≤ϵ2M, showing that

limn→∞⁡∥Pn⁢f-f∥∞=0.

Furthermore, if n≥0 then

∥Pn⁢f-f∥22=∫ℝ|Pn⁢f⁢(x)-f⁢(x)|2⁢𝑑x=∫-2M2M|Pn⁢f⁢(x)-f⁢(x)|2⁢𝑑x≤2⋅2M⋅∥Pn⁢f-f∥∞2,

and because ∥Pn⁢f-f∥∞→0 as n→∞ we get ∥Pn⁢f-f∥2→0 as n→∞. ∎

From Lemma 4, we get

(Pn+1-Pn)⁢f⁢(x) =∫ℝKn+1⁢(x,y)⁢f⁢(y)⁢𝑑y-∫ℝKn⁢(x,y)⁢f⁢(y)⁢𝑑y
=∫ℝLn⁢(x,y)⁢f⁢(y)⁢𝑑y
=∫ℝ∑k∈ℤψn,k⁢(x)⁢ψn,k⁢(y)⁢f⁢(y)⁢d⁢y
=∑k∈ℤ⟨f,ψn,k⟩⁢ψn,k⁢(x),

thus

Pn+1-Pn=∑k∈ℤψn,k⊗ψn,k (3)

in the strong operator topology. Using (3), we obtain for n≥0 that

Pn+1 =P0+∑j=0nPj+1-Pj
=P0+∑j=0n∑k∈ℤψj,k⊗ψj,k

in the strong operator topology. For n<0,

Pn =P0-∑j=-n-1Pj+1-Pj
=P0-∑j=-n-1∑k∈ℤψj,k⊗ψj,k

in the strong operator topology.

We have already shown in Lemma 2 that {ψn,k:n,k∈ℤ} is an orthonormal set in L2⁢(ℝ), and we now prove that it is an orthonormal basis for L2⁢(ℝ).

Theorem 8.

In the strong operator topology,

idL2⁢(ℝ)=∑n,k∈ℤψn,k⊗ψn,k.
Proof.

Let f∈L2⁢(ℝ) and suppose ϵ>0. By Lemma 6, there is some M such that m≥M implies that ∥P-m⁢f∥2<ϵ2. There is some g∈Cc⁢(ℝ) satisfying ∥f-g∥2<ϵ6, and by Lemma 7 there is some N such that n≥N implies that ∥Pn⁢g-g∥2<ϵ6. Hence, if n≥N then

∥Pn⁢f-f∥2 ≤∥Pn⁢f-Pn⁢g∥2+∥Pn⁢g-g∥2+∥g-f∥2
≤2⁢∥f-g∥2+∥Pn⁢g-g∥2
<2⁢ϵ6+ϵ6
=ϵ2.

Therefore, if m≥M and n≥N, then

∥(Pn-P-m-idL2(ℝ)⁢f∥2≤∥Pn⁢f-f∥2+∥P-m⁢f∥2<ϵ2+ϵ2=ϵ.

For m,n>0, we have

Pn+1-P-m =∑j=0n∑k∈ℤψj,k⊗ψj,k+∑j=-m-1∑k∈ℤψj,k⊗ψj,k
=∑j=-mn∑k∈ℤψj,k⊗ψj,k

in the strong operator topology. ∎

5 Other function spaces

Let Cb⁢(ℝ) denote those continuous functions ℝ→ℂ that are bounded. We have

Cc⁢(ℝ)⊂C0⁢(ℝ)⊂Cb⁢(ℝ)⊂C⁢(ℝ).
Lemma 9.

If n∈ℤ and f∈Cb⁢(ℝ), then ∥Pn⁢f∥∞≤∥f∥∞.

Proof.

If x∈ℝ, then there is a unique kx∈ℤ with x∈In,kx, and

|Pn⁢f⁢(x)|=|2n⁢∫In,kxf⁢(y)⁢𝑑y|≤2n⁢∫In,kx|f⁢(y)|⁢𝑑y≤∥f∥∞.

∎

Theorem 10.

If f∈C0⁢(ℝ), then the series ∑n,k∈ℤ⟨f,ψn,k⟩⁢ψn,k converges to f uniformly on ℝ.

Proof.

If ϵ>0 then there is some g∈Cc⁢(ℝ) with ∥f-g∥∞<ϵ6. By Lemma 5, there is some M such that m≥M implies that ∥P-m⁢g∥∞<ϵ3, hence

∥P-m⁢f∥∞ ≤∥P-m⁢f-P-m⁢g∥∞+∥P-m⁢g∥∞
≤∥f-g∥∞+∥P-m⁢g∥∞
<ϵ6+ϵ3
=ϵ2.

By Lemma 7, there is some N such that n≥N implies that ∥Pn⁢g-g∥∞<ϵ6, hence

∥Pn⁢f-f∥∞ ≤∥Pn⁢f-Pn⁢g∥∞+∥Pn⁢g-g∥∞+∥g-f∥∞
≤2⁢∥f-g∥∞+∥Pn⁢g-g∥∞
<ϵ2.

Therefore, if n≥N and m≥M, then

∥Pn⁢f-P-m⁢f-f∥∞≤∥Pn⁢f-f∥∞+∥P-m⁢f∥∞<ϵ2+ϵ2=ϵ.

∎

The following theorem states that Pn is an operator on Lp⁢(ℝ) with operator norm ≤1.55 5 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 297, Lemma 6.3.9. In particular, it asserts that if f∈Lp⁢(ℝ) then the averaged function Pn⁢f is also an element of Lp⁢(ℝ).

Theorem 11.

If 1≤p<∞, n∈ℤ, and f∈Lp⁢(ℝ), then ∥Pn⁢f∥p≤∥f∥p.

Proof.

Let 1p+1q=1, so q=pp-1. (If p=1 then q=∞.) If x∈ℝ, then there is a unique kx∈ℤ with x∈In,kx, and using Hölder’s inequality we get

|Pn⁢f⁢(x)| =|2n⁢∫In,kxf⁢(y)⁢𝑑y|
≤2n⁢(∫In,kx|f⁢(y)|p⁢𝑑y)1/p⁢(μ⁢(In,kx))1/q
=2n⁢(∫In,kx|f⁢(y)|p⁢𝑑y)1/p⁢2-n/q.

Therefore, if k∈ℤ then

∫In,k|Pn⁢f⁢(x)|p⁢𝑑x ≤∫In,k2n⁢p⁢2-n⁢p/q⁢∫In,kx|f⁢(y)|p⁢𝑑y⁢𝑑x
=∫In,k2n⁢p⁢2-n⁢p/q⁢∫In,k|f⁢(y)|p⁢𝑑y⁢𝑑x
=2-n⁢2n⁢p⁢2-n⁢p/q⁢∫In,k|f⁢(y)|p⁢𝑑y
=∫In,k|f⁢(y)|p⁢𝑑y.

We obtain

∥Pn⁢f∥pp =∑k∈ℤ∫In,k|Pn⁢f⁢(x)|p⁢𝑑x
≤∑k∈ℤ∫In,k|f⁢(y)|p⁢𝑑y
=∫ℝ|f⁢(y)|p⁢𝑑y
=∥f∥pp,

giving ∥Pn⁢f∥p≤∥f∥p. ∎

6 Multiresolution analysis

For a∈ℝ, we define ma:ℝ→ℝ by ma⁢(x)=a⁢x, and we define τa:ℝ→ℝ by τa⁢(x)=x-a.

Definition 12 (Multiresolution analysis).

A multiresolution analysis of L2⁢(R) is a set {Vn:n∈ℤ} of closed subspaces of the Hilbert space L2⁢(ℝ) and a function Φ∈L2⁢(ℝ) satisfying

  1. 1.

    If n∈ℤ, then f∈Vn if and only if f∘m2∈Vn+1.

  2. 2.

    Vn⊆Vn+1.

  3. 3.

    ⋃n∈ℤVn¯=L2⁢(ℝ).

  4. 4.

    ⋂n∈ℤVn={0}.

  5. 5.

    {Φ∘τk:k∈ℤ} is an orthonormal basis for V0.

It is straightforward to prove the following theorem using what we have established so far.

Theorem 13.

The closed subspaces {L2⁢(ℝ,ℱn):n∈ℤ} of L2⁢(ℝ) and the function ϕ=χ[0,1) is a multiresolution analysis of L2⁢(ℝ).

The following lemma shows that if Pn is the projection onto Vn, where Vn is a closed subspace of a multiresolution analysis of L2⁢(ℝ), then Pn→0 in the strong operator topology as n→-∞.66 6 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 313, Lemma 6.4.28.

Lemma 14.

If {Vn:n∈ℤ} and Φ∈L2⁢(ℝ) is a multiresolution analysis of L2⁢(ℝ), Pn:L2⁢(ℝ)→Vn is the orthogonal projection onto Vn, and f∈L2⁢(ℝ), then

limn→-∞⁡Pn⁢f=0.
Proof.

Define Φn,k⁢(x)=2n/2⁢Φ⁢(2n⁢x-k). The set {Φ0,k:k∈ℤ} is an orthonormal basis for V0, and one checks that the set {Φn,k:k∈ℤ} is an orthonormal basis for Vn. Therefore

Pn=∑k∈ℤΦn,k⊗Φn,k

in the strong operator topology.

For R>0, let fR=f⁢χ[-R,R]. If 2n⁢R<12, then, using the Cauchy-Schwarz inequality,

∥Pn⁢fR∥22 =∑k∈ℤ|⟨Pn⁢fR,Φn,k⟩|2
=∑k∈ℤ|⟨fR,Φn,k⟩|2
=∑k∈ℤ|⟨fR,χ[-R,R]⁢Φn,k⟩|2
≤∑k∈ℤ(∫-RR|fR⁢(x)|2⁢𝑑x)⁢(∫-RR|Φn,k⁢(x)|2⁢𝑑x)
=∥fR∥22⁢∑k∈ℤ∫-RR|Φn,k⁢(x)|2⁢𝑑x
=∥fR∥22⁢∑k∈ℤ2n⁢∫-RR|Φ⁢(2n⁢x-k)|2⁢𝑑x
=∥fR∥22⁢∑k∈ℤ∫-2n⁢R-k2n⁢R-k|Φ⁢(x)|2⁢𝑑x
=∥fR∥22⁢∫Un|Φ⁢(x)|2⁢𝑑x,

where

Un=⋃k∈ℤ(-k-2n⁢R,-k+2n⁢R);

the intervals are disjoint because 2n⁢R<12. Define Fn⁢(x)=|Φ⁢(x)|2⁢χUn⁢(x). For all x∈ℝ we have |Fn⁢(x)|≤|Φ⁢(x)|2, and if x∈ℝ then

limn→-∞⁡Fn⁢(x)→|Φ⁢(x)|2⁢χℤ⁢(x),

where ℤ=⋂n∈ℤUn. Thus by the dominated convergence theorem we get

limn→-∞⁡∫ℝFn⁢(x)⁢𝑑x=∫ℝ|Φ⁢(x)|2⁢χℤ⁢(x)⁢𝑑x=0,

because μ⁢(ℤ)=0. Therefore,

limn→-∞⁡∥Pn⁢fR∥2=0.

If ϵ>0 then there is some R such that ∥f-fR∥2<ϵ. We have, because Pn is an orthogonal projection,

lim supn→-∞⁡∥Pn⁢f∥2 ≤lim supn→-∞⁡∥Pn⁢f-Pn⁢fR∥2+lim supn→-∞⁡∥Pn⁢fR∥2
=lim supn→-∞⁡∥Pn⁢f-Pn⁢fR∥2
≤lim supn→-∞⁡∥f-fR∥2
<ϵ.

This is true for all ϵ>0, so we obtain

limn→-∞⁡∥Pn⁢f∥2=0.

∎

If Sα,α∈I, are subsets of a Hilbert space H, we denote by ⋁α∈ISα the closure of the span of ⋃α∈ISα. If S is a subset of H, let S⟂ be the set of all x∈H such that y∈S implies that ⟨x,y⟩=0. If Sn,n∈ℤ, are mutually orthogonal closed subspaces of a Hilbert space, we write

⊕n∈ℤSn=⋁n∈ℤSn.

The following theorem shows a consequence of Definition 12.

Theorem 15.

If {Vn:n∈ℤ} are the closed subspaces of a multiresolution analysis of L2⁢(ℝ) and Wn=Vn+1∩Vn⟂, then

L2⁢(ℝ)=⊕n∈ℤWn.
Proof.

Because Wn=Vn+1∩Vn⟂ is the intersection of two closed subspaces, it is itself a closed subspace. Suppose that n<n′, f∈Wn,g∈Wn′. n+1≤n′, and hence Vn+1⊆Vn′. Therefore

Wn′=Vn′+1∩Vn′⟂⊂Vn′⟂⊆Vn+1⟂.

But f∈Wn⊂Vn+1 and g∈Wn′⊂Vn+1⟂, so ⟨f,g⟩=0. Therefore Wn⟂Wn′.

If f∈Vn and f≠0, then there is a minimal N such that f∈VN; this minimal N exists because Vn⊆Vn+1 and ⋂n∈ℤVn={0}. We have

VN=VN-1⊕WN-1,

hence f=fN-1+gN-1, with fN-1∈VN-1 and gN-1∈WN-1. Likewise,

VN-1=VN-2⊕WN-2,

hence fN-1=fN-2+gN-2, with fN-2∈VN-2 and gN-2∈WN-2. In this way, for any M≥0 we obtain

f=fN-M+∑m=1MgN-m,

where fN-M∈VN-M and gN-m∈WN-m. Check that fN-M is the orthogonal projection of f onto VN-M. It thus follows from Lemma 14 that fN-M→0 as M→∞. Thus, for any ϵ>0 there is some M with ∥fN-M∥2<ϵ and f∈fN-M+⊕m=1MWN-m. Therefore, if f∈⋃n∈ℤVn then there is some g∈⊕n∈ℤWn satisfying ∥f-g∥2<∞. Thus

⋃n∈ℤVn¯⊆⊕n∈ℤWn,

and so

L2⁢(ℝ)=⊕n∈ℤWn.

∎

7 The unit interval

L2⁢([0,1)) is a Hilbert space with the inner product

⟨f,g⟩=∫01f⁢(x)⁢g⁢(x)¯⁢𝑑x.

If n≥0, then In,0=[0,12n) and In,2n-1=[1-12n,1), and we have

[0,1)=⋃k=02n-1In,k.

Let n≥0, let 𝒢n be the σ-algebra generated by {In,k:0≤k≤2n-1}, and let 𝒢 be the σ-algebra of Lebesgue measurable subsets of [0,1). If n<n′, then

𝒢n⊂𝒢n′⊂𝒢.

An element of L2⁢([0,1),𝒢n) is an element of L2⁢([0,1),𝒢) that is constant on each set In,k,0≤k≤2n-1. Equivalently, an element of L2⁢([0,1),𝒢n) is a function f:[0,1)→ℂ that is constant on each set In,k,0≤k≤2n-1; because [0,1) is a union of finitely many In,k, any such function will be an element of L2⁢([0,1),𝒢). It is apparent that

L2⁢([0,1),𝒢n)⊂L2⁢([0,1),𝒢n′)⊂L2⁢([0,1),𝒢).

We check that L2⁢([0,1),𝒢n) is a complex vector space of dimension 2n.

In,k=In+1,2⁢k∪In+1,2⁢k+1. If x∈In+1,2⁢k, then 2⁢k2n+1≤x<2⁢k+12n+1, so k2n≤x<k2n+12n+1, hence 0≤2n⁢x-k<12. If x∈In+1,2⁢k+1, then 2⁢k+12n+1≤x<2⁢k+22n+1, hence k2n+12n+1≤x<k+12n, and so 12≤2n⁢x-k<1. Thus, if x∈In+1,2⁢k then

ψn,k⁢(x)=2n/2⁢ψ⁢(2n⁢x-k)=2n/2

and if x∈In+1,2⁢k+1 then

ψn,k⁢(x)=2n/2⁢ψ⁢(2n⁢x-k)=-2n/2.

Otherwise x∉In,k, for which ψn,k⁢(x)=0. It follows that ψn,k∈L2⁢([0,1),𝒢n+1).

Theorem 16.

If

ℬ0={χ[0,1)}

and, for n≥0,

ℬn+1={ψn,k:0≤k≤2n-1},

then

⋃n=0Nℬn

is an orthonormal basis of L2⁢([0,1),𝒢N).

Proof.

It follows from Lemma 2 that ⋃n=1Nℬn is orthonormal in L2⁢([0,1)), as it is a subset of an orthonormal set. If 0≤n≤N then ℬn⊂L2⁢([0,1),𝒢N), hence ⋃n=1Nℬn is orthonormal in L2⁢([0,1),𝒢N). If 0<n≤N and 0≤k≤2n-1-1, then ψn-1,k∈ℬn and

⟨ψn-1,k,χ[0,1)⟩ =∫01ψn-1,k⁢(x)⁢χ[0,1)⁢(x)¯⁢𝑑x
=∫01ψn-1,k⁢(x)⁢𝑑x
=∫In,2⁢kψn-1,k⁢(x)⁢𝑑x+∫In,2⁢k+1ψn-1,k⁢(x)⁢𝑑x
=∫In,2⁢k2(n-1)/2⁢𝑑x+∫In,2⁢k+1-2(n-1)/2⁢d⁢x
=0.

Therefore, ⋃n=0Nℬn is orthonormal in L2⁢([0,1),𝒢N).

|ℬ0|=1, and if n≥1 then |ℬn|=2n-1. Therefore the number of elements of ⋃n=0Nℬn is

1+∑n=1N2n-1=1+∑n=0N-12n=2N.

As dim⁡L2⁢([0,1),𝒢N)=2N, the orthonormal set ⋃n=0Nℬn is an orthonormal basis for L2⁢([0,1),𝒢N). ∎

By Theorem 16, if N≥0 then ⋃n=0Nℬn is an orthonormal set in L2⁢([0,1)). Hence

ℬ=⋃n=0∞ℬn

is an orthonormal set in L2⁢([0,1)): if f,g∈ℬ then there is some N with f,g∈⋃n=0Nℬn, which is an orthonormal set. The following theorem shows that ℬ is an orthonormal basis for the Hilbert space L2⁢([0,1)).77 7 John K. Hunter and Bruno Nachtergaele, Applied Analysis, p. 177, Lemma 7.13.

Theorem 17.

ℬ is an orthonormal basis for L2⁢([0,1)).

Proof.

If f∈L2⁢([0,1)) and ϵ>0 then there is some g∈C⁢([0,1]) with ∥f-g∥2<ϵ2. g is uniformly continuous on the compact set [0,1], so there is some δ>0 such that |x-y|<δ implies that |g⁢(x)-g⁢(y)|<ϵ2. Let 2-n≤δ, and define h:[0,1)→ℂ by

h⁢(x)=∑k=02n-1g⁢(k2n)⁢χIn,k⁢(x).

If x∈[0,1) then there is a unique kx,0≤kx≤2n-1, with x∈In,kx, and for this kx we have |x-kx2n|<2-n≤δ, and hence

|g⁢(x)-h⁢(x)|=|g⁢(x)-g⁢(kx2n)|<ϵ2.

Therefore ∥g-h∥∞≤ϵ2.

We have h∈L2⁢([0,1),𝒢n), and

∥f-h∥2≤∥f-g∥2+∥g-h∥2⁢<ϵ2+∥⁢g-h∥∞≤ϵ.

We have shown that if f∈L2⁢([0,1)) and ϵ>0 then there is some n and some h∈L2⁢([0,1),𝒢n) with ∥f-h∥2<ϵ. This tells us that ⋃n=0∞L2⁢([0,1),𝒢n) is a dense subset of L2⁢([0,1)). Since ℬ is orthonormal and span⁢ℬ=⋃n=0∞L2⁢([0,1),𝒢n), ℬ is an orthonormal basis for L2⁢([0,1)). ∎

8 References

Useful references on wavelets and multiresolution analysis are Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets; P. Wojtaszczyk, A Mathematical Introduction to Wavelets; Yves Meyer, Wavelets and Operators; Eugenio Hernández and Guido Weiss, A First Course on Wavelets.