Does there exist a continuous function f : R 2 → R that is also injective?
An injective function is one-to-one, meaning that no element of the range is the image of more than one element of the domain.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
See the comments for how this problem generalizes to different dimensions. Even though it sounds object that we cannot inject a higher dimension space into a lower dimension, the rigorous proof requires some work.
Can we similarly say that any continuous map from R n to R m would not be injective if n > m ?
If m = 1 the proof above works. Otherwise, I don't see a way to adapt this proof.
Btw, in the last line I think you meant R 2 ∖ { ( 0 , 0 ) } rather than R ∖ { ( 0 , 0 ) } .
Log in to reply
The is a deep result called Invariance of Domain, which states that if f : R n → R n is continuous and injective, and if U ⊆ R n is open, then V = f ( U ) is open, and indeed f : U → V is a homeomorphism.
Thus, if f : R n → R m were continuous and injective, with m < n , then g would be a continuous injective map from R n to itself, where g ( x ) = ( f ( x ) , 0 , 0 , … , 0 ) Thus, if U were an open subset of R n , then g ( U ) would be an open subset of R n , which is not possible (consider the last n − m components, which are all 0 ).
Thus no continuous injection exists from a Euclidean space to another one of smaller dimension.
Log in to reply
Right. This (Invariance of Domain) was said as a passing remark in our Analysis class. I hadn't paid much attention to it as we never saw any applications.
I think this is a result in algebraic topology right?
Log in to reply
@Deeparaj Bhat – Yes. First proved by Brouwer, of the Fixed Point Theorem.
This is a very cool proof. Some people initially told me that one would need that f is of class C 1 , but then it seemed to me that it would be very weird if such a function is even just continuous.
What is R^2 can you please tell me?
I answered yes because of the Hilbert space-filling curve. Isn't this curve a continuous bijection between R^2 and R? What am I missing?
Log in to reply
A space-filling curve is a continuous surjection from R to R 2 . It cannot be injective.
Log in to reply
Thanks. This has more details if anybody else is interested. http://math.stackexchange.com/questions/29732/in-what-way-is-the-peano-curve-not-one-to-one-with-0-12
Can anyone tell me in what class you are?
Log in to reply
Mark is probably not in school anymore. He's 57, so..
Relevant wiki: Borsuk Ulam Theorem
The restriction g = f ∣ S 1 of a continuous function f to the unit circle is continuous.
Therefore, by the one-dimensional Borsuk-Ulam theorem, there are antipodal points x , − x ∈ S 1 such that g ( x ) = g ( − x ) , so f ( x ) = f ( − x ) . If f were injective, then this would imply x = − x , so 0 = x ∈ S 1 , which is absurd, so f cannot be injective.
Note that the one-dimensional instance of the Borsuk-Ulam theorem is basically the intermediate value theorem, but I've referenced it here since it provides a very nice generalization to higher dimensions.
I also want to point out that the dual form of the this question is also interesting, if not a fair bit harder. It is "Let f : R → R 2 be continuous. Can f be surjective?" [assuming the axiom of choice... otherwise, I believe it's undecidable]
This is an interesting proof too. I am guessing that this idea generalizes to n dimensions when you look at S n − 1 , like you said.
About the dual question, I think we can answer that positively with space filling curves.
Relevant wiki: Intermediate Value Theorem
Let's assume the contrary. Then, there exists a function f which is injective.
Let a = f ( 0 , 0 ) , b = f ( 1 , 0 ) . Without loss of generality, let's assume a < b . By intermediate value theorem, f restricted to { ( t , 0 ) ∣ 0 < t < 1 } assumes all values in the interval ( a , b ) . In particular, f assumes 2 a + b . Let 0 < ξ < 1 be such that f ( ξ , 0 ) = 2 a + b .
Now, let us look at d = f ( ξ , 1 ) . By injectivity of f , d ∈ / [ a , b ] . Without loss of generality, let's assume d > b . Then, similarly by looking at the restriction of f to { ( ξ , t ) ∣ 0 < t < 1 } assumes all values in the interval ( 2 a + b , d ) . In particular, it assumes b , which is a contradiction.
An interesting question:
What happens when we remove the condition that f is continuous?
Then we certainly have injections. We also have bijections.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Connected Space
Suppose that the continuous function f is injective. Let f ( 0 , 0 ) = c . If we define U = { x ∈ R 2 ∣ ∣ f ( x ) > c } V = { x ∈ R 2 ∣ ∣ f ( x ) < c } then U , V are disjoint open subsets of R 2 whose union is R 2 \ { ( 0 , 0 ) } .
If U = ∅ then f ( x ) < c for all x = ( 0 , 0 ) . Thus f ( 1 , 0 ) , f ( 0 , 1 ) < c . If f ( 1 , 0 ) < f ( 0 , 1 ) we can, using the intermediate value theorem , find 0 < u < 1 such that f ( u , 0 ) = f ( 0 , 1 ) , which is impossible. It is similarly impossible for f ( 1 , 0 ) > f ( 0 , 1 ) . Thus it is impossible for U to be empty. Similarly V is not empty. But this tells us that R 2 \ { ( 0 , 0 ) } is not connected, which is false. Thus f cannot be injective.