Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to prove that for any function $f: \mathbb{R} \rightarrow \mathbb{R}$ there exist two injections $g,h \in \mathbb{R}^{\mathbb{R}} \ : \ g+h=f$.

Could you help me?

share|cite|improve this question
Are you familiar with transfinite induction? – Brian M. Scott Jan 14 '13 at 21:00
up vote 3 down vote accepted

Note that it suffices to find an injection $g$ such that $f+g$ is also an injection, as $f$ can then be written as the sum $(f+g)+(-g)$. Such a $g$ can be constructed by transfinite recursion.

Let $\{x_\xi:\xi<2^\omega\}$ be an enumeration of $\Bbb R$. Suppose that $\eta<2^\omega$, and we’ve defined $g(x_\xi)$ for all $\xi<\eta$ in such a way that $g(x_\xi)\ne g(x_\zeta)$ and $(f+g)(x_\xi)\ne(f+g)(x_\zeta)$ whenever $\xi<\zeta<\eta$. Let




Then $|S_\eta\cup T_\eta|<2^\omega$, so we may choose $g(x_\eta)\in\Bbb R\setminus(S_\eta\cup T_\eta)$. Clearly $g(x_\eta)\ne g(x_\xi)$ for $\xi<\eta$, since $g(x_\eta)\notin S_\eta$. Moreover, $g(x_\eta)\notin T_\eta$, so for each $\xi<\eta$ we have $g(x_\eta)\ne(f+g)(x_\xi)-f(x_\eta)$ and hence $(f+g)(x_\eta)\ne(f+g)(x_\xi)$. Thus, the recursion goes through to define $g(x_\xi)$ for all $\xi<2^\omega$, and it’s clear from the construction that both $g$ and $f+g$ are injective.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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