Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $1\leq p < \infty$. Suppose that $\{f_k\} \subset L^p$ (the domain here does not necessarily have to be finite), $f_k \to f$ almost everywhere, and $\|f_k\|_{L^p} \to \|f\|_{L^p}$. Why is it the case that $$\|f_k - f\|_{L^p} \to 0\ ?$$

A statement in the other direction (i.e. $\|f_k - f\|_{L^p} \to 0 \Rightarrow \|f_k\|_{L^p} \to \|f\|_{L^p}$ ) follows pretty easily and is the one that I've seen most of the time. I'm not how to show the result above though.

share|improve this question
    
Miscellaneous notes. The norm of $L^p$ is uniformly convex $(1 < p < \infty)$. And $f_k$ converges weakly in $L^p$ to $f$. –  GEdgar May 15 '11 at 12:37
    
Does $f_k$ converges weakly in $L^p$ to $f$ implies $f_k$ converges $L^p$ to $f$? –  Topologieeeee May 15 '11 at 13:00
2  
Nope, not at all. e.g. $f_{k}(x) = e^{2\pi i k x}$ converges weakly to zero in $L^{p}([0,1])$. However, what GEdgar is getting at: if $f_{k} \to f$ weakly and $\|f_{k}\|_{p} \to \|f\|_{p}$ then $f_{p} \to f$ due to uniform convexity of $L^{p}$ for $1 \lt p \lt \infty$. Can you do the case $p = 2$ (which is a lot easier)? Then look up Hanner's inequalities (and Clarkson's inequalities) for uniform convexity of $L^p$. –  t.b. May 15 '11 at 13:39
1  
An almost identical question has been merged into this one. I've cleaned up the comments a bit. –  Willie Wong Jul 16 '11 at 1:52

2 Answers 2

up vote 32 down vote accepted

This is a theorem by Riesz.

Observe that $$|f_k - f|^p \leq 2^p (|f_k|^p + |f|^p),$$

Now we can apply Fatou's lemma to $$2^p (|f_k|^p + |f|^p) - |f_k - f|^p \geq 0.$$

If you look well enough you will notice that this implies that

$$\limsup_{k \to \infty} \int |f_k - f|^p \, d\mu = 0.$$

Hence you can conclude the same for the normal limit.

share|improve this answer
3  
You're very fast :) –  t.b. Jul 14 '11 at 21:02
    
Wow, thanks for the lightning fast response! I actually can't even mark the answer correct yet. Also, just out of curiosity, in what text is the result attributed to Riesz? –  user1736 Jul 14 '11 at 21:09
5  
@user1736, Jonas: Here's Riesz's foundational paper on $L^p$-spaces, where he proves (among many other things) completeness of $L^p$ for $1\leq p \lt \infty$ and some weak sequential compactness results which he then applies to solve some integral equations. The Riesz-Fischer theorem is called this way as it was proved simultaneously and independently by both of them. Both papers appeared in the Comptes rendus de l'Académie des sciences 144: 615–619 (Riesz) and 1022–1024 (Fischer). The result here is not proved but can easily be extracted... –  t.b. Jul 14 '11 at 21:28
3  
... I don't know its history and where it appeared first, but it is very likely that it is due to Riesz. If you really want to know you should check Dieudonné's history of functional analysis. –  t.b. Jul 14 '11 at 21:29
6  
@anegligibleperson: Convexity. Or, $$|f+g|^p \leq (2\max(|f|,|g|))^p = 2^p \max(|f|^p,|g|^p) \leq 2^p (|f|^p + |g|^p)\>.$$ Note that the latter works for any $p \geq 0$. –  cardinal Jan 5 '13 at 21:50

Consider $g_k = 2^p(|f_k|^p + |f|^p) - |f_k - f|^p$.

Since $g_k \geq 0$ (why?), and $g_k \to 2^{p+1}|f|^p$ a.e., we can apply Fatou's Lemma: $$\int \liminf g_k \leq \liminf \int g_k$$ so that $$\int 2^{p+1}|f|^p \leq \liminf \left(\int 2^p |f_k|^p + \int 2^p |f|^p - \int |f_k - f|^p \right),$$ and I'll let you take it from here.

share|improve this answer
    
A point that wasn't addressed so far: $L^1$-convergence (in the title) is not the same thing as pointwise convergence a.e. –  t.b. May 15 '11 at 20:55
    
True. Even in finite measure spaces, neither implies the other. –  Jesse Madnick May 15 '11 at 21:03
9  
I love how the combining of two questions makes it seem like I answered this question a whole two months before it was asked :-) –  Jesse Madnick Apr 19 '12 at 6:24
1  
I guess in light of the first comment to the other answer, that makes you very, very fast. (+1) –  cardinal Jan 5 '13 at 22:16

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.