Groups

Overview
Groups are an incredibly powerful tool where you consider a set of elements connected by one or more binary operations. The beauty of groups is that, instead of using the operations directly, we abstract them away and use the theory of groups to find results. Provided an operation satisfies the group axioms, it doesn't matter how that operation is defined or how complicated it is - we can prove results using only the abstract concept of an operation (this will make more sense, I promise).
Group Axioms
A group (G,∗)(G, \ast)(G,∗)
 is a set GGG
 with a binary operation that satisfies the following axioms:
​∗\ast∗
 is closed on GGG
​
​∗\ast∗
 is associative on GGG
​
There is an identity element e∈Ge \in Ge∈G
 such that ∀a∈G,e∗a=a∗e=a\forall a \in G, e \ast a = a \ast e = a∀a∈G,e∗a=a∗e=a
​
For every a∈Ga \in Ga∈G
, there is an inverse element a−1∈Ga^{-1} \in Ga−1∈G
 such that a∗a−1=a−1∗a=ea \ast a^{-1} = a^{-1} \ast a = ea∗a−1=a−1∗a=e
​
Note that groups do not need to be commutative - if a group is commutative, it is called an Abelian group, named after Niels Abel.
Group Example
We take the group (Z4,+)(\Z_4, +)(Z4​,+)
 where Z4={0,1,2,3}\Z_4 = \{0,1,2,3\}Z4​={0,1,2,3}
. This group is addition modulo 4, forming an abelian group of order 4 (has 4 elements). We can write the complete addition table:
+ | 0 1 2 3
--|--------
0 | 0 1 2 3
1 | 1 2 3 0
2 | 2 3 0 1
3 | 3 0 1 2
This is clearly closed and has an identity element 000
. Every element aaa
 also has an inverse a−1a^{-1}a−1
 such that a+a−1=0a + a^{-1}=0a+a−1=0
. The associativity and commutativity can be assumed based on the associativity and commutativity of general addition, meaning (Z4,∗)(\Z_4, \ast)(Z4​,∗)
 forms an abelian group.
Last modified 1yr ago