A friend has given me this task and asked for help. I immediately tried picking various $f$ and $g$ such that $g$ and $g\circ f$ are both surjective but $f$ is not. However, i always found myself restricting $\mathbb{R}$ to some subsets $A \subset \mathbb{R}$ in order to make it work. I can't figure out how to prove it for
$$ \mathbb{R} \xrightarrow{f} \mathbb{R} \xrightarrow{g} \mathbb{R}$$
Is it even possible? I also tried using sectionwise defined functions (different functions for $x \ge 0$ and $x < 0$). However, no success.
Any advise? I'm starting to assume that it's not possible for $\mathbb{R}$ without any restrictions.
Thanks for any help!
for every positive $x \in \mathbb{R}$ you get $f(g(x)) = x$.
so we have $(f \circ g)(x) = 1$ for all $x \le 0$ and $(f \circ g)(x) = x$ for all $x > 0$, i dont think this is surjective tbh. There is no $x$ such that $(f \circ g)(x) = -3$ for example.
– Zest Nov 17 '18 at 23:53