Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $\Omega$ be a measure space (which can be assumed to be an interval with Lebesgue measure).

It is well known that for a sequence $(f_n)$ in $L^1(\Omega)$ which converges to zero (in $L^1(\Omega)$, that is, $\|f_n\|_{L^1(\Omega)}\to 0$) then a subsequence of $f_n$ converges to zero pointwise almost everywhere. My question is: Is there a uniform version of this theorem in the following sense: For a countable set $A$ of sequences $(f_n)$ in $L^1(\Omega)$ and $$\sup_{(f_n)\in A} \|f_n\|_{L^1(\Omega)}\to 0$$ is it true that there exists a set of measure zero $N\subset \Omega$ and an increasing sequence of indices $(k_n)$ such that for $x\notin N$, $$\sup_{(f_n)\in A} |f_{k_n}(x)|\to 0$$ as $n\to \infty$?

Edit: "uniform convergence pointwise a.e." is obviously not such a great way to describe this kind of convergence, so if someone knows how this should be called, this might be of help too.

share|improve this question
add comment

1 Answer

up vote 3 down vote accepted

No. For each $n$ let $(A_{n,m})$ be a sequence of subsets of $\Omega$ each with measure less than $1/n$, but with $\bigcup_m A_{n,m} = \Omega$ (certainly you can do this if $\Omega=[0,1]$ with Lebesgue measure).

Now set $f^{(m)}_n = \chi_{A_{n,m}}$. Then \[ \lim_n \ \sup_m \|f^{(m)}_n\|_1 = \lim_n \ \sup_m |A_{n,m}| < \lim_n \frac{1}{n} = 0. \] However, for any sequence $(k_n)$ and any $x\in\Omega$, \[ \sup_m |f^{(m)}_{k_n}(x)| = \sup_m \chi_{A_{k_n,m}}(x) = \chi_{\bigcup_m A_{k_n,m}}(x) = 1. \] Thus your conclusion cannot hold.

share|improve this answer
    
OK thank you (Now that you gave the counterexample, it seems so obvious that I'm a bit embarrassed having asked the question in the first place) –  Florian Mar 20 '12 at 13:11
    
I was trying to think of some extra condition which would save the result; but I don't see one... –  Matthew Daws Mar 20 '12 at 13:12
add comment

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.