Convergence with L2 norm functions

tom_rylex
Messages
9
Reaction score
0

Homework Statement


(I'm posting this because my proofs seem to be lousy. I want to see if I'm missing anything.)
Show that if f_n \in L^2(a,b) and f_n \rightarrow f in norm, then <f_n,g> \rightarrow <f,g> for all g \in L^2(a,b)

Homework Equations


L^2(a,b) is the space of square-integrable functions,
{f_n} is a finite sequence of piecewise continuous functions, and
< , > is the inner product


The Attempt at a Solution



I started with a linear combination of inner products and applied the Cauchy Schwarz inequality:
\vert &lt;f_n - f,g&gt; \vert \leq \Vert f_n - f \Vert \Vert g \Vert
By the definition of norm convergence, I have
\Vert f_n - f \Vert \rightarrow 0, which means that
\vert &lt;f_n - f,g&gt; \vert \rightarrow 0
Since this is absolutely convergent, that means that
&lt;f_n,g&gt; - &lt;f,g&gt; is also convergent to 0. So therefore,
&lt;f_n,g&gt; -&lt;f,g&gt; \rightarrow 0
&lt;f_n,g&gt; \rightarrow &lt;f,g&gt;

Is that reasonable? Or am I missing something?
 
Physics news on Phys.org
I suggest going from <fn - f , g> ---> 0 to <fn , g> - <f , g> ---> 0 more explicitly.
 
As in:
<fn-f,g> --> 0 (absolutely convergent series are convergent)
<fn,g> - <f,g> --> 0 (linearity property wrt the first variable for inner products)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top