• Foundation
  • About 20 min
  • 5 practice questions

Invertible functions and finding the inverse

Know that a function is invertible exactly when it is bijective, find the inverse by solving y = f(x), and verify it with gof = I and fog = I.

If something looks wrong, please tell us.

By the end of this lesson you can

  • State the definition of an invertible function using the identity functions.
  • Explain why invertible and bijective mean the same thing.
  • Find f⁻¹ for linear, rational and restricted quadratic functions and verify the answer.

Converting rupees to dollars and back, or encoding a message and decoding it, both rely on a process that can be reversed exactly. In the language of functions this means finding a second function that undoes the first. Lesson 3 told us which functions can be undone; now we find the undoing function itself.

Definition

A function f : X → Y is invertible if there is a function g : Y → X such that gof = I_X and fog = I_Y, where I_X(x) = x on X and I_Y(y) = y on Y. Such g is unique; it is called the inverse of f and written f⁻¹. Note that f⁻¹ does not mean 1/f.

f is invertible ⇔ f is one-one and onto (bijective). Then f⁻¹(y) = the unique x with f(x) = y.

— Key theorem

Why the theorem holds: if f is not one-one, two inputs x₁ ≠ x₂ share an image y, and no single value f⁻¹(y) could return both. If f is not onto, some y has no pre-image, so f⁻¹(y) has nothing to be. Conversely, when f is bijective, every y has exactly one pre-image, and sending y to it defines g with gof = I_X and fog = I_Y. This is why proving bijectivity is often the quickest way to show a function is invertible.

Finding and checking an inverse

  1. Check bijective Show f is one-one and onto from X to Y.
  2. Write y = f(x) Treat y as any element of the co-domain.
  3. Solve for x Express x in terms of y; check this x lies in X for every y in Y.
  4. Define f⁻¹(y) f⁻¹ : Y → X is the formula you found.
  5. Verify Confirm f⁻¹(f(x)) = x and f(f⁻¹(y)) = y.

Worked example 1: a linear function

f : R → R, f(x) = 3x − 7. Working: f is one-one and onto (as in Lesson 3). Put y = 3x − 7, so x = (y + 7)/3. Define f⁻¹(y) = (y + 7)/3. Check: f⁻¹(f(x)) = (3x − 7 + 7)/3 = x and f(f⁻¹(y)) = 3 × (y + 7)/3 − 7 = y. Both compositions are identities, so f⁻¹(y) = (y + 7)/3.

Worked example 2: a rational function

f : R − {2} → R − {1}, f(x) = (x + 3)/(x − 2). One-one: if (x₁ + 3)/(x₁ − 2) = (x₂ + 3)/(x₂ − 2), cross-multiplying gives x₁x₂ − 2x₁ + 3x₂ − 6 = x₁x₂ − 2x₂ + 3x₁ − 6, so 5x₂ = 5x₁ and x₁ = x₂. Onto and inverse: put y = (x + 3)/(x − 2). Then yx − 2y = x + 3, so x(y − 1) = 2y + 3 and x = (2y + 3)/(y − 1), which is defined because y ≠ 1. Could this x equal 2? That would need 2y + 3 = 2y − 2, i.e. 3 = −2, impossible. So x always lies in the domain. Hence f is bijective and f⁻¹(y) = (2y + 3)/(y − 1).

Worked example 3: a restricted quadratic

f : [0, ∞) → [4, ∞), f(x) = x² + 4. One-one: for x₁, x₂ ≥ 0, x₁² + 4 = x₂² + 4 gives x₁² = x₂², so x₁ = x₂ (both non-negative). Onto: for y ≥ 4, put x = √(y − 4), which is real and ≥ 0, and f(x) = (y − 4) + 4 = y. So f⁻¹(y) = √(y − 4). Check: f⁻¹(f(x)) = √(x²) = |x| = x because x ≥ 0. On all of R the same formula would not be invertible, because f(−1) = f(1).

Inverses found in this lesson
f(x) and its domain → co-domainInverse f⁻¹(y)
3x − 7, R → R(y + 7)/3
(x + 3)/(x − 2), R − {2} → R − {1}(2y + 3)/(y − 1)
x² + 4, [0, ∞) → [4, ∞)√(y − 4)
x³, R → R∛y

Useful facts about inverses

  • If f is invertible, so is f⁻¹, and (f⁻¹)⁻¹ = f.
  • If f : X → Y and g : Y → Z are both invertible, then gof is invertible and (gof)⁻¹ = f⁻¹og⁻¹ (undo the last step first, like taking off socks after shoes).
  • If f(a) = b, then f⁻¹(b) = a: an inverse simply swaps input and output.

Worked example 4. With f(x) = x + 2 and g(x) = 3x on R, (gof)(x) = 3(x + 2) = 3x + 6, so (gof)⁻¹(y) = (y − 6)/3. Using the rule instead: g⁻¹(y) = y/3 and f⁻¹(y) = y − 2, so f⁻¹(g⁻¹(y)) = y/3 − 2 = (y − 6)/3. The two answers agree.

Key takeaways: invertible means bijective. To find f⁻¹, solve y = f(x) for x, check that x lies in the domain for every y in the co-domain, and verify both compositions. Restrict domain and co-domain when a function is not one-one or not onto, and remember (gof)⁻¹ = f⁻¹og⁻¹.

Check your understanding

  1. 1. If f : R → R, f(x) = 4x + 5, what is f⁻¹(x)?

    1. (x + 5)/4
    2. 4x − 5
    3. 1/(4x + 5)
    4. (x − 5)/4
    Show answer

    Answer: D. Put y = 4x + 5, so x = (y − 5)/4. Hence f⁻¹(x) = (x − 5)/4. Check: 4 × (x − 5)/4 + 5 = x.

  2. 2. Which function is invertible as written?

    1. f : R → R, f(x) = x²
    2. f : R → R, f(x) = x³ + 1
    3. f : R → R, f(x) = |x|
    4. f : R → R, f(x) = 5
    Show answer

    Answer: B. x³ + 1 is one-one (x₁³ = x₂³ ⇒ x₁ = x₂) and onto (x = ∛(y − 1)), so it is bijective and invertible. x² and |x| are not one-one on R; a constant function is neither one-one nor onto.

  3. 3. f : R − {1} → R − {2} is given by f(x) = (2x + 3)/(x − 1). What is f⁻¹(y)?

    1. (y + 3)/(y − 2)
    2. (y − 3)/(y + 2)
    3. (2y + 3)/(y − 1)
    4. (y − 2)/(y + 3)
    Show answer

    Answer: A. y(x − 1) = 2x + 3 ⇒ yx − y = 2x + 3 ⇒ x(y − 2) = y + 3 ⇒ x = (y + 3)/(y − 2), defined for y ≠ 2. Check with x = 2: f(2) = 7, and (7 + 3)/(7 − 2) = 2.

  4. 4. If f and g are invertible functions from R to R with f(x) = x − 1 and g(x) = 2x, what is (gof)⁻¹(8)?

    1. 3
    2. 7
    3. 5
    4. 4.5
    Show answer

    Answer: C. (gof)⁻¹ = f⁻¹og⁻¹. g⁻¹(8) = 8/2 = 4, then f⁻¹(4) = 4 + 1 = 5. Check: (gof)(5) = g(4) = 8.

  5. 5. Assertion (A): f : R → R, f(x) = x² is not invertible.
    Reason (R): A function is invertible only if it is one-one and onto.

    1. Both A and R are true, and R is the correct explanation of A
    2. Both A and R are true, but R is not the correct explanation of A
    3. A is true but R is false
    4. A is false but R is true
    Show answer

    Answer: A. R is the key theorem. f(2) = f(−2) = 4, so f is not one-one (and negative numbers are never reached), so by R it has no inverse. Both are true and R explains A.

Privacy · Terms · Refunds · Delivery