Mathematical-Reasoning ยท Unit 28 ยท Video 3 ยท Interactive Practice

Equivalence Classes: Everything Equivalent to y

IKey Formulas

FormulaMeaning
[y]={xโˆˆAโˆฃxโˆผy}[y] = \{ x \in A \mid x \sim y \}the equivalence class of yy, for an equivalence relation โˆผ\sim on AA
[y]โˆผ,ย ย R[y],ย ย [y]R[y]_\sim,\ \ R[y],\ \ [y]_Rthe same class, naming the relation when more than one is in use
[y]โІA[y] \subseteq A, ย yโˆˆA\ y \in Aa class is a subset; the element that names it is an element
[0],[1],โ€ฆ,[nโˆ’1][0], [1], \ldots, [n-1]the nn distinct congruence classes modulo nn, one per remainder

Key Insight: Every element names a class, but many names give the same class: [7]=[10]=[โˆ’2]=[1][7] = [10] = [-2] = [1] for congruence modulo 33.

IIThe Integers in nn Panels

Congruence modulo nn cuts the integers into nn congruence classes, one for each remainder.

IIIWhich Class Modulo 4?

Each integer lies in exactly one of [0][0], [1][1], [2][2], [3][3] for congruence modulo 44.

IVQuiz Questions

Problem 1 ยท A Roster Modulo 4

For congruence modulo 44 on Z\mathbb{Z}, which roster is the class [3][3]?

โœ… Correct! Start at 33 and step by 44 in both directions.
โŒ Not quite. โˆ’3=4(โˆ’1)+1-3 = 4(-1) + 1 lies in [1][1]; mirroring the positive entries does not keep the remainder.
โŒ Not quite. That is [0][0] for congruence modulo 33; here the step is 44.
โŒ Not quite. The class also contains negative integers, for instance โˆ’1=4(โˆ’1)+3-1 = 4(-1) + 3.
Show solution

xโˆˆ[3]x \in [3] exactly when xโ‰ก3(mod4)x \equiv 3 \pmod 4, that is, x=3+4kx = 3 + 4k for some integer kk. Taking k=โˆ’3,โˆ’2,โˆ’1,0,1,2k = -3, -2, -1, 0, 1, 2 gives

[3]={โ€ฆ,โˆ’9,โˆ’5,โˆ’1,3,7,11,โ€ฆ}.[3] = \{\ldots, -9, -5, -1, 3, 7, 11, \ldots\}.

Check a negative entry: โˆ’1=4(โˆ’1)+3-1 = 4(-1) + 3, remainder 33.

Problem 2 ยท Element or Subset?

For congruence modulo 22 on Z\mathbb{Z}, which statement is true?

โœ… Correct! The class [1][1] is the set of odd integers: a subset of Z\mathbb{Z} that contains 11.
โŒ Not quite. [1][1] is a set of integers and 11 is an integer; a set is never equal to one of its elements here.
โŒ Not quite. [1][1] is not an integer; it is a subset of Z\mathbb{Z}.
โŒ Not quite. [1][1] is the odd integers and [0][0] the even integers; they are disjoint.
Show solution

[1]={xโˆˆZโˆฃxโ‰ก1(mod2)}={โ€ฆ,โˆ’3,โˆ’1,1,3,5,โ€ฆ}[1] = \{ x \in \mathbb{Z} \mid x \equiv 1 \pmod 2 \} = \{\ldots, -3, -1, 1, 3, 5, \ldots\}, the odd integers. It is a subset of Z\mathbb{Z}, and 1โ‰ก1(mod2)1 \equiv 1 \pmod 2 (reflexivity) puts 11 in it. It is not an integer, not equal to 11, and shares no element with [0][0], the even integers.

Problem 3 ยท A Class on a Finite Set

On A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} define xRyx \mathrel{R} y when โŒˆx/2โŒ‰=โŒˆy/2โŒ‰\lceil x/2 \rceil = \lceil y/2 \rceil. This is an equivalence relation. Find [4]R[4]_R.

โœ… Correct! โŒˆ4/2โŒ‰=2\lceil 4/2 \rceil = 2, and the only elements with โŒˆx/2โŒ‰=2\lceil x/2 \rceil = 2 are 33 and 44.
โŒ Not quite. 4โˆˆ[4]R4 \in [4]_R, but so is every xx with โŒˆx/2โŒ‰=2\lceil x/2 \rceil = 2.
โŒ Not quite. โŒˆ5/2โŒ‰=3โ‰ 2\lceil 5/2 \rceil = 3 \ne 2, so 55 is not related to 44.
โŒ Not quite. That groups by parity; compute โŒˆx/2โŒ‰\lceil x/2 \rceil instead.
Show solution

The values of โŒˆx/2โŒ‰\lceil x/2 \rceil for x=1,โ€ฆ,6x = 1, \ldots, 6 are 1,1,2,2,3,31, 1, 2, 2, 3, 3. Since โŒˆ4/2โŒ‰=2\lceil 4/2 \rceil = 2,

[4]R={xโˆˆAโˆฃโŒˆx/2โŒ‰=2}={3,4}.[4]_R = \{ x \in A \mid \lceil x/2 \rceil = 2 \} = \{3, 4\}.

RR has three classes, {1,2}\{1, 2\}, {3,4}\{3, 4\} and {5,6}\{5, 6\}; six elements give six names but only three classes.

Problem 4 ยท Congruence Modulo 7

Consider congruence modulo 77 on Z\mathbb{Z}.

How many distinct congruence classes are there?

Which class contains โˆ’23-23?

โœ… Correct! Seven remainders give seven classes, and โˆ’23=7(โˆ’4)+5-23 = 7(-4) + 5.
โŒ Count the remainders. Dividing by 77 leaves 0,1,โ€ฆ,60, 1, \ldots, 6: one class for each.
โŒ Check the remainder. The multiple of 77 just below โˆ’23-23 is โˆ’28-28.
Show solution

Each integer is congruent modulo 77 to exactly one of 0,1,โ€ฆ,60, 1, \ldots, 6, so the distinct classes are [0],[1],โ€ฆ,[6][0], [1], \ldots, [6]: seven of them. Infinitely many integers name classes, but [k]=[r][k] = [r] whenever rr is the remainder of kk.

โˆ’23=7(โˆ’4)+5,-23 = 7(-4) + 5,

so โˆ’23โ‰ก5(mod7)-23 \equiv 5 \pmod 7 and โˆ’23โˆˆ[5]-23 \in [5]. (Negating 23=7โ‹…3+223 = 7 \cdot 3 + 2 would give โˆ’2-2, which is not a remainder.)

Solved: 0 / 4