Spivak Calculus, 4th ed., problem 3-17:
If $f(x)=0$ for all $x$, then $f$ satisfies $f(x+y)=f(x)+f(y)$ for all $x$ and $y$, and also $f(x\cdot y ) =f(x)\cdot f(y)$ for all $x$ and $y$. Now suppose that $f$ satisfies these two properties, but that $f(x)$ is not always $0$. Prove that $f(x)=x $ for all $x$, as follows:
- Prove that $f(1)=1.$
- Prove that $f(x)=x$ if $x$ is rational.
- Prove that $f(x)>0$ if $x>0$. (This part is tricky, but if you have been paying attention to the philosophical remarks in accompanying the problems in the last two chapters, you will know what to do.)
- Prove that $f(x)>f(y)$ if $x>y$.
- Prove that $f(x)=x$ for all $x$. Hint: Use the fact that between any two numbers there is a rational number.
Parts 1 and 2 are fine with me, but with 3, I'm not exactly sure what he's looking for. Some kind of a pre-continuity continuity argument...anyone have any ideas? I'm also not sure about part 5.
Note that the completeness of the real numbers has not yet been defined, nor has continuity been defined.