2Thanks
• 1 Post By Deveno
• 1 Post By Deveno

# Thread:

1. ## Prove the total number of cosets of a particular subgroup in a particular group is m?

I'm having difficulty in understanding a proof given on wikipedia under "Examples" section. The proof can be found at:

Coset - Wikipedia, the free encyclopedia

Math Problem:

If $Z = \{..., -2, -1, 0, 1, 2, ...\}$ is an additive group of integers and $H$ a subgroup such that $mZ = \{...,-2m, -m, 0, m, 2m, ...\}$
where $m$ is an integer. Then prove that the cosets of $H$ in $G$ are the $m$ sets.

Proof:

Let $G$ be the additive group of integers $Z = \{..., -2, -1, 0, 1, 2, ...\}$ and $H$ the subgroup $mZ = \{..., -2m, -m, 0, m, 2m, ...\}$
where $m$ is a positive integer.

Then the cosets of $H$ in $G$ are the $m$ sets $mZ, mZ+1, ... , mZ + (m - 1)$, where $mZ+a=\{..., -2m+a, -m+a, a, m+a, 2m+a, ...\}$.

There are no more than $m$ cosets, because $mZ+m=m(Z+1)=mZ$. <--------------My problem?

The coset $mZ+a$ is the congruence class of a modulo $m$

My question:

Why is that the $mZ + m = m(Z+1) = mZ$? Specifically why's that $Z+1 = Z$?

I know it's true visually but how do I prove that $Z+1 = Z$?

Is it possible to kindly help me find the reason why's $Z+1 = Z$ and what it got to do with congruence class of modulo $m$ which is stated at the next line of the proof above?

2. ## Re: Prove the total number of cosets of a particular subgroup in a particular group i

suppose i have the entire set of integers:

Z = {.........-4,-3,-2,-1,0,1,2,3,4,5........}

what set do i get if i add 1 to every integer in this set?

one of the peculiarities of the integers is that there is no "smallest integer" nor no "largest integer" so there is no "bottom" that gets bigger when we add 1 to everything, nor no "top" that keeps everything under a certain amount.

EDIT: here is a "semi-formal" proof that Z = Z+1.

suppose k is in Z. then k-1 is in Z as well, so k = (k-1) + 1 is in Z+1.

on the other hand, suppose m is in Z+1. then m = n+1, for some integer n. hence m = n+1 is also an integer, whence m is in Z.

thus Z+1 = Z, since the two sets contain each other.

EDIT #2:

let's look at a particular m, say m = 5.

now 5Z = {........-25,-20,-15,-10,-5,0,5,10,15,20,25,30.......}.

1+5Z = {.......-24,-19,-14,-9,-4,1,6,11,16,21,26,31......}

2+5Z = {......-23,-18,-13,-8,-3,2,7,12,17,22,27,32.......}

3+5Z = {......-22,-17,-12,-7,-2,3,8,13,18,23,28,33......}

4+5Z = {.....-21,-16,-11,-6,-1,4,9,14,19,24,29,34......}

so far, we haven't had any "overlap" at all, every integer only occurs in ONE of these sets.

what happens when we have:

5+5Z = {.......-20,-15,-10,-5,0,5,10,15,20,25,30,35.....}

all we have done is "shifted 5Z over 5". but 5Z has no "start" and no "end" (it's infinite both ways), so we don't get any "extras" at the "end" or any "new ones" at the "start".

***************************

personally, i don't like this way of looking at Z/5Z. i prefer to think of it as a PARTITION of Z into 5 subsets:

5Z = all integers of the form 5k, for some integer k.
1+5Z = all integers of the form 5k+1
2+5Z = all integers of the form 5k+2
3+5Z = all integers of the form 5k+3
4+5Z = all integers of the form 5k+4

if you like you can think of this partition as being the equivalence classes of the following equivalence relation:

m~n if m-n is divisible by 5.

so now your question becomes: why are the integers of the form 5k+5 of the form 5k?

because 5k+5 = 5(k+1) (we just change k's).

3. ## Re: Prove the total number of cosets of a particular subgroup in a particular group i

Originally Posted by Deveno
suppose i have the entire set of integers:

Z = {.........-4,-3,-2,-1,0,1,2,3,4,5........}

what set do i get if i add 1 to every integer in this set?

one of the peculiarities of the integers is that there is no "smallest integer" nor no "largest integer" so there is no "bottom" that gets bigger when we add 1 to everything, nor no "top" that keeps everything under a certain amount.

EDIT: here is a "semi-formal" proof that Z = Z+1.

suppose k is in Z. then k-1 is in Z as well, so k = (k-1) + 1 is in Z+1.

on the other hand, suppose m is in Z+1. then m = n+1, for some integer n. hence m = n+1 is also an integer, whence m is in Z.

thus Z+1 = Z, since the two sets contain each other.

EDIT #2:

let's look at a particular m, say m = 5.

now 5Z = {........-25,-20,-15,-10,-5,0,5,10,15,20,25,30.......}.

1+5Z = {.......-24,-19,-14,-9,-4,1,6,11,16,21,26,31......}

2+5Z = {......-23,-18,-13,-8,-3,2,7,12,17,22,27,32.......}

3+5Z = {......-22,-17,-12,-7,-2,3,8,13,18,23,28,33......}

4+5Z = {.....-21,-16,-11,-6,-1,4,9,14,19,24,29,34......}

so far, we haven't had any "overlap" at all, every integer only occurs in ONE of these sets.

what happens when we have:

5+5Z = {.......-20,-15,-10,-5,0,5,10,15,20,25,30,35.....}

all we have done is "shifted 5Z over 5". but 5Z has no "start" and no "end" (it's infinite both ways), so we don't get any "extras" at the "end" or any "new ones" at the "start".

***************************

personally, i don't like this way of looking at Z/5Z. i prefer to think of it as a PARTITION of Z into 5 subsets:

5Z = all integers of the form 5k, for some integer k.
1+5Z = all integers of the form 5k+1
2+5Z = all integers of the form 5k+2
3+5Z = all integers of the form 5k+3
4+5Z = all integers of the form 5k+4

if you like you can think of this partition as being the equivalence classes of the following equivalence relation:

m~n if m-n is divisible by 5.

so now your question becomes: why are the integers of the form 5k+5 of the form 5k?

because 5k+5 = 5(k+1) (we just change k's).
Deveno,...Just brilliant! Thanks for help.

4. ## Re: Prove the total number of cosets of a particular subgroup in a particular group i

Sorry for prematurely closing this thread.

Deveno, I've a question about the notation you used.

You said(just after the asterisks symbol) that:

Deveno said:
"...personally, i don't like this way of looking at Z/5Z. i prefer to think of it as a PARTITION of Z into 5 subsets:"

I was just wondering:how did you interpret this notation of "Z/5Z"?

I understand on previous sentences you mentioned that "shifted 5Z over 5".

Can you tell me how that equals to "Z/5Z"?

5. ## Re: Prove the total number of cosets of a particular subgroup in a particular group i

Z/5Z is the set of cosets. the idea is that the "divisor" notation similarity is to remind you of ab/b = a ("factoring out b"), and so Z/5Z is called a "factor group" or more usually, a "quotient group" of Z.

imagine that the integers are like a deck of cards, and you start dealing the cards 1 by 1, into 5 "bowls". every 5th card goes into the same bowl. the bowls are like the cosets: we wind up with 5 subsets of Z, each of which is completely disjoint with all the other 4, and every integer winds up in exactly one coset (no integers get "left out").

for this to work, in general, the subgroup (in this case 5Z) has to have a certain kind of structure, called "normality". for abelian groups (such as Z), every subgroup is normal, so its a non-issue.

6. ## Re: Prove the total number of cosets of a particular subgroup in a particular group i

Again thanks for help.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 26, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9223759174346924, "perplexity_flag": "middle"}