Show that a distance preserving map T:X->X is onto

  • Thread starter Thread starter Ratpigeon
  • Start date Start date
  • Tags Tags
    Map
Ratpigeon
Messages
52
Reaction score
0

Homework Statement



I'm trying to show that a distance preserving map is 1:1 and onto. The 1:1 part was easy, but I'm stuck on proving it's onto...

Homework Equations



X is compact
T(X)\subseteqX
THere's a hint saying to consider a point y in X\T(X) and consider the minimum distance
between y and x\in T(X) (the infinum of d(x,y) for all x\in T(X) where d is an undefined metric, and call it deltA)
Then it says to consider the sequence
yn=Tn(y)

The Attempt at a Solution



Because X is compact, and yn is a subset of X, it must be bounded (I think?) and have a convergent subsequence, and inf(d(T^n(y),T^n(x))=delta for all n (and x_n=T^n(x) will also have a convergent subsequence). Show that the limits of y_n and x_n provide a contradiction?
 
Physics news on Phys.org
I'm really not sure where that hint is supposed to lead. Here is an alternative hint. You know X can be covered by a finite number of open balls of radius delta/2. Let N be the minimum number of open balls of radius delta/2 you need to cover X. Now throw away a ball containing x. It's doesn't intersect f(X). That means f(X) can be covered by N-1 balls. Do you see a problem looming here? Think about inverse images.
 
Is the next step something like:
Take a=sup(T(x'),T(x)) and because X is compact, it is closed, therefore using distance preservation of T there exists at least on x in X such that
d(x',x)=a
then lead this to contradiction?
 
Ratpigeon said:
Is the next step something like:
Take a=sup(T(x'),T(x)) and because X is compact, it is closed, therefore using distance preservation of T there exists at least on x in X such that
d(x',x)=a
then lead this to contradiction?

I don't see what contradiction that leads to.
 
Sorry - that one was completely off track, but I think I got it out now, thanks
 
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