RELATIONS AND FUNCTIONS-Exercise 2.1

The solutions of the textbook exercises of NCERT Mathematics Class XI Chapter 2 – Relations and Functions are designed to help students develop a clear and logical understanding of one of the most fundamental concepts in higher mathematics. This chapter forms the base for advanced topics such as calculus, inverse trigonometric functions, and mappings studied in later classes. Each solution is presented in a systematic and concept-driven manner, strictly following the definitions, notations, and approach prescribed by the NCERT textbook. Emphasis is placed on understanding relations as subsets of Cartesian products and functions as special relations with unique outputs. Step-by-step reasoning, correct use of symbols, and precise mathematical language ensure clarity and accuracy. These solutions not only assist students in solving textbook problems but also strengthen analytical thinking and exam readiness, making them highly useful for school examinations as well as competitive exams that follow the NCERT syllabus.

Continue Reading →
Maths

TRIGONOMETRIC FUNCTIONS-Exercise 3.2

Exercise • Jan 2026

Trigonometric Functions form a crucial foundation of higher mathematics and play a vital role in physics, engineering, astronomy, and real-life proble...

Continue Reading →
Exercise
Maths

TRIGONOMETRIC FUNCTIONS-Exercise 3.1

Exercise • Jan 2026

Trigonometric Functions form a crucial foundation of higher mathematics and play a vital role in physics, engineering, astronomy, and real-life proble...

Continue Reading →
Exercise
January 15, 2026  |  By Academia Aeternum

RELATIONS AND FUNCTIONS-Exercise 2.1

Maths - Exercise

Q1. If \(\left(\dfrac{x}{1} + 1,y-\dfrac{2}{3}\right)=\left(dfrac{5}{3},\dfrac{1}{3}\right)\), find the values of x and y.

Solution

We are given the equality of two ordered pairs. Hence, their corresponding coordinates must be equal. Thus, \[ \begin{aligned} \left(\dfrac{x}{3}+1,\, y-\dfrac{2}{3}\right) &= \left(\dfrac{5}{3},\, \dfrac{1}{3}\right). \end{aligned} \]

Equating the first coordinates, we get \[ \begin{aligned} \dfrac{x}{3}+1 &= \dfrac{5}{3} \\ \dfrac{x}{3} &= \dfrac{5}{3}-1 \\ \dfrac{x}{3} &= \dfrac{2}{3} \\ x &= 2 \end{aligned} \]

Equating the second coordinates, we obtain \[ \begin{aligned} y-\dfrac{2}{3} &= \dfrac{1}{3} \\ y &= \dfrac{1}{3}+\dfrac{2}{3} \\ y &= \dfrac{3}{3} = 1 \end{aligned} \]

Therefore, the required values of \(x\) and \(y\) are \[ \Rightarrow (x,y) = (2,1) \]


Q2. If the set A has 3 elements and the set B = {3, 4, 5}, then find the number of elements in (A×B).

Solution

We are given that the set \(A\) contains 3 elements and the set \(B=\{3,4,5\}\). Hence, the number of elements in each set can be written as \[ \begin{aligned} n(A) &= 3 \\ n(B) &= 3 \end{aligned} \]

The number of elements in the Cartesian product of two finite sets is equal to the product of the number of elements in each set. Therefore, \[ \begin{aligned} n(A \times B) &= n(A)\times n(B) \\ &= 3 \times 3 \\ &= 9 \end{aligned} \]

Thus, the Cartesian product \(A \times B\) contains \(9\) elements.


Q3. If G = {7, 8} and H = {5, 4, 2}, find G × H and H × G.

Solution

We are given the two sets \[ \begin{aligned} G &= \{7,8\},\\ H &= \{5,4,2\} \end{aligned} \]

The Cartesian product \(G \times H\) consists of all ordered pairs \((g,h)\) such that \(g \in G\) and \(h \in H\). Therefore, \[ \begin{aligned} G \times H &= \{7,8\} \times \{5,4,2\} \\ &= \{(7,5),(7,4),(7,2),\\ &(8,5),(8,4),(8,2)\} \end{aligned} \]

Similarly, the Cartesian product \(H \times G\) consists of all ordered pairs \((h,g)\) such that \(h \in H\) and \(g \in G\). Hence, \[ \begin{aligned} H \times G &= \{5,4,2\} \times \{7,8\} \\ &= \{(5,7),(5,8),(4,7),\\&(4,8),(2,7),(2,8)\} \end{aligned} \]


Q4. State whether each of the following statements are true or false. If the statement is false, rewrite the given statement correctly.
(i) If P = {m, n} and Q = { n, m}, then P × Q = {(m, n),(n, m)}.
(ii) If A and B are non-empty sets, then A × B is a non-empty set of ordered pairs (x, y) such that x ∈ A and y ∈ B.
(iii) If A = {1, 2}, B = {3, 4}, then A × (B ∩ φ) = φ.

Solution

(i) We are given \(P=\{m,n\}\) and \(Q=\{n,m\}\). The Cartesian product \(P\times Q\) consists of all ordered pairs \((x,y)\) such that \(x\in P\) and \(y\in Q\). Thus, \[ \begin{aligned} P\times Q &= \{m,n\}\times\{n,m\} \\ &= \{(m,n),(m,m),(n,n),(n,m)\} \end{aligned} \] Hence, the given statement is false. The correct statement is \(P\times Q=\{(m,n),(m,m),(n,n),(n,m)\}\).

(ii) If \(A\) and \(B\) are non-empty sets, then there exists at least one element \(x\in A\) and at least one element \(y\in B\). Therefore, the ordered pair \((x,y)\) belongs to \(A\times B\). Hence, \[ \begin{aligned} A\times B \neq \varnothing \end{aligned} \] and it is a set of ordered pairs \((x,y)\) such that \(x\in A\) and \(y\in B\). Thus, the given statement is true.

(iii) We are given \(A=\{1,2\}\) and \(B=\{3,4\}\). Since the intersection of any set with the empty set is the empty set, \[ \begin{aligned} B\cap \varnothing &= \varnothing \end{aligned} \] Now, the Cartesian product of any set with the empty set is also the empty set. Hence, \[ \begin{aligned} A\times (B\cap \varnothing) &= A\times \varnothing \\ &= \varnothing \end{aligned} \] Therefore, the given statement is true.


Q5. If A = {–1, 1}, find A × A × A.

Solution

We are given the set \[ \begin{aligned} A=\{-1,1\} \end{aligned} \]

First, we find the Cartesian product of \(A\) with itself: \[ \begin{aligned} A\times A &= \{-1,1\}\times\{-1,1\} \\ &= \{(-1,-1),(-1,1),(1,-1),(1,1)\} \end{aligned} \]

Now, the Cartesian product \(A\times A\times A\) is obtained by taking the Cartesian product of \(A\times A\) with \(A\): \[ \begin{aligned} A\times A\times A &= \{(-1,-1),(-1,1),(1,-1),(1,1)\}\times\{-1,1\} \\ &= \{(-1,-1,-1),(-1,-1,1),(-1,1,-1),\\&(-1,1,1),(1,-1,-1),(1,-1,1),\\&(1,1,-1),(1,1,1)\} \end{aligned} \]


Q6. If A × B = {(a, x),(a , y), (b, x), (b, y)}. Find A and B.

Solution

We are given the Cartesian product \[ \begin{aligned} A\times B=\{(a,x),(a,y),(b,x),(b,y)\} \end{aligned} \]

From the ordered pairs in \(A\times B\), the first components are \(a\) and \(b\). Hence, \[ \begin{aligned} A=\{a,b\} \end{aligned} \]

Similarly, the second components of the ordered pairs are \(x\) and \(y\). Therefore, \[ \begin{aligned} B=\{x,y\} \end{aligned} \]


Q7. Let A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8}. Verify that
(i) A × (B ∩ C) = (A × B) ∩ (A × C).
(ii) A × C is a subset of B × D.

Solution

We are given the sets \[ \begin{aligned} A&=\{1,2\} \\ B&=\{1,2,3,4\} \\ C&=\{5,6\} \\ D&=\{5,6,7,8\} \end{aligned} \]

(i) First, we find the intersection of \(B\) and \(C\): \[ \begin{aligned} B\cap C=\varnothing \end{aligned} \] Hence, \[ \begin{aligned} A\times (B\cap C) &= \{1,2\}\times \varnothing \\ &= \varnothing \end{aligned} \]

Now, we evaluate \(A\times B\) and \(A\times C\): \[ \begin{aligned} A\times B &= \{1,2\}\times\{1,2,3,4\} \\ &= \{(1,1),(1,2),(1,3),(1,4),\\&(2,1),(2,2),(2,3),(2,4)\} \end{aligned} \] \[ \begin{aligned} A\times C &= \{1,2\}\times\{5,6\} \\ &= \{(1,5),(1,6),\\&(2,5),(2,6)\} \end{aligned} \] Since there is no common ordered pair in the above two sets, \[ \begin{aligned} (A\times B)\cap(A\times C)=\varnothing \end{aligned} \] Thus, \[ \begin{aligned} A\times(B\cap C)=(A\times B)\cap(A\times C) \end{aligned} \] Hence, part (i) is verified.

(ii) Now, we find \(A\times C\): \[ \begin{aligned} A\times C&=\{(1,5),(1,6),\\&(2,5),(2,6)\} \end{aligned} \] Also, \[ \begin{aligned} B\times D=\{1,2,3,4\}\times\{5,6,7,8\} \end{aligned} \] Each element of \(A\times C\) has its first component in \(B\) and its second component in \(D\). Therefore, \[ \begin{aligned} A\times C \subseteq B\times D \end{aligned} \] Hence, part (ii) is verified.


Q8. Let A = {1, 2} and B = {3, 4}. Write A × B. How many subsets will A × B have? List them.

Solution

We are given the sets \[ \begin{aligned} A&=\{1,2\} \\ B&=\{3,4\} \end{aligned} \]

The Cartesian product \(A\times B\) is the set of all ordered pairs \((a,b)\) such that \(a\in A\) and \(b\in B\). Hence, \[ \begin{aligned} A\times B &= \{1,2\}\times\{3,4\} \\ &= \{(1,3),(1,4),(2,3),(2,4)\} \end{aligned} \]

Since set \(A\) has 2 elements and set \(B\) has 2 elements, the number of elements in their Cartesian product is \[ \begin{aligned} n(A) &= 2 \\ n(B) &= 2 \\ n(A\times B) &= 2\times 2 \\ &= 4 \end{aligned} \]

The number of subsets of a set containing 4 elements is given by \[ \begin{aligned} 2^{4} &= 16 \end{aligned} \]

Thus, \(A\times B\) has 16 subsets. These subsets are \[ \begin{aligned} \varnothing,\{(1,3)\},\{(1,4)\},\{(2,3)\},\{(2,4)\},\{(1,3),(1,4)\},\{(1,3),(2,3)\},\\ \{(1,3),(2,4)\},\{(1,4),(2,3)\},\{(1,4),(2,4)\},\{(2,3),(2,4)\},\\ \{(1,3),(1,4),(2,3)\},\{(1,3),(1,4),(2,4)\}, \{(1,3),(2,3),(2,4)\},\\ \{(1,4),(2,3),(2,4)\},\{(1,3),(1,4),(2,3),(2,4)\} \end{aligned} \]


Q9. Let A and B be two sets such that n(A) = 3 and n(B) = 2. If (x, 1), (y, 2), (z, 1) are in A × B, find A and B, where x, y and z are distinct elements.

Solution

We are given that the number of elements in the sets are \[ \begin{aligned} n(A)=3 \\ n(B)=2 \end{aligned} \] and the ordered pairs \((x,1),(y,2),(z,1)\) belong to \(A\times B\), where \(x,y\) and \(z\) are distinct elements

Since the first components of the given ordered pairs come from set \(A\), we observe that the elements of \(A\) are \(x,y\) and \(z\). Thus, \[ \begin{aligned} A=\{x,y,z\} \end{aligned} \]

Similarly, the second components of the ordered pairs come from set \(B\). These are \(1\) and \(2\). Hence, \[ \begin{aligned} B=\{1,2\} \end{aligned} \]

Therefore, the required sets are \(A=\{x,y,z\}\) and \(B=\{1,2\}\)


Q10. The Cartesian product A × A has 9 elements among which are found (–1, 0) and (0,1). Find the set A and the remaining elements of A × A.

Solution

We are given that the Cartesian product \(A\times A\) has 9 elements. Hence, \[ \begin{aligned} n(A\times A)=9 \end{aligned} \] This implies that \[ \begin{aligned} n(A)^2=9 \end{aligned} \] and therefore \(n(A)=3\)

It is also given that the ordered pairs \((-1,0)\) and \((0,1)\) belong to \(A\times A\). Thus, the elements \(-1,0\) and \(1\) must all belong to the set \(A\). Since \(A\) has exactly three elements, we obtain \[ \begin{aligned} A=\{-1,0,1\} \end{aligned} \]

Now, we write the complete Cartesian product \(A\times A\): \[ \begin{aligned} A\times A &= \{-1,0,1\}\times\{-1,0,1\} \\ &= \{(-1,-1),(-1,0),(-1,1),\\(0,-1),(0,0),(0,1),\\(1,-1),(1,0),(1,1)\} \end{aligned} \]

Thus, the set \(A\) is \(\{-1,0,1\}\) and the remaining elements of \(A\times A\) are all the ordered pairs listed above


Frequently Asked Questions

An ordered pair is a pair of elements written as \((a, b)\), where the order matters. Two ordered pairs are equal if and only if their corresponding elements are equal.

The Cartesian product of sets \(A\) and \(B\), denoted \(A \times B\), is the set of all ordered pairs \((a, b)\) where \(a \in A\) and \(b \in B\).

If set \(A\) has \(m\) elements and set \(B\) has \(n\) elements, then \(A \times B\) has \(m \times n\) elements.

A relation from set \(A\) to set \(B\) is any subset of the Cartesian product \(A \times B\).

The domain is the set of all first elements of the ordered pairs belonging to the relation.

The range is the set of all second elements of the ordered pairs of a relation.

The codomain is the set from which the second elements of ordered pairs are taken, regardless of whether all elements appear in the relation or not.

A relation that contains no ordered pair is called an empty relation.

A relation that contains all possible ordered pairs of a Cartesian product is called a universal relation.

An identity relation on a set \(A\) consists of all ordered pairs \((a, a)\) for every \(a \in A\).

A relation is reflexive if every element of the set is related to itself, i.e., \((a, a)\) belongs to the relation for all \(a\).

A relation is symmetric if whenever \((a, b)\) belongs to the relation, \((b, a)\) also belongs to it.

A relation is transitive if whenever \((a, b)\) and \((b, c)\) belong to the relation, then \((a, c)\) must also belong to it.

A relation that is reflexive, symmetric, and transitive is called an equivalence relation.

An equivalence class is the set of all elements related to a given element under an equivalence relation.

A function is a special type of relation in which every element of the domain is associated with exactly one element of the codomain.

In a relation, an element of the domain may have multiple images or none, whereas in a function each domain element has exactly one image.

A function is one-one if distinct elements of the domain have distinct images in the codomain.

A function is onto if every element of the codomain has at least one pre-image in the domain.

A function that is both one-one and onto is called a bijective function.

Bijective functions allow the definition of inverse functions and establish a perfect one-to-one correspondence between two sets.

A real-valued function is a function whose domain and codomain are subsets of the set of real numbers.

A function is represented graphically by plotting ordered pairs \((x, f(x))\) on the Cartesian plane.

The vertical line test states that a graph represents a function if and only if no vertical line intersects the graph at more than one point.

Relations and Functions form the foundation for calculus, coordinate geometry, matrices, and real analysis studied in higher classes.

They are used to model dependencies such as temperature variation with time, cost with quantity, population growth, and physical laws.

Definition-based, reasoning-based, relation classification, domain-range identification, and function-type identification questions are common.

Focus on definitions, properties, standard examples, and clear logical explanations with proper mathematical notation.

Yes, it builds the conceptual base required for functions, graphs, and mappings used extensively in higher-level problems.

It enhances logical reasoning, abstract thinking, precise mathematical communication, and analytical problem-solving skills.

The image of an element \(x\) under a function \(f\) is the value \(f(x)\) in the codomain corresponding to \(x\).

A pre-image of an element \(y\) in the codomain is an element \(x\) in the domain such that \(f(x) = y\).

Yes, this occurs in many-one functions where distinct domain elements map to the same codomain element.

No, assigning more than one value to a single domain element violates the definition of a function.

If set \(A\) has \(m\) elements and set \(B\) has \(n\) elements, the total number of relations is \(2^{mn}\).

If set \(A\) has \(m\) elements and set \(B\) has \(n\) elements, the total number of functions is \(n^m\).

A transformation describes how a function maps elements from one set to another according to a specific rule or operation.

Arrow diagrams visually represent relations and functions, helping to identify whether a relation satisfies the conditions of a function.

It is a table listing elements of the domain alongside their corresponding images, useful for clarity and verification.

Confusing domain with codomain, assuming all relations are functions, and misidentifying one-one and onto properties are common errors.

The domain determines where the function is defined; incorrect domain selection can change the nature and validity of a function.

Restriction of domain involves limiting the set of input values to ensure the function is well-defined or satisfies required properties.

Concepts of functions, domain, and range are essential for understanding limits, continuity, and derivatives.

While not mandatory, graphs provide intuitive understanding and help verify whether a relation represents a function.

They help classify elements into distinct groups called equivalence classes based on shared properties.

Relations can be represented using matrices, and functions describe mappings fundamental to linear algebra.

Questions testing logical consistency, property verification, and classification of relations and functions are common.

Answers should include clear definitions, correct notation, logical steps, and proper justification wherever required.

It is largely theory-based but requires strong conceptual understanding to solve reasoning and classification problems.

It establishes the foundational language and structure for expressing mathematical relationships used throughout higher mathematics.

Recent posts


    Important Links

    Leave Your Message & Comments