University Mathematics — Year 3 · Bachelor Year 3
12The Lp Spaces
The Lebesgue integral was built for analysis; the spaces are where that analysis lives. They are Banach spaces (Riesz–Fischer) — the completions that Exercise 7.1 showed the continuous functions lacked — and they support a smoothing technology, convolution against mollifiers, that approximates any function by ones. This chapter proves the integral versions of Hölder and Minkowski, completeness, the density theorems, and the regularization machine, ending with the inclusion and interpolation geography of the scale. Throughout, is a measure space and functions are complex-valued; on , the measure is .
12.1 Definition; Hölder and Minkowski
Definition 12.1
For , is the set of measurable with , and the set of bounded outside a null set, with the essential sup — the least with a.e. (the inf is attained: intersect the null sets for ). Since only forces a.e. (Exercise 10.5), we define
elements are classes of functions modulo null sets, and is a genuine norm on .
Theorem 12.2 (Hölder’s inequality)
Let with (conjugate exponents). For measurable :
with equality (for , finite norms, ) iff and are proportional a.e.
Proof. The cases are direct ( a.e.). Let ; normalize (homogeneity; zero or infinite norms are trivial). Young’s inequality (; concavity of , as in Problem 8.1) gives pointwise ; integrate: . Equality forces a.e. equality in Young, i.e. a.e. (after the normalization; undoing it, proportionality). ∎
Theorem 12.3 (Minkowski’s inequality)
For : .
Proof. : pointwise/a.e. triangle inequality. For , assume (else use , from convexity of , to see the left side is finite when the right is). Then
by Hölder, and since ; divide by (if nonzero; else trivial) and use . ∎
12.2 Completeness and its companions
Theorem 12.4 (Riesz–Fischer)
For , is a Banach space. Moreover, every sequence converging in has a subsequence converging almost everywhere (with an dominator in the case ).
Proof. : a -Cauchy sequence is, off a single null set (union of countably many), uniformly Cauchy: it converges uniformly off it; done. Let . By Exercise 7.1(b) it suffices to sum absolutely convergent series: let . Set and (pointwise in ): by Minkowski , and MCT () gives : a.e., so the series converges absolutely for a.e. ; call the sum (any value on the null set). Then , and DCT gives : the series converges in .
The subsequence statement: if in , pick with ; the series falls under the previous argument: it converges absolutely a.e., dominated by a , so a.e., and this a.e.-limit must be (a representative of) (both are limits). The dominator: . ∎
Remark 12.5
convergence does not imply a.e. convergence (the typewriter sequence, Exercise 12.3), nor conversely (escaping bumps): the two modes are linked only through subsequences and domination. Keeping the counterexamples of Exercise 12.3 in mind is the best vaccine.
12.3 Density theorems
Theorem 12.6
Let .
- Simple functions (with finite-measure supports) are dense in .
- In , the continuous compactly supported functions are dense.
- Translation is continuous on : writing , as .
None of the three holds for .
Proof. (1) For : the dyadic of Theorem 10.4 satisfy : DCT. (Each lies in , and its level sets have finite measure where the value is positive: .) Split general into four nonnegative parts.
(2) By (1) it suffices to approximate , Borel with . Regularity (proof as in Theorem 9.13) gives compact open with ; Urysohn’s function
is continuous, on , outside , and can be taken compactly supported (shrink to a bounded open first). Then .
(3) For : uniform continuity gives , with supports in a fixed compact for : . For general : pick with ; then (translation invariance of the norm).
For : uniform approximation of by continuous functions is impossible (jump), and for . ∎
12.4 Convolution and regularization
Theorem 12.7 (Young’s inequality)
Let , , . Then is defined a.e., belongs to , and
Proof. : direct bound. : Theorem 11.9. Let , conjugate. Split and apply Hölder:
Raise to the -th power and integrate in ; Tonelli on the second factor gives , i.e. — and the finiteness of the Tonelli integral justifies a.e. absolute convergence as in Theorem 11.9. ∎
Definition 12.8 (Mollifiers)
The function
with normalizing , is on : the point is that is on , all its derivatives at being (each derivative is for a polynomial , which tends to ; induction). For set : supported in , still of integral .
Theorem 12.9 (Regularization)
Let and . Then:
- , with ;
- as ;
- consequently is dense in .
Proof. (1) Differentiation under the integral (Theorem 10.15) in : for in a ball , with compact ( within of ), and (Hölder against ): the theorem applies; iterate for higher derivatives.
(2) Since :
and Minkowski’s integral inequality — or directly: Hölder/Jensen with the probability measure and Tonelli —
(the middle step: apply Jensen’s inequality, Exercise 12.10, to the inner -integral, then Tonelli). The integrand is supported in and tends to there uniformly as (Theorem 12.6(3)): the whole expression tends to .
(3) Approximate by (Theorem 12.6(2)), then by (compact support: sum of supports). ∎
Example 12.10 (Mollifying , with rates)
Take on (locally ; the theorem applies on every bounded window) and a symmetric mollifier . Then
is ; away from the kink, nothing happens: for , is linear in on the support of , so exactly (symmetry kills the correction). Near , smoothing costs precisely
the approximation error is confined to the -neighborhood of the singularity and is of its size. Meanwhile everywhere ( is convex, and convolution against preserves convexity), with : the second derivative is a bump of mass squeezed into width , so . Smoothing is a trade: uniform error against derivative blow-up — the exact exchange rate that quantitative analysis (interpolation inequalities, Problem 12.1’s circle of ideas) formalizes.
Corollary 12.11 (Fundamental lemma of the calculus of variations)
Let (integrable on compacts) with for every . Then a.e.
Proof. Fix a ball and let . For and : , the test function being . But in (Theorem 12.9): a.e. on ; exhaust . ∎
12.5 The geography
Proposition 12.12
(a) If and , then with . (b) On (infinite measure) there are no inclusions: for there are functions in . (c) (Interpolation) If and is defined by , then
in particular .
Proof. (a) Hölder with exponents and its conjugate: ( directly). (b) Near and near , powers calibrate: Exercise 12.2. (c) Write and apply Hölder with the conjugate pair , (conjugates precisely by the definition of ): . ∎
Method 12.13
The toolkit, as used everywhere below: to prove an identity or inequality for all — prove it on a dense class ( via Theorem 12.9) and extend by continuity (Theorem 7.2, both sides being -continuous); to prove , test against (Corollary 12.11); to gain smoothness, convolve; to trade exponents, Hölder and interpolation. The Fourier theory of Chapter 14 is one long application of this method.
12.6 Exercises
Exercise 12.1 ★
(a) State and prove the Cauchy–Schwarz inequality in as the case of Hölder. (b) On a probability space, show is nondecreasing. (c) When is Hölder an equality for , ?
Solution
Solution of Exercise 12.1.
(a) in Theorem 12.2: — Cauchy–Schwarz, with equality iff proportional and the phases aligned.
(b) On a probability space, for : apply Jensen (Exercise 12.10) with the convex to the function : , i.e. .
(c) iff a.e. on (the inequality must be an a.e. equality).
Exercise 12.2 ★
For which do the following belong to ?
Conclude: on small is easier, on large is easier, and no contains another on .
Solution
Solution of Exercise 12.2.
iff : the first is in for . iff : the second for (and : it is bounded — include it). Third: for , dominated by : integrable; for , substitute : ; for the power dominates: divergent. So . Fourth: iff ; bounded, so also : . Moral: integrability at likes small , at large ; combining both obstructions, no inclusion between spaces.
Exercise 12.3 ★★
(The typewriter) Enumerate the dyadic intervals , , , , … and let . (a) Show in every , , but diverges for every . (b) Exhibit the a.e.-convergent subsequence promised by Theorem 12.4. (c) Conversely give a sequence converging a.e. but not in , and one converging in but in no , .
Solution
Solution of Exercise 12.3.
(a) (at dyadic level the length is ). But every lies in one interval of each dyadic level: infinitely often and infinitely often (intervals of the same level not containing ): no convergence at any point.
(b) (the first interval of each level) converges to at every : a.e.
(c) a.e. but not : a.e., integral . In but in no (): : , while for every .
Exercise 12.4 ★★
Let and , . Show that as . (Upper bound by (a) of Proposition 12.12; lower bound by integrating over , of positive measure.)
Solution
Solution of Exercise 12.4.
Upper: (Proposition 12.12(a) with ), and . Lower: for , has (definition of the essential sup), and
Exercise 12.5 ★★
(a) Where exactly does the proof of Theorem 12.6(3) use ? (b) Show that satisfies iff has a uniformly continuous representative.
Solution
Solution of Exercise 12.5.
(a) Twice: the conversion (finite-measure support) degenerates for only in that the density of fails there — that is the real gap: step (2) of Theorem 12.6 has no analogue.
(b) If has a uniformly continuous representative : . Conversely, suppose . The mollifications are continuous, and
(the convolution is an average of translates). Each is uniformly continuous (, by averaging), and a uniform limit of uniformly continuous functions is one: agrees a.e. with a uniformly continuous function.
Exercise 12.6 ★★
Let be conjugate, , . Show that is defined everywhere, bounded, with , and uniformly continuous. (Continuity of translation in ; treat separately — for use translation continuity on the factor.)
Solution
Solution of Exercise 12.6.
By Hölder, for every the integrand is in with : everywhere defined and bounded. Uniform continuity ():
uniformly in (Theorem 12.6(3)). If , then : write and run the same bound with the translation acting on .
Exercise 12.7 ★★
Let with for every . Show that is a.e. equal to a constant. (Fix with ; any with is a ; write a general test function as and apply Corollary 12.11 to with .)
Solution
Solution of Exercise 12.7.
Fix with , and set . Let be arbitrary and : then , so defines (it vanishes near both ends: near trivially, near because the total integral is ) with . The hypothesis gives , hence
By Corollary 12.11 (localized on ), a.e.
Exercise 12.8 ★★★
(Smooth Urysohn) Let , compact, open. Construct with , on , . (Mollify the indicator of the -neighborhood of with , for small.) Deduce a partition-of-unity statement for a compact covered by finitely many open sets.
Solution
Solution of Exercise 12.8.
Let (positive: Exercise 6.6(b); if any works), , and
Then (Theorem 12.9(1); the indicator is ), (), on (for , , so the convolution integrates fully), and : compactly supported ( is bounded). Partition of unity: given , choose (by compactness) compacts with , take as above for , and set : each , and on .
Exercise 12.9 ★★
Using interpolation (Proposition 12.12(c)): (a) show that for all , with ; (b) show that is, for fixed , log-convex in , and give an example where exactly for in a given interval .
Solution
Solution of Exercise 12.9.
(a) The interpolation exponent for at is : Proposition 12.12(c) gives .
(b) Taking logarithms in Proposition 12.12(c): where is the same convex combination of : is convex. Example with -membership exactly on :
the first term is iff , the second iff .
Exercise 12.10 ★★
(Jensen) Let be a probability measure, real, and convex. Show
(support line of at the point ). Deduce the arithmetic–geometric inequality and the monotonicity of of Exercise 12.1(b).
Solution
Solution of Exercise 12.10.
Let . Convexity provides a support line at : there is with for all (take between the one-sided derivatives, which exist for convex functions). Substitute and integrate against the probability :
(measurability: is continuous; integrability of the negative part of is guaranteed by the support line). AM–GM: on a finite set with weights , take and : , i.e. . The norm monotonicity is Exercise 12.1(b).
Exercise 12.11 ★★★
(Young’s convolution inequality) Let with , and , . (a) Prove . (Write, for conjugate exponents worked out from , and apply the three-factor Hölder inequality with exponents , , ; then integrate in by Tonelli.) (b) Check the three special cases already known: (Hölder, Exercise 12.6); (-stability of convolution by an integrable kernel); ( is a convolution algebra, Theorem 11.9). (c) Why is there no inequality with ? (Test on dilations and compare the scalings of both sides.)
Solution
Solution of Exercise 12.11.
(a) Assume first and (replace by absolute values). The three exponents , , satisfy (the scaling relation). Split, for fixed ,
and Hölder with the three exponents gives
more precisely: the second factor is since , and likewise the third is . Raise to the -th power and integrate in (Tonelli on the first factor):
The endpoint cases ( or an exponent equal to its bound) are plain Hölder or direct estimates.
(b) forces : — Hölder after translation-reflection. gives : , the mollification workhorse (Theorem 12.9’s engine). gives : the convolution algebra (Theorem 11.9).
(c) Replace by , : then , and comparing norms,
an inequality valid for all forces the two scaling exponents to match, i.e. exactly. Any other combination dies at or : Young’s relation is not a convenience but a scaling law.
Exercise 12.12 ★★
(Equality cases) (a) In Hölder’s inequality (), show that equality holds iff and are proportional a.e. (Track the equality case of Young’s inequality , which is .) (b) In Minkowski’s inequality (), show that equality with forces a.e. with . (c) Contrast with and : describe the (much larger) equality cases there, on examples.
Solution
Solution of Exercise 12.12.
(a) Normalize . The proof of Hölder integrates Young’s inequality ; equality of the integrals forces equality a.e. in Young, which (strict convexity of ; equality iff ) means a.e. Undoing the normalization: a.e. — proportionality.
(b) Minkowski is two Hölders applied to and ; equality forces (a)’s proportionality in both: and each proportional to , so a.e. for a constant ; and the initial pointwise triangle inequality must also be an a.e. equality, which for complex values means and have a.e. the same argument where both are nonzero. Combining: a.e., (both nonzero).
(c) : equality in holds whenever have the same sign pattern (same argument a.e.) — no proportionality needed: and work. : as soon as the two functions peak compatibly at a common point (or along a common sequence): near one point suffices regardless of behavior elsewhere. The strict convexity of the balls for — and its failure at the endpoints — is exactly what these equality cases witness.
12.7 Problem: Hardy’s inequality
Problem 12.1
Weekend problem — Hardy’s inequality and its sharp constant
For , , define the Hardy operator
Hardy’s inequality (1920) asserts
and the constant is optimal and not attained. This problem proves everything, then extends to series.
Part I — The inequality. Assume first continuous with compact support in , and let .
- Show that : near , vanishes on a neighborhood of ; near , is bounded, so , and belongs to for .
Integrate by parts to show
(Differentiate ; boundary terms vanish — justify both ends.)
- Apply Hölder to the right side and deduce for such .
- Extend to all of : for , construct continuous with compact support in , a.e. (truncate, then approximate monotonically — justify the construction); then pointwise (MCT inside the average) and MCT passes the inequality to the limit. For signed or complex , conclude with .
Part II — Optimality.
For let . Compute and, for ,
- Deduce , and conclude that the constant is optimal.
- Show that equality with is impossible. (Track the equality case of Hölder in question 3: it would force -type behavior, which is not in .)
Part III — The discrete inequality.
For a nonincreasing on and , compare and , and -averages accordingly, to deduce from Part I Hardy’s discrete inequality: for ,
— prove it first for nonincreasing via the comparison above, then reduce the general case to the nonincreasing one by rearrangement (admit, with a one-line justification, that sorting in decreasing order can only increase the left side while fixing the right).
- Deduce: if then the Cesàro means of are again — and give an example () where but is not summable, yet Hardy still controls the means.
Part IV — Epilogue.
- Show that Hardy’s inequality fails for : with , compute and observe . Where does the proof break?
Part V — The maximal function, and Lebesgue’s differentiation theorem. Hardy averages from the origin; Hardy–Littlewood average around each point. For define
- (Vitali, finite version) Let be open intervals. Show there is a disjoint subfamily with , where denotes the interval with the same center and triple length (greedy: repeatedly pick the longest interval disjoint from those already picked).
(Weak type ) Show that for every ,
each with owns a centered interval with ; take a compact (inner regularity), cover it by finitely many , apply question 11, and exhaust.
- Compute for and deduce that for every ( at infinity): at , the weak inequality of question 12 is the best possible statement.
(Strong type for ) For : split , observe , and combine question 12 with the layer-cake formula (Proposition 11.8) and Tonelli to prove
(The blow-up as is question 13’s failure, quantified.)
(Lebesgue differentiation theorem) Prove: for ,
(Clear for continuous . In general write , continuous with compact support, (Theorem 12.6); the set where of the averaged oscillation exceeds sits inside , of measure ; let , then along a sequence.)
- Deduce: (a) almost every point is a Lebesgue point of ; (b) for , the primitive is differentiable a.e. with a.e. — the integral half of the fundamental theorem of calculus in the Lebesgue world, closing the circle opened by the staircase (Problem 9.1), which showed the converse half can fail.
- (Density points) For measurable , show that almost every satisfies : measurable sets are locally full at almost all of their points. Sketch, in two lines, how this yields yet another proof of Steinhaus’ theorem (Exercise 9.8).
Part VI — Variations on the theme of averaging.
(Weighted Hardy) For and , show
by the same integration by parts, and check that the borderline is genuinely forbidden (adapt question 10’s counterexample).
- (The adjoint) Let . Show for nonnegative (Tonelli), and prove (directly by parts, or from Hardy on the conjugate exponent by duality — mind which exponent picks up which constant).
(A Hilbert-type inequality) Deduce that for nonnegative , :
(split along / : each half is a pairing of one function against a Hardy transform of the other).
- (Optimality, discrete) Show that the constant of question 8 is also optimal: test on , compare both sides with integrals, and let (the discrete mirror of Part II).
- (Synthesis) Three averaging operators appeared in this problem: Hardy’s , the discrete Cesàro mean, and the maximal operator . State in one line each what its boundedness says, observe that all three fail exactly at , and explain why it is the same failure three times (the harmonic tail ).
Part VII — Carleman’s inequality, and how sharp is sharp.
(Carleman’s inequality) Let with . Apply the discrete Hardy inequality of question 8 to , use the arithmetic–geometric mean inequality, and let (show that decreases to ) to obtain
the geometric means of a summable sequence are summable, at cost at most .
- (The constant is optimal) Test : using the Stirling bracketing of Problem 11.1, show , deduce that both sides of Carleman grow like , and conclude that no constant smaller than can work. (Observe the pattern: the optimizers of Hardy and of Carleman are both the harmonic-type sequences that just fail to be in the space.)
(How slowly is “sharp” approached?) Take . For , compute , against the bound . For the near-optimizers of question 5, prove the exact identity
Evaluate at (ratio ) and comment: the supremum is approached at speed only — an optimal constant can be all but invisible numerically.
Solution
Solution of Problem 12.1.
1. has support in some , so on and on : vanishes near and is at infinity; for , and is continuous: .
2. . Both boundary values vanish: at because near ; at because (). Integrating the identity over :
which is the displayed relation.
3. Hölder with exponents and :
so ; divide (finite by question 1, and if there is nothing to prove).
4. Let , . Choose with in (Theorem 12.6(2), intersected with the open half-line — approximate and diagonalize), and replace by (still continuous, and closer to ). For every fixed , Hölder on gives
pointwise. Fatou and question 3:
For signed or complex : pointwise, and the nonnegative case applies to .
5. . For :
6. Fix and with for . Then
so as : the constant cannot be improved.
7. Equality in question 3 forces equality in Hölder: proportional to a.e., i.e. a.e. for some . Since is absolutely continuous with a.e., solves : on any interval where , , so and there. But no nonzero power belongs to ( needed at and at : incompatible), and cannot vanish identically unless . So equality demands .
8. Given nonincreasing , define the step function on : nonincreasing, with and , so . The average of a nonincreasing function is nonincreasing, so is, and
by Part I. For a general nonnegative sequence, let be its nonincreasing rearrangement (possible when , which we may assume — otherwise both sides are infinite): the right side is unchanged, and each partial sum is at most (the largest terms): the left side only grows. Hence the inequality for all .
9. If , the sequence of Cesàro means is in with norm . Example (): (): , yet (integral test); Hardy still guarantees .
10. For : on and for : , while . The proof collapses at two points: the constant blows up as , and the boundary term no longer vanishes at infinity for . Hardy’s inequality is an honest phenomenon.
11. Pick the longest interval ; discard every interval meeting it; pick the longest survivor ; iterate (finitely many intervals). The chosen ones are disjoint by construction, and every discarded met a chosen interval at least as long: an interval meeting a longer-or-equal one is contained in its triple, .
12. is open: each average is continuous (dominated convergence in ), and a supremum of continuous functions is lower semicontinuous. Each in it owns with . For compact : finitely many cover , Vitali (question 11) extracts disjoint with , so
by disjointness; inner regularity (Theorem 9.13) concludes.
13. For : with the average is , increasing in ; for it is , decreasing: the supremum is , attained at . So . In general, if on a bounded interval , then for all : never integrable unless a.e.
14. With : , so and question 12 gives . Layer cake (Proposition 11.8) and Tonelli:
15. Write . For continuous : everywhere. Given , split with continuous of compact support and (Theorem 12.6); then
so has measure (question 12; Markov). arbitrary: ; union over : a.e.
16. (a) For each , question 15 applied to gives a.e.; on the intersection of these full-measure sets, choose with : for every : almost every is a Lebesgue point. (b) At a Lebesgue point,
a.e. — primitives of functions do differentiate back; the staircase (Problem 9.1) is the counterexample to the converse direction only.
17. Apply question 15 to and let grow: for a.e. the density . Steinhaus: around a density point take with density ; for , and each fill more than of an interval of length , hence intersect: .
18. Let : vanishes at ( vanishes near ) and at ( bounded, ), so with
Hence ; Hölder for the measure (exponents and ) finishes as in question 3. Borderline : with , the right side is while the left contains : no constant survives .
19. Tonelli on :
Duality: , Hardy being invoked in , whose constant equals .
20. Split along the (null) diagonal. On :
since Hardy in carries the constant . Symmetrically, (). Total: .
21. For , : the right side is . On the left, for : , so the -th Cesàro mean is uniformly for in any range ; raising to the and summing, the left side is . Dividing and letting , then : no constant smaller than can work.
22. bounded on : cumulative averages do not inflate -norms (constant ); Cesàro on : the same, discretized; bounded on : even the best local average stays under control (constant ). All three fail at , and for one reason: averaging a concentrated unit of mass produces a tail (questions 10 and 13), and belongs to every near infinity except . Smoothing spreads mass exactly to the harmonic frontier of integrability.
23. Set , so . Question 8 gives
and AM–GM bounds each summand from below:
Hence for every . With ,
which decreases to as (the classical monotone upper sequence for ). Taking the infimum over gives Carleman’s inequality with constant .
24. For , . The bracketing of Problem 11.1 gives , so
since . Inverting, , and summing over :
(the error series converges). A Carleman inequality with constant would force , hence upon dividing by . The optimizing sequences line up: Hardy’s constant is approached by (question 21), Carleman’s by — in each case the harmonic-type sequence sitting just outside the space being averaged.
25. For : on and for , so and the ratio is , about of the sharp bound. For (): on , so on that range and, for , . Squaring and integrating,
whence ; dividing by gives the stated identity. At : , so the ratio is . The defect decays only logarithmically: to reach ratio one would need , i.e. . Sharp constants are theorems, not experiments.