$x^{(n)}$ converges to $x$ in $\ell^1$ if and only if $\lim x^{(n)}_j=x_j$ for all $j\in\mathbb N$

133 Views Asked by At

Let $x^{(n)}$ and $x$ belong to the unit sphere of $\ell^1$. I want to prove that

$x^{(n)}\to x$ if and only if $\lim_{n\to \infty} x^{(n)}_j=x_j$ for all $j\in \mathbb N$.

It's clear that $x^{(n)}\to x$ implies $x^{(n)}_j\to x_j$ since $$|x^{(n)}_j-x_j|\leq \sum_{j=1}^\infty|x^{(n)}_j-x_j|\to 0.$$

However the other side is not easy for me. If $x^{(n)}_j\to x_j$ for all $j$ and $\epsilon>0$ is given then there exists $N_j$ such that if $n\geq N_j$, then $|x^{(n)}_j-x_j|< \epsilon$.

But this doesn't help. I think maybe we should find a $N$ such that for $n\geq N$ we have $|x^{(n)}_j-x_j| <\frac{\epsilon}{2^j}$ for all $j$.

And I don't know how $\sum_j |x^{(n)}_j|=\sum_j|x_j|=1$ could help.

2

There are 2 best solutions below

0
On BEST ANSWER

Hint: Choose $J$ such that $\sum_{j=1}^{J}|x_j|> 1-\epsilon.$ Because $J$ is now fixed, we'll have

$$\sum_{j=1}^{J}|x_{nj}-x_j| < \epsilon$$

for large $n.$ For such $n,$ we then have

$$\sum_{j=1}^{J}|x_{nj}| \ge \sum_{j=1}^{J}|x_j|-\sum_{j=1}^{J}|x_{nj}-x_j| > 1-\epsilon - \epsilon.$$

Thus we will have both $\sum_{j>J}|x_{j}|, \sum_{j>J}|x_{nj}|$ small for large $n.$

2
On

Here is a more general statement:

Proposition. (Scheffé’s lemma) Let $(X, \mathcal{F}, \mu)$ be a measure space. Suppose that $f_n, f$ are $L^1$-functions on $X$ such that $f_n \to f$ pointwise. Then the followings are equivalent:

  1. $f_n \to f$ in $L^1$.
  2. $\int|f_n| \, d\mu \to \int |f| \, d\mu$

In our case, we can set $(X, \mathcal{F}, \mu) = (\mathbb{N}, \mathcal{P}(\mathbb{N}), \text{counting measure})$ so that $\ell^1(\mathbb{N})$ is the $L^1$-space on $\mathbb{N}$. Since the second condition is satisfied for our sequence, the claim follows. So it remains to prove the above proposition.

  • Proof. The direction $1 \Rightarrow 2$ is straightforward, so we prove the converse $2 \Rightarrow 1$. By the Fatou's lemma,

    $$ \liminf_{n\to\infty} \int_X (|f_n| + |f| - |f - f_n|) \, d\mu \geq \int_X \liminf_{n\to\infty} (|f_n| + |f| - |f - f_n|) \, d\mu. $$

    By the assumption that $\int_X |f_n| \, d\mu \to \int_X |f| \, d\mu$, the LHS is

    $$ \liminf_{n\to\infty} \int_X (|f_n| + |f| - |f - f_n|) \, d\mu = 2\int_X |f| \, d\mu - \limsup_{n\to\infty} \int_X |f - f_n| \, d\mu. $$

    On the other hand, the RHS is

    $$ \int_X \liminf_{n\to\infty} (|f_n| + |f| - |f - f_n|) \, d\mu = \int_X 2|f| \, d\mu. $$

    Plugging back and simplifying, we get

    $$ \limsup_{n\to\infty} \int_X |f - f_n| \, d\mu \leq 0 $$

    and therefore $f_n \to f$ in $L^1$. ////

Remark. Notice that this proof is almost identical to the proof of the dominated convergence theorem, where the role of dominating function being replaced by the convergence assumption $\int_X |f_n| \, d\mu \to \int_X |f| \, d\mu$.