technical note

§ It Suffices to Check for Weak Convergence on a Spanning Set.

created 2023-08-06 · last edited 2023-09-22
  • Theorem: suppose x[i]x[i]x[i] is a bounded sequence in XXX. Then, to check that x[i]→wLx[i] \to_w Lx[i]→w​L, it suffices to check on a spanning set A⊆XA \subseteq XA⊆X such that closure(span(A))=Xclosure(span(A)) = Xclosure(span(A))=X.
  • Proof: first, it easily suffices for linear combinations by triangle inequality.
  • Next, to show it suffices for closures, we wish to show that h(x[n])→h(L)h(x[n]) \to h(L)h(x[n])→h(L) given that g(x[n])→g(x)g(x[n]) \to g(x)g(x[n])→g(x)for all g∈span(A)g \in span(A)g∈span(A).
  • Let h=lim⁡jg[j]h = \lim_j g[j]h=limj​g[j] for some g[j]∈X⋆g[j] \in X^\starg[j]∈X⋆.
  • Let us bound ∣h(x[n])−h(L)∣|h(x[n]) - h(L)|∣h(x[n])−h(L)∣.
  • This is equal to ∣h(x[n])−g[j](x[n])+g[j](x[n])+g[j](L)−g[j](L)−h(L)|h(x[n]) - g[j](x[n]) + g[j](x[n]) + g[j](L) - g[j](L) - h(L)∣h(x[n])−g[j](x[n])+g[j](x[n])+g[j](L)−g[j](L)−h(L)
  • Rearranging: ∣(h(x[n])−g[j](x[n]))+(g[j](x[n])−g[j](L))+(g[j](L)−h(L))∣|(h(x[n]) - g[j](x[n])) + (g[j](x[n]) - g[j](L)) + (g[j](L) - h(L))|∣(h(x[n])−g[j](x[n]))+(g[j](x[n])−g[j](L))+(g[j](L)−h(L))∣.
  • We bound each pair: ∣h(x[n])−g[j](x[n])∣|h(x[n]) - g[j](x[n])|∣h(x[n])−g[j](x[n])∣ can be made arbitrary because g[j]→hg[j] \to hg[j]→h, and thus they are bounded pointwise since these are bounded linear functionals.
  • ∣g[j](x[n])−g[j](L)|g[j](x[n]) - g[j](L)∣g[j](x[n])−g[j](L) can be made arbitrarily small because we know that x[n]→wLx[n] \to_w Lx[n]→w​L on the set AAA.
  • The third term ∣g[j](L)−h(L))∣|g[j](L) - h(L))|∣g[j](L)−h(L))∣ can be made arbitrarily small because g[j]→hg[j] \to hg[j]→h and these are bounded linear functionals.
  • Thus we have shown that we can make stuff arbitrarily small, and we are done!
❦
Newer ৪ Blog ৪ Older