Q.Show that the relation R defined by $R = \{(a,b) : a-b \text{ is an integer}\}$ in the set $Z$ of all integers is an equivalence relation.

Showing the 12 most recent of 13 on this concept.

1. CBSE 2026Set ANNUAL1 mark
   Q.Write the answer in one word/sentence: Define equivalence relation.

   ›Reveal solutionSolution

   Equivalence relation = reflexive + symmetric + transitive.

   …

   🔒 Start your 14-day free trial to see the full solution →
2. CBSE 2025Set ANNUAL1 mark
   Q.Define an equivalence relation. OR If $R = \{(1,-1),(2,-2),(3,-1)\}$ is a relation, then find the domain and the range of $R$.

   ›Reveal solutionSolution

   State the three defining properties of an equivalence relation.

   A relation $R$ on a non-empty set $A$ is called an equivalence relation if it satisfies all three of the following:

   1. Reflexive: $(a,a)\in R$ for every $a\in A$.
   2. Symmetric: if $(a,b)\in R$ then $(b,a)\in R$.
   3. Transitive: if $(a,b)\in R$ and $(b,c)\in R$ then $(a,c)\in R$. …

   🔒 Start your 14-day free trial to see the full solution →
3. CBSE 2024Set A1 mark
   Q.A Relation $R$ in a set $A$ is said to be ______ relation if $R$ is reflexive, symmetric, and transitive.

   ›Reveal solutionSolution

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

   …

   🔒 Start your 14-day free trial to see the full solution →
4. CBSE 2024Set ANNUAL1 markMCQ
   Q.Let R be the relation in the set Z of all integers defined as, R = {(x, y) : x – y is an integer}, then R is

   (a) Reflexive

   (b) Symmetric

   (c) Transitive

   (d) Equivalence relation

   ›Reveal solutionSolution

   R is reflexive, symmetric, and transitive, hence an equivalence relation.

   For any $x \in \mathbb{Z}$, $x - x = 0$, which is an integer, so $(x,x) \in R$ for every $x$. Hence R is reflexive.

   If $(x,y) \in R$, then $x-y$ is an integer. Then $y - x = -(x-y)$ is also an integer, so $(y,x) \in R$. Hence R is symmetric.

   …

   🔒 Start your 14-day free trial to see the full solution →
5. CBSE 2023Set ANNUAL1 mark
   Q.If $R$ is an equivalence relation on $A$, then link the domain of $R$ and the range of $R$.

   ›Reveal solutionSolution

   For an equivalence relation R on A, both the domain and the range of R equal A itself.

   Since R is an equivalence relation on A, it is reflexive: for every $a \in A$, $(a,a) \in R$. This means every element of $A$ appears as a first coordinate (so it is in the domain) and also as a second coordinate (so it is in the range) of some pair in R. H …

   🔒 Start your 14-day free trial to see the full solution →
6. CBSE 2023Set ANNUAL1 mark
   Q.Define an equivalence relation. OR A relation $R$ in the set $N$ of natural numbers is defined as $R = \{(x, y) : y = x+5 \text{ and } x < 4\}$. Find the range of $R$.

   ›Reveal solutionSolution

   An equivalence relation is one that is simultaneously reflexive, symmetric and transitive; the alternative just lists the images of the allowed $x$-values.

   A relation $R$ on a set $A$ is called an equivalence relation when it satisfies all three of the following properties:

   • Reflexive: $(a,a)\in R$ for every $a\in A$.
   • Symmetric: if $(a,b)\in R$ then $(b,a)\in R$.
   • Transitive: if $(a,b)\in R$ and $(b,c)\in R$ then $(a,c)\in R$. …

   🔒 Start your 14-day free trial to see the full solution →
7. CBSE 2023Set ANNUAL1 mark
   Q.Define an equivalence relation.

   ›Reveal solutionSolution

   An equivalence relation is a relation satisfying all three properties: reflexivity, symmetry, and transitivity.

   A relation $R$ defined on a set $A$ is called an equivalence relation if it satisfies all of the following three conditions:

   1. Reflexive: $(a,a) \in R$ for every $a \in A$.
   2. Symmetric: If $(a,b) \in R$, then $(b,a) \in R$, for all $a,b \in A$.
   3. Transitive: If $(a,b)\in R$ and $(b,c)\in R$, then $(a,c)\in R$, for all $a,b,c \in A$. …

   🔒 Start your 14-day free trial to see the full solution →
8. CBSE 2023Set ANNUAL1 markMCQ
   Q.Case study based question: An organization conducted a bike race under two different categories- boys and girls. Totally there were 250 participants, out of which three from category 1 and two from category 2 were selected for the final race. John forms two sets B and G with these participants for his college project. Let $B=\{b_1,b_2,b_3\}$ and $G=\{g_1,g_2\}$ where B and G represents the set of boys and girls respectively, who were selected for the final race. Answer the following using the above information. John wishes to form all the relations possible from B to G. How many such relations are possible?

   (a) $2^{6}$

   (b) $2^{5}$

   (c) $0$

   (d) $2^{3}$

   ›Reveal solutionSolution

   The number of relations from a set of size $m$ to a set of size $n$ is $2^{mn}$; here $m=3,n=2$.

   $B=\{b_1,b_2,b_3\}$ has $|B|=3$ elements; $G=\{g_1,g_2\}$ has $|G|=2$ elements.

   A relation from $B$ to $G$ is any subset of $B\times G$. The number of elements in $B\times G$ is $|B|\times|G|=3\times2=6$.

   …

   🔒 Start your 14-day free trial to see the full solution →
9. CBSE 2022Set ANNUAL1 markMCQ
   Q.Which of the following relations on A = {1, 2, 3} is an equivalence relation?

   (a) {(1, 1), (2, 2), (3, 3)}

   (b) {(1, 1), (2, 2), (3, 3), (1, 2)}

   (c) {(1, 1), (3, 3), (1, 3), (3, 1)}

   (d) None of these

   ›Reveal solutionSolution

   Only option (a) is reflexive, symmetric, and transitive at once - the other two options fail reflexivity or symmetry.

   An equivalence relation on $A=\{1,2,3\}$ must be reflexive (contain $(1,1),(2,2),(3,3)$), symmetric (if $(x,y)$ is in it so is $(y,x)$), and transitive.

   (a) $\{(1,1),(2,2),(3,3)\}$ - contains all three diagonal pairs (reflexive), has no off-diagonal pair to break symmetry, and is trivially transitive. This IS an equivalence relation (it is the identity relation on $A$).

   …

   🔒 Start your 14-day free trial to see the full solution →
10. CBSE 2022Set ANNUAL1 markMCQ
    Q.Case study based question: Students of class-XII planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line $y=x-4$. Let L be the set of all lines which are parallel on the ground and R be a relation on L. Answer the following using the above information. Let relation R be defined by $R=\{(L_1,L_2): L_1 \parallel L_2 \text{ where } L_1, L_2 \in L\}$, then R is _______ relation.

    (a) Equivalence

    (b) Only reflexive

    (c) Not reflexive

    (d) symmetric but not transitive

    ›Reveal solutionSolution

    The relation 'is parallel to' on a set of lines is reflexive, symmetric and transitive, hence an equivalence relation.

    $R=\{(L_1,L_2): L_1\parallel L_2\}$ on the set $L$ of all lines.

    Reflexive: every line is parallel to itself, so $(L,L)\in R$ for all $L$. (True)

    Symmetric: if $L_1\parallel L_2$ then $L_2\parallel L_1$, so $(L_1,L_2)\in R\Rightarrow(L_2,L_1)\in R$. (True)

    …

    🔒 Start your 14-day free trial to see the full solution →
11. CBSE 2020Set ANNUAL1 mark
    Q.What is meant by an equivalence relation?

    ›Reveal solutionSolution

    definition recall

    …

    🔒 Start your 14-day free trial to see the full solution →
12. CBSE 2019Set ANNUAL1 markMCQ
    Q.Write the correct option from the following if $R\{(a, b) : a$ and $b$ both are either even or odd$\}$ in the set $A\{1, 2, 3, 4, 5, 6, 7\}$:

    (a) No relation

    (b) Trivial

    (c) Equivalence relation

    (d) Not symmetric

    ›Reveal solutionSolution

    “Same parity” partitions A into evens and odds, so R is reflexive, symmetric and transitive — an equivalence relation.

    R = {(a, b) : a and b are both even or both odd} on A = {1,2,3,4,5,6,7}.

    Step 1 (Reflexive): Any a has the same parity as itself, so (a, a) ∈ R. ✓

    Step 2 (Symmetric): If a and b have the same parity, so do b and a; (a,b) ∈ R ⇒ (b,a) ∈ R. ✓

    …

    🔒 Start your 14-day free trial to see the full solution →