Spot an Equivalence Class From the Pair Pattern

A JEE problem hands you a relation as a list: R = \{(a, a), (a, b), (b, a), (a, c), (c, a), (b, b), (c, c), (b, c), (c, b)\}. The question asks, "identify the equivalence classes." The fastest path is not to check properties one pair at a time. Train your eye to see the pattern: whenever every pair (x, y) with x, y from some subset S appears in R, that subset S is an equivalence class. Reading the pair list as a block of pairs built on S compresses the nine entries into a single fact — \{a, b, c\} is one equivalence class.

The pattern in words

An equivalence class is a subset S \subseteq A where the relation restricted to S is the complete relation on S — every element relates to every element, including itself. So if |S| = k, the class contributes exactly k^2 pairs to R, and those pairs form a k \times k "filled square" on the A \times A grid.

On the $A \times A$ grid, equivalence classes appear as filled squares along the main diagonal. A class of size $k$ fills a $k \times k$ square and contributes $k^2$ pairs. The whole relation is just a disjoint union of these squares.

Read this in reverse: if you see a filled k \times k block on the grid — with every pair present — call out the block. The elements along its axes form one equivalence class.

The three pattern markers

For a subset S = \{x_1, x_2, \ldots, x_k\} \subseteq A to appear as an equivalence class in R, three pair patterns must all be visible:

Marker 1: self-loops. Every (x_i, x_i) is in R. The diagonal of the k \times k block is filled.

Marker 2: symmetric arrows. For every (x_i, x_j) in R with i \neq j, the reverse (x_j, x_i) is also in R. On the grid, the block is mirror-symmetric across the diagonal.

Marker 3: full closure. Every possible pair (x_i, x_j) with x_i, x_j \in S is present — no missing cells inside the square.

When all three markers are present for a subset S, S is an equivalence class.

Why these three and not just "symmetric plus reflexive plus transitive": transitivity applied to a subset S where every pair exists is automatic — pick any (x_i, x_j) and (x_j, x_l), both present, and the claim (x_i, x_l) \in R is exactly marker 3. The three markers are the surface manifestation of the three equivalence properties, compressed into visual cues.

The worked recognition

Back to the original problem: R = \{(a, a), (a, b), (b, a), (a, c), (c, a), (b, b), (c, c), (b, c), (c, b)\} on A = \{a, b, c\}.

Scan for filled blocks:

Is \{a, b, c\} a filled block? List every pair it would need: (a,a), (a,b), (a,c), (b,a), (b,b), (b,c), (c,a), (c,b), (c,c). Count: 9 pairs. Every one is present in R. ✓

So \{a, b, c\} is an equivalence class. Since |A| = 3 and the class already contains all three elements, R has exactly one equivalence class: \{a, b, c\}. The partition of A is the trivial one.

How a mis-block exposes a non-equivalence relation

Suppose you see R' = \{(a, a), (a, b), (b, a), (a, c), (c, a), (b, b), (c, c)\} — the previous list minus the pair (b, c) and (c, b).

Try to mark \{a, b, c\} as a block. You need (b, c) and (c, b). Both are missing. The block is not filled; \{a, b, c\} is not a valid equivalence class.

Now try smaller blocks. \{a, b\}: need (a, a), (a, b), (b, a), (b, b) — all four present ✓. But here is the subtlety: we also have (a, c), (c, a) \in R', which means a is related to c, yet c is not in the block \{a, b\}. This violates the "classes are disjoint" structure. The relation R' is not an equivalence relation at all — it fails transitivity (the pair (b, c) should be forced by (b, a) and (a, c), but it is missing).

Pattern recognition exposes the failure: you cannot cover R' with non-overlapping filled squares that respect the pairs. The attempt to tile R' with blocks fails, and that failure is the same failure as "not an equivalence relation."

The reverse direction: listing pairs from a partition

The pattern works both ways. Given a partition, you can write R by inflating each block into its square.

Example. Partition of \{1, 2, 3, 4, 5\}: \{\{1, 2, 3\}, \{4, 5\}\}. The relation R is:

From block \{1, 2, 3\}: all 3 \times 3 = 9 pairs — (1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3).
From block \{4, 5\}: all 2 \times 2 = 4 pairs — (4,4), (4,5), (5,4), (5,5).

Total 9 + 4 = 13 pairs. Write them down and you have the complete equivalence relation associated with that partition, with zero property-checking required.

JEE pattern-spotting question

Problem: On A = \{1, 2, 3, 4\}, the relation R contains the pairs \{(1,1), (2,2), (3,3), (4,4), (1,2), (2,1), (3,4), (4,3)\}. Identify the equivalence classes.

Scan. Diagonal is fully present ✓. Look for filled off-diagonal blocks.

Possible block \{1, 2\}: needs (1,1), (1,2), (2,1), (2,2). All four present. ✓ → \{1, 2\} is a class.

Possible block \{3, 4\}: needs (3,3), (3,4), (4,3), (4,4). All four present. ✓ → \{3, 4\} is a class.

Check: \{1, 2\} and \{3, 4\} are disjoint, together cover A, and no stray pairs connect them. Partition complete.

Answer: Equivalence classes are \{1, 2\} and \{3, 4\}. Partition of A into two blocks.

Time spent: about 10 seconds of eye-scanning. A property-by-property check of an 8-pair relation would take a minute or more.

The habit to drill

Whenever you see a relation listed as pairs and the question asks about equivalence classes:

Group pairs by the first coordinate. Look for sets of "partners" — elements that appear together.
For each candidate subset S, visualise the |S| \times |S| block. Check that every pair it requires is in R.
If yes, S is a class. If any pair is missing, shrink S.
Keep going until you have used every pair exactly once across the disjoint classes.

Thinking in blocks instead of pairs is the single biggest speedup for this question type.