By the end of this chapter you'll be able to…

  • 1Form the Cartesian product and count its elements
  • 2Define a relation and identify domain, co-domain and range
  • 3Recognise functions and their types
  • 4Count relations and functions between finite sets
  • 5Compute the composition of two functions
💡
Why this chapter matters
Relations and Functions sets up the language used throughout higher mathematics. Counting relations/functions, identifying types, and composition are dependable scoring questions in the TN SSLC exam.

Before you start — revise these

A 5-minute refresher here will save you 30 minutes of confusion below.

Relations and Functions — Class 10 Maths (Samacheer Kalvi)

TN State Board (Samacheer Kalvi) Class 10 Mathematics, Chapter 1. The language of pairs, relations and functions.


1. About this chapter

This chapter introduces the Cartesian product, relations, and functions — their types, representations, and composition.

2. Ordered pairs, Cartesian product and relations

  • Ordered pair: (a, b) — order matters, so (a, b) ≠ (b, a) unless a = b.
  • Cartesian product: A × B = { (a, b) : a ∈ A, b ∈ B }. n(A × B) = n(A) × n(B).
  • Relation from A to B: any subset of A × B. It has a domain, co-domain and range.

3. Functions and their types

  • A function f : A → B assigns to every element of A exactly one element of B.
  • Types: one-one (injective), onto (surjective), bijective (both), into, constant, and identity function.
  • Counting: if n(A) = p and n(B) = q, then number of relations = 2^(pq) and number of functions = q^p.

4. Representation and composition

  • A function can be shown by an arrow diagram, table, set of ordered pairs, or graph.
  • Composition: (f ∘ g)(x) = f(g(x)). In general f ∘ g ≠ g ∘ f.
  • Graphs: recognise the shapes of linear, quadratic, cubic and reciprocal functions.

5. Worked examples

Example 1. If A = {1, 2} and B = {3, 4}, find A × B and n(A × B). A × B = {(1,3), (1,4), (2,3), (2,4)}; n(A × B) = 2 × 2 = 4.

Example 2. If n(A) = 3 and n(B) = 2, find the number of functions from A to B. q^p = 2³ = 8.

Example 3. If f(x) = 2x + 1 and g(x) = x², find (f ∘ g)(x). (f ∘ g)(x) = f(g(x)) = f(x²) = 2x² + 1.

6. Common mistakes

  • Mistake: Treating any relation as a function. Fix: A function needs exactly one image for every domain element.
  • Mistake: Writing (f ∘ g) = (g ∘ f). Fix: Composition is generally not commutative.
  • Mistake: Swapping the relation/function counting formulas. Fix: Relations = 2^(pq); functions = q^p.

7. Practice (book-back style)

  1. If A = {a, b} and B = {1, 2, 3}, find n(A × B).
  2. Define a one-one and an onto function.
  3. If n(A) = 2, n(B) = 3, find the number of relations from A to B.
  4. If f(x) = x + 3 and g(x) = 2x, find (g ∘ f)(x).
  5. State whether (f ∘ g) = (g ∘ f) in general.

8. Answer key

  1. n(A × B) = 2 × 3 = 6.
  2. One-one: distinct elements have distinct images; onto: every element of the co-domain has a pre-image.
  3. 2^(pq) = 2^(6) = 64.
  4. (g ∘ f)(x) = g(f(x)) = g(x + 3) = 2(x + 3) = 2x + 6.
  5. No — composition is not commutative in general.

9. Quick revision

  • Chapter 1 · Cartesian product, relations, functions.
  • n(A × B) = n(A)·n(B); relations = 2^(pq); functions = q^p.
  • Function: every domain element → exactly one image.
  • Types: one-one, onto, bijective, into, constant, identity.
  • (f ∘ g)(x) = f(g(x)); not commutative.

Key formulas & results

Everything you need to memorise, in one card. Screenshot this for revision.

Cartesian product
n(A × B) = n(A) × n(B)
Number of ordered pairs.
Number of relations
2^(pq)
p = n(A), q = n(B).
Number of functions
q^p
From A to B.
Composition
(f ∘ g)(x) = f(g(x))
Generally not commutative.
⚠️

Common mistakes & fixes

These are the exact errors that cost students marks in board exams. Read them once, save yourself the trouble.

WATCH OUT
Treating any relation as a function
A function needs exactly one image for every domain element.
WATCH OUT
Writing (f ∘ g) = (g ∘ f)
Composition is generally not commutative.
WATCH OUT
Swapping the relation/function counting formulas
Relations = 2^(pq); functions = q^p.

Practice problems

Try each one yourself before tapping "Show solution". Active recall > rereading.

Q1EASY· Concept
If A = {a, b} and B = {1, 2, 3}, find n(A × B).
Show solution
n(A × B) = 2 × 3 = 6.
Q2EASY· Concept
Define a one-one and an onto function.
Show solution
One-one: distinct elements have distinct images; onto: every element of the co-domain has a pre-image.
Q3MEDIUM· Counting
If n(A) = 2 and n(B) = 3, find the number of relations from A to B.
Show solution
2^(pq) = 2^6 = 64.
Q4MEDIUM· Composition
If f(x) = x + 3 and g(x) = 2x, find (g ∘ f)(x).
Show solution
(g ∘ f)(x) = g(f(x)) = g(x + 3) = 2(x + 3) = 2x + 6.
Q5EASY· Counting
If n(A) = 3 and n(B) = 2, find the number of functions from A to B.
Show solution
q^p = 2^3 = 8.
Q6EASY· Concept
Is composition of functions commutative?
Show solution
No, in general (f ∘ g) ≠ (g ∘ f).

5-minute revision

The whole chapter, distilled. Read this the night before the exam.

  • Chapter 1 of Samacheer Kalvi Class 10 Mathematics.
  • n(A × B) = n(A) × n(B).
  • Relations = 2^(pq); functions = q^p.
  • Function: every domain element has exactly one image.
  • Types: one-one, onto, bijective, into, constant, identity.
  • (f ∘ g)(x) = f(g(x)); not commutative.

Tamil Nadu (TNBSE) marks blueprint

Where the marks come from in this chapter — so you can plan your prep.

Typical chapter weightage: 6-10 marks across MCQ, short answer and composition/graph problems

Question typeMarks eachTypical countWhat it tests
MCQ11-2Definitions and counting
Short Answer2-31-2Types and Cartesian product
Composition / Graph2-51Composition and graphs
Prep strategy
  • Memorise the counting formulas
  • Practise identifying function types
  • Work composition problems both ways
  • Learn the standard function graphs

Where this shows up in the real world

This chapter isn't just an exam topic — it lives in the world around you.

Coordinate geometry

Ordered pairs are the coordinates of points in the plane.

Computer science

Functions and mappings model input–output relationships.

Data tables

Relations describe how one quantity depends on another.

Exam strategy

Battle-tested tips from teachers and toppers for this chapter.

  1. Apply the correct counting formula
  2. Check the function condition before answering
  3. Compute composition step by step
  4. Sketch graphs neatly when asked

Going beyond the textbook

For olympiad aspirants and curious learners — topics that build on this chapter.

  • Find the number of bijective functions between two equal finite sets.
  • Prove that composition of bijections is a bijection.

Where else this chapter is tested

CBSE board isn't the only one — other exams test this chapter too.

TN SSLC Class 10 Public ExamHigh
Foundation / NTSE MathematicsMedium
School unit testsHigh

Questions students ask

The real ones — pulled from the Q&A community and tutor sessions.

Every function is a relation, but a relation is a function only if each element of the domain is paired with exactly one element of the co-domain.

Because (a, b) and (b, a) usually represent different pairs; the first and second positions have fixed roles (e.g. x and y coordinates).
Verified by the tuition.in editorial team
Last reviewed on 3 June 2026. Written and reviewed by subject-matter experts — read about our process.
Editorial process →
Header Logo