Home / Learn / Exam prep / CUET (UG) prep / Lesson 8.1
All lessons

Module 8: Mathematics · Lesson 8.1 · about 18 min

Maths: relations and functions

Reflexive, symmetric, transitive and equivalence relations, one-one and onto functions, composition and invertible functions, and counting relations and functions, with a live counting problem.

Key points, meanings and formulas on one page: choose "Save as PDF" in the print box.

Module 8 · about 18 minutes. By the end you will test any relation for the three properties and any function for one-one and onto.

A relation pairs things up; a function is a relation where each input gets exactly one output. The vocabulary (reflexive, symmetric, transitive, one-one, onto) just names patterns in those pairings.

Everyday picture: roll numbers in a class. Each student has exactly one roll number (a function), and no two students share one (one-one). If every roll number from 1 to 40 is used, it is also onto, so you can go back from a roll number to the student (an inverse).

1. Types of relations

Property Test Example on “people in a family”
Reflexive (a, a) ∈ R for every a “is the same age as”
Symmetric (a, b) ∈ R ⇒ (b, a) ∈ R “is a sibling of”
Transitive (a, b), (b, c) ∈ R ⇒ (a, c) ∈ R “is older than”
Equivalence all three “was born in the same year as”

An equivalence relation splits a set into non-overlapping equivalence classes: for “a − b divisible by 3” on integers the classes are numbers leaving remainder 0, 1 or 2.

2. Types of functions

One-one (injective): assume f(a) = f(b) and show a = b. Or find two inputs with the same output to disprove.
Onto (surjective): take any y in the codomain and solve f(x) = y for x inside the domain.
Watch the sets: x² is not one-one on R, but it is on [0, ∞). The same rule can pass or fail depending on the domain and codomain.
Bijective (both) means invertible: f⁻¹(y) = the x with f(x) = y.

Composition: (g ∘ f)(x) = g(f(x)), apply f first. If f and g are both bijections, so is g ∘ f. For finite sets with the same number of elements, one-one ⇔ onto.

“Symmetric and antisymmetric are opposites, so a relation must be one or the other.” “Is equal to” is both; “is a brother of” on all people is neither. Test each property separately.

3. Practice

  • Equivalence = reflexive + symmetric + transitive; it creates classes.
  • One-one: f(a) = f(b) ⇒ a = b. Onto: every y is hit.
  • Bijective ⇔ invertible.
  • Counts (|A| = m, |B| = n): relations 2^(mn), functions nᵐ, bijections A → A m!.

Check yourself

1R = {(a, b) : a − b is divisible by 3} on the integers is:
2f : R → R, f(x) = x² is:
3A function has an inverse exactly when it is:

Sources

  • NCERT, Mathematics Part I (Class 12), Relations and Functions
  • National Testing Agency, CUET (UG) Mathematics syllabus https://cuet.nta.nic.in/ (checked 2026-11-22)
  • Questions: original fibub writing for this course

Your ticks stay in this browser. Save them as a file on the course home.

Updated 2026-11-22. The exam pattern follows the NTA CUET (UG) information bulletin as checked on 2026-11-22: check cuet.nta.nic.in for the current year. fibub is a free independent site, not part of NTA; every question here is original. Practice runs in your browser and nothing you answer is sent anywhere.