Hello! You're probably here because I ordered an elementary introduction to group theory in one of my other posts. To get you up to speed, I recommend one of these resources:
- The Dog Shool of Mathematics - Introduction to Group Theory. A quite long but very good series that takes you all the way from writing out Cayley Tables to analysing the groups of a Rubik's cube. Very useful, my favourite of the bunch.
- NRICH - An Introduction to Mathematical Structure. A short article that gives a solid example of several isomorphic groups. Good enough for most of my posts.
- The Group Properties Wiki. Shockingly useful resource for definitions and examples, and even a good tool for picking up foundational concepts if you can trudge through their mildly dense articles.
- You can't go wrong with Wikipedia. It's a good launch point for exploring new ideas once you have the foundations down.
Alternatively, you can bear witness to me lumbering through a couple foundational concepts which should be enough to get you on a level playing field for my other group theory posts.
Proceed with caution, disclaimer, disclaimer, warning..
what is a group?
The general idea is that a group is a collection of elements. These elements can be combined with a special group operation which follows these rules:
- There is an identity element $e$; we call it the identity cause any element in the group $g$ combined with $e$ (I'll write this as $g \cdot e$) is just $g$ again. For example, $0$ is the identity of addition in $\mathbb{Z}$ because $x + 0 = x$ for any integer $x$.
- Every element $g$ has to have an inverse $g^{-1}$ where $g \cdot g^{-1} = e$. An example is how $5$ has the inverse $-5$ where $5 + (-5) = 0$.
- The operation is associative. This means that in general, the order in which you do an operation doesn't affect the result. In more specific terms, for some elements $a$, $b$ and $c$ in $G$ (I'll write this as $a, b, c, \in G$): $$(a \cdot b) \cdot c = a \cdot (b \cdot c)$$
So all in all, a group is about some elements and a way that you can combine them so that you get another element that is in the group. This means that every state, transformation, or "number" you can get from this operation is part of the group. As a result, groups can be of any size, even infinitely large.
Notice that we don't actually say what the operation is. This is the kind of super-abstracted math where "operation" can represent anything from addition to turning the faces of a Rubik's cube.1
what is an isomorphism?
A cool thing about everything being so abstract: we can start looking at the structures of these groups without any labels at all, purely in the way the operation acts on members of the group.
An algebraic example. The complex roots of unity that satisfy $z^8 = 1$ form a group under multiplication. (They satisfy all the group axioms - check!). The set of integers modulo 8 $\mathbb Z / 8$ also forms a group under addition modulo 8. These are the same group! If you relabel the roots of unity to be integers, by going $e^{0} \rightarrow 0$, $e^{\frac {i \pi} 4} \rightarrow 1$, $e^{\frac {i \pi} 2} \rightarrow 2$ and so on, you see that the groups formed are exactly the same! This relabelling of the roots of unity to $\mathbb Z / 8$ is our bijection. We call this group the cyclic group of order 8, $C_8$.
A geometric example: Coming Soon. Pretend geometry hasn't been invented yet; it sucks, anyway.
The sources above provide some more in-depth examples of groups that show up everywhere, which helps develop your intuition. I really can't explain it any better.
group theory DLC
Groups have cool little subtypes. For example, an abelian group is a commutative group; every single element commutes with every other element, so $a \cdot b = b \cdot a$ for any $a$ and $b$ in the group. However, abstract algebra isn't only concerned with groups - there are other similarly fascinating algebraic objects worth studying.
A field is a special set with two operations $+$ and $\times$, and two special elements $0$ and $1$.
- The $+$ operation on a field forms an abelian group with identity $0$.
- The $\times$ operation on the elements of the field that are not $0$ forms an abelian group with identity $1$.
- The $\times$ operation is "distributive over" $+$: $$a \times (b + c) = a \times b + a \times c$$
In other words, a field is a set which acts like the rational numbers!2
A ring is like a field, but a little less stricter. In a ring, we don't require multipication to
form an abelian group - it doesn't need to be commutative, or have inverses, or have an identity, although
it can, which means all fields are also rings.
An example of this is the set of $2 \times 2$ square matrices, denoted $M_2(\mathbb R)$. It doesn't form
a field because singular matrices have no inverse, and multiplication is not commutative.
These alternative concepts exist because just like boring old groups, they show up everywhere, which means we can do even more cool theory on existing structures.
some common groups
There are some groups that come up a lot, especially in my posts, and it's useful to know where they come from and what they look like.
The cyclical groups are denoted by $C_n$, where $n$ is the order of the group (the number of elements). The best way to think of them is the addition of integers mod $n$.
A dihedral group represents the symmetries of a regular polygon, which are the rotations and flips that rearrange the points while keeping the shape looking the same. You'll find my favourite one is $D_4$ ("the dihedral group of degree 4"), which represents the symmetries of a square. It has 8 elements, where I use $e$ to represent identity, $r$ to represent rotation $90 ^\circ$ anticlockwise, and $f$ reflection about the central horizontal axis of the square.
$$\{e, r, r^2, r^3, f, rf, r^2f, r^3f\}$$
Symmetric groups, written as $S_n$ are the sets of all permutations on $n$ elements. Pretty transparently, this has order $n!$ (because combinatorics). Labelling the elements of a symmetric group is pretty difficult since there are so many, so we tend to write them as descriptions of their representative permutations.
Say we have a set $$\{1, 2, 3, 4, 5, 6\}$$ and a permutation which moves $1 \mapsto 3, 3 \mapsto 2, 2 \mapsto 1$ and $6 \mapsto 5$, leaving $4$ alone. This produces a cycle $1 \mapsto 3 \mapsto 2 \mapsto 1$, and another "cycle" $5 \mapsto 6 \mapsto 5$. We write this permutation using its cycles, as $$(1\ 3\ 2)(5\ 6)$$
anything else?
-
Technically, the object is Rubik's cube, not a Rubik's cube, which makes sense but is also really ugly to say. <