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

Exercise 1.1 · Q8: ∣a−b∣|a-b| even on {1, …, 5}

Exercise 1.1Equivalence relations · Exercise 1.1
The question

Show that the relation RR in the set A={1,2,3,4,5}A = \{1, 2, 3, 4, 5\} given by R={(a,b):∣a−b∣ is even}R = \{(a, b) : |a - b| \text{ is even}\}⁠, is an equivalence relation. Show that all the elements of {1,3,5}\{1, 3, 5\} are related to each other and all the elements of {2,4}\{2, 4\} are related to each other. But no element of {1,3,5}\{1, 3, 5\} is related to any element of {2,4}\{2, 4\}⁠.

Exam answer

Reflexive: Let a∈Aa \in A⁠. Then ∣a−a∣=0|a - a| = 0⁠, which is even, so (a,a)∈R(a, a) \in R⁠. Thus RR is reflexive.

Symmetric: Let (a,b)∈R(a, b) \in R⁠. Then ∣b−a∣=∣a−b∣|b - a| = |a - b| is even, so (b,a)∈R(b, a) \in R⁠. Thus RR is symmetric.

Transitive: Let (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R⁠. Then a−ba - b and b−cb - c are even: a−b=2ka - b = 2k⁠, b−c=2mb - c = 2m for some k,m∈Zk, m \in \Z⁠.

∴ a−c=(a−b)+(b−c)=2k+2m=2(k+m)\begin{aligned} \therefore\ a - c &= (a - b) + (b - c) \\ &= 2k + 2m = 2(k + m) \end{aligned}

So ∣a−c∣|a - c| is even and (a,c)∈R(a, c) \in R⁠. Thus RR is transitive.

Hence RR is an equivalence relation.

For a,b∈{1,3,5}a, b \in \{1, 3, 5\}⁠: ∣a−b∣∈{0,2,4}|a - b| \in \{0, 2, 4\}⁠, all even. So all elements of {1,3,5}\{1, 3, 5\} are related to each other.

For a,b∈{2,4}a, b \in \{2, 4\}⁠: ∣a−b∣∈{0,2}|a - b| \in \{0, 2\}⁠, all even. So all elements of {2,4}\{2, 4\} are related to each other.

For a∈{1,3,5}a \in \{1, 3, 5\}⁠, b∈{2,4}b \in \{2, 4\}⁠: ∣a−b∣∈{1,3}|a - b| \in \{1, 3\}⁠, which is odd. So (a,b)∉R(a, b) \notin R and (b,a)∉R(b, a) \notin R⁠.

Hence no element of {1,3,5}\{1, 3, 5\} is related to any element of {2,4}\{2, 4\}⁠.

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

The one idea this problem is built on

The absolute value only removes a sign, and a number is even exactly when its negative is even. So "∣a−b∣|a-b| is even" means the same as "a−ba-b is even", which means aa and bb have the same parity (both odd or both even). That turns the problem into Example 5 on a small set: the odd numbers {1,3,5}\{1,3,5\} form one class, the even numbers {2,4}\{2,4\} the other.

Given, to show, and the plan
Given
A={1,2,3,4,5}A = \{1,2,3,4,5\} and the rule: (a,b)∈R(a,b)\in R exactly when ∣a−b∣|a-b| is even.
To show
(a) RR is an equivalence relation. (b) Any two elements of {1,3,5}\{1,3,5\} are related, and any two elements of {2,4}\{2,4\} are related. (c) No element of {1,3,5}\{1,3,5\} is related to any element of {2,4}\{2,4\}⁠.
Plan
(1) Remove the absolute value: ∣a−b∣|a-b| even   ⟺  \iff a−b=2ka-b = 2k⁠. (2) Prove reflexive, symmetric, transitive for arbitrary elements. (3) Check parts (b) and (c) pair by pair, using the grid of all 25 pairs.

Basics you need

1Even numbers

An integer nn is even when n=2kn = 2k for some integer kk⁠. 0 is even (0=2⋅00 = 2\cdot0⁠). If n=2kn = 2k then −n=2(−k)-n = 2(-k)⁠, so nn is even exactly when −n-n is even. Basics: integers, even and odd

2Absolute value

∣n∣=n|n| = n if n≥0n \ge 0 and ∣n∣=−n|n| = -n if n<0n < 0⁠. So ∣n∣|n| is always either nn or −n-n⁠. Also ∣b−a∣=∣a−b∣|b-a| = |a-b|⁠, since b−a=−(a−b)b - a = -(a-b)⁠.

3The three properties and equivalence

Reflexive: (a,a)∈R(a,a)\in R for all aa⁠. Symmetric: (a,b)∈R⇒(b,a)∈R(a,b)\in R\Rightarrow(b,a)\in R⁠. Transitive: (a,b),(b,c)∈R⇒(a,c)∈R(a,b),(b,c)\in R\Rightarrow(a,c)\in R⁠. All three together: an equivalence relation. Basics: reflexive, symmetric, transitive

4Odd minus even is odd

If a=2k+1a = 2k+1 is odd and b=2mb = 2m is even, then a−b=2(k−m)+1a - b = 2(k-m) + 1⁠, which is odd. Two numbers of the same parity have an even difference; different parity gives an odd difference.

5Equivalence classes

An equivalence relation splits its set into disjoint classes of mutually related elements. Basics: equivalence classes

Solution

  1. Remove the absolute value

    For any a,ba, b⁠, ∣a−b∣|a-b| is either a−ba-b or −(a−b)-(a-b) (Basic 2), and a number is even exactly when its negative is even (Basic 1). So

    (a,b)∈R  ⟺  ∣a−b∣ is even  ⟺  a−b is even  ⟺  a−b=2k for some integer k.\begin{aligned} (a,b)\in R &\iff |a-b| \text{ is even}\\ &\iff a - b \text{ is even}\\ &\iff a - b = 2k \text{ for some integer } k. \end{aligned}
    Absolute values are awkward in algebra because ∣x∣+∣y∣|x| + |y| need not equal ∣x+y∣|x+y|⁠. The transitive step needs to add differences, so we first replace "∣a−b∣|a-b| is even" by the equivalent "a−ba-b is even". This is valid because removing the absolute value changes at most the sign, and the sign does not affect evenness.
    Example: ∣2−5∣=∣−3∣=3|2-5| = |-3| = 3 is odd and 2−5=−32 - 5 = -3 is odd; ∣1−5∣=∣−4∣=4|1-5| = |-4| = 4 is even and 1−5=−4=2⋅(−2)1 - 5 = -4 = 2\cdot(-2) is even.
  2. Reflexive

    Take any a∈Aa\in A⁠. Then ∣a−a∣=∣0∣=0=2⋅0|a - a| = |0| = 0 = 2\cdot 0⁠, which is even. So (a,a)∈R(a,a)\in R for every aa⁠, and RR is reflexive.

    Every element differs from itself by 0, and 0 counts as even. The argument does not depend on which aa we take.
    0 is even, because 0=2⋅00 = 2\cdot 0 with 00 an integer (Basic 1).
  3. Symmetric

    Suppose (a,b)∈R(a,b)\in R⁠, so ∣a−b∣|a-b| is even. Since b−a=−(a−b)b - a = -(a-b)⁠, we have

    ∣b−a∣=∣−(a−b)∣=∣a−b∣,|b - a| = |-(a-b)| = |a-b|,

    which is even. So (b,a)∈R(b,a)\in R⁠, and RR is symmetric.

    The absolute value makes symmetry immediate: the distance from aa to bb is the same as from bb to aa⁠. We started from (a,b)∈R(a,b)\in R and derived (b,a)∈R(b,a)\in R⁠, as the definition requires.
    ∣−x∣=∣x∣|-x| = |x| for every real xx (Basic 2).
  4. Transitive

    Suppose (a,b)∈R(a,b)\in R and (b,c)∈R(b,c)\in R⁠. By Step 1 there are integers kk and mm with

    a−b=2kandb−c=2m.a - b = 2k \qquad\text{and}\qquad b - c = 2m.

    Adding makes bb cancel:

    a−c=(a−b)+(b−c)=2k+2m=2(k+m).a - c = (a-b) + (b-c) = 2k + 2m = 2(k+m).

    k+mk + m is an integer, so a−ca - c is even, and by Step 1 ∣a−c∣|a-c| is even. So (a,c)∈R(a,c)\in R⁠, and RR is transitive.

    Being reflexive, symmetric and transitive, RR is an equivalence relation.

    We add the two equations because that removes the middle element bb⁠, and the conclusion (a,c)∈R(a,c)\in R does not mention bb⁠. Using two letters kk and mm is important: the two differences need not be equal (for example 5−1=45 - 1 = 4 and 1−3=−21 - 3 = -2⁠). This is why Step 1 removed the absolute values: the signed differences add up exactly, 4+(−2)=2=5−34 + (-2) = 2 = 5 - 3⁠.
    Even + even = even: 2k+2m=2(k+m)2k + 2m = 2(k+m)⁠. Integers are closed under addition.
  5. All of {1,3,5}\{1,3,5\} are related, and all of {2,4}\{2,4\} are related

    Check every pair inside each set (9 ordered pairs from {1,3,5}\{1,3,5\}⁠, 4 from {2,4}\{2,4\}⁠). The differences that occur:

    SetPairs (a,b)(a,b)∣a−b∣|a-b|Even?
    {1,3,5}\{1,3,5\}(1,1),(3,3),(5,5)(1,1),(3,3),(5,5)00yes
    (1,3),(3,1),(3,5),(5,3)(1,3),(3,1),(3,5),(5,3)22yes
    (1,5),(5,1)(1,5),(5,1)44yes
    {2,4}\{2,4\}(2,2),(4,4)(2,2),(4,4)00yes
    (2,4),(4,2)(2,4),(4,2)22yes

    All 13 pairs have an even difference, so every element of {1,3,5}\{1,3,5\} is related to every element of {1,3,5}\{1,3,5\}⁠, and likewise for {2,4}\{2,4\}.

    In general: if a=2i+1a = 2i+1 and b=2j+1b = 2j+1 are both odd, a−b=2(i−j)a-b = 2(i-j) is even; if a=2ia = 2i⁠, b=2jb = 2j are both even, a−b=2(i−j)a - b = 2(i-j) is even.

    The sets are small, so a complete table is a full proof. The general line underneath explains why it works and would work for any odd or even numbers.
    Same parity ⇒\Rightarrow even difference (Basic 4).
  6. No element of {1,3,5}\{1,3,5\} is related to any element of {2,4}\{2,4\}

    There are 3×2=63\times 2 = 6 pairs with a∈{1,3,5}a\in\{1,3,5\} and b∈{2,4}b\in\{2,4\}⁠:

    ∣1−2∣=1,∣1−4∣=3,∣3−2∣=1,∣3−4∣=1,∣5−2∣=3,∣5−4∣=1.\begin{aligned} |1-2| &= 1, & |1-4| &= 3,\\ |3-2| &= 1, & |3-4| &= 1,\\ |5-2| &= 3, & |5-4| &= 1. \end{aligned}

    Every one is odd, so none of these pairs is in RR⁠. By symmetry of ∣⋅∣|\cdot|⁠, the 6 reversed pairs (b,a)(b,a) have the same odd values and are not in RR either. So no element of {1,3,5}\{1,3,5\} is related to any element of {2,4}\{2,4\}.

    0 1 2 3 4 1 0 1 2 3 2 1 0 1 2 3 2 1 0 1 4 3 2 1 0 1 1 2 2 3 3 4 4 5 5 b (second entry) a each cell (a, b) shows |a − b| blue: a, b both in {1, 3, 5} 9 pairs, |a − b| is 0, 2 or 4 gold: a, b both in {2, 4} 4 pairs, |a − b| is 0 or 2 empty: one odd, one even 12 pairs, |a − b| is 1 or 3
    All 25 pairs (a,b)(a,b) of A×AA\times A⁠, each showing ∣a−b∣|a-b|⁠. The 13 coloured cells are RR⁠: the blue ones form {1,3,5}×{1,3,5}\{1,3,5\}\times\{1,3,5\} and the gold ones {2,4}×{2,4}\{2,4\}\times\{2,4\}⁠. The 12 empty cells mix an odd and an even number, and their differences 1 and 3 are odd.
    "No element of one set is related to any element of the other" is a statement about all 6 cross pairs (12 counting both orders), so we check them all. In general an odd number minus an even number is odd (Basic 4), which is why every cross difference came out as 1 or 3.
    So RR has exactly two equivalence classes: [1]={1,3,5}[1] = \{1,3,5\} and [2]={2,4}[2] = \{2,4\}⁠. They are disjoint and their union is AA⁠. Basics: equivalence classes
Result

R={(a,b):∣a−b∣ is even}R = \{(a,b) : |a-b| \text{ is even}\} is an equivalence relation on {1,2,3,4,5}\{1,2,3,4,5\}⁠: reflexive (∣a−a∣=0|a-a| = 0⁠), symmetric (∣b−a∣=∣a−b∣|b-a| = |a-b|⁠) and transitive (a−c=(a−b)+(b−c)a - c = (a-b)+(b-c) is even + even). Its pairs are exactly those inside {1,3,5}\{1,3,5\} (differences 0, 2, 4) or inside {2,4}\{2,4\} (differences 0, 2), 13 pairs in all; every cross pair has difference 1 or 3, which is odd. So {1,3,5}\{1,3,5\} and {2,4}\{2,4\} are the two equivalence classes.

Play this problem

Class Catcher, in the chapter’s Games tab. Level 2 is this question: sort 1 to 5 by |a − b| even. Play Class Catcher ↗

Check it with numbers

Count: 32+22=9+4=133^2 + 2^2 = 9 + 4 = 13 pairs in RR and 2×3×2=122\times3\times2 = 12 cross pairs not in RR⁠; 13+12=25=5213 + 12 = 25 = 5^2⁠, so every pair of A×AA\times A is accounted for. Transitivity on one chain: (5,1)∈R(5,1)\in R (∣5−1∣=4|5-1| = 4⁠) and (1,3)∈R(1,3)\in R (∣1−3∣=2|1-3| = 2⁠), and indeed (5,3)∈R(5,3)\in R (∣5−3∣=2|5-3| = 2⁠), with 4+(−2)=24 + (-2) = 2 for the signed differences. A computer check of all 53=1255^3 = 125 triples confirms transitivity.

Common mistakes
  1. Adding absolute values in the transitive step. ∣a−b∣+∣b−c∣|a-b| + |b-c| is not always ∣a−c∣|a-c| (try 5,1,35,1,3⁠: 4+2=64 + 2 = 6 but ∣5−3∣=2|5-3| = 2⁠). Remove the absolute values first, as in Step 1.
  2. Forgetting that 0 is even. Reflexivity rests on ∣a−a∣=0|a-a| = 0 being even.
  3. Checking only one order of the cross pairs. "Not related" should hold both ways; symmetry of ∣⋅∣|\cdot| covers the reversed pairs, but say so.
What to take away
  1. Evenness ignores sign, so ∣a−b∣|a-b| even   ⟺  \iff a−ba-b even   ⟺  \iff aa and bb have the same parity.
  2. This is Example 5 restricted to {1,…,5}\{1,\dots,5\}⁠, and the textbook's Example 6 does the same on {1,…,7}\{1,\dots,7\}⁠. The classes are always "the odd ones" and "the even ones".
  3. On a finite set, a grid of all pairs makes the classes visible as coloured blocks once the elements are grouped.

Every fact used, and where it comes from

FactUsed inSource
nn even   ⟺  \iff −n-n even; ∣n∣∈{n,−n}|n|\in\{n,-n\}Step 1Definition of even; absolute value
Reflexive, symmetric, transitiveSteps 2–4Definition 3, Section 1.2 (Lesson: types of relations)
Equivalence relationStep 4Definition 4, Section 1.2
2k+2m=2(k+m)2k + 2m = 2(k+m)Step 4Integers closed under addition
Same parity   ⟺  \iff even differenceSteps 5, 6a=2i+1,b=2j+1a = 2i+1, b = 2j+1 etc.
Same relation on Z\Z and on {1,…,7}\{1,\dots,7\}Take-away 2Example 5, Example 6 (Lesson: equivalence relations)
All 25 differences and the counts 13, 12Steps 5, 6; CheckBrute-force check 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 →