Group Theory. Part I

Hola Malena,

today I want to summarize some basic concepts of Group Theory.

What is a group? Well, I don't mean group as in "bunch of people" or as in "your school drama group". No. I mean it in a technical, mathematical sense. And, as you start seeing it, mathematicians love to be very picky with the details!

This has to do with our previous post on the group, $C_{3v}$, of symmetries of the ammonia molecule $N{H}_3$. There I mentioned that the six symmetry elements of $C_{3v}$ form a group, and I made the remark that this means something very precise. Here I want to provide you with a very basic introduction to the topic of Group Theory.

I'll try to make this text as self-contained as possible. If you still find things that are not so clear, you may check any elementary book on Algebra, or your class notes. Later I'll provide some links as well.

1.-Definition of Group:
So, what do mathematicians think of when they refer to a group? Here it goes:

• A group consists of two things $(G,\ast )$:
1. a collection of elements (we'll denote an arbitrary element by $g$ and the whole collection by $G$)
2. and an internal operation $\ast$ between any pair of elements of $G$, $g$ and $g^{\prime }$. This means, that the result of "multiplying" both elements is again an element of $G$, i.e., $g\ast g^{\prime }\in G$.
• In addition the pair $(G,\ast )$ must satisfy following properties:
1. There is a neutral element $e\in G$ such that
   $e\ast g=g\ast e=g$
   for any arbitrary element $g\in G$.
2. The "product" is associative, i.e.
   $(g\ast g^{\prime })\ast g^{″}=g\ast (g^{\prime }\ast g^{″})$
3. For every element $g$ there is an inverse element, which we'll denote by $g^{-1}$, such that
   $g\ast g^{-1}=g^{-1}\ast g=e$.

And that's all what there is about the definition of group.

As you can see, a group is indeed a collection of "things", somehow. The key point is that we have a way of combining those "things" together and, when we do it, we obtain another thing of that same collection. Furthermore, this combination has to follow some very precise rules (the above three rules) and we you change these rules it won't be a Group anymore; but something else!

Another fun way to express the same thing is saying that those "things" can interact among them and the result of such an interaction is another "thing" of the same kind. That's very much the same as when you write a chemical reaction like, e.g., $H_2+O_2⟶2H_{2}O$: two type of substances (a hydrogen molecule and an oxygen molecule) interact (we symbolize this with the $+$ sign!) to yield another type of substance (water!).

Incidentally, the concept of group shows as well what the essence of Algebra is. Basically, Algebra is about considering a collection of objects and defining one or more internal operations among them. Each time you do so, mathematicians, very pompously say "we defined a structure"! In this case, the structure defined is that of a group. So, what keeps mathematicians so busy about groups, and algebra in general? Once you define a structure, what else is there to do? Don't you then know all about it already? Well, we already know $G$ is a group, yes. However, our goal is to learn about how $G$ is internally structured. Read on to see what I mean.

2.- Types of groups:
In these notes I want to quickly summarize some useful results about groups that should help you understand the things we already talked about and some others to come soon.

In this spirit, I'll start by making a very simple distinction between finite groups and continuos groups. This is already a statement about the internal structure of a group.

The first type are groups that have a finite number of elements, e.g., the group $C_{3v}$ we saw before, which has only $6$ elements. The second type are groups that have an uncountable infinite number of elements, e.g. the group of rotations of the sphere by an angle $\theta \in [0,2\pi )$ around the the $z$-axis: For every value of $\theta$ there is a rotation $R(\theta )$ which is an element of the group, with $\theta$ being a real number! For instance, the identity is given by $R(\theta =0)$; another element is a rotation $R({90}^{\circ })$ of ${90}^{\circ }$, etc.

From now on, I will refer to finite groups unless otherwise stated. Although many things will be valid in general, like the definition above, the theory of continuos groups is a world in its own that goes by the name of Lie groups.

3.- The Cayley table of a finite group:
One easy way to summarize a (finite) group $(G,\ast )$ is by way of writing a table of all possible "products". This is called the Cayley table. (It's obvious that this applies only to finite groups, isn't?)

The Cayley table for our group $C_{3v}$ is as follows (here we use $E$ to denote the identity element $e$):

	$E$	$C_1$	$C_2$	$S_1$	$S_2$	$S_3$
$E$	$E$	$C_1$	$C_2$	$S_1$	$S_2$	$S_3$
$C_1$	$C_1$	$C_2$	$E$	$S_3$	$S_1$	$S_2$
$C_2$	$C_2$	$E$	$C_1$	$S_2$	$S_3$	$S_1$
$S_1$	$S_1$	$S_2$	$S_3$	$E$	$C_2$	$C_2$
$S_2$	$S_2$	$S_3$	$S_1$	$C_2$	$E$	$C_1$
$S_3$	$S_3$	$S_1$	$S_2$	$C_1$	$C_1$	$E$

The way we wrote this table is meant to be read as follow: The action of performing first $S_1$ and then $C_1$, i.e., the product $C_1\ast S_1$ is $S_3$. In other words, the columns specify the right-most element of the product (first operation we apply) and the row the left-most element of the product (second operation we apply).

Notice that this "multiplication" table represents a product that is not commutative: $C_1\ast S_1\ne S_1\ast C_1$!


4.-Definitions:
We'll introduce some basic concepts than have been useful in describing the internal structure of a group.

Given a group $(G,\ast )$ we will introduce the following definitions:

The order of a group $G$ is the number of elements it contains. It's denoted as $ord(G)$. Thus $ord(C_{3v})=6$.

The order of an element $g\in G$ is defined as the number of times we have to "multiply" $g$ by itself in order to obtain the neutral element $e$.

Exercise 1: The order of $S_1$ is $2$ as it is $S_1^2=E$. Check the following results: $ord(C_1)=ord(C_2)=3$ and $ord(S_2)=ord(S_3)=2$.

[Remark: For a finite group the order of an element is always defined. Remember that operating two elements of a group always yields another element of the same group. If the group is finite, and you keep "multiplying" $g$ by itself, eventually you must hit $e$! This is not meant as a formal proof of that statement, but rather give an idea of how the proof goes. However, it's trivial to proof by contradiction; just assume it never gives $e$ but a list of, say, four elements $\{g,g^2,g^3,g^4\}$. The reasoning is the same if you consider another number instead of $4$. What happens when you keep calculating powers $g^5,g^6,\cdots$ or, say, $g^{3141516}$?]

Subgroup: A group $(H,\ast )$ is called a subgroup of $(G,\ast )$ if $H$ is a subset of $G$ and when "multiplying two elements of $H$ yields always again an element of $H$. We can briefly summarize the two conditions as

• $H\subseteq G$ 
• $\mathrm{\forall }h,h^{\prime }\in H;h\ast h^{\prime }\in H$

Of course, $G$ and $\{E\}$ are always subgroups of $G$. These are the trivial subgroups and we rarely talk about them. We already know $G$ is a group. Our goal is to learn about how it is structured. Keep on reading to learn more about how we can learn more about $G$'s structure. (I know, I said that before already :)

Exercise 2: Find all subgroups of $C_{3v}$.

Give it a try before reading on...

Ok, the subgroups are ${\mathrm{\Sigma }}_1=\{E,S_1\}$, ${\mathrm{\Sigma }}_2=\{E,S_2\}$, ${\mathrm{\Sigma }}_3=\{E,S_3\}$ and $R=\{E,C_1,C_2\}$.

That the rotations of the ammonia molecule form a subgroup expresses just the intuitive fact that applying two consecutive rotations yields another rotation, either one of ${240}^{\circ }$ ($C_1\ast C_1=C_2$), one of ${120}^{\circ }$ ($C_2\ast C_2=C_1$) or one of ${360}^{\circ }$ ($C_1\ast C_2=E$), which is the same as the identity.  It is $ord(R)=3$.

Swapping two given hydrogen atoms, say $H_2$ and $H_3$, twice consecutively is the same as not doing anything. Thus, each swapping yields one subgroup. For the swappings $ord({\mathrm{\Sigma }}_1)=ord({\mathrm{\Sigma }}_2)=ord({\mathrm{\Sigma }}_3)=2$.

That's all the concept of subgroup is saying: "Things stay within the given subset of elements"!

The subgroup $R$, taken as a group in itself, is an example of what is called a cyclic group. These are groups that are generated by the repeated multiplication of an element by itself. Such an element is called the generator of the group. $R$ is generated by the rotation $C_1$: $R=\{C_1,C_1^2,C_1^3\}$. Often, you may as well see that written as $$⟨C_1⟩=R$$ where the left and right angle brackets mean the group generated by the elements in between.

Now you can also understand why mathematicians chose the same word order when talking about a group and an element of a group: The order of an element is the same as the size of the group it generates! Put it simply, order always refers to the size of a group; one just needs to understand which group it refers to.

Exercise 3: Find all cyclic subgroups of $C_{3v}$ and their respective orders.

Here you have, thus, another example of how a group can look like. It could be cyclic, like $R$, or non-cyclic, like $C_{3v}$; it can be finite, like these two examples, or infinite,...And the list of possible features doesn't stop there. Read on.

Cosets: Take a subgroup $H$ of $G$. Take as well an arbitrary element $g$ -it could be an element of $H$; it doesn't matter. We can form the subset of elements constructed as $g\ast H$, that is, take an arbitrary element $h\in H$ and do the multiplication $g\ast h$. Do that for all $h$'s and the collection of all products is the subset we denote by $g\ast H\subseteq G$. This is called the left-coset of the subgroup $H$ through $g$. If we now take another $g^{\prime }\in G$ and do the same procedure again we'd obtain another different left-coset $g^{\prime }\ast H$. We keep repeating this for all $g\in G$ and we obtain the list of all left-cosets of $H$

$H$, $g_1\ast H$, $g_2\ast H$, ... , $g_n\ast H$, ...

We could do the same but doing the multiplication in reverse order and we'll denote this by $H\ast g$. This is called the right-coset of the subgroup $H$ through $g$. As we did before, this would lead us to the list of all right-cosets of $H$:

$H$, $H\ast g_1$, $H\ast g_2$, ... , $H\ast g_n$, ... 

In general, the left and right cosets are different.

Exercise 4: From the Cayley table of $C_{3v}$, we can read the left-cosets of ${\mathrm{\Sigma }}_1$ from its column as
$E\ast {\mathrm{\Sigma }}_1={\mathrm{\Sigma }}_1$, $C_1\ast {\mathrm{\Sigma }}_1=\{C_1,S_3\}$, $C_2\ast {\mathrm{\Sigma }}_1=\{C_2,S_2\}$, $S_1\ast {\mathrm{\Sigma }}_1={\mathrm{\Sigma }}_1$, $S_2\ast {\mathrm{\Sigma }}_1=\{S_2,C_2\}$, $S_3\ast {\mathrm{\Sigma }}_1=\{S_3,C_1\}$.
In summary, denoting by $C_{3v}\ast {\mathrm{\Sigma }}_1$ all left-cosets of ${\mathrm{\Sigma }}_1$, we have
$$C_{3v}\ast {\mathrm{\Sigma }}_1=\{{\mathrm{\Sigma }}_1,\{C_1,S_3\},\{C_2,S_2\}\}$$ Find all the cosets of $C_{3v}$.

Give yourself some time before reading on...

Ok, here are all left and right cosets of $C_{3v}$
$$\begin{gathered} C_{3v}\ast {\mathrm{\Sigma }}_1=\{{\mathrm{\Sigma }}_1,\{C_1,S_3\},\{C_2,S_2\}\} \\ {\mathrm{\Sigma }}_1\ast C_{3v}=\{{\mathrm{\Sigma }}_1,\{C_1,S_2\},\{C_2,S_3\}\} \\ {C}_{3v}\ast {\mathrm{\Sigma }}_2=\{{\mathrm{\Sigma }}_2,\{C_1,S_1\},\{C_2,S_3\}\} \\ {\mathrm{\Sigma }}_2\ast C_{3v}=\{{\mathrm{\Sigma }}_2,\{C_1,S_3\},\{C_2,S_1\}\} \\ {C}_{3v}\ast {\mathrm{\Sigma }}_3=\{{\mathrm{\Sigma }}_3,\{C_1,S_2\},\{C_2,S_1\}\} \\ {\mathrm{\Sigma }}_3\ast C_{3v}=\{{\mathrm{\Sigma }}_3,\{C_1,S_1\},\{C_2,S_2\}\} \\ {C}_{3v}\ast R=\{R,\mathrm{\Sigma }\}=R\ast C_{3v} \\ \text{where we have defined} \\ \mathrm{\Sigma }=\{S_1,S_2,S_3\} \end{gathered}$$
Normal (invariant) subgroup: As you can see, for the subgroup $R$ the left and right cosets are the same. When this happens, we call that subgroup a normal subgroup. We can see that $R$ is the only non-trivial normal subgroup of $C_{3v}$.

Symbolically, we wrote the fact that $R$ is a normal subgroup as $C_{3v}\ast R=R\ast C_{3v}$. This looks a lot like the property of commutativity! Any relation to it? Well, in general a group is not commutative. Case in point, our friend $C_{3v}$: For instance, $S_1\ast C_1=S_2\ne C_1\ast S_1=S_3$. However, if we "ignore the details" of which exact pair of elements we are multiplying, but only look at which coset each belongs, in some sense we can recover the commutativity. There is a precise way in which we can "ignore the details". We'll come to that again when we talk about the quotient (or factor) group below.

Why is a normal group also called invariant? This sounds interesting; like there would be something being conserved. Probably, this reminds you of our game CSƆ (Classification, Symmetry, Ɔonservation) , isn't? But, where is there any "transformation" happening? What is there being conserved? Read on; we'll come to it further below.

Wether a given group has or not invariant subgroups, or how many it has depends on each group. This is telling us something about its structure. If the only normal subgroups of $G$ are the trivial ones, we say that $G$ is a simple group. For example, $C_{3v}$ is not a simple group, but ${\mathrm{\Sigma }}_1,{\mathrm{\Sigma }}_2{\mathrm{\Sigma }}_3$ and $R$ all are simple groups.


Partitions of a group: This is not a topic that you may find elsewhere when talking about groups, but this blog is about making contact with the topic of partitions after all! So, I'll talk about this. :)

A partition of a collection of objects is a division of it into classes such that (1) they all are mutually disjoint and (2) the union of all of them equals the whole collection. Consider, for instance, the left-cosets of ${\mathrm{\Sigma }}_1$,
$$C_{3v}\ast {\mathrm{\Sigma }}_1=\{{\mathrm{\Sigma }}_1,\{C_1,S_3\},\{C_2,S_2\}\}$$
As you can see any two classes are disjoint and their union gives the whole group
$${\mathrm{\Sigma }}_1\cup \{C_1,S_3\}\cup \{C_2,S_2\}=C_{3v}$$

Exercise 4: Check that both the left- and right-cosets of each subgroup form a partition of $C_{3v}$.

Partitioning a collection of objects is the same as defining an equivalence relation among them. Be $A$ any subgroup of a group $G$. The collection of its left-cosets, symbolically $G\ast A$,  gives rise to a partition for which we can define the equivalence relation ${\sim }_{GA}$ as follows:
$$\mathrm{\forall }g,g^{\prime }\in G;g{\sim }_{GA}{g}^{\prime }⟺g\ast A=g^{\prime }\ast A\iff g^{-1}\ast g^{\prime }\in A$$ That is, two elements, $g_1,g_2$, belong to the same "left-A-class" (left-coset of A) iif the inverse of one by the other one, $g_1^{-1}\ast g_2$ yield an element of $A$.

Analogously, we can define the equivalence relation given by the right-cosets of $A$, $A\ast G$. However, in this case the equivalence relation we obtain is, in general, different:

$$\mathrm{\forall }g,g^{\prime }\in G;g{\sim }_{AG}{g}^{\prime }⟺A\ast g=A\ast g^{\prime }\iff g^{\prime }\ast g^{-1}\in G$$

Notice the change of order in the last step! As the group may not be commutative, both things express different conditions: it could be that $g^{\prime }\ast g^{-1}\in A$, but $g^{-1}\ast g^{\prime }\notin A$! Case in point, the cosets of, say, ${\mathrm{\Sigma }}_1$: Considering the partition given by $C_{3v}\ast {\mathrm{\Sigma }}_1$, $C_1$ and $S_3$ belong to the same left-coset, and thus $$\begin{gathered} C_1^{-1}\ast S_3=C_2\ast S_3=S_1\in {\mathrm{\Sigma }}_1, \\ \text{however,} \\ {S}_3\ast C_1^{-1}=S_3\ast C_2=S_2\notin {\mathrm{\Sigma }}_1 \end{gathered}$$ 

The latter, however, is the condition for belonging to the same right-coset of ${\mathrm{\Sigma }}_1$! Indeed, the equivalent partner of $C_1$ in ${\mathrm{\Sigma }}_1\ast C_{3v}$ is $S_2$, and we have $$C_1\ast S_2^{-1}=C_1\ast S_2=S_1\in {\mathrm{\Sigma }}_1$$

Of course, we obtain the same answer if we check the other ways around (it's indeed an equivalence relation, and thus, symmetric!), namely, $S_2\ast C_1^{-1}=S_2\ast C_2=S_1\in {\mathrm{\Sigma }}_1$. However, for the right-coset we see again that the check is not satisfied with the inverse on the left: $S_2^{-1}\ast C_1=S_2\ast C_1=S_3\notin {\mathrm{\Sigma }}_1$.

In summary, when you need to check whether any two elements $g,g^{\prime }$ belong to the same coset, the test for the left-cosets has the inverse on the left;  while that for the right-cosets has the inverse on the right!

Exercise 5: Proof whether or not 1) $C_2$ and $S_3$ belong to the same coset in a) $C_{3v}\ast {\mathrm{\Sigma }}_1$, b) ${\mathrm{\Sigma }}_2\ast C_{3v}$ and c) $C_{3v}\ast {\mathrm{\Sigma }}_3$.

Exercise 6: Proof that ${\sim }_{GA}$ and ${\sim }_{AG}$, noth are, indeed, an equivalence relation. That is, proof that each is 1) reflexive, 2) symmetric, and 3) transitive. In short, for a generic equivalence relation $$\begin{gathered} g\sim g \\ g\sim g^{\prime }⟺g^{\prime }\sim g \\ \text{if}g\sim g^{\prime }\text{and}{g}^{\prime }\sim g^{″}\to g\sim g^{″} \end{gathered}$$ where, $g,g^{\prime },g^{″}\in G$ are arbitrary elements of $G$. Demonstrate that both relations satisfy these three conditions.

Don't you wish both checks would give the same relation, that is, would be equally valid? That would make life easier when defining a partition of a group. But this is indeed the case for the cosets of a normal (invariant) subgroup! This explains part of the importance of normal subgroups.

As for a normal subgroup both left- and right-cosets are the same, so are as well both equivalent relations. Thus, a normal subgroup $N$ determines a unique equivalence relation ${\sim }_N$ characterize by $$\mathrm{\forall }g,g^{\prime }\in Gg{\sim }_N⟺g\ast g^{\prime -1}\in N⟺g^{-1}\ast g^{\prime }\in N$$ We can check this is indeed like that for the case of $C_{3v}$.

Exercise 7: For the normal subgroup $R$ of $C_{3v}$, 1) check that for all pair of elements $g,g^{\prime }\in C_{3v}$, if $g^{-1}\ast g^{\prime }\in R$ then it is also true that  $g\ast g^{\prime -1}\in R$; 2) check as well that the implication is also true the other way around, that is, if $g\ast g^{\prime -1}\in R$, then it is also $g^{-1}\ast g^{\prime }\in R$.


Cosets and Action of a Group: You may ask, why is the concept of coset relevant at all? Fine, it's telling us about the so called structure of a group, but, so what? what is this useful for? I'll try to answer this now.

Consider the symmetry transformations that leave invariant the three vertices of an equilateral triangle. Yes, you got it right! These transformations are given as well by our friend $C_{3v}$ (technically, both groups are isomorphic; but we'll come to that later). Indeed, we can swap two vertices or we can rotate the triangle as a whole, with all three vertices simultaneously moving.

Consider now the action of this group, $C_{3v}$ on the vertices. We can represent the three vertices by a $3$-dimensional vector and the group elements by matrices, as we did before. The action of, say, the swapping $S_1$ on any given vertex can be written as $$\left(\begin{array}{ccc}1& 0& 0\\ 0& 0& 1\\ 0& 1& 0\end{array}\right){\mathbf{e}}_{i}i=1,2,3$$ If right after that transformation, we do another one, say a ${120}^{\circ }$ rotation $C_1$, with the present notation, we would write the whole effect as $$\left(\begin{array}{ccc}0& 0& 1\\ 1& 0& 0\\ 0& 2& 0\end{array}\right)\left(\begin{array}{ccc}1& 0& 0\\ 0& 0& 1\\ 0& 1& 0\end{array}\right){\mathbf{e}}_{i}i=1,2,3$$ In other words, the composition of transformations is given by left multiplying with the corresponding matrices.

The group $C_{3v}$ is small. Yet, if I want to understand what it does to the triangle, do we need to remember all matrices of all $6$ representations? do we need to remember all possible combinations of them as well? That doesn't sound like fun. But the left-cosets come here to rescue us!

The cosets are telling us that we just need to consider pair-multiplications (and not products of 3, 4,...100 matrices!) to describe the effect of the group. Even more, for instance, the partition given by $C_{3v}\ast {\mathrm{\Sigma }}_1$ is telling us that we just need multiplications by either the neutral element $E$ or $S_1$. Indeed, when left-multiplying, $S_3$ is given by $C_1\ast S_1$ and $S_2$ is given by $C_2\ast S_1$. That is, we can simply consider the swapping $S_1$ and the rotations, and all three generate all possible transformations!

Mathematically, we can express this by saying that $S_1,C_1,C_2$ generate the whole group, $$⟨S_1,C_1,C_2⟩=C_{3v}$$Swap once and rotate the system to your desired orientation! That's all there is to $C_{3v}$! Cool, isn't?

Of course, we may choose differently. If $S_3$ is given by $C_1\ast S_1$, it is also true that $C_1$ is given by $S_3\ast S_1$! Analogously for $S_2$. Thus, can also consider just the reflections of $C_{3v}$ to describe all effects of this group! In more mathematical terms, we can therefore also write $$⟨S_1,S_2,S_3⟩=C_{3v}$$Let's get convinced through an explicit example. Let's say we want to apply the transformation $C_1\ast S_2\ast C_2\ast S_3$. You immediately see that it doesn't start with $S_1$! Actually, there is no $S_1$ at all! But we said that we just need the three reflections, or just one of them and the two rotations! Were we wrong!? Not really. We just need to show that we can rewrite that composition of transformations in terms of the generators we want. For instance, in terms of $\{S_1,C_1,C_2\}$, it is $C_1\ast (C_2\ast S_1)\ast C_2\ast (C_1\ast S_1)=S_1\ast S_1=E$; and in terms of $\{S_1,S_2,S_3\}$, it is as well $(S_3\ast S_1)\ast S_2\ast (S_2\ast S_1)\ast S_3=S_3\ast S_3=E$.

Given that $C_1$ is the generator of a cyclic group, we can even forget about $C_2$: just repeat $C_1$ twice whenever you see $C_2$! Therefore, for this particular group, it is also true that $$⟨S_1,C_1⟩=C_{3v}.$$This is exactly was is encoded in the fact that 1) $R=⟨C_1⟩$ and 2) that $R$ is a normal group of $ord(R)=3$. As the whole group $C_{3v}$ has $6$ elements and all cosets of $R$ must have $3$ elements as well, there can only be $2$ cosets! This is the so-called Langrange Theorem.

We could have taken other combinations by considering other left-cosets, and that would give as different choices of transformations with which we could summarize the action of $C_{3v}$ on the equilateral triangle.

I'm leaving something important: What does it mean that any two elements belonging to the same coset are equivalent? Well, it's not the case that wherever you see $C_1$ you can substitute it by, say, $S_3$. So, yes, in what sense are they equivalent? We will however postpone the answer to the next chapter.

I think I'll stop here for now. This post is long enough and way more abstract than what I initially had planned. I will continue with the rest I wanted to talk about in a following post, part II of Group Theory.

The emergence of patterns in Physics. Part I.

Hola Malena,

What is an electron, a proton, a pion or a quark? Little balls of different size and mass? Strings vibrating in different modes?

Ignoring for the moment String Theory and other theories trying to unify Gravitation with Quantum Field Theory (QFT), I wanted to suggest you a simple exercise in algebra which illustrates what is understood as an elementary particle within the framework of QFT. And, as you surely guessed it, this has to do with our game csɔ (read as /kasak/; classification, symmetry, ɔonservation, or the other way around ;-).

This example illustrates as well how the patterns that help us understand nature emerge in Physics.

Let me explain this last sentence by recalling the world view that once had Heraclitus (or even better here). We know about him from the writings of Plato. According to him, Heraclitus claimed that everything was in permanent change, or, as is probably better known, you cannot step twice into the same stream. Namely, the current of water you see today is not the same as that from yesterday, whence it is not the same river, Heraclitus would probably say.

What has this to do with current Physics? Probably nothing. But it amuses me thinking that Physics, not without some bit of irony, rephrases Heraclitus when assuming that what is real is that which stays invariant when performing a change, a transformation; that what then gets conserved is the only thing meaningful to talk about, the rest being superfluous.

And that's the idea of our game csɔ, you remember? Let's see. Consider the ammonia molecule $N{H}_3$. It has a tetrahedral configuration with a triangular base.

Balls & stick model of the ammonia molecule $N{H}_3$. Nitrogen atom in blue; hydrogen atoms in grey. Figure retrieved from Wikipedia.

A more schematic drawing is given by the following figure:

Top view of the positions of atoms in a $N{H}_3$ molecule.

Imagine the three hydrogen atoms on the base and the bigger, nitrogen one, on the center and above the  plane of the others. Let's assign this position the number $0$.

Question 1: What are the transformations that leave this structure invariant?

Try to answer before reading on...

Ok, the answer is the group of 6 transformations called $C_{3v}$, which can be obtained considering the following symmetries: A) 120 deg. rotations around an axis perpendicular to the plane of the figure and passing through the N atom, and B) 3 reflections through each of the 3 perpendicular planes that contain N and each one of the H atoms.

If we label the rest of the positions by 1, 2 and 3, see the figure, we can use following notation. We'll call S1 to the reflection through the plane containing 0 & 1, that is, the transformation which swaps whatever is in locations 2 & 3; S2 the one containing 0 & 2, and therefore, only swapping whatever is in 1 & 3; and S3 the one swapping 1 & 2 -notice how we keep abusing of our language one step more every sentence!

[ Remark: It becomes somewhat tedious to keep repeating "whatever is in..." and usually it's not said, but still that's what's meant! ]

From the three possible rotations, that with an angle of ${360}^{\circ }$ is the same as not doing anything, that is, it's the identity, and we'll call it $E$. To the ${120}^{\circ }$, anti-clockwise rotation, we'll call it $C_1$, and the ${240}^{\circ }$, anti-clockwise one, $C_2$. Thus, the group of symmetries consists in $C_{3v}=\{E,C_1,C_2,S_1,S_2,S_3\}$

[Remark: Technically speaking, one says that the structure has the symmetry $C_{3}v$, and each transformation of the group is called a symmetry element.]

[Remark: Here we are using the word "group" in a quite informal way as a "collection of objects". We'll later see that it has a very precise mathematical definition. But we'll ignore that for moment -let's see how far we get :) ]

Question 2: If we denote by $C_2\cdot C_1$ the composition of transformations (in analogy to the usual composition of functions $f\circ g$), that is, first apply $C_1$ and, to the result, apply then $C_2$, convince yourself of the following identities:

$$\begin{gathered} C_2\cdot C_1=C_1\cdot C_2=E \\ {S}_1\cdot S_1=S_2\cdot S_2=S_3\cdot S_3=E \end{gathered}$$

Question 3: A possible first notation for these 6 transformations is that of permutations. It works as follows.

For each transformation, list the four atoms sorted on one line. The sorting of each atom is given by its position. On a line beneath that one, list again the atoms after the transformation while respecting the same sorting of positions. In this way, we obtain

$$\begin{gathered} E=\left[\begin{array}{cccc}N& H_1& H_2& H_3\\ N& H_1& H_2& H_3\end{array}\right] \\ {C}_1=\left[\begin{array}{cccc}N& H_1& H_2& H_3\\ N& H_3& H_1& H_2\end{array}\right] \end{gathered}$$

For instance, for $C_1$ this reads as follows: "the transformation $C_1$ leaves the object located on $0$ on the same location; that which was on location $1,H_1$, it moves it to location $2$; the one located on $2,H_2,$ is moved to $3$; and the one which was located on $3,H_3$, gets moved to location $1$".

As the first reference line will always be the same, we can omit it and thereby save some work! In this way, we'll write

$$\begin{gathered} E=\left[N{H}_1{H}_2{H}_3\right] \\ {C}_1=\left[N{H}_3{H}_1{H}_2\right] \\ {C}_2=\left[N{H}_2{H}_3{H}_1\right] \end{gathered}$$ 

Write the permutations corresponding to $S_1,S_2$ and $S_3$.

Question 4: We can represent these transformation as matrices as well. Consider the same sorting for columns and rows as that one above for positions. Again this sorting denotes thus the locations 0,1,2 and 3. We may then read each column, say column 'c' as "that which was on position 'c' gets moved to position..." and the answer is the location corresponding to the row where we put a "1" on that same column. We have then, e.g.,

$E=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\end{array}\right)$

and

$C1=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 0& 1\\ 0& 1& 0& 0\\ 0& 0& 1& 0\end{array}\right)$.

Write the matrices corresponding to $C_2,S_1,S_2$ and $S_3$.

Verify the following identities by doing the corresponding matrix multiplications:

$$\begin{gathered} C_1\cdot C_2=C_2\cdot C_1=E \\ {S}_1\cdot S_1=E \\ {S}_1\cdot S_2=C_2 \end{gathered}$$

Question 5: The inverse of a transformation has to be one such that when multiplying by the said transformation one obtains the identity. Write as a matrix the inverse of the transformation $C_1$, i.e., $(C_1{)}^{-1}$, and verify that $C_1\cdot (C_1{)}^{-1}=(C_1{)}^{-1}\cdot C_1=E$.

Do the same for $S_1$. Can you write down the matrices corresponding to inverses of $S_2$ and $S_3$ without calculating them? Actually, it's easy to write down all inverses without calculating the inverse matrix. It suffices to understand the notation and realize what changes each inverse transformation does.

Question 6: The matrices we obtained in Q4 above are the matrices written on the basis of vectors given by $B_0=\{e_0,e_1,e_2,e_3\}$, as given on the big slide at the bottom. This basis represents the four positions as vectors in a virtual vectorial space (nothing to do with the 3-dimensional space where we can construct the triangular tetrahedron, nor the one where the ammonia molecule lives in).

Write the corresponding matrices in the basis $B_z$ as given by the slide at the bottom.

The final result is as follows. In the basis $B_z$, the symmetry $C_{3v}$ has the following matricial representation:

$E^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\end{array}\right)C_1^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& -\frac{1}{2}& \frac{1}{2}\\ 0& 0& -\frac{3}{2}& -\frac{1}{2}\end{array}\right)C_2^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& -\frac{1}{2}& -\frac{1}{2}\\ 0& 0& \frac{3}{2}& -\frac{1}{2}\end{array}\right)$

$S_1^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& -1\end{array}\right)S_2^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& -\frac{1}{2}& \frac{1}{2}\\ 0& 0& \frac{3}{2}& \frac{1}{2}\end{array}\right)S_3^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& -\frac{1}{2}& -\frac{1}{2}\\ 0& 0& -\frac{3}{2}& \frac{1}{2}\end{array}\right)$

Notice how the 6 matrices get structured in blocks around the diagonals (in linear algebra, this is similar to what's called the Jordan normal form, or Jordan canonical form of a matrix, which is the simplest representation we can get when a matrix cannot be diagonalized). We can distinguish two blocks of 1x1 size and one of size 2x2 on all six matrices!

Yes, for $E$ and $S_1$ that may sound a bit strange, but it isn't. The said 2x2 block is just $\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)$ for $E$ and $\left(\begin{array}{cc}1& 0\\ 0& -1\end{array}\right)$ for $S_1$.


Conclusion:
As you can see, none of the transformations "mix" the vectors $Z_0$ and $Z_1$, neither among them, nor with $Z_2$ or $Z_3$. However, vectors $Z_2$ and $Z_3$ do get mixed under the transformations  $C_1,C_2,S_2$ and $S_3$. Under $S_1$, $Z_2$ stays invariant, but $Z_3$ reverses its orientation. Whence, in some sense, $Z3$ does mix as well in this case, even if it´s with himself!

Indeed, the fact that there are blocks that do not mix means that these blocks present some "identity", some reality; it means it is something that gets preserved, conserved, under any transformation. It is, thus, something we may call a (symmetry) pattern.

In the following figure you can see my attempt to graphically represent the different patterns one may distinguish. Not all are obtained within a single basis, as happens with the patterns given by the vectors $e_0,V_0$ and $Z_1$.

Four basic patterns of the $C_{3v}$ symmetry: I) everything collapsed on a dot, II) a triangular tetrahedral frame as a whole; III) a triangular frame corresponding to the base; IV) two more abstract, intertwinned patterns related to the orientation of location 0 relative to the plane formed by 1, 2 and 3.  

These patterns we are talking about, i.e., the specific set of vectors as ${\mathbf{e}}_0$, ${\mathbf{V}}_0$,    ${\mathbf{Z}}_1$, etc., these are mathematical patterns: We considered a physical system and arbitrarily decided to represent it through vectors and matrices. Maybe we could have chosen a different description. But given our present choice, we then see that a particular combination of vectors somehow conveys our idea of pattern.

The job of the physicist is then to apply this language in the description of physical systems in a way that helps us understand them better. For instance, these ideas may provide an easier argument explaining why the electrostatic field is perpendicular to the surface of a conductor, or why the magnetic field of a current through a wire has only an angular component around that wire.

But the ideas of symmetry are much more powerful. Physics considers the elementary particles, and, for what it matters, any other particle as well, in an analogous way as we did here, namely as symmetry patterns analogous to the examples shown here. More exactly, an elementary particle is but a component of an irreducible representation of a symmetry group. By irreducible representation it is meant the blocks we obtained above; a component is like a vector defining such a block, i.e., like ${\mathbf{e}}_0$ or like ${\mathbf{Z}}_2$.

Furthermore, the concept of symmetry allows the physicist to classify things, like, say, atoms :-) . This is just the familiar Mendeleev's periodic table of elements: the concept of symmetry, as we did here, is used to identify recurrent patterns in the configuration of the electrons of the atoms. Once you can identify different patterns, you can classify things based on who shows which pattern, in much the same way we all have done often as kids. Thus, each column of the periodic table groups together elements with the same irreducible representation of the group of rotations (rotations by an arbitrary angle; see next paragraph). This is the symmetry manifested by the valence electrons (those farthest from an atom's nucleus). A version of the periodic table of elements that best reflects this classification is Janet's left-step periodic table.

The difference in QFT is that the corresponding symmetry groups are very different. In particular, the may represent groups of continuous transformations, i.e., they accept rotations by an arbitrary angle, and not only by ${120}^{\circ }$; or each transformation may depend on the location in space; or they may refer to transformations in a virtual space that has nothing to do with swapping balls around some locations in space.

Thus, as we can see, the concept of symmetry has been very useful for the physicist in describing nature. It has allowed her understand which quantities have to be conserved, defining the essential concept of elementary particle, and also to classify systems. But there is more: physics shows us that the four fundamental forces are uniquely determined by the symmetries that characterize them. That is, once the symmetries are given, so are the forces! The theory of liquid crystal, in condensed matter, is another clear example where the symmetry of the constituent particles uniquely determines the dynamics, i.e., the response of the liquid crystal.

The Emergence of Patterns I

Solutions:

Question 1: Evidently, $C_{3v}$ is a symmetry group of the ammonia molecule $N{H}_3$. Any of its symmetry elements transforms the molecule into a state that is indistinguishable from the initial state before the transformation. We could end the discussion here, as the solution to the question is already in the above text: It's enough checking that $C_{3v}$ is indeed a symmetry!

However, if we care for the details, we could ask, how we know for sure that these are all the symmetries of $N{H}_3$. That is, aren't we missing a symmetry transformation of $N{H}_3$ that is not included in $C_{3v}$? For the sake of completeness of the discussion in this post, we will now try to respond to this question here.

For example, we could swap the atoms $N$ and $H_1$. Clearly, this is not a symmetry, as we would immediately realize that somebody moved the molecule. However, if we then rotate the molecule within the plane containing atoms $N$, $H_1$ and $H_3$ we could bring $N$ atom back on the top position.   Isn't this a symmetry transformation? Isn't this, therefore, a transformation different that those contained in $C_{3v}$? And from a more general point of view, why did we consider rotations only around the $N$ atom? why not also rotations around each and every hydrogen atom? And, what about reflections including $N$ as well? Couldn't there be combinations of such kind of rotations and reflections that lead to additional symmetries of $N{H}_3$?

That is our mindset now. These are the questions we are trying to clarify. Fine. Let's look into it in detail now.

For the sake of simplifying our discussion, let's first consider only transformations that leave invariant hydrogen atom $H_2$. For those leaving invariant $H_1$ or $H_3$ the argument should be similar.

Fine. If $H_2$ is invariant, we just need to repeat the same arguments in the text above, but considering $H_2$ as if it were the nitrogen atom. That is, we will have 3 reflections and 3 rotations in the plane containing atoms $N$, $H_1$ and $H_3$. We will call the first three ${\sigma }_0$, ${\sigma }_1$ and ${\sigma }_3$, with the indices referring to the positions left invariant, and we'll call the rotations $D_3$, $D_3^2$ and $D_3^3\equiv E$, the last one being the identity. We will also call the group of transformations formed by these elements $C_{3v}^{II}$. Notice how, ${\sigma }_0$ is identical to the reflection $S_2$ of our previous group $C_{3v}$. This will be the key for why we don't need to consider any additional transformations to those already discussed.

Evidently, $C_{3v}^{II}$ is not a group of symmetries of the ammonia molecule $N{H}_3$. It's easy to see that none of the elements $D_3$, ${\sigma }_1$ or ${\sigma }_3$ is a symmetry element -and if $D_3$ isn't, so is $D_3^2$, isn't? But, what about combinations of these transformations? In order to set up a combination resulting in a symmetry, we must manage to get the $N$ atom back on position $0$ at the end of such a transformation. We will see now that this is that strong a constraint that it limits the answer to only one possibility -besides the trivial one, $E$.

Let's use the notation corresponding to permutations -it's more concise and this text is becoming already  very long. Let's consider now the first combination we mentioned above, namely, $D_3^2\cdot {\sigma }_3$, that is, (fasten your seat belts now!) swapping whatever are in locations $0$ and $1$, followed by a counter-clockwise rotation of ${240}^{\circ }$ around an axis containing $2$ and perpendicular to the plane $0$, $1$ and $3$. (Side note: one day I'll draw a picture and just refer to it.)

Ok. The reflection is easy to write down, namely $S_3=[1,0,2,3]$. The other isn't much more difficult: $D_3^2=[1,3,2,0]$. We might have applied twice $D_3=[3,0,2,1]$ as well, instead of guessing it directly. Fine, we then have

$D_3^2\cdot {\sigma }_3=D_3^2[1,0,2,3]=[0,3,2,1]={\sigma }_0$

It's relatively easy to convince oneself that, no matter with which transformation $T\in C_{3v}^{II}$ we start with. If we want that the next transformation $T^{\prime }$ leaves the $N$ atom on position $0$, the resulting combination will always end up being ${\sigma }_0$! In other words, now all the symmetries of $N{H}_3$ are the transformations contained within the subgroup $G\equiv \{E,{\sigma }_0\}\supset C_{3v}^{II}$.  But, as ${\sigma }_0=S_2$, $G$ is but a subgroup of $C_{3v}$.

We would have arrived to the same conclusion if we would have fixed atom $H_1$ or $H_3$ instead of $H_2$. We are shown, therefore, that the group $C_{3v}$ contains all possible symmetry elements of the ammonia molecule $N{H}_3$. QED :-)

Question 2: $C_1$ is a transformation that rotates each and every one of the hydrogen atoms ${120}^{\circ }$ counter-clockwise around an axis containing $N$. $C_2$ is a rotation in the same sense and around the same axis, but by angle of ${240}^{\circ }$. Thus, if we first rotate all $H$ atoms ${120}^{\circ }$ and right afterwards we add a ${240}^{\circ }$ rotation to it, the net effect will be like rotating all those atoms ${360}^{\circ }$, and therefore, like not doing anything. In mathematical jargon, the combined effect of both transformations is identical to the identity transformation! The same happens if we first apply $C_2$ and then $C_1$. It therefore holds that $C_2\cdot C_1=E=C_1\cdot C_2$.

It's easier to see it for reflections: Consider a sorted list of characters, a, b, c,... Now swap two, and only two, characters, e.g., the first and the third characters. The list would then turn into c, b, a, ... If we now apply the same transformations again, that is, we swap again the first and third characters, we get a, b, c, ... In other words, it's like we didn't do anything. Thus, applying twice a transposition -which is the technical name for such a swap when we make no reference to space- is the same as the identity. As each of $S_1$, $S_2$ and $S_3$ are transpositions, it readily follows the three identities $S_1\cdot S_1=S_2\cdot S_2=S_3\cdot S_3=E$.

Question 3: It's easy to convince yourself that the solutions are

$S_1=[N,H_1,H_3,H_2]$,

$S_2=[N,H_3,H_2,H_1]$,

$S_3=[N,H_2,H_1,H_3]$.

Question 4: As we already know, $C_2$ leaves $N$ invariant, but rotates all hydrogens by ${240}^{\circ }$. 

Thus, it makes $H_1$ hop twice: from its initial position, $1$, to $2$ and from there to $3$. In the same way, it moves $H_2$ to the position were initially we had $H_1$, i.e., $1$, etc. Therefore, we can directly write the corresponding matrix 

$C_2=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\\ 0& 1& 0& 0\end{array}\right)$

The reflections are even easier and we can directly write them down

$S_1=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 0& 1\\ 0& 0& 1& 0\end{array}\right)$

$S_2=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 0& 1\\ 0& 0& 1& 0\\ 0& 1& 0& 0\end{array}\right)$

$S_3=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 1& 0\\ 0& 1& 0& 0\\ 0& 0& 0& 1\end{array}\right)$

Question 5: Let's determine the inverse matrix of $C_1$ without calculating it. Remember that such an matrix must "undo" what $C_1$ does. For instance, $C_1$ move an atom at $1$ to position $2$. It's inverse must thus bring to location $1$ whatever is at $2$. Thus, its column number $2$ will have a one at row $1$ and the rest will be zeros. Furthermore, as $C_3$ brings what is at $3$ to $1$, its inverse must bring what is at $1$ to $3$, and therefore its column $1$ will all be zeros except at row $3$ where it must have a one. Similarly, we can see the its column $3$ will have a single 1 only at row $2$.

${\left(C_1\right)}^{-1}=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\\ 0& 1& 0& 0\end{array}\right)$

As we can see, this matrix is just transformations $C_2$! In short, it is $C_2={\left(C_1\right)}^{-1}$.

Again, the case of the reflections is easier:

${\left(S_1\right)}^{-1}=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 0& 1\\ 0& 0& 1& 0\end{array}\right)=S_1$

${\left(S_2\right)}^{-1}=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 0& 1\\ 0& 0& 1& 0\\ 0& 1& 0& 0\end{array}\right)=S_2$

${\left(S_3\right)}^{-1}=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 0& 1& 0\\ 0& 1& 0& 0\\ 0& 0& 0& 1\end{array}\right)=S_3$

Question 6: The basis $B_z$ is composed of the vectors

${\mathbf{Z}}_0={\mathbf{e}}_0$, ${\mathbf{Z}}_1={\mathbf{e}}_1+{\mathbf{e}}_2+{\mathbf{e}}_3$, ${\mathbf{Z}}_2=2{\mathbf{e}}_1-({\mathbf{e}}_2+{\mathbf{e}}_3)$ y ${\mathbf{Z}}_3={\mathbf{e}}_3-{\mathbf{e}}_2$

Let's construct the matrices with the columns and rows sorted in the same way, namely, Z0, Z1, Z2 and Z3. We can follow to ways to obtain these matrices. One path is the "mechanical" one, which is longer  but doesn't require "to think" much. This path consists in writing the matrix change of basis, let's call it $M$, given by the previous definitions of the $B_z$ basis, and apply $M$ as a similarity transformation to the matrices we obtained earlier. For instance, if call the matrix representation of $C_1$ in the basis $B_0$ as $C_1^0$, and that one in the basis $B_z$ as $C_1^z$, it holds that $C_1^z=M^{-1}\cdot C_1^0\cdot M$.

Painful! It's convenient to know this way of calculating it, and sometimes it might be the only approach available; we also need to master matrix algebra, of course. But, if we clearly understand what a matrix is, we have another way of solving this question which is way easier.

[Now comes a side note on elementary linear algebra.
Let's recall what a matrix is. The column $j$ of an arbitrary matrix $A$ is the result of applying $A$ on the basis vector $b_j$, i.e.,  the column $j$ consists on the vector $A{b}_j$. An arbitrary component $i$ of this vector is thus ${\left(A{b}_j\right)}^i=A^{ij}$ (strictly speaking it would be $A_{\phantom{i}j}^{i\phantom{j}}$ as it is a 1-covariant, 1-contravariant tensor. Will we ignore, however, such subtleties as we are not considering the effects of having any particular metric around). In other words, the matrix element $A^{rs}$ of a matrix $A$ is the component $r$ of the image of the basis vector $b_s$ given by the linear application $A$.

For the case of a matrix change of basis $M$ the interpretation changes only slightly. This takes a vector of basis $B_z$, say ${\mathbf{Z}}_1$, and assigns it as image a linear combination of vectors of basis $B_0$, namely ${\mathbf{e}}_1+{\mathbf{e}}_2+{\mathbf{e}}_3$. Sorting the columns as Z0, Z1, Z2 and Z3, and the rows as e0, e1, e2 and e3, the previous change of basis, $M$ has the matrix representation given by

$M=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 2& 0\\ 0& 1& -1& -1\\ 0& 1& -1& 1\end{array}\right)$.

End of review of linear algebra.]

Therefore, in order to construct the corresponding matrices, we just need to build the images of Z0, Z1, Z2 and Z3 as given by each and every one of the 6 symmetry elements of $C_{3v}$.

Immediately we see that ${\mathbf{Z}}_0$ is invariant under all transformations -as it should, for it corresponds to position $0$. But also that ${\mathbf{Z}}_1$ is invariant under $C_{3v}$ as well. This is so because ${\mathbf{Z}}_1$ is a symmetric combination of all three positions $1$, $2$ and $3$, i.e., it considers them all together without making any distinctions among them. Any rotation or reflection will thus change only the order of the summands in ${\mathbf{Z}}_1$. But this doesn't change ${\mathbf{Z}}_1$ at all!

There is still left to see what happens with ${\mathbf{Z}}_2$ and ${\mathbf{Z}}_3$. These are not invariant, but transform among each other! Let's look in detail the case of $S_2$. In this case we obtain following results:

$S_2{\mathbf{Z}}_2=2e_3-(e_2+e_1)=-\frac{1}{2}{\mathbf{Z}}_2+\frac{3}{2}{\mathbf{Z}}_3$

$S_2{\mathbf{Z}}_3=e_1-e_2=\frac{1}{2}{\mathbf{Z}}_2+\frac{1}{2}{\mathbf{Z}}_3$

Therefore, the matrix corresponding to $S_2$ in the basis $B_z$ is

$S_2^z=\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& -\frac{1}{2}& \frac{1}{2}\\ 0& 0& \frac{3}{2}& \frac{1}{2}\end{array}\right)$

You can follow the same method to obtain the matrices of the remaining transformations.