Let A = 1, 2, 3. Define a relation (on A) which is reflexive and symmetric but not transitive.

Question 28 of 49

Q. Let A = {1, 2, 3}. Define a relation (on A) which is reflexive and symmetric but not transitive.

West Bengal WbchseWest Bengal HS (WBCHSE) Board 2019Subjective· 2mImportance★★★★★

57% · 28/49 Questions

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

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

Concept understanding — Types of Relations

Types of Relations – From Intuition to Precision

Imagine you have a set of people in a room. A relation is simply a rule that tells you whether two people are connected in some way. "Is the brother of", "lives in the same city as", "is taller than" — each of these is a relation. The question is: what kind of connection is it?

Some relations are very special. They behave in predictable, almost perfect ways. These are the ones we study first.

The Intuition: Three Key Properties

Think about the relation "lives in the same city as" between people.

Reflexive: Does every person live in the same city as themselves? Yes — obviously. A relation is reflexive if every element is related to itself.
Symmetric: If A lives in the same city as B, does B live in the same city as A? Yes — it's mutual. A relation is symmetric if whenever A is related to B, B is also related to A.
Transitive: If A lives in the same city as B, and B lives in the same city as C, does A live in the same city as C? Yes — it chains. A relation is transitive if whenever A is related to B and B is related to C, then A is related to C.

Now think about "is taller than". It is not reflexive (no one is taller than themselves), not symmetric (if A is taller than B, B is not taller than A), but it is transitive (if A > B and B > C, then A > C). Different relations satisfy different combinations.

The Precise Definitions

Let $R$ be a relation on a set $A$ (meaning $R \subseteq A \times A$ ).

R

R

R

The Four Types of Relations You Must Know

These three properties combine to define the most important types:

Type	Reflexive?	Symmetric?	Transitive?	Example
Empty relation	No (unless $A = \emptyset$ )	Yes (vacuously)	Yes (vacuously)	$R = \emptyset$ on $A = \{1,2\}$
Universal relation	Yes	Yes	Yes	$R = A \times A$
Identity relation	Yes	Yes	Yes	$R = \{(a,a) \mid a \in A\}$
Equivalence relation	Yes	Yes	Yes	"Same city", "same remainder mod 3"

Watch out

A common mistake: thinking "symmetric" means "if (a,b) is in R, then (b,a) must also be in R" — that's correct. But it does not require that (a,b) and (b,a) are different pairs. The identity relation is symmetric because (a,a) implies (a,a).

Equivalence Relations — The Most Important Type

An equivalence relation is one that is reflexive, symmetric, and transitive all at once. It captures the idea of "sameness" or "equivalence" in some sense.

Important

An equivalence relation partitions the set into disjoint equivalence classes — groups of elements that are all related to each other. Every element belongs to exactly one class.

Example: On the set of integers, define $a \sim b$ if $a - b$ is divisible by 3. This is an equivalence relation. The classes are:

$\{\dots, -6, -3, 0, 3, 6, \dots\}$ (remainder 0) …

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

Build a relation that pairs 1 with 2 and 2 with 3 (symmetrically) but omits the pair (1,3), breaking transitivity.

Let $A=\{1,2,3\}$ and define

$R=\{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)\}.$

Reflexive: $(1,1),(2,2),(3,3)\in R$ — every element is related to itself. ✓

Symmetric: $(1,2)\in R \Rightarrow (2,1)\in R$ ; $(2,3)\in R \Rightarrow (3,2)\in R$ . Every pair's reverse is also present. ✓

…

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

←Previous section · summarySummary →Next questionQ2 — R1 and R2 are two equivalence relations defined on set A (not equal to…

Q.Let A = {1, 2, 3}. Define a relation (on A) which is reflexive and symmetric but not transitive.

🎓Unlock everything free for 14 days

Unlock everything free for 14 days