A subset in R^n is bounded if and only if it is totally bounded.

  • Thread starter Thread starter bobby2k
  • Start date Start date
  • Tags Tags
    Bounded
bobby2k
Messages
126
Reaction score
2

Homework Statement


Prove that a subset in R^n, where n is a finite number, is bounded if and only if it is totally bounded.

Homework Equations


If A is the subset, A is bounded if there is a point b in R^n such that d(x,b)<= K, for a every x in A.

A is totally bounded if for every e> 0, there is a finite number of ball with radius e, that covers A.

The Attempt at a Solution



totally bounded -> bounded

Chose a number e, there is a finite number P of open balls that cover A, each with radius e.
Chose an element b in A. s=sup{d(b,l): l is the center of the balls} must exist since we only have finite amount of balls. Then the max distance from b to another point in A is s+e, and hence A is bounded.
Is this proof correct for this implication?

bounded -> totally bounded
There is an element in R^n such that for any element x in A d(x,b) <= K, for a real number K.
I do not see how to proceed here?
Since Q^n is dense I guess that if we make balls with radius epsilon around every element in R^n that is rational we have a countable number of balls that cover A?, then the problem is to reduce it to a finite number of balls?
 
Last edited:
Physics news on Phys.org
bobby2k said:
bounded -> totally bounded
There is an element in R^n such that for any element x in A d(x,b) <= K, for a real number K.
I do not see how to proceed here?
Since Q^n is dense I guess that if we make balls with radius epsilon around every element in R^n that is rational we have a countable number of balls that cover A?, then the problem is to reduce it to a finite number of balls?
I like your thinking, simply because it shows you're actually thinking about this, but I don't think that will work.

Since ##A## is bounded, can we make ##A\subseteq B_K##, where ##B_K=\{x\in\mathbb{R}^n:d(b,x)\leq K\}##?
 
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