Topology - Use Componentwise Convergence Criterion to prove closed ball closed.

t00dles23
Messages
13
Reaction score
0

Homework Statement


Let r be a positive number and define F = {u in R^n | ||u|| <= r}. Use the Componentwise Convergence Criterion to prove F is closed.

Homework Equations


The Componentwise Convergence Criterion states: If {uk} in F converges to c, then pi(uk) converges to pi(c). That is, the ith component of the sequence converges to the ith component of c.

The Attempt at a Solution


What we want to show is that if {uk} in F converges to c, then ||c|| <= r.

It's easy to show it without the componentwise convergence criterion, as follows:
||c|| <= ||c - uk|| + ||uk||. Taking the limit as k goes to infinity, we get ||c|| <= 0 + ||uk|| <= r. But I need a proof that does use the CCC.

I tried this:
Suppose {uk} in F converges to c. Then pi(uk) converges to pi(c) by the componentwise convergence criterion. So:
|pi(uk)| <= ||uk|| <= r
Taking the limit as k goes to infinity, we get
|pi(c)| <= r
(pi(c))^2 <= r^2
\sum_{i=1}^{n} (p_{i}(c))^2 \leq \sum_{i=1}^{n} r^2
\sqrt{\sum_{i=1}^{n} (p_{i}(c))^2} \leq \sqrt{nr^2}
||c|| <= (n)^(1/2)*r

but this isn't a strong enough statement, because I need ||c|| <= r. Advice please?
 
Physics news on Phys.org
If pi(uk) --> pi(c) for every i, then what happens to the sequence

\sqrt{\sum_{i=1}^n{p_i(u_k)^2}}

as k goes to infinity? To which number does this sequence converge?
 
I don't think I understand your hint. I mean sure, ||u_k|| --> ||c||. But I don't know what that does for me. It seems to just point back to the proof using ||c|| and the triangle inequality, but that doesn't use the componentwise convergence criterion. Can you elaborate?
 
Nevermind. I understand now. Thank you for your hint.
 
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