Professional Documents
Culture Documents
Definition. Define L2 = L2 ([a, b]) as the set of measurable functions f : [a, b] → C so that
the function x 7→ |f (x)|2 is Lebesgue integrable, i.e.
Z b
∥f ∥22 := |f (x)|2 dx < ∞.
a
Note: You do not need to prove measurability in this workshop, since that is non-
examinable material (but if you are interested in continuing to study analysis, you are
strongly recommended not to ignore measurability!).
The functions |f |2 , |g|2 are integrable by assumption. The functions f (x)λg(x) and
f (x)λg(x)f (x) are integrable by Theorem 4.15, because they are measurable (see Ex-
ercise 4.20 in the notes) and using ab ≤ 12 (a2 + b2 ), their absolute values are bounded
by
|λ|
(|f (x)|2 + |g(x)|2 ),
2
which is an integrable function, because f, g ∈ L2 .
1
Solution. (a) In L2 for all a ∈ R: f is measurable because it is continuous, and in L2
because |f |2 = 1.
(b) In L2 if and only if a > −1/2: f is measurable because it is continuous (up to
potentially at zero). For x ∈ (0, 1], |f (x)|2 = x2a , which is integrable if and only if
2a > −1 by a previous worksheet.
(c) In L2 because f is measurable (by continuity) and |f |2 is integrable (again by
continuity).
(d) In L2 because step functions are measurable and |f |2 is also a step function and
therefore integrable.
(d) Not necessarily in L2 , consider the example in (b) for a = −1/2.
Rb
Definition. If f, g ∈ L2 ([a, b]), then their inner product is defined by ⟨f, g⟩ := a
f (x)g(x)dx.
The notation should remind you of the inner product for vectors in Rn and indeed, the
inner product plays a similar role in L2 .
3. Let us prove one of the most important inequalities in analysis: the Cauchy–Schwarz
inequality: for f, g ∈ L2 we have |⟨f, g⟩| ≤ ∥f ∥2 ∥g∥2 .
Rb
(a) Show that the integral a f (x)g(x)dx exists, i.e. that x 7→ f (x)g(x) is integrable
on [a, b].
Hint: Use Theorem 4.15 from the notes (and again, you can but should not ignore
the measurability assumption in that theorem).
Rb λ
Rb 1
Rb
(b) Let λ > 0. Show that a
|f (x)g(x)|dx ≤ 2 a
|f (x)|2 dx + 2λ a
|g(x)|2 dx.
(c) By using calculus or otherwise, find the value of λ that minimizes the right hand
side of the previous inequality (holding f, g fixed) and finish the proof.
(d) By examining the proof, determine when equality holds in the Cauchy–Schwarz
inequality.
Solution. (a) Since f, g are measurable, so is x 7→ f (x)g(x) (see proof of Exercise
4.20 in the notes for the real-valued case; for the complex-valued case decompose into
real and imaginary part). By Theorem 4.15 it now suffices to note that |f (x)g(x)| ≤
1
2
|f (x)|2 + 21 |g(x)|2 and that 12 |f (x)|2 + 21 |g(x)|2 is integrable, because |f |2 , |g|2 are
integrable.
(b) Again using xy ≤ 21 (x2 + y 2 ), we have
Z b Z b
λ b
Z Z b
1/2 −1/2 2 1
|f (x)g(x)|dx = |λ f (x)||λ g(x)|dx ≤ |f (x)| dx + |g(x)|2 dx.
a a 2 a 2λ a
2
(d) The only equality we used was |f (x)g(x)| ≤ λ2 |f (x)|2 + 2λ 1
|g(x)|2 , where equality
holds if and only if λ|f (x)| = λ−1 |g(x)|. For equality to be preserved after integrating
over x ∈ [a, b] it is necessary that this holds for almost every x ∈ [a, b]. Thus, equality
holds in the Cauchy–Schwarz inequality if and only if f (x) = c · g(x) for almost every
x and some constant c.
Rb
4. For integrable f : [a, b] → C we write ∥f ∥1 = a |f |. Show that there exists a constant
C ∈ (0, ∞) such that ∥f ∥1 ≤ C∥f ∥2 for every f ∈ L2 . Does the converse hold? That
is, does there exist C ∈ (0, ∞) such that ∥f ∥2 ≤ C∥f ∥1 for every f ∈ L2 ? (Prove or
disprove.)
Solution. By the Cauchy–Schwarz inequality,
Z b 1/2
∥f ∥1 = ⟨1, |f |⟩ ≤ 1 ∥f ∥2 = (b − a)1/2 ∥f ∥2 .
a
To see that the converse fails, say that [a, b] = [0, 1] (with no loss of generality). Let
ε ∈ (0, 1) and set f = χ[0,ε] . Then ∥f ∥1 = ε, whereas ∥f ∥2 = ε1/2 . Thus, if there would
exist a constant C ∈ (0, ∞) so that for all f ∈ L2 , ∥f ∥2 ≤ C∥f ∥1 , then we would have
ε1/2 ≤ Cε, i.e. ε ≥ C −2 which is a contradiction since we may choose ε < C −2 .
Definition. Let f, f1 , f2 , . . . be functions in L2 ([a, b]). We say that the sequence (fn )n con-
verges to f in L2 if the sequence
Z b 1/2
∥fn − f ∥2 = |fn (x) − f (x)|2 dx
a
3
7. Construct a sequence (fn )n of L2 functions on [0, 1] so that fn → 0 in L2 , but the
sequence (fn (x))n does not converge for any x ∈ [0, 1].
Hint: The L2 norm of the characteristic function of an interval only depends on the
length of the interval, not its location.
Solution. We’ll first prove the claim for the interval [1/2, 1] instead of [0, 1]. For
n = 1, 2, . . . set fn = χIn , where In = [n2−k , (n + 1)2−k ] and for each n, k is the unique
integer so that 2k−1 ≤ n < 2k (in particular, In ⊂ [ 21 , 1]). Then ∥fn ∥2 = 2−k/2 → 0 as
n → ∞. Fix x ∈ [1/2, 1]. We claim that for every N ≥ 1 there exist n1 , n2 ≥ N so
that so that x ∈ In1 and x ̸∈ In2 , so |fn1 (x) − fn2 (x)| = 1. This implies that (fn (x))n
is not a Cauchy sequence, so it does not converge as n → ∞.
To show the claim let N ≥ 1. Choose k ≥ 2 such that 2k−1 ≥ N . Then the intervals
I2k−1 = [1/2, 1/2 + 2−k ], I2k−1 +1 , . . . , I2k −1 = [1 − 2−k , 1] are pairwise disjoint (possibly
up to endpoints) and their union equals [1/2, 1]. Thus there must exist 2k−1 ≤ n1 < 2k
so that x ∈ In1 . Also, there are at most two such n1 so since k ≥ 2 there must exist
2k−1 ≤ n2 < 2k so that x ̸∈ In2 , which proves the claim.
Finally, by replacing the intervals In by 2In − 1 one achieves the same result for the
interval [0, 1] instead of [1/2, 1].
We say that two functions f, g ∈ L2 ([a, b]) are orthogonal (on [a, b]) if ⟨f, g⟩ = 0.
8. This exercise is to provide a first hint about why orthogonality is a powerful idea.
Suppose that f1 , f2 , . . . , fN are L2 functions on [a, b].
(a) Show that
X N
N
X 1/2
1/2 2
fk
≤ N ∥fk ∥2
2
k=1 k=1
and give examples of f1 , . . . , fN to show that the constant N 1/2 cannot be improved.
(b) Suppose f1 , f2 , · · · , fN are pairwise orthogonal on [a, b]. Show that
XN
N
X 1/2
fk
= ∥fk ∥22
2
k=1 k=1
To see that N 1/2 cannot be improved, set f1 = · · · = fN = χ[a,b] . Then both sides are
equal to N (b − a)1/2 .
4
(b) We compute
XN N
2 D X N
X E XN X
N
fk
= fk , fj = ⟨fk , fj ⟩.
2
k=1 k=1 j=1 k=1 j=1