0

Let $\phi:\mathbb{R} \rightarrow \mathbb{R}$ be a ring homomorphism onto. Prove or disprove: $\phi(r)=r$ for all $r\in \mathbb{R}.$

Attempt: I believe it is true! Since $\phi(1)=\phi(1\cdot 1)=\phi(1)^2$ we get $\phi(1)=1$, since $\phi$ is onto. Then quite easily we get $\phi(m)=m$ for $m\in \mathbb{Z}$ and $\phi(q)=q$ for $q\in \mathbb{Q}$. How do we go on from this point, to conclude for $\mathbb{R}$?

quid
  • 42,135
Nikolaos Skout
  • 5,329
  • 2
  • 16
  • 40

2 Answers2

2

Notice that if $a\leq b$, then $b-a\geq 0$, hence there exists a $c\in \mathbb{R}$ such that $c^2=b-a$, thus $\phi(b-a)=\phi(c^2)=\phi(c)^2\geq 0$, it follows that $\phi(b)\geq \phi(a)$. Hence $\phi$ is order preserving. Now any $r\in \mathbb{R}$ is equal to $\sup_{q\in \mathbb{Q}, q< r}q=r=\inf_{q\in \mathbb{Q}, q>r}q$. Hence $$\sup_{q\in \mathbb{Q}, q< r} \phi(q) \leq r \leq \inf_{q\in \mathbb{Q}, q>r}\phi(q).$$ Using that $\phi$ is order preserving, we find that $\phi(r)=r$ for all $r\in\mathbb{R}$.

Edit: I nowhere used continuity of $\phi$, this is not needed. However I do use the supremum property of $\mathbb{R}$.

1

Let $r\in\mathbb{R}$, and suppose by contradiction that $f(r)\neq r $. Then there are disjoint neighbourhoods $V,U$ of $f(r),r$ respectively.

Using the continuity, there is a neighbourhood $W$ of $r$ such that $f(W)\subset V$.

Consider $q\in U\cap W$ such that $q\in\mathbb{Q}$. Then on one hand, $f(q)=q\in U$ and on the other hand, $f(q)\in V$, but $V\cap U=\emptyset$.

Hence $f(r)=r$.

ChanaG
  • 325