2

I have the following exercise that concerns me:

Let $X$ be a normed space and $X^*$ its dual space. Suppose $\text{s-lim}\ l_n = l$ and $x_n \to x$. Then $l_n(x_n) \to l(x)$. Does this still hold, if $\text{s-lim}\ l_n = l$ and $x_n \rightharpoonup x$?

We use the following definitions for strong and weak convergence: if $l(x_n) \to l(x)$, we say that $x_n$ converges weakly to $x$ and we write $x_n \rightharpoonup x$. Furthermore, we have $\text{s-lim} \ l_n = l$ iff $l_n(x) \to l(x)$.

My answer to the first question: we look at

$$\lVert l_n(x_n) - l(x) \rVert \leq \lVert l_n(x_n) - l(x_n)\rVert + \lVert l(x_n) - l(x)\Vert \leq \lVert l_n(x_n) - l(x_n)\rVert + \lVert l \rVert \lVert x_n - x \rVert \to 0$$

where we have used the strong convergence $\text{s-lim}\ l_n = l$ for the first and the norm convergence $x_n \to x$ for the second summand.

Now, based on my approach and the definitions I have given, the second question also has to be true. But I am a little bit unsure about that and I think someone really has to pay attention to the details when it comes to dealing with weak and strong convergence. Could anyone maybe help me with that?

1 Answers1

1

The estimate you need is similar to what you did. You have \begin{align} |l_n(x_n)-l(x)| &\leq |l_n(x_n)-l_n(x)|+|l_n(x)-l(x)|\\[0.2cm] &\leq\|l_n\|\,\|x_n-x\|+|l_n(x)-l(x)|. \end{align} Now, because a weak$^*$-convergent sequence is bounded, there exists $c>0$ with $\|l_n\|\leq c$. This gives us \begin{align} |l_n(x_n)-l(x)| &\leq c\,\|x_n-x\|+|l_n(x)-l(x)|. \end{align} Then \begin{align} \limsup_n|l_n(x_n)-l(x)| &\leq \limsup_n c\,\|x-x_n\|+|l(x_n)-l(x)|=0. \end{align} This proves that the limit exists and $\lim_n|l_n(x_n)-l(x)|=0$.

When $x_n\rightharpoonup x$, the result can fail. For instance let $X=c_0$, and consider the canonical basis $e_n$. Then $e_n\rightharpoonup 0$. Consider also $e_n\in \ell^1=c_0^*$. This gives us the functionals $l_n(x)=x_n$. Given any $x\in c_0$, $$ l_n(x)=x_n\to0, $$ so $l_n\to0$ in the weak$^*$-topology. But $l_n(e_n)=1$ for all $n$.

Martin Argerami
  • 217,281