Group Theory Basics
Group Theory Basics
A group is a set of elements, the group has one operation. The group is closed under the operation. Each element has an inverse. Combining the inverse with the element gives you the identity usually denoted with
Closure
if
Associativity
if a,b and c are in the group then (a * b) * c = a * (b * c)
The group operation must be associative. Addition and multiplication of real numbers is associative. Subtraction and division of real numbers is not associative
but
Thus (5-3)-2 does not equal 5 - (3-2). Same goes for division
but
Identity
There is an element
A group must have identity element. When the identity element is combined with any element of the group in the group operation the result is always the same member of the group. For multiplication of real numbers the identity element is 1; for addition of real numbers it is 0.
Inverse
For any element a of the group there is an element a^-1 such that
and
Inverse of the element of the additive group is the negative of the element, ex:
Inverse of the element of the multiplicative group is the reciprocal of the element, ex:
Commutativity
In group theory commutativity is not assumed. Only the four properties above: closure, associativity, inverses, identity are required for a group.
Cyclic Groups
Any subgroup must contain its inverse, identity element and to be closed under the group operation it has to contain all powers of x and its inverse.
Examples
Multiplication
Let G be a group with operation X (multiplication)
Pick
What ’s the smallest subgroup of G that contains
if
Addition
Let H be a group with operation + (addition)
Pick
Group generated by y = smallest subgroup of H containing y.
if
Lagrange Theorem
In group theory, for any finite group of G, the order of subgroup H of group G divides the order of G. The order of the group represents the number of elements.
Suppose we’ve got a finite group G and a subgroup of G that we’ll call H. Lagrange’s Theorem says that |H| divides |G| and the number of left cosets is |G| / |H|. We’ll prove it in a few steps:
- For any subgroup H, a left coset of H has the same size as H.
- For the rest of the proof, assume H isn’t just G or {1}; if it is, the theorem holds anyway.
- The cosets of H are all disjoint.
- Every element of G is a member of some coset of H.
- |G| = the sum of the sizes of all cosets.
- |G| = k|H|, where k is the number of left cosets.
Let
and
construct the table:
The number of disjoint
Our equivalence provides the partition of
Only two unique groups from the gH composition hence 2; the order of H is 4. Thus the order of G will be 4 * 2 = 8