Does the product rule fn->f , gn->g imply fngn->fg in (C[0,1],||.||)?

cummings12332
Messages
38
Reaction score
0

Homework Statement


the product rule fn->f , gn->g implies fngn->fg true in the normed
vector space (C[0,1],||.||) depends on the the norm||.||. Give a proof or a
counterexample for (C[0,1],||.||infinite),(C[0,1].||.||1)

Homework Equations


counterexample , you may wish to examine the case f=g=0 and choose fn=gn for
some piecewise linear functions.

The Attempt at a Solution


what i did for (||.|| infinite) is that ||fn||->||f||, ||gn||->||g|| ,then (||fn||-||f||)*(||gn||-||g||)->0 ,||g||(||fn||-||f||)->0,||f||(||gn||-||g||)->0
then get (||fn||-||f||)*(||gn||-||g||)+||g||(||fn||-||f||)+||f||(||gn||-||g||)=||fn||*||gn||-||f||*||g||->0
therefore ||fn||*||gn||->||f||*||g||
for it is infinite so we get ||fn|||*||gn||=max|fn|*max|gn|=max|fn||gn=max|fngn|=||fngn|| and ||f||*||g||=||fg|| ( by definition of norm) so ||fn*gn||->||fg||
i don't know it is right or wrong

and by the (C[0,1],||.||1) i have no idea to get the counterexample
 
Last edited:
Physics news on Phys.org
How would you prove the "product rule" for convergent sequences of real numbers? i.e how do you prove, given a_n\rightarrow a\in\mathbb{R} and b_n\rightarrow b\in\mathbb{R}, that a_nb_n\rightarrow ab? Notice that |\cdot| is a norm on the real vector space \mathbb{R}.

What part of that proof (if any) goes wrong if you try to apply it to the normed vector spaces that you're working with?
 
gopher_p said:
How would you prove the "product rule" for convergent sequences of real numbers? i.e how do you prove, given a_n\rightarrow a\in\mathbb{R} and b_n\rightarrow b\in\mathbb{R}, that a_nb_n\rightarrow ab? Notice that |\cdot| is a norm on the real vector space \mathbb{R}.

What part of that proof (if any) goes wrong if you try to apply it to the normed vector spaces that you're working with?

i proved the product rule by an->a bn->b then (an-a)(bn-b)->0 and a(bn-b)->0 b(an-a)->0 i.e. (an-a)(bn-b)+a(bn-b)+b(an-a)=anbn-ab->0 . should i prove that ||fn||*||gn||->||f||*||g|| instead of ||fngn||->||fg||? but if it is , i don't know what is the differences for the case for index infinite and index 1?
 
I don't see anywhere that you are using the difference between those norms and the usual norm on functions.

What is the precise definition of those norms?
 
HallsofIvy said:
I don't see anywhere that you are using the difference between those norms and the usual norm on functions.

What is the precise definition of those norms?

for ||fn||1 that is the sum of |fn| , for ||fn||infinte that is the max of |fn|
 
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...
Back
Top