$1-1$ functions

General Mathematics
Post Reply
User avatar
Tolaso J Kos
Administrator
Administrator
Posts: 867
Joined: Sat Nov 07, 2015 6:12 pm
Location: Larisa
Contact:

$1-1$ functions

#1

Post by Tolaso J Kos »

Prove that every function \( f:\mathbb{Q} \rightarrow \mathbb{Q} \) can be written as the sum of two \( 1-1 \) functions \( g, h: \mathbb{Q} \rightarrow \mathbb{Q} \).
Imagination is much more important than knowledge.
Demetres
Former Team Member
Former Team Member
Posts: 77
Joined: Mon Nov 09, 2015 11:52 am
Location: Limassol/Pyla Cyprus
Contact:

Re: $1-1$ functions

#2

Post by Demetres »

Let \(q_1,q_2,\ldots\) be an enumeration of the rationals. Suppose we have already defined \(g,h\) on \(q_1,\ldots,q_k\) such that their sum is equal to \(f\) on those points and they are 1 to 1 so far.

When defining \(g\) and \(h\) on \(q_{k+1}\) it is enough to pick any \(q \in \mathbb{Q}\) such that \(q \notin \{g(q_1),\ldots,g(q_k)\}\) and \(f(q) - q \notin \{h(q_1),\ldots,h(q_k)\}\). We then take \(g(q_{k+1}) = q\) and \(h(q_{k+1}) = f(q)-q\). This is possible as there are only \(2k\) bad choices for \(q\).
Post Reply

Create an account or sign in to join the discussion

You need to be a member in order to post a reply

Create an account

Not a member? register to join our community
Members can start their own topics & subscribe to topics
It’s free and only takes a minute

Register

Sign in

Who is online

Users browsing this forum: No registered users and 8 guests