Class 12 Maths, Worked in Full Past papersGet updates
Chapter 1 · Relations and Functions

Example 20: Two descriptions of one relation on {1, …, 9}

ExamplesEquivalence relations · Miscellaneous Examples
The question

Let X={1,2,3,4,5,6,7,8,9}X = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}⁠. Let R1R_1 be a relation in XX given by R1={(x,y):x−y is divisible by 3}R_1 = \{(x, y) : x - y \text{ is divisible by } 3\} and R2R_2 be another relation on XX given by R2={(x,y): {x,y}⊂{1,4,7} or{x,y}⊂{2,5,8} or{x,y}⊂{3,6,9}}.\begin{aligned} R_2 = \{(x, y) :\ &\{x, y\} \subset \{1, 4, 7\} \text{ or}\\ &\{x, y\} \subset \{2, 5, 8\} \text{ or}\\ &\{x, y\} \subset \{3, 6, 9\}\}. \end{aligned} Show that R1=R2R_1 = R_2⁠.

(The printed book has a stray closing brace after {1,4,7}\{1, 4, 7\} in the definition of R2R_2⁠; it is a misprint and has been left out here.)

Exam answer

The elements of {1,4,7}\{1, 4, 7\}⁠, {2,5,8}\{2, 5, 8\} and {3,6,9}\{3, 6, 9\} leave remainders 1, 2 and 0 respectively on division by 3.

R2⊂R1R_2 \subset R_1⁠: Let (x,y)∈R2(x, y) \in R_2⁠. Then x,yx, y are in the same set, so x=3q+rx = 3q + r⁠, y=3q′+ry = 3q' + r for some integers q,q′q, q'⁠. So x−y=3(q−q′)x - y = 3(q - q') is divisible by 3, and (x,y)∈R1(x, y) \in R_1⁠. Thus R2⊂R1R_2 \subset R_1⁠.

R1⊂R2R_1 \subset R_2⁠: Let (x,y)∈R1(x, y) \in R_1⁠, so x−y=3kx - y = 3k⁠, k∈Zk \in \Z⁠. Let x=3q+rx = 3q + r⁠, y=3q′+r′y = 3q' + r' with r,r′∈{0,1,2}r, r' \in \{0, 1, 2\}⁠. Then

r−r′=(x−y)−3(q−q′)=3(k−q+q′)\begin{aligned} r - r' &= (x - y) - 3(q - q') \\ &= 3(k - q + q') \end{aligned}

is a multiple of 3 with −2≤r−r′≤2-2 \le r - r' \le 2⁠, so r=r′r = r'⁠. So x,yx, y are in the same set, and (x,y)∈R2(x, y) \in R_2⁠. Thus R1⊂R2R_1 \subset R_2⁠.

Hence R1=R2R_1 = R_2⁠.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

The three groups {1,4,7}\{1,4,7\}⁠, {2,5,8}\{2,5,8\}⁠, {3,6,9}\{3,6,9\} are the elements of XX that leave remainder 1, 2 and 0 when divided by 3. And "x−yx-y is divisible by 3" is the same as "xx and yy leave the same remainder on division by 3". So both descriptions say "xx and yy lie in the same remainder group". To prove two sets are equal, we show each is contained in the other: R1⊂R2R_1 \subset R_2 and R2⊂R1R_2 \subset R_1⁠.

Given, to show, and the plan
Given
Two relations on X={1,…,9}X = \{1,\dots,9\}⁠: R1R_1 described by divisibility, R2R_2 described by three groups.
To show
R1=R2R_1 = R_2⁠, that is, they contain exactly the same ordered pairs.
Plan
(1) Recall how to prove two sets equal. (2) Sort XX by remainder on division by 3. (3) Show R2⊂R1R_2 \subset R_1⁠: two numbers in the same group differ by a multiple of 3. (4) Show R1⊂R2R_1 \subset R_2⁠: if the difference is a multiple of 3, the remainders agree, so the numbers lie in the same group. (5) Conclude, and count the pairs as a check.

Basics you need

1Equality of sets

Two sets are equal when they have exactly the same elements. The standard proof: show P⊂QP \subset Q (every element of PP is in QQ⁠) and Q⊂PQ \subset P⁠. Together these give P=QP = Q⁠. Basics: sets

2Relations are sets of pairs

R1R_1 and R2R_2 are subsets of X×XX\times X⁠, so "R1=R2R_1 = R_2" is an equality of sets of ordered pairs. Basics: what a relation is

3Division with remainder

Every integer nn can be written n=3q+rn = 3q + r with qq an integer and remainder r∈{0,1,2}r \in \{0, 1, 2\}⁠, and this rr is unique. For example 7=3⋅2+17 = 3\cdot 2 + 1 and 9=3⋅3+09 = 3\cdot 3 + 0⁠. Basics: integers and remainders

4What {x,y}⊂S\{x,y\} \subset S means

{x,y}\{x,y\} is the set whose elements are xx and yy⁠. Saying {x,y}⊂S\{x,y\}\subset S means both x∈Sx\in S and y∈Sy \in S⁠. When x=yx = y the set {x,y}\{x,y\} is just {x}\{x\}⁠, so pairs like (4,4)(4,4) are included.

5Equivalence classes

The relation "33 divides x−yx - y" is an equivalence relation whose classes are the remainder groups (the book shows this on Z\Z just after Example 5). Basics: equivalence classes

Solution

  1. Sort the elements of XX by remainder

    Remainder on division by 3Elements of XXForm
    11=3⋅0+11 = 3\cdot 0+1⁠, 4=3⋅1+14 = 3\cdot 1+1⁠, 7=3⋅2+17 = 3\cdot 2+13q+13q+1
    22=3⋅0+22 = 3\cdot 0+2⁠, 5=3⋅1+25 = 3\cdot 1+2⁠, 8=3⋅2+28 = 3\cdot 2+23q+23q+2
    03=3⋅13 = 3\cdot 1⁠, 6=3⋅26 = 3\cdot 2⁠, 9=3⋅39 = 3\cdot 33q3q

    So the three groups used in R2R_2 are precisely the sets of elements of XX with remainder 1, 2 and 0. Every element of XX is in exactly one group.

    This is the "characteristic" of the three sets that the textbook mentions. Naming it precisely (same remainder) turns both directions of the proof into short calculations. The fact that the groups do not overlap and cover XX follows from Basic 3: each number has one and only one remainder.
    Every integer has a unique remainder 0, 1 or 2 on division by 3 (Basic 3).
  2. Show R2⊂R1R_2 \subset R_1

    Take any (x,y)∈R2(x,y)\in R_2⁠. Then xx and yy lie in the same group, so they have the same remainder rr (Step 1):

    x=3q+r,y=3q′+rfor some integers q,q′.x = 3q + r, \quad y = 3q' + r \qquad\text{for some integers } q, q'.

    Subtracting,

    x−y=(3q+r)−(3q′+r)=3(q−q′),x - y = (3q + r) - (3q' + r) = 3(q - q'),

    and q−q′q - q' is an integer. So x−yx - y is divisible by 3, that is (x,y)∈R1(x,y)\in R_1⁠. Since (x,y)(x,y) was an arbitrary element of R2R_2⁠, R2⊂R1R_2 \subset R_1.

    The remainders are equal, so they cancel when we subtract, leaving a multiple of 3. This handles all three groups at once, since we wrote a general remainder rr⁠. For example, in {2,5,8}\{2,5,8\}⁠: 8−2=68 - 2 = 6⁠, 5−8=−35 - 8 = -3⁠, 5−5=05 - 5 = 0⁠, all multiples of 3. Note that negative differences and 0 count: −3=3⋅(−1)-3 = 3\cdot(-1) and 0=3⋅00 = 3\cdot 0⁠.
    3∣n3 \mid n means n=3kn = 3k for some integer kk (possibly negative or zero). The difference of two integers is an integer. Basics: integers
  3. Show R1⊂R2R_1 \subset R_2

    Take any (x,y)∈R1(x,y)\in R_1⁠, so x−y=3kx - y = 3k for some integer kk⁠. Write x=3q+rx = 3q + r and y=3q′+r′y = 3q' + r' with remainders r,r′∈{0,1,2}r, r' \in\{0,1,2\}⁠. Then

    r−r′=(x−3q)−(y−3q′)=(x−y)−3(q−q′)=3(k−q+q′),r - r' = (x - 3q) - (y - 3q') = (x - y) - 3(q - q') = 3(k - q + q'),

    so r−r′r - r' is a multiple of 3. But rr and r′r' are each 0, 1 or 2, so −2≤r−r′≤2-2 \le r - r' \le 2⁠. The only multiple of 3 between −2-2 and 22 is 0. Hence r=r′r = r'⁠: xx and yy have the same remainder, so by Step 1 they lie in the same group, and {x,y}\{x,y\} is a subset of {1,4,7}\{1,4,7\}⁠, {2,5,8}\{2,5,8\} or {3,6,9}\{3,6,9\}⁠. That is (x,y)∈R2(x,y)\in R_2⁠. Hence R1⊂R2R_1 \subset R_2.

    This is the direction that the textbook passes over quickly, and it needs a reason: why can't two numbers from different groups differ by a multiple of 3? The argument shows that the difference of the remainders would then be ±1\pm1 or ±2\pm2⁠, which is never a multiple of 3. The trick of squeezing r−r′r - r' between −2-2 and 22 is what forces it to be 0.
    The only multiple of 3 strictly between −3-3 and 33 is 0. Uniqueness of the remainder (Basic 3).
  4. Conclude: R1=R2R_1 = R_2

    We have R1⊂R2R_1 \subset R_2 (Step 3) and R2⊂R1R_2 \subset R_1 (Step 2). Therefore R1=R2R_1 = R_2.

    rows x, columns y: 1 to 9112233445566778899same dots, reordered by group114477225588336699x, y in {1, 4, 7}x, y in {2, 5, 8}x, y in {3, 6, 9}
    Each dot is a pair (x,y)(x,y) in the relation, with xx the row and yy the column. On the left, rows and columns are in the order 1 to 9, which is how R1R_1 sees things: the dots lie on the diagonals where x−yx - y is 0,±30, \pm3 or ±6\pm6⁠. On the right, the same 27 dots with rows and columns reordered by group: they fill three solid 3×33\times 3 blocks, which is how R2R_2 describes them.
    Set equality is exactly mutual inclusion (Basic 1). The figure gives a picture of the same fact: one set of 27 dots, seen in two orders. The left pattern is "difference divisible by 3"; the right pattern is "both in the same group".
    P=Q  ⟺  P⊂Q and Q⊂PP = Q \iff P\subset Q \text{ and } Q \subset P⁠. Basics: sets
  5. Count the pairs as a cross-check

    In R2R_2⁠, each group has 3 elements, so it gives 3×3=93\times 3 = 9 ordered pairs (both entries chosen from the group, repeats allowed). Three groups give 3×9=273 \times 9 = 27 pairs. In R1R_1⁠, list by the value of x−yx - y⁠:

    x−y=0: 9 pairs,x−y=±3: 6+6 pairs,x−y=±6: 3+3 pairs,total: 9+12+6=27.\begin{aligned} x - y = 0 &: \ 9 \text{ pairs},\\ x - y = \pm 3 &: \ 6 + 6 \text{ pairs},\\ x - y = \pm 6 &: \ 3 + 3 \text{ pairs},\\ \text{total} &: \ 9 + 12 + 6 = 27. \end{aligned}
    The proof is already complete, but counting gives an independent sanity check: equal sets must have the same number of elements. The differences x−yx - y for x,y∈Xx, y \in X range from −8-8 to 88⁠, and the multiples of 3 in that range are 0,±3,±60, \pm 3, \pm 6⁠. For x−y=3x - y = 3 the pairs are (4,1),(5,2),…,(9,6)(4,1), (5,2), \dots, (9,6)⁠, six of them; for x−y=6x-y = 6 they are (7,1),(8,2),(9,3)(7,1), (8,2), (9,3)⁠.
    Counting ordered pairs from a 3-element set with repetition allowed: 3×33\times 3⁠. Basics: counting choices
Result

R1=R2R_1 = R_2⁠. Both consist of the 27 pairs (x,y)(x,y) for which xx and yy leave the same remainder on division by 3: two numbers in the same group differ by a multiple of 3 (R2⊂R1R_2\subset R_1⁠), and two numbers that differ by a multiple of 3 must be in the same group (R1⊂R2R_1 \subset R_2⁠). This agrees with the textbook's conclusion.

Check it with numbers

Pick a few pairs. (7,1)(7,1)⁠: 7−1=67 - 1 = 6 is divisible by 3, and {7,1}⊂{1,4,7}\{7,1\}\subset\{1,4,7\}⁠. In both. (8,2)(8,2)⁠: 66⁠, and {8,2}⊂{2,5,8}\{8,2\}\subset\{2,5,8\}⁠. In both. (4,6)(4,6)⁠: 4−6=−24 - 6 = -2 is not divisible by 3, and 4 and 6 are in different groups. In neither. The verification script builds both relations as sets of pairs from their definitions and confirms they are identical, each with 27 pairs.

Common mistakes
  1. Proving only one inclusion. R2⊂R1R_2 \subset R_1 alone does not give equality; R1R_1 could be bigger. Both directions are needed.
  2. Forgetting pairs like (5,5)(5,5)⁠. {5,5}={5}⊂{2,5,8}\{5,5\} = \{5\}\subset\{2,5,8\}⁠, so (5,5)∈R2(5,5)\in R_2⁠; and 5−5=05 - 5 = 0 is divisible by 3, so (5,5)∈R1(5,5)\in R_1⁠.
  3. Ignoring negative differences. (1,7)∈R1(1,7)\in R_1 because 1−7=−6=3⋅(−2)1 - 7 = -6 = 3\cdot(-2)⁠.
  4. Checking a few pairs and calling it a proof. Here X×XX\times X has only 81 pairs, so checking all of them would be a valid proof, but checking a handful is not.
What to take away
  1. To prove two relations (sets) are equal, prove inclusion both ways.
  2. "n∣(x−y)n \mid (x - y)" means "xx and yy leave the same remainder on division by nn". The classes are the remainder groups.
  3. An equivalence relation can be described by a rule or by listing its classes. This example shows the two descriptions agree, which is the partition idea of Section 1.2 in action.

Every fact used, and where it comes from

FactUsed inSource
P=Q  ⟺  P⊂QP = Q \iff P\subset Q and Q⊂PQ\subset PStep 4Equality of sets (Class 11, Sets)
Division with a unique remainder 0, 1 or 2Steps 1–3Division algorithm for integers
3∣n  ⟺  n=3k, k∈Z3\mid n \iff n = 3k,\ k\in\ZSteps 2, 3Definition of divisibility
Relations as subsets of X×XX\times XStep 4Section 1.2 (Lesson: relations)
"3 divides a−ba-b" partitions into remainder classesBasics, Take-awaySection 1.2, note after Example 5 (Lesson: equivalence relations)
Both relations have the same 27 pairsStep 5, CheckBrute force in the site's verification script
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →