Conservation of completeness by uniformly continuous bijection

h-simplex
Messages
2
Reaction score
0

Homework Statement


I want to prove this proposition:

Let f: M \rightarrow N be a uniformly continuous bijection between metric spaces. If M is complete, then N is complete.

The Attempt at a Solution


I have a 'partial' solution, whose legitimacy hinges upon a claim that I am unable to prove, namely that the inverse of a uniformly continuous bijection is uniformly continuous.

Assuming that is true, here goes my 'proof':
Let (y_n) be a Cauchy sequence in N. Then, since f^{-1} is uniformly continuous, (f^{-1}(y_n)) is Cauchy in M; since M is complete, there exists a \in M such that f^{-1}(y_n) \rightarrow a. Hence by continuity of f, we have f(f^{-1}(y_n)) = y_n \rightarrow f(a) \in N. Thus N is complete.

The above proof seems very 'natural' ... but as I mentioned, it hinges on something I am unable to prove, or disprove. So is my claim correct and if so how can I prove it? If not... well then I have no idea how to prove the original claim; this was my best idea.
 
Physics news on Phys.org
I would try to find a counterexample for both statements (that is: "uniform continuous images of complete spaces are complete" and "uniform continuous bijections are uniform isomorphisms"). I doubt that they are true.
 
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