Functions

Step 8 of 11 · Worked example

← Functions

0 of 3 done

Work through the example to CHECK to open the problems.

Reach CHECK to open the problems.Higher Level · Functions · Step 8

Prove each yes with algebra, show each no with one example, then restrict.

Domain and codomain all real numbers. Is each injective, surjective or bijective? (i) f(x) = 2x − 5. (ii) g(x) = (x − 1)². Then restrict (ii) so that it is bijective.

The horizontal line test
(0, 1)(2, 1)

The dashed line at height 1 cuts y = (x − 1)² twice, so two inputs share an output: not injective on all real numbers.

  • g(x) = (x − 1)²
  • y = 1

The domain and codomain are both ℝ, all real numbers.

(i) f(x) = 2x − 5 (ii) g(x) = (x − 1)²

Is each function injective, surjective, bijective? Give a reason each time. Then restrict the domain and codomain of g so that it is bijective.

Read it once, slowly. Then copy it onto your page.
  • What is fixed? Inputs and possible outputs: all of ℝ. Negatives, 0 and positives. Both sets matter here.
  • What are the rules? f doubles, then takes 5. g takes 1, then squares.
  • What do they want? Three yes-or-no answers per rule, each with a reason. Then cut g down until it is bijective.
Céim

Higher Level Maths · Functions · Step 8 of 11

Types of Functions

Injective, surjective and bijective: prove yes with algebra, show no with one example, read a mapping diagram, and restrict a domain to make a function bijective.

Why it matters

Prepares the logic required for inverses.

The worked example

The domain and codomain are both ℝ, all real numbers. (i) f(x) = 2x − 5 (ii) g(x) = (x − 1)² Is each function injective, surjective, bijective? Give a reason each time. Then restrict the domain and codomain of g so that it is bijective.

How the worked example goes

  1. Read

    • What is fixed? Inputs and possible outputs: all of ℝ. Negatives, 0 and positives. Both sets matter here.
    • What are the rules? f doubles, then takes 5. g takes 1, then squares.
    • What do they want? Three yes-or-no answers per rule, each with a reason. Then cut g down until it is bijective.
  2. Understand

    • (i) What do the three words mean?
    • Injective: no output is shared. Here c has two arrows in, from 3 and 4: not injective.
    • Surjective: every codomain value is hit. Here a, b and c all are: surjective.
  3. Reduce

    • To show f is injective, which is enough? f(a) = f(b) forces a = b: That covers every pair of inputs at once: equal outputs only come from equal inputs.
    • (i) Where do I start?
    • Injective: suppose two inputs a and b give the same output, and see whether a must equal b.
  4. Solve

    • (i) Run both tests.
    • 2a − 5 = 2b − 5
    • 2a = 2b, so a = b
  5. Check

    • (i) Is it right?
    • Reach y = 7: x = (7 + 5)/(2) = 6, and f(6) = 12 − 5 = 7 ✓
    • A straight line that is not flat: any level line meets it exactly once. Never twice, never missed ✓