Skip to content
Procedure

Testing one-one and onto

Algebra • Functions

Statement

is one-one if ; onto if for each some has . It is bijective if it is both.

How to use it

  1. 1For onto, solve for , then check that this lies in the domain for every in the codomain.
  2. 2If the equation has exactly one solution in the domain for every , is bijective.

Worked example

Is , , bijective?

Step-by-step

  1. 1

    Why: Solve for .

  2. 2
    For this exists, and would need , impossible

    Why: So is in the domain, and it is the only solution.

  3. 3
    Exactly one for each : one-one and onto

Answer

Yes, it is bijective.

Watch out

Onto depends on the codomain. With codomain , the value would be missed and would not be onto.

Also known as

injective surjective, bijection test

Appears in past papers

2026 (II)

2025 (I)

2024 (I)

2023 (I)

2021 (I)

2018 (I)

2017 (I)