| New Reply |
Completeness of R^2 with sup norm |
Share Thread |
| Mar10-12, 04:57 AM | #1 |
|
|
Completeness of R^2 with sup norm
1. The problem statement, all variables and given/known data
Given that R is complete, prove that R^2 with the sup norm is complete 2. Relevant equations 3. The attempt at a solution How may I tackle this? Thanks |
| Mar10-12, 05:12 AM | #2 |
|
|
Start with a Cauchy sequence in R^2?
|
| Mar10-12, 08:37 AM | #3 |
|
|
by definition we have ##||x_n-x||_\infty=sup(|x_n(1)-x(1)|,|x_n(2)-x(2)|)## for ##n \in \mathbb{N}## ie ##||x_n-x||_\infty \to 0## as ##n \to \infty##. We need to show that ##x_n(1) \to x(1)##. Since ##x_n## is Cauchy, ##\exists n_0 \in N## s.t. ##||x_n-x||_\infty < \epsilon \forall n \ge n_0## we have that ##|x_n(1)-x(1)| < \epsilon/2 \forall n_1 \ge n_0## and ##|x_n(2)-x(2)| < \epsilon/2 \forall n_2 \ge n_0## ##\implies |x_n-x| < \epsilon/2 + \epsilon/2 < \epsilon##...........? Not sure if this right or how to complete it? Thanks |
| Mar10-12, 01:05 PM | #4 |
|
|
Completeness of R^2 with sup norm
Where did your x come from?
Cauchy means for all r>0, there exists a natural number p such that for all m,n>p, d(x_m,x_n) < r. In this case, max{|xn(1)-xm(1)|,|xn(2)-xm(2)|}<r for all n,m>p |
| Mar12-12, 05:15 AM | #5 |
|
|
|
| Mar12-12, 10:59 AM | #6 |
|
|
I thought x_n was your arbitrary Cauchy sequence. You have an x_n and an x in your post.
|
| Mar12-12, 02:07 PM | #7 |
|
|
|
| Mar12-12, 05:25 PM | #8 |
|
Mentor
|
What is x(1) and x(2)? It looks like you're thinking that ##x(1)=\lim_n x_n(1)## and similarly for (2). But what makes you think that these limits exist?
|
| Mar13-12, 02:21 AM | #9 |
|
|
Now, that you mention it, I guess I dont know whether they exist but its seems to be a pattern I've seen when writing these proofs. Ie, assume x_n converges to x and continue. That's all I've done here!... |
| Mar13-12, 03:39 AM | #10 |
|
Mentor
|
So you think you can prove that xn→x by assuming that xn→x? If this had made sense, we could prove any statement by just assuming that it's true.
|
| Mar13-12, 05:34 AM | #11 |
|
|
|
| Mar13-12, 05:55 AM | #12 |
|
Mentor
|
Which sequence? If you mean ##\langle x_n\rangle##, then no, it's not valid, because you're assuming what you're trying to prove. If you mean ##\langle (x_n)_1\rangle## and ##\langle (x_n)_2\rangle##, then my question is, have you proved that these sequences are Cauchy?
|
| Mar13-12, 02:32 PM | #13 |
|
|
Proof. given ##\epsilon >0## ##\exists n_0 \in \mathbb{N}## s.t. ##\forall n,m > n_0## then ##||x_n-x_m|| < \epsilon## Suppose x_n converges to L and let ε>0 be given. Then ##\exists n_0 in N## s.t. ##|x_n-L| < \epsilon/2 \forall n \ge n_0## Let any integer ##m \ge n## be given. since ##m \ge n \ge n_0## then ##|x_m-L| < \epsilon/2## By the triangle inequality ##|x_n-x_m|=|(x_n-L)+(L-x_m)| \le |x_m -L|+|x_n-L| < \epsilon/2+\epsilon/2 < \epsilon \implies x_n## is Cauchy If I have correctly proven this is Cauchy, what is the next step? |
| Mar13-12, 03:16 PM | #14 |
|
Mentor
|
If you delete everything before the word "suppose" (in particular the part where you assume what you want to prove), then what we have left is a correct proof of the claim that every convergent sequence in ℝ is Cauchy. But this doesn't seem to be relevant to the problem you're trying to solve.
You need to start with an arbitrary sequence in ##\mathbb R^2## that's Cauchy with respect to the ∞-norm, and then use the fact that it's Cauchy with respect to the ∞-norm to learn something else about it, something you can use to prove that it's convergent with respect to the ∞-norm. |
| Mar13-12, 03:29 PM | #15 |
|
|
Bugatti79, you need to develop a strategy to work a problem like this. You are trying to show ##R^2## is complete, meaning every Cauchy sequence in ##R^2## converges to a point in ##R^2##. What you have to work with is that ##R## is complete. So you start with a Cauchy sequence ##\{x_n = (x_n(1),x_n(2))\}## like you did. You are trying to find an ##x=(x(1),x(2))\in R^2## such that ##x_n\to x##. If you could show ##x_n(1)## and ##x_n(2)## converged to something, maybe that something would do for ##x##. How might you show they converge? If they do, how could show that their limits could be used for ##x##? You have been working on relevant material recently.
|
| Mar14-12, 01:26 PM | #16 |
|
|
ie, we need to find ##n_0 \in N## s.t ##|x_n(1)-x(1)| < \epsilon \forall n > n_0## Since we know ##x_n \to x \in R^2, || ||_\infty## we know ##\exists n_0 \in N## s.t ##||x_n-x||_\infty < \epsilon \forall n \ge n_0## ie ##||(x_n(1)-x(1), x_n(2)-x(2))||_\infty < \epsilon## We have that ##|x_n(1)-x(1)| \le max (|x_n(1)-x(1)|, |x_n(2)-x(2)|) < \epsilon## This shows ##x_n(1) \to x(1)## as ##n \to \infty## Similarly We have that ##|x_n(2)-x(2)| \le max (|x_n(1)-x(1)|, |x_n(2)-x(2)|) < \epsilon## This shows ##x_n(2) \to x(2)## as ##n \to \infty## Now, conversely assume ##x_n(1) \to x(1)## and ##x_n(2) \to x(2)## Need to show that ##x_n \to x in R^2, || ||_\infty##. Need to find ##n_0 \in N## s.t. ##||x_n-x||_\infty \forall n \ge n_0## but we know that ##x_n(1) \to x(1), \exists n \in N## s.t. ##|x_n(1)-x(1)| < \epsilon/2 \forall n \ge n_1## and ##|x_n(2)-x(2)| < \epsilon/2 \forall n \ge n_2## Take ##n_0=max(n_1,n_2)##. Then ##\forall n > n_0## we have ##||x_n-x||_\infty=max(|x_n(1)-x(1)|,|x_n(2)-x(2)|) < \epsilon/2 + \epsilon/2 < \epsilon## Therefore ##x_n \to x \implies## R^2 with the sup norm is complete...? It looks like it is similar to the other question I answered in my other post..? |
| Mar14-12, 01:58 PM | #17 |
|
|
|
| New Reply |
Similar discussions for: Completeness of R^2 with sup norm
|
||||
| Thread | Forum | Replies | ||
| Norm of operator vs. norm of its inverse | Calculus | 3 | ||
| Proof that norm of submatrix must be less than norm of matrix it's embedded in | Calculus & Beyond Homework | 2 | ||
| Prove that the dual norm is in fact a norm | Calculus & Beyond Homework | 2 | ||
| How do i determine if a rock is qtz-norm, ol-norm, hy-norm or ne-norm? | Earth | 1 | ||
| Completeness in l^\infty Norm | Calculus & Beyond Homework | 2 | ||