Class 12 PCM . Mathematics . Mathematics Part I . Relations and Functions

Chapter 1: Relations And Functions

Ch 1

Mathematics

Class 12 PCM

Relations

A relation RR from a non-empty set AA to another non-empty set BB is defined as a subset of the Cartesian product A×BA \times B. Formally,

R⊆A×B={(a,b):a∈A,b∈B}R \subseteq A \times B = \{(a,b) : a \in A, b \in B\}

Thus, any subset of A×BA \times B is a relation from AA to BB.

Note: If AA and BB are finite sets with pp and qq elements respectively, then n(A×B)=pqn(A \times B) = pq. The total number of relations from AA to BB is the number of subsets of A×BA \times B, which is 2pq2^{pq}.

Domain, Range and Co-domain of a Relation

Domain: The domain of a relation RR from AA to BB is the set of all elements a∈Aa \in A such that there exists b∈Bb \in B with (a,b)∈R(a,b) \in R. Formally,

Dom(R)={a∈A:∃b∈B,(a,b)∈R}\text{Dom}(R) = \{ a \in A : \exists b \in B, (a,b) \in R \}

Range: The range of RR is the set of all elements b∈Bb \in B such that there exists a∈Aa \in A with (a,b)∈R(a,b) \in R. Formally,

Range(R)={b∈B:∃a∈A,(a,b)∈R}\text{Range}(R) = \{ b \in B : \exists a \in A, (a,b) \in R \}

Co-domain: The co-domain of RR is the set BB itself.

Types of Relations

  • Empty Relation: R=∅R = \emptyset.
  • Universal Relation: R=A×BR = A \times B.
  • Identity Relation: Defined on AA as IA={(a,a):a∈A}I_A = \{(a,a) : a \in A\}.
  • Reflexive Relation: RR on AA is reflexive if (a,a)∈R(a,a) \in R for all a∈Aa \in A.
  • Symmetric Relation: RR on AA is symmetric if (a,b)∈R⇒(b,a)∈R(a,b) \in R \Rightarrow (b,a) \in R for all a,b∈Aa,b \in A.
  • Transitive Relation: RR on AA is transitive if (a,b)∈R(a,b) \in R and (b,c)∈R(b,c) \in R imply (a,c)∈R(a,c) \in R for all a,b,c∈Aa,b,c \in A.
  • Equivalence Relation: A relation that is reflexive, symmetric, and transitive.

Worked Example 1

Let A={1,2,3,7}A = \{1,2,3,7\}, B={3,6}B = \{3,6\}, and define \( R = \{(a,b) : a < b\} \). Find domain, range, and co-domain.

Solution:

R={(1,3),(1,6),(2,3),(2,6),(3,6)}R = \{(1,3), (1,6), (2,3), (2,6), (3,6)\}

Domain: {1,2,3}\{1,2,3\}

Range: {3,6}\{3,6\}

Co-domain: B={3,6}B = \{3,6\}

Worked Example 2

Check if the relation R={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3)}R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3)\} on A={1,2,3}A = \{1,2,3\} is reflexive.

Solution:

Check if (a,a)∈R(a,a) \in R for all a∈Aa \in A:

(1,1),(2,2),(3,3)∈R(1,1), (2,2), (3,3) \in R, so RR is reflexive.

Practice Set

Level 1 – Easy

  • Define the relation RR on A={1,2}A = \{1,2\} and B={3,4}B = \{3,4\} as R={(1,3)}R = \{(1,3)\}. Find domain, range, and co-domain.
  • Is the empty relation on A={1,2,3}A = \{1,2,3\} reflexive?

Level 2 – Moderate

  • Given A={1,2,3}A = \{1,2,3\}, check if R={(1,2),(2,1),(2,3),(3,2)}R = \{(1,2),(2,1),(2,3),(3,2)\} is symmetric.
  • Show that the universal relation on A={1,2}A = \{1,2\} is reflexive.

Level 3 – Challenging

  • Prove that the relation R={(a,b):a−b is even}R = \{(a,b) : a-b \text{ is even}\} on integers is an equivalence relation.
  • Given A={1,2,3}A = \{1,2,3\}, R={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1),(2,3),(3,2)}R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1),(2,3),(3,2)\}, verify if RR is transitive.

Answer Key

Level 1

  • Domain: {1}\{1\}, Range: {3}\{3\}, Co-domain: {3,4}\{3,4\}
  • No, empty relation is not reflexive as (a,a)∉R(a,a) \notin R for all a∈Aa \in A.

Level 2

  • Yes, RR is symmetric because for every (a,b)∈R(a,b) \in R, (b,a)∈R(b,a) \in R.
  • Universal relation contains all pairs including (a,a)(a,a), so it is reflexive.

Level 3

  • Reflexive: a−a=0a-a=0 even, Symmetric: if a−ba-b even, then b−ab-a even, Transitive: sum of even numbers is even. Hence equivalence relation.
  • Check transitivity: For all (a,b),(b,c)∈R(a,b), (b,c) \in R, (a,c)∈R(a,c) \in R holds. Hence RR is transitive.

Quick Reference

Relation TypeDefinition
Empty RelationR=∅R = \emptyset
Universal RelationR=A×BR = A \times B
Identity RelationIA={(a,a):a∈A}I_A = \{(a,a) : a \in A\}
Reflexive(a,a)∈R(a,a) \in R for all a∈Aa \in A
Symmetric(a,b)∈R⇒(b,a)∈R(a,b) \in R \Rightarrow (b,a) \in R
Transitive(a,b),(b,c)∈R⇒(a,c)∈R(a,b),(b,c) \in R \Rightarrow (a,c) \in R
Equivalence RelationReflexive, Symmetric, and Transitive

Glossary

  • Relation: A subset of A×BA \times B.
  • Domain: Set of first elements in relation pairs.
  • Range: Set of second elements in relation pairs.
  • Co-domain: The set BB in relation R⊆A×BR \subseteq A \times B.
  • Reflexive: Every element relates to itself.
  • Symmetric: Relation is bidirectional.
  • Transitive: Relation passes through intermediate elements.
  • Equivalence Relation: Relation that is reflexive, symmetric, and transitive.

Functions

A function ff from a set AA to a set BB is a special type of relation where each element of AA is related to exactly one element of BB. Formally, f⊆A×Bf \subseteq A \times B such that for every x∈Ax \in A, there exists a unique y∈By \in B with (x,y)∈f(x,y) \in f. The element yy is called the image of xx under ff, denoted f(x)f(x).

Difference Between Relation and Function

PropertyFunctionRelation
ExistenceEvery x∈Ax \in A has at least one y∈By \in B with (x,y)∈f(x,y) \in fNot necessarily
UniquenessEach x∈Ax \in A has exactly one y∈By \in BCan have multiple yy for same xx

Real Valued Function of a Real Variable

If the domain and range of ff are subsets of real numbers R\mathbb{R}, then ff is called a real valued function of a real variable.

Common Real Functions

FunctionExpressionDomainRange
Identityf(x)=xf(x) = xR\mathbb{R}R\mathbb{R}
Modulusf(x)=∣x∣f(x) = |x|R\mathbb{R}[0,∞)[0, \infty)
Greatest Integerf(x)=⌊x⌋f(x) = \lfloor x \rfloorR\mathbb{R}Z\mathbb{Z}
Signum\( f(x) = \begin{cases} -1 & x<0 \\ 0 & x=0 \\ 1 & x>0 \end{cases} \)R\mathbb{R}{−1,0,1}\{-1,0,1\}
Exponential\( f(x) = a^x, a>0, a \neq 1 \)R\mathbb{R}(0,∞)(0, \infty)
Logarithmic\( f(x) = \log_a x, a>0, a \neq 1 \)(0,∞)(0, \infty)R\mathbb{R}

Types of Functions

  • One-one (Injective) Function: f:A→Bf: A \to B is injective if f(a)=f(b)⇒a=bf(a) = f(b) \Rightarrow a = b for all a,b∈Aa,b \in A.
  • Onto (Surjective) Function: f:A→Bf: A \to B is surjective if for every b∈Bb \in B, there exists a∈Aa \in A such that f(a)=bf(a) = b.
  • Bijective Function: A function that is both injective and surjective.
  • Identity Function: IA:A→AI_A: A \to A defined by IA(x)=xI_A(x) = x for all x∈Ax \in A.
  • Equal Functions: Two functions ff and gg are equal if f(x)=g(x)f(x) = g(x) for all xx in their domain.

Algorithms to Check Injectivity and Surjectivity

Injectivity

  1. Take arbitrary a,b∈Aa,b \in A.
  2. Assume f(a)=f(b)f(a) = f(b).
  3. Solve for a=ba = b. If true for all a,ba,b, ff is injective.

Surjectivity

  1. Take arbitrary b∈Bb \in B.
  2. Solve f(x)=bf(x) = b for xx.
  3. If solution x∈Ax \in A exists for all bb, ff is surjective.

Worked Example 1

Show that f:A→Bf: A \to B defined by f(x)=4x+7f(x) = 4x + 7 is one-one.

Solution:

Assume f(x1)=f(x2)f(x_1) = f(x_2), then

4x1+7=4x2+74x_1 + 7 = 4x_2 + 7

4x1=4x24x_1 = 4x_2

x1=x2x_1 = x_2

Hence, ff is injective.

Worked Example 2

Show that f:N→Nf: \mathbb{N} \to \mathbb{N} defined by f(1)=f(2)=1f(1) = f(2) = 1 and f(x)=x−1f(x) = x - 1 for \( x > 2 \) is onto but not one-one.

Solution:

Since f(1)=f(2)=1f(1) = f(2) = 1, ff is not injective.

For any y∈Ny \in \mathbb{N}, y≠1y \neq 1, choose x=y+1x = y + 1, then f(x)=yf(x) = y. Also f(1)=1f(1) = 1. Hence, ff is onto.

Practice Set

Level 1 – Easy

  • Define a function f:{1,2,3}→{4,5}f: \{1,2,3\} \to \{4,5\} and find its domain, co-domain, and range.
  • Is the function f(x)=2x+3f(x) = 2x + 3 injective?

Level 2 – Moderate

  • Check if f(x)=x2f(x) = x^2 from R→R\mathbb{R} \to \mathbb{R} is onto.
  • Show that the function f(x)=sin⁡xf(x) = \sin x is not one-one.

Level 3 – Challenging

  • Prove that the function f:R→Rf: \mathbb{R} \to \mathbb{R} defined by f(x)=3x+2f(x) = 3x + 2 is bijective.
  • Find the inverse of the function f(x)=2x−13f(x) = \frac{2x - 1}{3} and verify it is bijective.

Answer Key

Level 1

  • Domain: {1,2,3}\{1,2,3\}, Co-domain: {4,5}\{4,5\}, Range depends on function definition.
  • Yes, f(x)=2x+3f(x) = 2x + 3 is injective.

Level 2

  • f(x)=x2f(x) = x^2 is not onto R\mathbb{R} because negative numbers are not in range.
  • f(x)=sin⁡xf(x) = \sin x is not one-one as sin⁡x=sin⁡(π−x)\sin x = \sin (\pi - x).

Level 3

  • f(x)=3x+2f(x) = 3x + 2 is bijective because it is both injective and surjective.
  • Inverse: f−1(y)=3y+12f^{-1}(y) = \frac{3y + 1}{2}. Verified by composition.

Quick Reference

Function TypeCondition
Injectivef(a)=f(b)⇒a=bf(a) = f(b) \Rightarrow a = b
Surjective∀b∈B,∃a∈A:f(a)=b\forall b \in B, \exists a \in A : f(a) = b
BijectiveBoth injective and surjective
IdentityIA(x)=xI_A(x) = x

Glossary

  • Function: Relation with unique image for each element in domain.
  • Domain: Set of inputs.
  • Co-domain: Set of possible outputs.
  • Range: Actual set of outputs.
  • Injective: One-to-one mapping.
  • Surjective: Onto mapping.
  • Bijective: Both injective and surjective.
  • Inverse Function: Function reversing ff.

Mathematics — ALL CHAPTERS

1

Relations And Functions

View

2

Inverse Trigonometric Functions

View

3

Matrices

View

4

DETERMINANTS 

View

5

Continuity And Differentiability

View

6

Application Of Derivatives

View

7

Integrals

View

8

APPLICATION OF INTEGRALS

View

9

DIFFERENTIAL EQUATIONS

View

10

VECTOR ALGEBRA

View

11

Three Dimensional Geometry

View

12

Linear Programming

View

13

Probability

View

14

Proofs In Mathematics

View

15

Mathematical Modelling

View
Relations and Functions Notes – Class 12 Mathematics | Prepzy