Basic Concepts
A Group is a structure consisting of a set extended with an operation which together satisfy four axioms.
Definition 26 (Group)
A group is an abstract mathematical entity which is composed of a set, \(G\), with an associated binary operation, \(*\).
In order to be a group, the pair \((G, *)\) must satisfy the following axioms,
Axiom 1 (Closure)
For all \(a,b \in G\), \(a*b \in G\).
Axiom 2 (Assosciativity)
For all \(a,b,c, \in G\), \((a*b)*c = a*(b*c)\).
Axiom 3 (Identity)
There exists \(e \in G\), such that, for every \(a \in G\), \(a*e = e*a = a\) holds.
Axiom 4 (Inverse)
For each \(a \in G\) there exists a \(b \in G\) such that \(a*b = b*a = e\).
A group is normally denoted by specifying the set and the operation together in the form \(<G, +>\) for the group consisting of set \(G\) and operation \(+\) for example.
Definition 27 (Group Order)
The order of a group is the number of elements it contains.
If the group has finite order the group is described as a finite group; if it has an infinite number of elements it is an infinite group.
Example 6 (A Clock Face)
The hours on a clock represent a group, with a set \(H = \{1,2,3,4,5,6,7,8,9,10,11,12\}\),
and an operation, addition \(\mod 12\).
The order of this group is 12, as it contains 12 elements.
Definition 28 (Homomorphism)
Given two groups, \((G,*)\) and \((H, \cdot)\), a group homomorphism from \((G,*)\) to \((H, \cdot)\) is a function \(h|G \to H\), such that, for all \(u\) and \(v\) in \(G\) it holds
\[h(u * v) = h(u)\cdot h(v)\]
Definition 29 (Isomophism)
A group isomorphism is a function between two groups which sets up a bijection between the elements of the groups in a way which respects the given group operations.
Given two groups, \((G,*)\) and \((H, \cdot)\), a group isomorphism from \((G,*)\) to \((H,\cdot)\) is a bijective group homomorphism from \(G\) to \(H\), that is, an isomorphism is a bijective function \(f : G \to H\), such that, for all \(u,v \in G\), it holds
\[f(u*v) = f(u) \cdot
f(v)\]
If such a function exists we can write
\[(G,*) \cong (H,\cdot)\]
The group of real numbers under addition, and the group of real numbers
under multiplication are isomorphic under the bijection
\[f(x) = e^x\]
[Abelian Group] A group, \((G,*)\) is called Abelian, if, in
addition to the axioms for a group, it also satisfies a commutative
property;
For all \(a,b \in G\), \(a*b = b*a\).
[Subgroup] A set \(H\) which is a subset of \(G\), where
\((G,*)\) is a group, is called a subgroup iff \((H,*)\) is a
group, and
\[H \le G\]
A subgroup, \(H\), is a trivial subgroup if the group, \(G\),
has only the identity element. Otherwise, if \(H \neq G\) then
\(H\) is a proper subgroup.
[Generating Set] The generating set of a group is a subset such that,
any element of the group can be expressed as the combination of finitely
many elements of the subset and their inverses.
[Cayley Diagram] Suppose that \(G\) is a group, and \(S\) is a
generating set for \(G\). They Cayley diagram,
\(\Gamma = \Gamma(G,S)\) is a coloured directed graph with the
construction:
each element \(g\in G\) is assigned a vertex. The vertex set
\(V(\Gamma)\) of \(\Gamma\) is thus identified with
\(G\).
each generator is assigned a colour, \(c_s\)
For any \(g\in G, s \in S\), the vertices corresponding to the
elements \(g\) and \(gs\) are joined by a directed edge of
colour \(c_s\), and thus the edge set, \(E(\Gamma)\) is
composed of the pairs of form \((g,gs)\), with \(s\in S\)
providing the colour.
For simplicity, the identity element is omitted, leaving a normal graph
without loops.