Herculi said:
Summary:: I am having trouble to understand the mechanism behind the group integer modulo 4.
The concept of "addition modulo 4" can be taught without talking about groups. To introduce it in an elementary school class, we ask students to pretend that the only allowed integers are 0,1,2,3. When an addition is performed such as 3 + 2 , we require that result in ordinary arithmetic be replaced by dividing the sum by 4 and using the integer remainder from that division as the answer. So, in modulo 4 arithmetic 3+2 = 1 since, in ordinary arithmetic 3 + 2 = 5 = 2(4) + 1.
For calculations like 1 - 3, we observe that in ordinary arithmetic
1 - 3 = -2 and -2 = (-1)(4) + 2, so in modulo 4 arithmetic 1 - 3 = 2.
The algorithm requires that when we express an integer ##z## in the form ##z = k(4) + r## that we must do this in a way that makes the remainder ##r## non-negative. Sometimes this requires that we choose ##k## to be a negative number.
When we study group theory, we can take a more abstract approach. One way to define "the additive group of integers modulo 4" is to let each element of the group be an infinite set of integers.
For example, in the text you quoted, ##a## is the set of all integers whose division by 4 gives a remainder of 1. For example:
1 = 0(4) + 1
5 = 2(4) + 1
-3 = -1(4) + 1
9 = 2(4) + 1
##a = \{1,5,-3,9,...\}##
The text you quoted conveniently lists the number 1 as the initial element in the set ##a##. You can interpret the contents of ##e,c,d## in a similar manner.
To define the operation ##\circ## of the group, we define addition of the elements ##a \circ b## to be the addition of the sets they represent, in the sense that we form a new set consisting of all possible sums of numbers created by adding one element from ##a## to one element of ##b##.
For example:
##a \circ b = \{1,5,-3,9,...\} \circ \{2,6,-2,10,..\}##
## = \{ 1+2,1+6,1-2,1+10,...,5+2,5+6,5-2,5+10,...\}##
## = \{3,7,-1,11,..,7,11,3,15,...\} = c ##
The calculation give ##a\circ b = c##. To understand that the final result is ##c## you have to imagine doing an infinite number of additions, and you have to keep in mind that in set notation, we do not list the same element twice. So the set I denoted by "##\{3,7,1,11,...,7,11,3,15,...\}##" should actually be denoted using only a single "3" , a single "7", and a single "11",
An more advanced way to define the additive group of integers modulo 4 is to use the group theory concept of a "quotient group". I don't know if you've studied that concept yet.