Relations and Functions
Swipe left or right to change slide
One-one (injective)
✎ Note: To prove one-one: start from f(x₁) = f(x₂) and reach x₁ = x₂. To disprove: find x₁ ≠ x₂ with the same image.
Onto (surjective)
✎ Note: To prove onto: take any y in the codomain, solve y = f(x) for x, and check that x is in the domain. To disprove: find one y that is never reached.
Bijective
✎ Note: Both one-one and onto = bijective. For a function from a finite set to itself, one-one and onto always come together.
SOLVED EXAMPLE – Prove one-one and onto (Ex 1.2 type)
Step 1: f : R → R, f(x) = 3 − 4x. One-one: suppose f(x₁) = f(x₂).
Step 2: Onto: take any real y and solve y = 3 − 4x.
Step 3: Both hold:
SOLVED EXAMPLE – Not one-one, not onto (Ex 1.2 type)
Step 1: f : R → R, f(x) = x². Two inputs, same image:
Why: −2 ≠ 2, so not one-one.
Step 2: A negative number is never a square:
Why: so not onto.
Exam tip: For onto, always write x in terms of y and check it lies in the domain (for N, the answer must be a natural number).
Practice only – this does not count as a test.
Practice only – this does not count as a test.
Log in to save your progress.