Skip to content

Relations and Functions | CBSE

sources:

  • text: Standard textbook reference

Relations and functions form the foundation of higher mathematics. This topic covers types of relations, types of functions, composition, and invertibility.

  • Relation RR from set AA to set BB is a subset of A×BA \times B
  • Domain of RR: dom(R)={aA:(a,b)R for some bB}\text{dom}(R) = \{a \in A : (a, b) \in R \text{ for some } b \in B\}
  • Range of RR: ran(R)={bB:(a,b)R for some aA}\text{ran}(R) = \{b \in B : (a, b) \in R \text{ for some } a \in A\}
  • Reflexive: (a,a)R(a, a) \in R for all aAa \in A
  • Symmetric: (a,b)R    (b,a)R(a, b) \in R \implies (b, a) \in R
  • Transitive: (a,b)R(a, b) \in R and (b,c)R    (a,c)R(b, c) \in R \implies (a, c) \in R
  • Equivalence relation: reflexive, symmetric, and transitive
  • Function f:ABf: A \to B is injective (one-to-one): f(a1)=f(a2)    a1=a2f(a_1) = f(a_2) \implies a_1 = a_2
  • Function f:ABf: A \to B is surjective (onto): for every bBb \in B, there exists aAa \in A with f(a)=bf(a) = b
  • Bijective function: both injective and surjective

Problem: Let A={1,2,3,4}A = \{1, 2, 3, 4\} and R={(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(2,3),(3,2)}R = \{(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (2, 3), (3, 2)\}. Determine if RR is reflexive, symmetric, and transitive.

Solution:

Reflexive: Check if (a,a)R(a, a) \in R for all aAa \in A: (1,1),(2,2),(3,3),(4,4)R(1,1), (2,2), (3,3), (4,4) \in R. Yes, RR is reflexive.

Symmetric: Check if (a,b)R    (b,a)R(a, b) \in R \implies (b, a) \in R: (1,2)R(1,2) \in R and (2,1)R(2,1) \in R. (2,3)R(2,3) \in R and (3,2)R(3,2) \in R. Yes, RR is symmetric.

Transitive: Check if (a,b)R(a, b) \in R and (b,c)R    (a,c)R(b, c) \in R \implies (a, c) \in R: (1,2)R(1,2) \in R and (2,3)R(2,3) \in R, but (1,3)R(1,3) \notin R. No, RR is not transitive.

Common mistake: Assuming that if a relation is reflexive and symmetric, it must be transitive. Always check all three properties.

Worked Example 2 — Injective and Surjective Functions

Section titled “Worked Example 2 — Injective and Surjective Functions”

Problem: Determine whether f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x2+1f(x) = x^2 + 1 is injective, surjective, or bijective.

Solution:

Injective: Suppose f(a)=f(b)f(a) = f(b): a2+1=b2+1    a2=b2    a=±ba^2 + 1 = b^2 + 1 \implies a^2 = b^2 \implies a = \pm b

Since aa and bb could have opposite signs (e.g., f(1)=f(1)=2f(1) = f(-1) = 2), ff is not injective.

Surjective: Is every yRy \in \mathbb{R} in the range? For y=0y = 0: x2+1=0    x2=1x^2 + 1 = 0 \implies x^2 = -1, which has no real solution. So ff is not surjective.

Since ff is neither injective nor surjective, it is not bijective.

Common mistake: Forgetting that x2=ax^2 = a has solutions x=±ax = \pm\sqrt{a}, which breaks injectivity.

Worked Example 3 — Composition of Functions

Section titled “Worked Example 3 — Composition of Functions”

Problem: If f(x)=2x+3f(x) = 2x + 3 and g(x)=x2g(x) = x^2, find (fg)(x)(f \circ g)(x) and (gf)(x)(g \circ f)(x).

Solution:

(fg)(x)=f(g(x))=f(x2)=2x2+3(f \circ g)(x) = f(g(x)) = f(x^2) = 2x^2 + 3

(gf)(x)=g(f(x))=g(2x+3)=(2x+3)2=4x2+12x+9(g \circ f)(x) = g(f(x)) = g(2x + 3) = (2x + 3)^2 = 4x^2 + 12x + 9

Note that fggff \circ g \neq g \circ f as a rule.

Common mistake: Computing g(f(x))g(f(x)) as g(x)f(x)g(x) \cdot f(x) instead of substituting f(x)f(x) into gg.

  1. Let A={1,2,3}A = \{1, 2, 3\} and R={(1,2),(2,3),(1,3)}R = \{(1, 2), (2, 3), (1, 3)\}. Is RR transitive?
  2. Show that f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=2x5f(x) = 2x - 5 is bijective.
  3. Find (ff)(x)(f \circ f)(x) if f(x)=3x1f(x) = 3x - 1.

Relations and functions are the language of mathematics. Every equation, mapping, and transformation in higher mathematics is expressed through functions. Understanding injectivity and surjectivity is essential for calculus, linear algebra, and abstract mathematics.

  • Equivalence relations partition a set into equivalence classes
  • A function is invertible if and only if it is bijective
  • Composition is not commutative: fggff \circ g \neq g \circ f
  • The number of functions from a set of mm elements to a set of nn elements is nmn^m
  • Practice identifying domain and range from graphs and equations
  • Number of relations from AA to BB: 2A×B2^{|A| \times |B|}
  • Number of functions from AA to BB: BA|B|^{|A|}
  • Number of one-one functions from AA to BB: P(B,A)=B!(BA)!P(|B|, |A|) = \frac{|B|!}{(|B|-|A|)!} (when BA|B| \geq |A|)
  • Composition: (fg)(x)=f(g(x))(f \circ g)(x) = f(g(x))
  • Inverse: if f(x)=yf(x) = y, then f1(y)=xf^{-1}(y) = x

Worked Example 4 — Equivalence Relation from Partition

Section titled “Worked Example 4 — Equivalence Relation from Partition”

Problem: Let A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\}. Define RR on AA by aRbaRb if aa and bb leave the same remainder when divided by 3. Show that RR is an equivalence relation and find the equivalence classes.

Solution:

Remainders when divided by 3: 111 \equiv 1, 222 \equiv 2, 303 \equiv 0, 414 \equiv 1, 525 \equiv 2, 606 \equiv 0.

Reflexive: aa and aa leave the same remainder. Yes.

Symmetric: If aa and bb leave the same remainder, then bb and aa leave the same remainder. Yes.

Transitive: If aa and bb leave the same remainder, and bb and cc leave the same remainder, then aa and cc leave the same remainder. Yes.

Equivalence classes:

  • Remainder 0: {3,6}\{3, 6\}
  • Remainder 1: {1,4}\{1, 4\}
  • Remainder 2: {2,5}\{2, 5\}

Common mistake: Forgetting that equivalence classes partition the set. Each element belongs to exactly one class.

Worked Example 5 — Injective Function with Restricted Domain

Section titled “Worked Example 5 — Injective Function with Restricted Domain”

Problem: Determine whether f:Z+Z+f: \mathbb{Z}^+ \to \mathbb{Z}^+ defined by f(n)=2n+1f(n) = 2n + 1 is injective, surjective, or bijective.

Solution:

Injective: Suppose f(a)=f(b)f(a) = f(b): 2a+1=2b+1    a=b2a + 1 = 2b + 1 \implies a = b Yes, ff is injective.

Surjective: Is every positive integer in the range? For f(n)=2n+1f(n) = 2n + 1, the range is {3,5,7,9,...}\{3, 5, 7, 9, ...\} (odd numbers greater than or equal to 3). So 11 and 22 are not in the range. No, ff is not surjective.

Since ff is injective but not surjective, it is not bijective.

Common mistake: Confusing the codomain with the range. The codomain is Z+\mathbb{Z}^+, but the range is only the odd numbers 3\geq 3.

Problem: Find the inverse of f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=2x+3x1f(x) = \frac{2x + 3}{x - 1}, x1x \neq 1.

Solution:

Let y=2x+3x1y = \frac{2x + 3}{x - 1}.

Solve for xx: y(x1)=2x+3y(x - 1) = 2x + 3 xyy=2x+3xy - y = 2x + 3 xy2x=y+3xy - 2x = y + 3 x(y2)=y+3x(y - 2) = y + 3 x=y+3y2x = \frac{y + 3}{y - 2}

Therefore: f1(x)=x+3x2,x2f^{-1}(x) = \frac{x + 3}{x - 2}, \quad x \neq 2

Common mistake: Forgetting to specify the domain of the inverse function. The domain of f1f^{-1} is R{2}\mathbb{R} \setminus \{2\}.

  1. To check transitivity, look for counterexamples: find (a,b)R(a, b) \in R and (b,c)R(b, c) \in R where (a,c)R(a, c) \notin R
  2. For injectivity, assume f(a)=f(b)f(a) = f(b) and show a=ba = b. If you get a=±ba = \pm b, the function is not injective.
  3. For surjectivity, try to solve f(x)=yf(x) = y for arbitrary yy in the codomain
  4. Composition order matters: (fg)(x)=f(g(x))(f \circ g)(x) = f(g(x)), not g(f(x))g(f(x))
  5. A function has an inverse if and only if it is bijective; to find it, solve y=f(x)y = f(x) for xx

A function is a machine with strict rules: Picture a vending machine — you put in a specific coin (input), and you always get the same snack (output). A function is the same: same input always produces same output. Injective means no two different coins give the same snack. Surjective means every snack in the display can be obtained. Bijective means it’s a perfect one-to-one correspondence.

Why it matters: Functions are the language of mathematics itself — every equation, mapping, and transformation is expressed through functions. Understanding injectivity and surjectivity determines whether you can invert a function, solve equations uniquely, and define meaningful compositions.

The key insight: Composition is not commutative because it’s about the order of operations — putting on socks then shoes is fundamentally different from shoes then socks.

Function composition is not commutative: (fg)(x)=f(g(x))(f \circ g)(x) = f(g(x)) is generally not equal to (gf)(x)=g(f(x))(g \circ f)(x) = g(f(x)). Students often compute g(f(x))g(f(x)) when the question asks for f(g(x))f(g(x)), or assume the order does not matter. Always write out the substitution explicitly: for fgf \circ g, plug g(x)g(x) into ff, not the other way around.

Mistake 2: Assuming a relation that is reflexive and symmetric must be transitive

Section titled “Mistake 2: Assuming a relation that is reflexive and symmetric must be transitive”

A relation can be reflexive and symmetric without being transitive. For example, on {1,2,3}\{1, 2, 3\}, the relation {(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}\{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} is reflexive and symmetric but not transitive because (1,2)(1,2) and (2,3)(2,3) are in RR while (1,3)(1,3) is not. Always check all three properties independently.

Mistake 3: Forgetting that composition is not the same as multiplication

Section titled “Mistake 3: Forgetting that composition is not the same as multiplication”

Students sometimes compute (fg)(x)(f \circ g)(x) as f(x)g(x)f(x) \cdot g(x) instead of f(g(x))f(g(x)). Composition means substituting the entire function g(x)g(x) into ff as the input variable. For example, if f(x)=2x+3f(x) = 2x + 3 and g(x)=x2g(x) = x^2, then (fg)(x)=2x2+3(f \circ g)(x) = 2x^2 + 3, not (2x+3)(x2)(2x + 3)(x^2).

  • Inverse Trigonometric Functions — Inverse trigonometric functions are specific examples of inverse functions, requiring understanding of bijectivity.
  • Matrices — Linear transformations are functions from vectors to vectors, extending function theory to matrix algebra.
  • Calculus — Derivatives measure rates of change of functions, connecting function theory to differential calculus.