Class 12 Maths, Worked in Full Past papersGet updates
Chapter 1 · Relations and Functions

Example 9: f(x)=2xf(x)=2x on R\R⁠: bijective

ExamplesTypes of functions · Section 1.3
The question

Prove that the function f:R→Rf : \R \to \R⁠, given by f(x)=2xf(x) = 2x⁠, is one-one and onto.

Exam answer

One-one: Let x1,x2∈Rx_1, x_2 \in \R with f(x1)=f(x2)f(x_1) = f(x_2)⁠. Then

f(x1)=f(x2)⇒2x1=2x2⇒x1=x2\begin{aligned} f(x_1) = f(x_2) &\Rightarrow 2x_1 = 2x_2 \\ &\Rightarrow x_1 = x_2 \end{aligned}

Thus ff is one-one.

Onto: Let y∈Ry \in \R⁠. Then x=y2∈Rx = \frac{y}{2} \in \R and

f(y2)=2⋅y2=yf\left(\frac{y}{2}\right) = 2 \cdot \frac{y}{2} = y

So every y∈Ry \in \R has a pre-image. Thus ff is onto.

Hence ff is one-one and onto.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

Doubling can always be undone by halving, and on the real numbers halving is always possible. Undoing in one direction gives one-one (equal doubles come from equal numbers). Undoing in the other direction gives onto: to hit any target yy⁠, start from y2\tfrac{y}{2}⁠, which is a real number for every real yy⁠. This is the same formula as Example 8; the only change is that the domain is now R\R⁠, so y2\tfrac{y}{2} is always an allowed input.

Given, to show, and the plan
Given
The rule f(x)=2xf(x) = 2x⁠, with domain R\R and codomain R\R⁠.
To show
(a) ff is one-one. (b) ff is onto. (Together: ff is bijective.)
Plan
(1) Prove one-one for arbitrary reals x1,x2x_1, x_2⁠. (2) For an arbitrary y∈Ry \in \R⁠, find the candidate preimage by solving 2x=y2x = y⁠, then check it lies in the domain and really works. (3) Read the result off the graph, and conclude.

Basics you need

1One-one (injective)

f:X→Yf : X \to Y is one-one if for all x1,x2∈Xx_1, x_2 \in X⁠, f(x1)=f(x2)⇒x1=x2f(x_1) = f(x_2) \Rightarrow x_1 = x_2⁠. Basics: one-one and onto

2Onto (surjective)

f:X→Yf : X \to Y is onto if for every y∈Yy \in Y there exists x∈Xx \in X with f(x)=yf(x) = y⁠. To prove it, take an arbitrary yy and produce an xx that works, then check that xx belongs to XX⁠.

3Bijective

A function that is both one-one and onto is called bijective (Definition 7). Basics: what a function is

4Real numbers can always be halved

For every real number yy⁠, the number y2\tfrac{y}{2} is again a real number. (This is false in N\N⁠: 12∉N\tfrac12 \notin \N⁠. That is the whole difference from Example 8.)

5Proving a "for every" claim

Use a letter that could stand for any element and argue only with facts true of all of them. Basics: proving and disproving

Solution

  1. One-one: equal outputs force equal inputs

    Take arbitrary x1,x2∈Rx_1, x_2 \in \R with f(x1)=f(x2)f(x_1) = f(x_2)⁠. Then

    f(x1)=f(x2)⇒2x1=2x2⇒x1=x2.\begin{aligned} f(x_1) = f(x_2) &\Rightarrow 2x_1 = 2x_2 \\ &\Rightarrow x_1 = x_2. \end{aligned}

    (The second implication divides both sides by 2.)

    So no two different real numbers have the same double, and ff is one-one.

    We start from the hypothesis of Definition 5, f(x1)=f(x2)f(x_1) = f(x_2)⁠, and derive its conclusion, x1=x2x_1 = x_2⁠. Because x1,x2x_1, x_2 were arbitrary, the argument covers every pair of real numbers at once. Dividing by 2 is legitimate because 2≠02 \ne 0⁠.
    Cancellation law: if c≠0c \ne 0 and ca=cbca = cb⁠, then a=ba = b⁠. The step is word for word the same as in Example 8: one-one does not care whether the inputs are natural or real.
  2. Onto: find the candidate preimage by solving f(x)=yf(x) = y

    Take an arbitrary y∈Ry \in \R⁠. We want some x∈Rx \in \R with f(x)=yf(x) = y⁠, that is 2x=y2x = y⁠. Solving for xx⁠:

    2x=y⟹x=y2.2x = y \quad\Longrightarrow\quad x = \frac{y}{2}.

    This is only a candidate: we found what xx must be if it exists. Next we check it.

    Working backwards from the target is the natural way to discover a preimage. But the definition of onto asks us to exhibit an xx in the domain with f(x)=yf(x) = y⁠, so discovery must be followed by verification. The textbook writes only the verification: "there exists y2\frac{y}{2} in R\R such that f(y2)=2⋅(y2)=yf(\frac{y}{2}) = 2 \cdot (\frac{y}{2}) = y". This step shows where y2\frac{y}{2} comes from.
    To solve 2x=y2x = y⁠, divide both sides by 2 (allowed since 2≠02 \ne 0⁠).
  3. Onto: check the candidate is in the domain and works

    (i) In the domain? yy is real, so y2\tfrac{y}{2} is real: y2∈R\tfrac{y}{2} \in \R⁠. (ii) Does it work?

    f ⁣(y2)=2⋅y2=y.f\!\left(\frac{y}{2}\right) = 2 \cdot \frac{y}{2} = y.

    So every yy in the codomain R\R is the image of the element y2\tfrac{y}{2} of the domain. Hence ff is onto. For example, y=3y = 3 comes from x=1.5x = 1.5⁠, and y=−4y = -4 comes from x=−2x = -2⁠.

    −3−1123−6−2246y = 3(1.5, 3)y = −4(−2, −4)y = 2x
    The graph of y=2xy = 2x (the book's Fig 1.3). Every horizontal line y=cy = c meets it in exactly one point, at x=c2x = \tfrac{c}{2}⁠: "at least one" gives onto, "at most one" gives one-one. Two such lines are shown, y=3y = 3 and y=−4y = -4⁠.
    Part (i) is exactly where Example 8 failed: there the domain was N\N and 12∉N\tfrac12 \notin \N⁠. Over R\R⁠, halving never leaves the set, so the candidate is always admissible. Part (ii) confirms that the formula really produces yy⁠, so we are not relying on algebra we have not checked.
    On a graph, y0y_0 is in the range exactly when the horizontal line y=y0y = y_0 meets the graph. Onto means every horizontal line meets it; one-one means no horizontal line meets it twice. Basics: one-one and onto
  4. Conclude

    ff is one-one (Step 1) and onto (Step 3), so f:R→R, f(x)=2xf : \R \to \R,\ f(x) = 2x is one-one and onto, that is, bijective.

    The preimage found in Step 3 is unique (by Step 1), so the rule y↦y2y \mapsto \tfrac{y}{2} undoes ff⁠. This is the inverse function of ff⁠, studied in Section 1.4: f−1(y)=y2f^{-1}(y) = \tfrac{y}{2}⁠.

    Definition 7 calls a function bijective exactly when it is both one-one and onto, so the two proved properties finish the question. The remark about the inverse previews why bijections matter: they are exactly the functions that can be reversed.
    Bijective   ⟺  \iff every yy in the codomain has exactly one preimage: onto supplies at least one, one-one allows at most one.
Result

f(x)=2xf(x) = 2x from R\R to R\R is one-one (2x1=2x2⇒x1=x22x_1 = 2x_2 \Rightarrow x_1 = x_2⁠) and onto (every y∈Ry \in \R equals f(y2)f(\tfrac{y}{2}) with y2∈R\tfrac{y}{2} \in \R⁠). So ff is a bijection, with inverse y↦y2y \mapsto \tfrac{y}{2}⁠.

Check it with numbers

Pick y=−7.3y = -7.3⁠. The recipe gives x=−3.65x = -3.65⁠, a real number, and f(−3.65)=2×(−3.65)=−7.3f(-3.65) = 2 \times (-3.65) = -7.3⁠. ✓ Pick y=13y = \tfrac{1}{3}⁠: x=16x = \tfrac16 and 2⋅16=132 \cdot \tfrac16 = \tfrac13⁠. ✓ And y=1y = 1⁠, the value that had no preimage in Example 8, now has the preimage x=12x = \tfrac12⁠, because 12\tfrac12 is a real number.

Common mistakes
  1. Solving 2x=y2x = y and stopping. Solving only tells you what xx must be. You must still say that y2\tfrac{y}{2} lies in the domain and that f(y2)=yf(\tfrac{y}{2}) = y⁠.
  2. Using a specific yy⁠. Showing that 3 and −4-4 are hit does not prove onto. The argument must work for an arbitrary y∈Ry \in \R⁠.
  3. Thinking the formula decides everything. The same rule 2x2x is onto on R\R but not on N\N (Example 8). Always look at the domain and codomain.
What to take away
  1. For onto: solve f(x)=yf(x) = y for xx⁠, then verify that the solution is in the domain and maps to yy⁠.
  2. Any linear function f(x)=ax+bf(x) = ax + b with a≠0a \ne 0 is a bijection R→R\R \to \R⁠, by the same two steps with preimage x=y−bax = \tfrac{y-b}{a}⁠.
  3. A graph test: one-one and onto together mean every horizontal line crosses the graph exactly once.

Every fact used, and where it comes from

FactUsed inSource
Definition of one-oneStep 1Definition 5, Section 1.3 (Lesson: types of functions)
Definition of ontoSteps 2, 3Definition 6, Section 1.3
Definition of bijectiveStep 4Definition 7, Section 1.3
Cancelling a non-zero factorSteps 1, 2Arithmetic
y∈R⇒y2∈Ry \in \R \Rightarrow \tfrac{y}{2} \in \RStep 3R\R is closed under division by a non-zero number
Graph of y=2xy = 2xStep 3 figureFig 1.3, Section 1.3
Inverse of a bijectionStep 4 remarkDefinition 9, Section 1.4 (Lesson: invertible functions)
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →