Sets, Relations and FunctionsMCQPYQ June 22Question 1970 of 217
All Questions

If f={(2,2);(3,3);(4,4);(5,5);(6,6)}\displaystyle f = \{(2,2); (3,3); (4,4); (5,5); (6,6)\} be a relation on set A={2,3,4,5,6}\displaystyle A = \{2,3,4,5,6\}, then f\displaystyle f is:

Options

AReflexive and Transitive
BReflexive and Symmetric
CReflexive only
DAn equivalence relation
For any discrepancies in this question, email contact@cadada.in

Correct Answer

Option bReflexive and Symmetric

All Options:

  • AReflexive and Transitive
  • BReflexive and Symmetric
  • CReflexive only
  • DAn equivalence relation

Ad

Detailed Solution & Explanation

Let us analyze the properties of the relation f={(2,2),(3,3),(4,4),(5,5),(6,6)}\displaystyle f = \{(2,2), (3,3), (4,4), (5,5), (6,6)\} defined on the set A={2,3,4,5,6}\displaystyle A = \{2,3,4,5,6\}:

1. **Reflexive Property:**
A relation f\displaystyle f on set A\displaystyle A is reflexive if (a,a)f\displaystyle (a,a) \in f for all aA\displaystyle a \in A.
Here, for all elements 2,3,4,5,6A\displaystyle 2, 3, 4, 5, 6 \in A, the pairs (2,2),(3,3),(4,4),(5,5),(6,6)\displaystyle (2,2), (3,3), (4,4), (5,5), (6,6) are all present in f\displaystyle f. Thus, f\displaystyle f is **reflexive**.

2. **Symmetric Property:**
A relation f\displaystyle f is symmetric if (a,b)f    (b,a)f\displaystyle (a,b) \in f \implies (b,a) \in f.
For the identity pairs, since a=b\displaystyle a = b, if (a,a)f\displaystyle (a,a) \in f, then the reversed pair is also (a,a)f\displaystyle (a,a) \in f. There are no distinct elements related to each other. Thus, f\displaystyle f is **symmetric**.

3. **Transitive Property:**
A relation f\displaystyle f is transitive if (a,b)f\displaystyle (a,b) \in f and (b,c)f    (a,c)f\displaystyle (b,c) \in f \implies (a,c) \in f.
Again, since all related elements are of the form a=b=c\displaystyle a = b = c, this condition is trivially satisfied. Thus, f\displaystyle f is **transitive**.

**Equivalence Relation:**
Since the relation f\displaystyle f is reflexive, symmetric, and transitive, it constitutes an **equivalence relation** (which is Option D).
However, because it is reflexive, symmetric, and transitive, it is also both reflexive and symmetric (Option B), and reflexive and transitive (Option A). The textbook/answer key lists **Option B** as the correct option, which is mathematically correct but less complete than Option D. Under the standard exam key, Option B is designated as correct, although Option D represents the most comprehensive classification.

Hence, **Option B** is the correct answer.

About This Chapter: Sets, Relations and Functions

Paper

Paper 3: Quantitative Aptitude

Weightage

3-5 Marks

Key Topics

Sets, Relations, Functions

This chapter covers Sets, Relations, Functions and is part of Paper 3: Quantitative Aptitude in the CA Foundation exam.

View Official ICAI Syllabus

Exam Strategy Tip

This topic carries 3-5 Marks weightage. Focus on understanding core concepts rather than memorizing.

Key Concepts to Understand

Related Comparison Tables

More Questions from Sets, Relations and Functions

Ready to Master Sets, Relations and Functions?

Practice all 217 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.

Start Practicing — It's Free