bloch-sphere-0

Groups

We're all familiar with the idea of adding/multiplying numbers together.3+2=53 + 2 = 5, 3×2=63 \times 2 = 6 etc.

Group theory concerns the study these operations in a more abstract setting. Instead of just numbers, we can have any kind of object and any kind of operation. The only requirement is that the operation satisfies a few properties. We'll cover these properties later, but first let's look at an example.

The Triangle Group

The most classic group example is the rotations and reflections of a triangle.

If we label the vertices of our triangle aa, bb and cc, then any specific rotation or reflection of the triangle can be represented by a permutation of these vertices. Here's how that works:

The rotations of a triangle and the different permutations of the vertices

As you can see as we rotate the triangle we can represent its state by the permutation of the vertices. Rotating the triangle changes the permutation.

We can also perform another operation on the triangle: flipping it along the vertical axis. We can see this operator as well with the permutations:

A representation of how flipping a triangle affects the vertex permutations

Now that we've got a visual intuition let's formalise this in mathematical terms.

We'll create a group out of this by considering how these operations combine. We'll call our group GG and the elements of the group will be all the operations we can perform on the triangle. There are 3 different operations we can perform: a 120 degree rotation, a 240 degree rotation and a flip. We'll represent these as r1r_1, r2r_2, ff respectively. In fact, we'll add a 4th operation here as well: doing nothing. We'll call this the identity operation and represent it as ee.

The last thing to cover is how these operations combine. We'll use the symbol \circ to combine our operations. And now we're ready to do some math!

It's quite clear that r1e=r1r_1 \circ e = r_1, fe=ff \circ e = f since doing nothing (the identity operation ee) after any operation will be the same as just doing the operation. We can see some more interesting properties as well. For example r1r2=er_1 \circ r_2 = e. If we do a 120 degree rotation followed by a 240 degree rotation we end up back where we started. This is the same as doing nothing.

We can create something very similar to a multiplication table showing how the \circ operation works between each element:

eer1r_1r2r_2ff
eeeer1r_1r2r_2ff
r1r_1r1r_1r2r_2ee?
r2r_2r2r_2eer1r_1?
ffff??ee

Ok, we've got a few interesting values in the table, but what about those question mark values? What do we get when we flip the triangle and then rotate it? If we start with a triangle permutation ABCABC, flipping then rotating gives us:BACBAC. We can't get to this state with a single flip or rotation so we've found a new operation that we need to add! We'll call this operation fr1fr_1. We'll also need to addfr2fr_2 to represent the state CBACBA. Now our table can be completed:

eer1r_1r2r_2fffr1fr_1fr2fr_2
eeeer1r_1r2r_2fffr1fr_1fr2fr_2
r1r_1r1r_1r2r_2eefr2fr_2fffr1fr_1
r2r_2r2r_2eer1r_1fr1fr_1fr2fr_2ff
fffffr1fr_1fr2fr_2eer1r_1r2r_2
fr1fr_1fr1fr_1fr2fr_2ffr2r_2eer1r_1
fr2fr_2fr2fr_2fffr1fr_1r1r_1r2r_2ee

I encourage you to get a pen and paper and check that some of these values are correct.

This is a group! We have a set of elements and a binary operation that combines them. Formally we define a group as (G,)(G,\circ) where GG is our set of elements and \circ is the binary operator the combines the elements. So in our case: G={e,r1,r2,f,fr1,fr2}G = \{e, r_1, r_2, f, fr_1, fr_2\} and \circ is the operation defined in the table above.

The essence of a group really lies in the multiplication table we created. Given any number of elements simply draw a table and fill in rows and columns and you've got a group!

Or have you...?

There are actually a few rules that must be followed in order for it to be a group. We can't just enter any values we want into the table. For example a group of 3 elements table where the operation \circ sends every value to ee (the identity) is not a valid group.

Let's go through each of the rules now and relate them to our triangle group example.

Closure

(ab)G(a \circ b) \in G

The closure property states that when combining any 2 elements of the group under the operation, the result is also a member of the group.

This is a not a tricky one to prove. Simply check the multiplication table above and you'll see that the result of any \circ operation gives another group element.

Associativity

(ab)c=a(bc)(a \circ b) \circ c = a \circ (b \circ c)

Just like normal numerical multiplication, when combining elements of the group, we must be able to pick any ordering of brackets we want.

Proving this for our triangle group will be a little more involved but I encourage you to try a few examples and check that it holds e.g. (r1fr1)f=r1(fr1f)(r_1 \circ fr_1) \circ f = r_1 \circ (fr_1 \circ f)

Identity

e,ea=ae=a\exists e, e \circ a = a \circ e = a

The math notation is getting a bit more complicated now, but this one's simple. It merely states than a group must have an identity element. i.e. the "do nothing" element.

This one's easy to prove as well since we can quite clearly see from the left and top row of the table that ee is indeed an identity.

Inverse

a,b,ab=ba=e\forall a, \exists b, a \circ b = b \circ a = e

For every element of the group there must exist some other element that when combined with that element produces the identity. Think about numerical multiplication where every number has an multiplicative inverse that when multiplied together gives 11, e.g. 5×15=15 \times \frac{1}{5} = 1

We can see this is true from the fact that each row/column of the table has exactly one ee in it.

Well-Defined

a1=a2 and b1=b2    a1b1=a2b2a_1 = a_2 \textmd{ and } b_1 = b_2 \implies a_1 \circ b_1 = a_2 \circ b_2

This one seems obvious, but it states that if two equal elements are combined in the same order under the operation they give the same result.

This is trivially true for the triangle group since we can see each entry in the table has only one entry.


And these are the 5 rules! I encourage you to have a go at constructing some other multiplication tables of groups and see if they fit the rules.

One interesting rule you might notice is missing is commutativity. Commutativity states that ab=baa \circ b = b \circ a. This is not actually a requirement of a group. The triangle group we've been discussing is not commutative! The table above shows that fr1r1r1fr1fr_1 \circ r_1 \neq r_1 \circ fr_1. If a group does have this property we call it an Abelian group.

Conclusion

One final question you might ask here is: why these rules? Why do we need these specific properties to define a group? What would happen if we removed some? The way to answer this question is to simply state that these rules are chosen because they are interesting. There is nothing that makes these rules "right" or "correct", but they are the rules that give us the most interesting and useful properties for the math we need. Changing the rules would give us a different structure that might be interesting in its own right, but it wouldn't be a group.

This is the essence of group theory. We're not interested in the specific operations we're performing, but the properties that these operations satisfy. This allows us to study the abstract properties of these operations and apply them to many different areas of mathematics.

Exercises

Exercise 1

Are the integers under multiplication a group?

More formally if we define the elements of our group to be the integers Z={...,2,1,0,1,2,...}\mathbb{Z} = \{..., -2, -1, 0, 1, 2, ...\} and the operation to be standard numerical multiplication×\times e.g. 3×2=63 \times 2 = 6 , do we get a valid group? If so, prove it. If not, which rule(s) does it violate?

Show solution

Exercise 2

Continuing on from the previous exercise, do we get a valid group if we take the integers under addition instead of multiplication? Again, if so, prove it. If not, which rule(s) does it violate?

Show solution

Exercise 3 (difficult)

How many abelian groups of order (size) 3 are there?

This is a bit more advanced so here's some guidance on this question:

When we say "order" here, we mean the number of elements in the group. e.g. for our triangle group above, the order is 66. We notate this formally as:G=6|G| = 6.

Remember the definition of an abelian group is one where the operation is commutative i.e. ab=baa \circ b = b \circ a.

We should also specify that we're looking for the number of"distinct" abelian groups of order 3. Distinct here means groups that are a fundamentally different structure. This means simply renaming the elements of the group doesn't count as a new group.

Show solution
> Next Article (Fields)