If we have that $f:U\rightarrow \mathbb{R}$ where $U$ is open and $U\subset\mathbb{R}$ and $f$ is continuous and injective I want to show that $f(U)$ is open.

So I have considered the function restricted to $f:U\rightarrow f(U)$ so that it is a bijection.

I've had a few thoughts on this but not really gotten anywhere. I thought about just considering the map on an open balls so that the iamge had to be connected and then try to show that these are open but this didnt really get me anywhere.

I feel that I might be supposed to use the intermediate value theorem as this is the $1$ dimensional case of part of the invariance of dimension theorem for euclidean spaces, the proof of which relies on the Brower fixed point theorem.

I would prefer a hint as to how to do this, unless of course it is really simple and I am being very stupid.

Thanks very much for any help.

  • $\begingroup$ Think of $f(x)=x$ and $U=[-1,1]$. $\endgroup$
    – Yai0Phah
    Jan 7 '13 at 11:20
  • $\begingroup$ I assume you want $U$ to be an open interval of $\Bbb R$, or at least an open subset of $\Bbb R$? $\endgroup$ Jan 7 '13 at 11:21
  • $\begingroup$ I think f will be monotonic. $\endgroup$
    – Koushik
    Jan 7 '13 at 11:26
  • $\begingroup$ doesn't it follow from intermediate property $\endgroup$
    – Koushik
    Jan 7 '13 at 11:29
  • $\begingroup$ @OlivierBégassat Yeah thanks I've edited it now. $\endgroup$
    – hmmmm
    Jan 7 '13 at 11:37

It sufficies to show that for any $a,b\in \mathbb R$ with $a<b$, $f(a,b)$ is an open interval.

Since $f$ is continuous, $f[a,b]$ is compact and connected in $\mathbb R$, hence $f[a,b]=[c,d]$, for some $c,d\in \mathbb R$, let us see $f(x)\neq d$ for all $x\in (a,b)$. Suppose $d=f(x)$ for some $x\in (a,b)$, then since $f$ is injective $f(a)<d$ and $f(b)<d$, hence we can choose $r\in (c,d)$ such that $f(a)<r$ and $f(b)<r$. Then by the intermediate value theorem there is $y\in (a,x)$ such that $f(y)=r$ and there exists $z\in(x,b)$ with $f(z)=r$, contradicting the injectivity of $f$. Thus $f(x)\neq d$ for all $x\in (a,b)$. Similarly $f(x)\neq c$ for all $x\in (a,b)$. Hence $f(a,b)=(c,d)$, since $f(a,b)$ is connected and $f[\{a,b\}]=\{c,d\}$.


A continuous, injective function $f: \mathbb{R} \to \mathbb{R}$ is either strictly increasing or strictly decreasing.

f must be monotonic by intermediate value theorem.so it maps an open set which must be a collection of open intervals to a open set.

  • 2
    $\begingroup$ This is false. Consider $f : \mathbb{R} \setminus \{ 0 \} \to \mathbb{R}$ given by $f(x) = \frac{1}{x}$. This is continuous and injective but not monotonic. It is true when the domain of $f$ is a connected open subset of $\mathbb{R}$, but this is not a hypothesis here. $\endgroup$ Jan 7 '13 at 11:35
  • $\begingroup$ @CliveNewstead yeah but can we not consider the basis of open balls which are connected and so if f maps an open ball to another open set then we just take the union of these. $\endgroup$
    – hmmmm
    Jan 7 '13 at 11:38
  • $\begingroup$ @hmmmm: What does the fact that the basis sets are connected have to do with it? The union of connected sets might not be connected. For example, $(0,1)$ and $(2,3)$ are connected but $(0,1) \cup (2,3)$ is disconnected. Your function must be monotonic on its connected components, but it needn't be monotonic on the whole domain $-$ between the connected components it can jump around and change direction all it likes! I mean, seeing is believing $-$ I've shown you a non-monotonic continuous injection! $\endgroup$ Jan 7 '13 at 11:40
  • 1
    $\begingroup$ ...but you can still use the result in K.Ghosh's answer by considering the restrictions of $f$ to the connected components of its domain separately. $\endgroup$ Jan 7 '13 at 11:41
  • $\begingroup$ @CliveNewstead sorry what I meant was consider the function $f$ acting on the basis of open balls of $U$. Each open balls is connected and so then apply the result to each open ball. Just like you were saying with the connected components? $\endgroup$
    – hmmmm
    Jan 7 '13 at 11:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.