COMMUTATIVITY

IDENTITY
INVERSE
Suppose
CLOSUREwe consider
– exists;a finite set S = {1,
the operation © 2,
is 3, 4} and
closed in aS binary
because
 The
operation
1©4 =©,
the said ©1
identity
andoflet13the
4operation defined in©allbeelements
==is23,operation defined of
onS.
the
The
2©3 identity
following =table.
3© 2  of 23 == 23
The identity of 3 of
:.Commutativity = 2© exists
The©identity
1 of 2 4 =32 4
ASSOCIATIVE
1 2 1 4 3
The 2identity
1©(2©3) element
2 3 of ©4is 2.
1 = (1©2)©3
:.The
3 Identity
1©3=1©3 4 of 3 © exists
2 1
4=44 3 4 1 2
2©(3©1) = operation
THEREFORE, (2©3)©1 © exists
2©4= 3©1
4=4

:.Associativity of © exists
:.The inverse of © exists
Activity 2. Modular Addition
Recall what you have learned in Lesson 1, and the definition of a º b (mod m). Perform the arithmetic addition
mod 7. Enter your answers on the matrix given. You can view from this link how modular addition is done:
x and y, be elements of Z
https://www.youtube.com/watch?v=2POgCMpHRh0.

Set S = {0,1,2,3,4,5,6}
Å7
x@y= 3x + 2y 33
0
0
0
1
1
2
2
4
4
5
5
6
6
1 1 2 3 4 5 6 0
2 2 3 4 5 6 0 1
-5@-5 = -25
3 3 4 5 6 0 1 2
4 4 5 6 0 1 2 3
5 5 6 0 1 2 3 4
6 6 0 1 2 3 4 5

:. Therefore, the operation Å exists. 7

Closure  Closure of Å exists. The operation Å is closed in

7 7

S because the said operation is defined in all elements of S.

Associativity 
Sol’n
2Å (4 Å 5) = (2Å 4 ) Å 5
7 7 7 7

2Å 2 = 6 Å 5
7 7

4=4
:. Associativity of operation Å exists. 7

Commutativity 
4 Å 5 = 5Å 4
7 7

2=2
:. Commutativity of operation Å exists. 7

:. Commutativity of operation Å exists as proven by diagonal 7

line of symmetry.

Additive Identity  0 is the additive identity of operation

Å7
:. Additive Identity of operation Å exists. 7

Additive Inverse  0 is the additive inverse of operation Å 7

:. Additive Inverse of operation Å exists. 7