Skip to content
MathsISC Class 12 · Chapter 1

Relations and Functions ISC Class 12: Notes, Methods and Solved Questions

Updated 14 October 2026 · Fact-checked

Relations and Functions is Chapter 1 of ISC Class 12 Mathematics. It covers types of relations (empty, universal, identity, reflexive, symmetric, transitive, equivalence), functions with domain and range, one-one, many-one, into and onto functions, composite functions, conditions for invertibility, inverses of algebraic functions and sketching a function with its inverse.

What Relations and Functions is about

This chapter, with Inverse Trigonometric Functions, makes up Unit 1 (10 of the 80 marks) of the ISC Mathematics paper. It is short but precise: most marks are lost through loose reasoning rather than hard algebra.

A relation R on a set A is any subset of A × A. You classify relations: empty, universal and identity, and test the three properties: reflexive ((a, a) ∈ R for every a), symmetric ((a, b) ∈ R ⇒ (b, a) ∈ R) and transitive ((a, b), (b, c) ∈ R ⇒ (a, c) ∈ R). A relation with all three is an equivalence relation, which splits A into disjoint equivalence classes.

A function f: A → B is a relation in which every element of A has exactly one image in B (the vertical line test on a graph). You find the domain and range of real-valued functions, and classify functions as one-one (injective), many-one, onto (surjective) or into. A function that is both one-one and onto (bijective) is invertible; to find , solve y = f(x) for x and then rename y as x. The graphs of f and are reflections of each other in the line y = x. Composite functions g∘f (x) = g(f(x)) are found for algebraic functions only, and in general g∘f ≠ f∘g.

ISC 2027 questions use MCQs, Statement I/II items and assertion-reason in Section A, and short proofs (one-one, onto, equivalence) and inverse-finding in Sections B and C.

Weightage: Relations and Functions is part of the unit Relations and Functions, which carries 10 of the 80 marks in the ISC Mathematics, shared with 1 other chapter. Questions on it can appear in any section of the paper.Source: CISCE ISC Mathematics syllabus, examination year 2027, distribution of marks

Key concepts

Types of relations

For a set A, a relation R on A is a subset of A × A; we write a R b when (a, b) ∈ R. The empty relation contains no pair; the universal relation is A × A itself; the identity relation is . R is reflexive if (a, a) ∈ R for every a ∈ A; symmetric if (a, b) ∈ R implies (b, a) ∈ R; transitive if (a, b) ∈ R and (b, c) ∈ R imply (a, c) ∈ R. To show a property fails, one counter-example is enough; to show it holds, argue for general elements. Note that every identity relation is reflexive, but a reflexive relation may contain other pairs too.

Worked example

Let A = {1, 2, 3} and R = {(1, 1), (2, 2), (3, 3), (1, 2)}. Is R reflexive, symmetric, transitive?

Try it first, then show the solutionSolution
  1. Reflexive: (1, 1), (2, 2), (3, 3) are all in R. Yes.
  2. Symmetric: (1, 2) ∈ R but (2, 1) ∉ R. No.
  3. Transitive: the only chains are (1, 1), (1, 2) giving (1, 2) ∈ R and (1, 2), (2, 2) giving (1, 2) ∈ R. Yes.

Answer: Reflexive and transitive, but not symmetric

Equivalence relations and equivalence classes

A relation that is reflexive, symmetric and transitive is an equivalence relation. It partitions the set into disjoint equivalence classes: the class of a is . Two classes are either identical or disjoint, and together they make up the whole set. A standard example is congruence modulo n on the integers: a R b if n divides a − b. The smallest equivalence relation on A is the identity relation; the largest is the universal relation A × A.

Worked example

On Z define a R b if a − b is divisible by 3. Show R is an equivalence relation and write the equivalence class of 1.

Try it first, then show the solutionSolution
  1. Reflexive: a − a = 0 is divisible by 3, so a R a.
  2. Symmetric: if 3 | (a − b) then 3 | (b − a) = −(a − b), so b R a.
  3. Transitive: if a − b = 3m and b − c = 3n, then a − c = 3(m + n), so a R c. Class of 1: {…, −5, −2, 1, 4, 7, …} = {3k + 1 : k ∈ Z}.

Answer: R is an equivalence relation; [1] = {3k + 1 : k ∈ Z}

Functions, domain and range

A function f from A to B assigns to every element x of A exactly one element y = f(x) of B. A is the domain, B the co-domain, and the set of images actually taken is the range (a subset of B). A real-valued function has its values in R. For a formula, the domain is the set of x for which it is defined: no division by zero, no square root of a negative number, no logarithm of a non-positive number. Vertical line test: a curve is the graph of a function of x if every vertical line cuts it at most once.

Worked example

Find the domain and range of .

Try it first, then show the solutionSolution
  1. Need , i.e. : domain [−3, 3].
  2. takes every value from 0 (at x = ±3) to 9 (at x = 0), so takes every value from 0 to 3.

Answer: Domain [−3, 3]; range [0, 3]

One-one, many-one, onto and into functions

f: A → B is one-one (injective) if different elements have different images: . Otherwise it is many-one. f is onto (surjective) if every element of B is an image: range = co-domain. Otherwise it is into. To prove onto, take any y in B, solve y = f(x), and check that the x found lies in A. A function that is one-one and onto is bijective. Graphically, a one-one function passes the horizontal line test. Counting: from a set of m elements to one of n elements there are functions, and one-one functions if m ≤ n (none if m > n).

Worked example

Show that f: R → R, f(x) = 3x + 5 is one-one and onto, but g: R → R, g(x) = x² is neither.

Try it first, then show the solutionSolution
  1. f: , so one-one. For any real y, is real and f(x) = y, so onto.
  2. g: g(−2) = g(2) = 4 with −2 ≠ 2, so not one-one.
  3. g(x) ≥ 0, so a negative number such as −1 has no pre-image: not onto.

Answer: f is bijective; g is many-one and into

Composite functions

If f: A → B and g: B → C, the composite g∘f: A → C is (g∘f)(x) = g(f(x)): apply f first, then g. It exists only when the range of f lies in the domain of g. In general g∘f ≠ f∘g (composition is not commutative), but it is associative: h∘(g∘f) = (h∘g)∘f. If f and g are both one-one (or both onto), so is g∘f. For ISC, composition and inverses are tested on algebraic functions only.

Worked example

If f(x) = x² + 1 and g(x) = 2x − 3, find f∘g(x), g∘f(x), and their values at x = 2.

Try it first, then show the solutionSolution
  1. f∘g(x) = f(2x − 3) = (2x − 3)² + 1 = 4x² − 12x + 10; at x = 2: 16 − 24 + 10 = 2.
  2. g∘f(x) = g(x² + 1) = 2(x² + 1) − 3 = 2x² − 1; at x = 2: 7.

Answer: f∘g(x) = 4x² − 12x + 10, g∘f(x) = 2x² − 1; 2 and 7 (so f∘g ≠ g∘f)

Invertible functions and finding the inverse

f: A → B is invertible if there is g: B → A with g∘f = and f∘g = ; then g = , and it is unique. Condition of invertibility: f must be bijective (one-one and onto). Method: put y = f(x), solve for x in terms of y to get , then replace y by x to write . State the domain of (the range of f). The graph of is the reflection of the graph of f in the line y = x.

Worked example

Show that f: R − {2} → R − {3}, is invertible and find .

Try it first, then show the solutionSolution
  1. One-one: , so a = b.
  2. Onto: , which is real and ≠ 2 for every y ≠ 3.
  3. So f is bijective and , x ≠ 3.

Answer:

Maths in real life: Relations and Functions

Each concept, met in an everyday situation. Read the situation, try the problem, then check the solution. The one-line hook is what to remember.

Onto but not one-one functions

Suppose a school assigns each of its 120 students to one of 4 houses (Red, Blue, Green, Yellow), and every house gets at least one student.

Is the assignment 'student → house' a function? Is it one-one? Is it onto?

Try it first, then show the solutionSolution
  1. Each student is in exactly one house, so it is a function from students to houses.
  2. With 120 students and 4 houses, many students share a house: not one-one. Every house has at least one student: onto.

Answer: A function that is many-one and onto (so it has no inverse)

Memory hook: Many students, one house: many-one; no empty house: onto.

Inverse of a function

Imagine a weather app that converts Celsius to Fahrenheit using F = f(C) = 9C/5 + 32 and must also convert back.

Find the inverse function and convert 98.6 °F to Celsius.

Try it first, then show the solutionSolution
  1. f is linear with non-zero slope, so it is a bijection R → R.
  2. , so

Answer: ; 98.6 °F = 37 °C

Memory hook: To invert, swap the roles: solve for the input.

Equivalence classes

Suppose a class of students is grouped by the relation 'was born in the same month as'.

Show this is an equivalence relation and say how many equivalence classes there can be at most.

Try it first, then show the solutionSolution
  1. Reflexive (same month as oneself), symmetric (if A shares B's month, B shares A's) and transitive (if A with B and B with C, then A with C).
  2. Each class is the set of students born in one month, so there are at most 12 classes.

Answer: An equivalence relation with at most 12 classes, one per month

Memory hook: Equivalence = sorting into non-overlapping boxes.

Topics in this chapter

Relations and Functions formula sheet

Relation on A
Empty: ∅; universal: A × A; identity: {(a, a)}.
Reflexive, symmetric, transitive
All three: equivalence relation.
Equivalence class
Classes are disjoint and cover A.
One-one
Horizontal line test.
Onto
Solve y = f(x) and check x lies in the domain.
Number of functions
From a set of m elements to a set of n elements.
Composition
Usually g∘f ≠ f∘g.
Inverse
Exists only for bijections; graph reflected in y = x.
Inverse of a composite
Undo in reverse order.

How the board asks Relations and Functions

The question patterns to expect, and the method that works for each.

Question typeHow it is askedMethod
Classify a relation (Section A)MCQ or Statement I/II on whether a relation (perpendicular lines, divisibility, 'less than') is reflexive, symmetric, transitive or an equivalence.Test each property separately; one counter-example kills a property.
Prove an equivalence relation (3 marks)Show R is an equivalence relation and find a class.Write three labelled parts with general elements; then list the class in set-builder form.
One-one and onto proofsShow f is (or is not) one-one / onto / bijective on given sets.One-one: start from . Onto: solve for x and justify that it lies in the domain.
Inverse of a function (2-5 marks)Find for a rational or polynomial function on stated sets; verify f∘ = I.Solve y = f(x) for x, then replace y by x; state the domain.
CompositionFind f∘g and g∘f, or a value such as (f∘g)(2); show non-commutativity.Substitute the inner function completely before simplifying.
Counting and graph itemsNumber of one-one functions; vertical line test; identify f and from graphs.Use ; reflection in y = x.

Tricks to remember Relations and Functions

Short memory aids. Say each one aloud once, then use it on a question the same day.

  • RST

    Equivalence = Reflexive + Symmetric + Transitive: 'Really Smart Teachers'.

    Use it when: Checking all three properties.

  • Perpendicular is only symmetric

    A line is not perpendicular to itself (not reflexive); l ⊥ m and m ⊥ n make l ∥ n (not transitive).

    Use it when: Line-relation MCQs.

  • Vertical for function, horizontal for one-one

    Vertical line cuts once: function. Horizontal line cuts once: one-one.

    Use it when: Graph-based questions.

  • Solve, then swap

    Inverse: solve y = f(x) for x, then swap the letters y → x.

    Use it when: Avoiding the '' answer that examiners penalise.

  • Socks and shoes

    : you put socks then shoes on, but take shoes off first.

    Use it when: Inverse of a composite.

Relations and Functions: board-level solved questions

Ordered from board level to HOTS. Cover the solution, write your own, then compare step by step.

Example 1: Properties of a small relation · 1 mark · MCQBoard level

On A = {1, 2, 3}, the relation R = {(1, 1), (2, 2), (3, 3), (1, 2)} is:
(a) an equivalence relation
(b) reflexive and symmetric only
(c) reflexive and transitive only
(d) symmetric and transitive only

Try it first, then show the solutionSolution
  1. All (a, a) present: reflexive. (2, 1) missing: not symmetric. No chain produces a missing pair: transitive.

Answer: (c)

Example 2: Squaring is not one-one · 1 mark · Assertion-reasonBoard level

Assertion: The function f: R → R, f(x) = x² is not one-one.
Reason: f(−1) = f(1) although −1 ≠ 1.
(a) Both Assertion and Reason are true, and Reason is the correct explanation of Assertion.
(b) Both Assertion and Reason are true, but Reason is not the correct explanation of Assertion.
(c) Assertion is true and Reason is false.
(d) Assertion is false and Reason is true.

Try it first, then show the solutionSolution
  1. Two different inputs with the same image is exactly the definition of failing one-one; the reason is a counter-example proving the assertion.

Answer: (a)

Example 3: Inverse of a rational function · 2 marks · Short answerHarder board level

If f: R − {2} → R − {3} is defined by and is invertible, find . [2]

Try it first, then show the solutionSolution
  1. Let : .
  2. So ; replacing y by x, , x ≠ 3.

Answer:

Example 4: Congruence modulo 3 · 3 marks · Short answerHarder board level

Show that the relation R on Z given by a R b ⇔ 3 divides (a − b) is an equivalence relation. Write the equivalence classes. [3]

Try it first, then show the solutionSolution
  1. Reflexive: a − a = 0 = 3 × 0. Symmetric: a − b = 3k ⇒ b − a = 3(−k).
  2. Transitive: a − b = 3k, b − c = 3m ⇒ a − c = 3(k + m). Hence R is an equivalence relation.
  3. Classes: [0] = {3k}, [1] = {3k + 1}, [2] = {3k + 2}, k ∈ Z: three disjoint classes covering Z.

Answer: Equivalence relation with classes [0], [1], [2]

Example 5: A cubic bijection · 3 marks · Short answerHarder board level

Show that f: R → R, f(x) = 4x³ + 7 is a bijection and find . [3]

Try it first, then show the solutionSolution
  1. One-one: (real cube roots are unique).
  2. Onto: for any real y, is real and f(x) = y.
  3. Hence f is bijective and .

Answer:

Example 6: Bijection, inverse and verification · 5 marks · Long answerHarder board level

Let A = R − {−4/3} and B = R − {4/3}. Consider f: A → B, .
(a) Show that f is one-one and onto. [3]
(b) Find and verify that (f∘)(x) = x. [2]

Try it first, then show the solutionSolution
  1. One-one: .
  2. Onto: , defined for every y ≠ 4/3.
  3. Check x ∈ A: if then , impossible; so x ≠ −4/3. Hence f is onto, and bijective.
  4. , x ≠ 4/3.
  5. .

Answer:

Example 7: Equivalence relations containing a pair · 3 marks · Short answerHOTS / competency

Let A = {1, 2, 3}. (a) Write the smallest and the largest equivalence relations on A. (b) How many equivalence relations on A contain (1, 2)? List them. [3]

Try it first, then show the solutionSolution
  1. (a) Smallest: identity {(1,1), (2,2), (3,3)}. Largest: A × A (9 pairs).
  2. (b) Any equivalence relation containing (1, 2) must contain (2, 1) and the diagonal: = {(1,1), (2,2), (3,3), (1,2), (2,1)}.
  3. Adding any pair with 3 (e.g. (1, 3)) forces, by symmetry and transitivity, all pairs: = A × A. So there are exactly 2.

Answer: (a) identity and A × A (b) 2

Example 8: A function that undoes itself in three steps · 2 marks · Short answerHOTS / competency

If , x ≠ 0, 1, show that f∘f∘f(x) = x. [2]

Try it first, then show the solutionSolution
  1. .
  2. .

Answer: f∘f∘f(x) = x (so )

Case-study practice (Section D style)

Read the situation, then answer every part. In the board paper this is a 5-mark question split into 1 + 1 + 1 + 2 marks.

A two-step secret code

Suppose two friends send numbers secretly. A number x is first coded by f(x) = 2x + 5 and the result is then coded by g(x) = x³. Both work on all real numbers.

  1. (i) · 1 mark

    Write the combined coding rule h(x) = (g∘f)(x).

    Answer

    Answer:

    Apply f first, then g: g(2x + 5) = (2x + 5)³.

  2. (ii) · 1 mark

    Show that f is a bijection and find .

    Answer

    Answer:

    Linear with slope 2 ≠ 0: one-one, and every y has pre-image (y − 5)/2.

  3. (iii) · 1 mark

    Find the decoding rule .

    Answer

    Answer:

    : take the cube root first, then apply .

  4. (iv) · 2 marks

    A coded message reads 343. What was the original number? Would the code still work if g were x² instead of x³?

    Answer

    Answer: 1; no.

    , (7 − 5)/2 = 1. With x², g is not one-one on R (e.g. (−3)² = 3²), so decoding would be ambiguous.

Relations in a sports club

Suppose a club has members P, Q, R, S. P plays chess and tennis, Q plays tennis, R plays chess and S plays football. Define a relation T: x T y if x and y play at least one common sport.

  1. (i) · 1 mark

    Is T reflexive? Is it symmetric?

    Answer

    Answer: Yes and yes.

    Every member shares a sport with themselves; 'common sport' does not depend on order.

  2. (ii) · 1 mark

    Is T transitive? Give a reason.

    Answer

    Answer: No.

    Q T P (tennis) and P T R (chess), but Q and R share no sport, so Q T R fails.

  3. (iii) · 1 mark

    Is T an equivalence relation? What relation would be?

    Answer

    Answer: No; e.g. 'plays exactly the same set of sports as'.

    T is not transitive. Having identical sets of sports is reflexive, symmetric and transitive.

  4. (iv) · 2 marks

    Write T as a set of ordered pairs.

    Answer

    Answer: {(P,P), (Q,Q), (R,R), (S,S), (P,Q), (Q,P), (P,R), (R,P)}

    P shares tennis with Q and chess with R; S shares nothing with anyone else.

Where the marks are

How a typical answer is split into step marks. Show every step: a right final answer alone rarely earns full marks.

f: R − {2} → R − {3}, is invertible. Find . (2 marks)

StepMarks
Puts y = f(x) and solves: 1
Writes (in terms of x), x ≠ 31

Show that R on Z, a R b ⇔ 3 | (a − b), is an equivalence relation. (3 marks)

StepMarks
Reflexive with reason (a − a = 0)1
Symmetric with reason (b − a = −(a − b))1
Transitive with reason (a − c = (a − b) + (b − c))1

Show that f: R − {−4/3} → R − {4/3}, is a bijection; find and verify f∘ = I. (5 marks)

StepMarks
One-one proof from 1
Solves for x: 1
Justifies x is in the domain for every y in the co-domain (onto)1
1
Verification f((x)) = x1

Where students lose marks in Relations and Functions

The slips examiners see most often, and what to write instead.

  • Mistake: Confusing symmetric with transitive

    CISCE examiners' comments, 2024: for the relation 'is perpendicular to' on lines in a plane, candidates confused symmetric and transitive properties.

    Wrong working

    Perpendicularity is symmetric and transitive.

    Right working

    l ⊥ m ⇒ m ⊥ l (symmetric), but l ⊥ m and m ⊥ n give l ∥ n, so not transitive; no line is perpendicular to itself, so not reflexive.

    Do this: Test each property with a quick sketch or counter-example.

    Usually costs: 1 mark.

  • Mistake: Leaving the inverse as

    CISCE examiners' comments, 2024: candidates found and stopped, instead of replacing y by x to give .

    Wrong working

    (final answer).

    Right working

    Then write .

    Do this: The last line must be in terms of x, as the question asks.

    Usually costs: 1 mark.

  • Mistake: Claiming onto without justification

    CISCE examiners' comments, 2024: candidates solved y = f(x) for x and declared f onto without checking that x belongs to the domain.

    Wrong working

    , hence onto.

    Right working

    For every real y, is real (in the domain) and f(x) = y; hence onto.

    Do this: Always add the sentence 'x ∈ domain and f(x) = y'.

    Usually costs: 1 mark.

  • Mistake: Not knowing the vertical line test

    CISCE examiners' comments, 2024: asked which of two graphs is a function of x, candidates did not know the vertical line test.

    Wrong working

    Chooses a circle-like curve as a function.

    Right working

    A curve is a function of x only if every vertical line meets it at most once.

    Do this: Draw a vertical line across each graph before choosing.

    Usually costs: 1 mark.

  • Mistake: Misjudging one-one functions between sets of different sizes

    CISCE examiners' comments, 2025: in an assertion-reason item on one-one functions from a larger set to a smaller one, candidates did not understand mappings between sets of unequal size; others could not write the smallest equivalence relation on {1, 2, 3} because they could not list A × A.

    Wrong working

    With m > n there are still some one-one functions.

    Right working

    If m > n, two elements must share an image (pigeonhole), so there are no one-one functions. The smallest equivalence relation on A is the identity relation.

    Do this: Count with small sets; list A × A when needed.

    Usually costs: 1 mark.

Practice questions on Relations and Functions

Write each answer on paper first. Open the hint only if you are stuck, and the answer only when you have finished.

  1. Q1 · 1 mark · MCQBoard level

    Statement I: Every equivalence relation on a set is reflexive.
    Statement II: Every reflexive relation on a set is symmetric.
    (a) Both statements are true.
    (b) Both statements are false.
    (c) Statement I is true and Statement II is false.
    (d) Statement I is false and Statement II is true.

    Hint

    Try R = {(1,1), (2,2), (1,2)} on {1, 2}.

    Answer

    (c)

  2. Q2 · 1 mark · MCQBoard level

    The number of one-one functions from {a, b, c} to {1, 2, 3, 4} is:
    (a) 12
    (b) 24
    (c) 64
    (d) 81

    Hint

    4 × 3 × 2.

    Answer

    (b) 24

  3. Q3 · 1 mark · MCQBoard level

    The domain of is:
    (a) [2, ∞)
    (b) (2, ∞)
    (c) (−∞, 2)
    (d) R − {2}

    Hint

    The square root must be positive, not zero.

    Answer

    (b)

  4. Q4 · 1 mark · Very short answerBoard level

    Write the smallest equivalence relation on A = {a, b}.

    Hint

    Only what reflexivity forces.

    Answer

    {(a, a), (b, b)}

  5. Q5 · 2 marks · Short answerBoard level

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

    Hint

    Inner function first.

    Answer

    (f∘g)(2) = f(1) = 2; (g∘f)(2) = g(5) = 7.

  6. Q6 · 2 marks · Short answerHarder board level

    Show that f: R → R, is one-one and onto.

    Hint

    Justify that the pre-image is real.

    Answer

    One-one: . Onto: for any real y, is real and f(x) = y.

  7. Q7 · 2 marks · Short answerHarder board level

    Check whether R = {(a, b) : a ≤ b²} on R is reflexive, symmetric or transitive.

    Hint

    Try a = 1/2; try 3, 2, 1.5.

    Answer

    Not reflexive: 1/2 ≤ 1/4 is false. Not symmetric: 1 ≤ 4 but 2 ≤ 1 is false. Not transitive: 3 ≤ 2² and 2 ≤ 1.5², but 3 ≤ 1.5² = 2.25 is false.

  8. Q8 · 2 marks · Short answerHOTS / competency

    If (x ≠ 0, 1), find f∘f(x) and hence .

    Hint

    f∘f∘f = I.

    Answer

    f∘f(x) = (x − 1)/x; since f∘(f∘f) = I, .

  9. Q9 · 3 marks · Short answerHarder board level

    On N × N define (a, b) R (c, d) ⇔ a + d = b + c. Show that R is an equivalence relation.

    Hint

    Transitive: add the two equations.

    Answer

    Reflexive: a + b = b + a. Symmetric: a + d = b + c ⇒ c + b = d + a. Transitive: a + d = b + c and c + f = d + e; adding, a + f = b + e, so (a, b) R (e, f).

  10. Q10 · 3 marks · Short answerHarder board level

    Show that f: [0, ∞) → [0, ∞), f(x) = x² is invertible, find , and describe how the two graphs are related.

    Hint

    Restricting the domain removes negative inputs.

    Answer

    On [0, ∞), a² = b² ⇒ a = b (one-one); every y ≥ 0 has pre-image √y (onto). . The graphs are mirror images in the line y = x.

  11. Q11 · 3 marks · Short answerHarder board level

    Is f: R → R, f(x) = |x| + x one-one? onto? Justify.

    Hint

    Write f piecewise.

    Answer

    f(x) = 2x for x ≥ 0 and 0 for x < 0. Not one-one: f(−1) = f(−2) = 0. Not onto: negative numbers are never images (range [0, ∞)).

  12. Q12 · 5 marks · Long answerHarder board level

    (a) Show that f: R − {3} → R − {1}, is bijective. [3]
    (b) Find and verify ∘f(x) = x. [2]

    Hint

    Solve y(x − 3) = x + 2.

    Answer

    (a) One-one: . Onto: , real for y ≠ 1, and it never equals 3 (that would need 2 = −3). (b) ; .

  13. Q13 · 2 marks · Short answerHarder board level

    Find the domain and range of . Is f: [−3, 3] → [0, 3] one-one?

    Hint

    Symmetric about x = 0.

    Answer

    Domain [−3, 3], range [0, 3]. Not one-one: f(−1) = f(1) = √8.

Test your recall

Answer in your head or on paper first, then open the card. Pulling an answer out of memory makes it stick far better than re-reading.

  1. 1.Define an equivalence relation.Show answer

    A relation that is reflexive, symmetric and transitive.

  2. 2.What is the identity relation on A?Show answer

    .

  3. 3.When is f one-one?Show answer

    When implies .

  4. 4.When is f onto?Show answer

    When its range equals its co-domain.

  5. 5.Condition for f to be invertible?Show answer

    f must be one-one and onto (bijective).

  6. 6.How are the graphs of f and related?Show answer

    Reflections of each other in the line y = x.

  7. 7.Is composition commutative?Show answer

    No; in general g∘f ≠ f∘g.

  8. 8. = ?Show answer

    .

Best order to study it

  1. Learn the definitions of relations and the three properties, with one example and one counter-example each.
  2. Practise equivalence-relation proofs and equivalence classes.
  3. Revise domain and range of real functions and the vertical line test.
  4. Practise one-one and onto proofs, with full justification for onto.
  5. Work through composition, then invertibility and finding inverses.
  6. Finish with mixed Section A items (MCQ, Statement I/II, assertion-reason).

Quick revision checklist

The night before the exam: can you do each of these without looking?

  • Can you test a relation for reflexive, symmetric and transitive properties?
  • Can you prove an equivalence relation and write its classes?
  • Can you find the domain and range of a function with a square root or fraction?
  • Can you prove one-one and onto with justification?
  • Can you count one-one functions between two finite sets?
  • Can you find f∘g and g∘f and show they differ?
  • Can you find an inverse and write it as with its domain?
  • Can you explain why f and are reflections in y = x?

Relations and Functions: frequently asked questions

How much does this chapter carry in ISC 2027?

Unit 1, Relations and Functions (this chapter and Inverse Trigonometric Functions), carries 10 of the 80 marks in the theory paper.

Are composite and inverse functions tested for all kinds of functions?

No. The syllabus restricts composite and invertible functions to algebraic functions only.

Do I need to sketch graphs?

Yes: the syllabus includes sketching the graph of a function and its inverse. Show both curves and the line y = x as the mirror.

How do I prove that a function is onto?

Take an arbitrary y in the co-domain, solve y = f(x) for x, and show that this x lies in the domain. Then f(x) = y, so every y has a pre-image.

What is the difference between co-domain and range?

The co-domain is the set the function maps into, given in its definition; the range is the set of values actually taken. f is onto exactly when they are equal.

Is every reflexive relation an identity relation?

No. Every identity relation is reflexive, but a reflexive relation may also contain other pairs, such as (1, 2).

Based on: CISCE ISC 2027 Mathematics syllabus; CISCE ISC 2027 Mathematics specimen question paper and answer key; CISCE Analysis of Pupil Performance, ISC Mathematics, 2025; CISCE Analysis of Pupil Performance, ISC Mathematics, 2024