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

Example 17: Inverse of f(x)=4x+3f(x)=4x+3

ExamplesInvertible functions · Section 1.4
The question

Let f:N→Yf : \N \to Y be a function defined as f(x)=4x+3f(x) = 4x + 3⁠, where Y={y∈N:y=4x+3 for some x∈N}.Y = \{y \in \N : y = 4x + 3 \text{ for some } x \in \N\}. Show that ff is invertible. Find the inverse.

Exam answer

Let y∈Yy \in Y⁠. Then y=4x+3y = 4x + 3 for some x∈Nx \in \N⁠, so x=y−34x = \frac{y - 3}{4}⁠.

Define g:Y→Ng : Y \to \N by g(y)=y−34g(y) = \frac{y - 3}{4}⁠. It is a function into N\N⁠, since g(4x+3)=x∈Ng(4x + 3) = x \in \N⁠.

For x∈Nx \in \N⁠,

gof(x)=g(4x+3)=(4x+3)−34=x\begin{aligned} gof(x) &= g(4x + 3) \\ &= \frac{(4x + 3) - 3}{4} = x \end{aligned}

and for y∈Yy \in Y⁠,

fog(y)=f(y−34)=4⋅y−34+3=y\begin{aligned} fog(y) &= f\left(\frac{y - 3}{4}\right) \\ &= 4 \cdot \frac{y - 3}{4} + 3 = y \end{aligned}

So gof=INgof = I_{\N} and fog=IYfog = I_Y⁠. Thus ff is invertible.

∴ f−1:Y→N\therefore\ f^{-1} : Y \to \N⁠, f−1(y)=y−34f^{-1}(y) = \dfrac{y - 3}{4}⁠.

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

The one idea this problem is built on

To undo "multiply by 4, then add 3", do the opposite steps in the opposite order: subtract 3, then divide by 4. That gives a candidate inverse g(y)=y−34g(y) = \frac{y-3}{4}⁠. Definition 9 then asks us to check two things: undoing after doing gets back to the start (gof=INgof = I_{\N}⁠), and doing after undoing gets back to the start (fog=IYfog = I_Y⁠). The careful choice of codomain YY (only the numbers of the form 4x+34x+3⁠) is what makes g(y)g(y) always a natural number.

Given, to show and find, and the plan
Given
f(x)=4x+3f(x) = 4x+3 on N={1,2,3,… }\N = \{1,2,3,\dots\}⁠, with codomain YY⁠, the set of all natural numbers that can be written as 4x+34x+3 with x∈Nx\in\N⁠.
To show and find
That there is a function g:Y→Ng : Y \to \N with gof=INgof = I_{\N} and fog=IYfog = I_Y⁠; and a formula for that g=f−1g = f^{-1}⁠.
Plan
(1) List YY to see what it is. (2) Solve y=4x+3y = 4x+3 for xx to find the candidate gg⁠. (3) Check that gg really maps YY into N\N⁠. (4) Verify gof(x)=xgof(x) = x for all x∈Nx\in\N⁠. (5) Verify fog(y)=yfog(y) = y for all y∈Yy \in Y⁠. (6) Conclude.

Basics you need

1Identity functions

IX:X→XI_X : X \to X is the function IX(x)=xI_X(x) = x⁠: it leaves every element where it is. INI_{\N} is the identity on N\N and IYI_Y the identity on YY⁠. Basics: what a function is

2Invertible (Definition 9)

f:X→Yf : X \to Y is invertible if there is a function g:Y→Xg : Y \to X with gof=IXgof = I_X and fog=IYfog = I_Y⁠. Then gg is called the inverse f−1f^{-1}⁠. Equivalently (as the book notes), ff is invertible exactly when it is one-one and onto.

3Composition

gof(x)=g(f(x))gof(x) = g(f(x))⁠: apply ff first, then gg⁠.

4Set-builder notation

The set {y∈N:y=4x+3\{y\in\N : y = 4x+3 for some x∈N}x\in\N\} means "all natural numbers yy for which there is at least one natural xx with y=4x+3y = 4x+3". Basics: sets

5One-one and onto

One-one: f(x1)=f(x2)⇒x1=x2f(x_1) = f(x_2) \Rightarrow x_1 = x_2⁠. Onto: every element of the codomain is ff of something. Basics: one-one and onto

Solution

  1. See what YY is

    Put x=1,2,3,4,…x = 1, 2, 3, 4, \dots into 4x+34x+3⁠:

    4(1)+3=7,4(2)+3=11,4(3)+3=15,4(4)+3=19, …4(1)+3 = 7,\quad 4(2)+3 = 11,\quad 4(3)+3 = 15,\quad 4(4)+3 = 19,\ \dots

    So Y={7,11,15,19,… }Y = \{7, 11, 15, 19, \dots\}⁠: the natural numbers that are 3 more than a positive multiple of 4. Numbers such as 1,2,3,4,5,6,8,9,101, 2, 3, 4, 5, 6, 8, 9, 10 are not in YY⁠.

    By its very definition, YY is the set of values of ff⁠. So ff maps N\N into YY⁠, and every element of YY is reached: ff is onto YY⁠.

    The codomain is deliberately not N\N⁠. If it were N\N⁠, the number 8 (for instance) would need a natural xx with 4x+3=84x+3 = 8⁠, that is x=54x = \frac54⁠, which is not natural. So f:N→Nf : \N\to\N would not be onto, and not invertible. Shrinking the codomain to exactly the set of outputs removes that problem.
    The range of a function is the set of its actual outputs. When the codomain is chosen equal to the range, the function is automatically onto. Basics: one-one and onto
  2. Find the candidate inverse by solving for xx

    Take an arbitrary y∈Yy\in Y⁠. By the definition of YY⁠, y=4x+3y = 4x + 3 for some xx in N\N⁠. Solve this for xx⁠:

    y=4x+3 ⟹ y−3=4x ⟹ x=y−34.y = 4x + 3 \ \Longrightarrow\ y - 3 = 4x \ \Longrightarrow\ x = \frac{y-3}{4}.

    So define g:Y→Ng : Y \to \N by

    g(y)=y−34.g(y) = \frac{y-3}{4}.
    An inverse must take each output yy back to the input xx that produced it. Solving y=f(x)y = f(x) for xx does exactly that. We subtract 3 first and divide by 4 second because ff did the reverse: it multiplied by 4 first and added 3 second. Undoing goes in the opposite order, like taking off shoes before socks.
    To undo a sequence of operations, apply the opposite operations in the reverse order. Subtracting the same number from both sides, or dividing both sides by the same non-zero number, keeps an equation true.
  3. Check that gg really sends YY into N\N

    For y∈Yy \in Y there is an x∈Nx\in\N with y=4x+3y = 4x + 3⁠. Then

    g(y)=(4x+3)−34=4x4=x∈N.g(y) = \frac{(4x+3)-3}{4} = \frac{4x}{4} = x \in \N.

    Also this xx is the only one: if 4x+3=4x′+34x+3 = 4x'+3⁠, then 4x=4x′4x = 4x'⁠, so x=x′x = x'⁠. Hence g(y)g(y) is a single, well-defined natural number for each y∈Yy\in Y⁠, and gg is a genuine function from YY to N\N⁠.

    The formula y−34\frac{y-3}{4} could produce fractions or zero or negatives for some numbers (8−34=54\frac{8-3}{4} = \frac54⁠, 3−34=0\frac{3-3}{4} = 0⁠). Before calling gg a function into N\N⁠, we must show that for the allowed inputs, the elements of YY⁠, it always gives a natural number. It does, because every element of YY has the form 4x+34x+3 with xx natural. The uniqueness line shows that ff is one-one, so there is never a choice to make.
    A function g:Y→Ng : Y \to \N must give exactly one output, lying in N\N⁠, for every input in YY⁠. Basics: what a function is
  4. Verify gof=INgof = I_{\N}

    Take any x∈Nx \in \N⁠. Then

    gof(x)=g(f(x))=g(4x+3)=(4x+3)−34=4x4=x.gof(x) = g(f(x)) = g(4x+3) = \frac{(4x+3) - 3}{4} = \frac{4x}{4} = x.

    So gof(x)=x=IN(x)gof(x) = x = I_{\N}(x) for every x∈Nx \in \N⁠, that is gof=INgof = I_{\N}.

    This says: start with a natural number, apply ff⁠, then apply gg⁠, and you are back where you started. Because xx was arbitrary, the calculation holds for every natural number at once.
    Two functions are equal when they agree at every point of the domain. Here gofgof and INI_{\N} agree at every x∈Nx\in\N⁠.
  5. Verify fog=IYfog = I_Y

    Take any y∈Yy \in Y⁠. Then

    fog(y)=f(g(y))=f ⁣(y−34)=4(y−34)+3=(y−3)+3=y.\begin{aligned} fog(y) &= f(g(y)) = f\!\left(\frac{y-3}{4}\right)\\ &= 4\left(\frac{y-3}{4}\right) + 3 = (y-3) + 3 = y. \end{aligned}

    So fog(y)=y=IY(y)fog(y) = y = I_Y(y) for every y∈Yy \in Y⁠, that is fog=IYfog = I_Y.

    NY17211315419……f(x) = 4x + 3g(y) = (y − 3)/4Y = {7, 11, 15, 19, …}: exactly the numbers 4x + 3 with x in N
    Blue arrows: ff sends 1,2,3,41, 2, 3, 4 to 7,11,15,197, 11, 15, 19⁠. Gold arrows: gg sends each of these straight back. Going down and then up returns every xx (this is gof=INgof = I_{\N}⁠); going up and then down returns every yy (this is fog=IYfog = I_Y⁠).
    Definition 9 asks for both identities, and they say different things. gof=INgof = I_{\N} says gg undoes ff⁠; fog=IYfog = I_Y says ff undoes gg⁠. The second one needs g(y)g(y) to be a legal input for ff⁠, which is why Step 3 (showing g(y)∈Ng(y)\in\N⁠) had to come first.
    Definition 9: f:X→Yf : X\to Y is invertible if some g:Y→Xg : Y \to X satisfies gof=IXgof = I_X and fog=IYfog = I_Y⁠. Lesson: invertible functions
  6. Conclude

    We have found g:Y→Ng : Y \to \N with gof=INgof = I_{\N} and fog=IYfog = I_Y⁠. By Definition 9, ff is invertible and f−1(y)=y−34f^{-1}(y) = \dfrac{y-3}{4} for y∈Yy\in Y⁠.

    The book also mentions a shortcut: a function is invertible exactly when it is one-one and onto. We have in fact seen both properties on the way: onto in Step 1 and one-one in Step 3. But finding gg and checking the two identities does more: it proves invertibility and gives the inverse in one go.
Result

f:N→Yf : \N \to Y⁠, f(x)=4x+3f(x) = 4x+3⁠, is invertible. Its inverse is f−1:Y→N,f−1(y)=y−34,f^{-1} : Y \to \N, \qquad f^{-1}(y) = \frac{y-3}{4}, because f−1(f(x))=xf^{-1}(f(x)) = x for all x∈Nx\in\N and f(f−1(y))=yf(f^{-1}(y)) = y for all y∈Yy\in Y⁠. This agrees with the textbook's solution.

Check it with numbers

Take x=10x = 10⁠: f(10)=43f(10) = 43⁠, and 43∈Y43 \in Y⁠. Then g(43)=43−34=404=10g(43) = \frac{43-3}{4} = \frac{40}{4} = 10⁠. ✓ Going the other way, take y=99y = 99⁠. Is it in YY⁠? 99=4⋅24+399 = 4\cdot 24 + 3⁠, yes. Then g(99)=964=24g(99) = \frac{96}{4} = 24 and f(24)=96+3=99f(24) = 96 + 3 = 99⁠. ✓ The verification script repeats this round trip for every xx from 1 to 2000 and every element of YY below 8000.

Common mistakes
  1. Taking the codomain to be N\N⁠. Then ff is not onto (8 has no preimage) and not invertible. The question deliberately uses YY⁠.
  2. Undoing in the wrong order, for example writing g(y)=y4−3g(y) = \frac{y}{4} - 3⁠. Check: g(f(1))=74−3≠1g(f(1)) = \frac74 - 3 \ne 1⁠.
  3. Checking only one identity. Definition 9 needs both gof=INgof = I_{\N} and fog=IYfog = I_Y⁠.
  4. Forgetting that gg must land in N\N⁠. Without Step 3, gg might not be a function from YY to N\N at all.
  5. Writing f−1(x)=14x+3f^{-1}(x) = \frac{1}{4x+3}⁠. f−1f^{-1} is the inverse function, not the reciprocal 1f(x)\frac{1}{f(x)}⁠.
What to take away
  1. To find an inverse, solve y=f(x)y = f(x) for xx⁠. Then check g(f(x))=xg(f(x)) = x and f(g(y))=yf(g(y)) = y⁠.
  2. Invertibility depends on the codomain. The same rule 4x+34x+3 is invertible onto YY but not onto N\N⁠.
  3. Invertible   ⟺  \iff one-one and onto. Constructing gg proves it and finds the inverse at the same time.

Every fact used, and where it comes from

FactUsed inSource
Definition of compositionSteps 4, 5Definition 8, Section 1.4 (Lesson: composition)
Definition of invertible; identity functions IXI_XSteps 4–6Definition 9, Section 1.4 (Lesson: invertible functions)
Invertible   ⟺  \iff one-one and ontoStep 6Paragraph after Definition 9, Section 1.4
One-one, ontoSteps 1, 3Definitions 5 and 6, Section 1.3 (Lesson: types of functions)
Solving a linear equationStep 2Algebra
All numerical values, Y={7,11,15,… }Y = \{7, 11, 15, \dots\}Steps 1, 3; CheckRecomputed in the site's verification script
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 →