The Unapologetic Mathematician

Mathematics for the interested outsider

Group Actions and Representations

From the module perspective, we’re led back to the concept of a group action. This is like a G-module, but “discrete”. Let’s just write down the axioms for easy reference: we’ve got a set S and a function A:G\times S\to S such that

  • A preserves the identity: A(e,s)=s.
  • A preserves the group operation: A(g,A(h,s))=A(gh,s).

Notice how this looks almost exactly like the axioms for a G-module, except since S is just a set we don’t have any sense of “linearity”.

Now, from a group action on a finite set S we can get a finite-dimensional representation. We let V=\mathbb{C}S — the vector space defined to have S as a basis. That is, vectors in \mathbb{C}S are of the form

\displaystyle\sum\limits_{s\in S}c_s\mathbf{s}

for some complex coefficients c_s. We get a G-module by extending A to a bilinear function \mathbb{C}[G]\times\mathbb{C}S\to\mathbb{C}S. We already know how it behaves on the basis of the form (\mathbf{g},\mathbf{s}), and the extension to a bilinear function is uniquely defined. We call \mathbb{C}S the “permutation representation” associated to S, and the elements \mathbf{s} for s\in S we call the “standard basis”.

As an example, the group S_n is defined from the very beginning by the fact that it acts on the set \{1,2,\dots,n\} by shuffling the numbers around. And so we get a representation from this action, which we call the “defining representation”. By definition, it has dimension n, since it has a basis given by \{\mathbf{1},\dots,\mathbf{n}\}. To be even more explicit, let me write out the defining matrix representation for S_3. Technically, going from an abstract representation to a matrix representation requires not just a basis, but an ordered basis, but the order should be pretty clear in this case. And so, with no further ado:

\displaystyle\begin{aligned}\rho\left(e\right)&=\begin{pmatrix}1&0&0\\{0}&1&0\\{0}&0&1\end{pmatrix}\\\rho\left((1\,2)\right)&=\begin{pmatrix}{0}&1&0\\1&0&0\\{0}&0&1\end{pmatrix}\\\rho\left((1\,3)\right)&=\begin{pmatrix}{0}&0&1\\{0}&1&0\\1&0&0\end{pmatrix}\\\rho\left((2\,3)\right)&=\begin{pmatrix}1&0&0\\{0}&0&1\\{0}&1&0\end{pmatrix}\\\rho\left((1\,2\,3)\right)&=\begin{pmatrix}{0}&0&1\\1&0&0\\{0}&1&0\end{pmatrix}\\\rho\left((1\,3\,2)\right)&=\begin{pmatrix}{0}&1&0\\{0}&0&1\\1&0&0\end{pmatrix}\end{aligned}

To see how this works, note that the permutation (1\,2\,3) sends 3 to 1. Similarly, we find that \left[\rho\left((1\,2\,3)\right)\right](\mathbf{3})=\mathbf{1}. That is:

\displaystyle\begin{pmatrix}{0}&0&1\\1&0&0\\{0}&1&0\end{pmatrix}\begin{pmatrix}{0}\\{0}\\1\end{pmatrix}=\begin{pmatrix}1\\{0}\\{0}\end{pmatrix}

We also see that composition of permutations turns into matrix multiplication. For example, (1\,2\,3)(2\,3)=(1\,2). In terms of the matrices we calculate:

\displaystyle\begin{pmatrix}{0}&0&1\\1&0&0\\{0}&1&0\end{pmatrix}\begin{pmatrix}1&0&0\\{0}&0&1\\{0}&1&0\end{pmatrix}=\begin{pmatrix}{0}&1&0\\1&0&0\\{0}&0&1\end{pmatrix}

You can check for yourself all the other cases that you care to.

Notice that in general the matrices are index by two elements of S, and the matrix element \rho(g)_s^t — the one in the sth row and tth column — is \delta_{A(g,t),s}. That is, it’s 1 if A(g,t)=s — if the action of g sends s to t — and 0 otherwise. This guarantees that every entry will be either 0 or 1, and that each row and each column will have exactly one 1. Such a matrix we call a “permutation matrix”, and we see that the matrices that occur in permutation representations are permutation matrices.

September 16, 2010 Posted by | Algebra, Group Actions, Group theory, Representation Theory, Representations of Symmetric Groups | 9 Comments

The Category of Root Systems

As with so many of the objects we study, root systems form a category. If \Phi is a root system in the inner product space V, and \Phi' is a root system in the inner product space V', then a morphism from \Phi to \Phi' will be a linear map \tau:V\rightarrow V' so that if \alpha\in\Phi then \tau(\alpha)\in\Phi'. Further, we’ll require that \tau(\beta)\rtimes\tau(\alpha)=\beta\rtimes\alpha for all roots \alpha,\beta\in\Phi.

Immediately from this, we find that the Weyl group \mathcal{W} of \Phi not only acts on \Phi itself, but on \Phi'. Indeed, \tau induces a homomorphism \mathcal{W}\rightarrow\mathcal{W}' that sends the generator \sigma_\alpha to the generator \sigma_{\tau(\alpha)}. Even better, \tau actually intertwines these actions! That is, \sigma_{\tau(\alpha)}(\tau(\beta))=\tau(\sigma_\alpha(\beta)). Indeed, we can calculate

\displaystyle\begin{aligned}\sigma_{\tau(\alpha)}(\tau(\beta))&=\tau(\beta)-(\tau(\beta)\rtimes\tau(\alpha))\tau(\alpha)\\&=\tau(\beta-(\tau(\beta)\rtimes\tau(\alpha))\alpha)\\&=\tau(\beta-(\beta\rtimes\alpha)\alpha)\\&=\tau(\sigma_\alpha(\beta))\end{aligned}

In particular, we can say that two root systems are isomorphic if there’s an invertible linear transformation \tau sending \Phi to \Phi', and whose inverse \tau^{-1} sends \Phi' back onto \Phi. In this case, the intertwining property can be written as an isomorphism of Weyl groups sending \sigma\in\mathcal{W} to \tau\sigma\tau^{-1}\in\mathcal{W}'.

Even more particularly, an automorphism of \Phi is an isomorphism from \Phi to itself. That is, it’s an invertible linear transformation from V to itself that leaves \Phi invariant. And so we see that \mathcal{W} itself is a subgroup of \mathrm{Aut}(\Phi). In fact, the Weyl group is a normal subgroup of the automorphism group. That is, given an element \sigma of \mathcal{W} and an automorphism \tau of \Phi, the conjugation \tau\sigma\tau^{-1} is again in the Weyl group. And this is exactly what we proved last time!

We can now revise our goal: we want to classify all possible root systems up to isomorphism.

January 22, 2010 Posted by | Algebra, Geometry, Group Actions, Root Systems | 9 Comments

The Weyl Group of a Root System

Let’s take a root system \Phi in the inner product space V. Each vector \alpha in \Phi gives rise to a reflection in \sigma_\alpha\in\mathrm{O}(V), the group of transformations preserving the inner product on V. So what sorts of transformations can we build up from these reflections? The subgroup of \mathrm{O}(V) generated by the reflections \sigma_\alpha for all \alpha\in\Phi is called the Weyl group \mathcal{W} of the root system. It’s pronounced “vile”, but we don’t mean that as any sort of value judgement.

Anyway, we can also realize \mathcal{W} as a subgroup of the group of permutations on the vectors in \Phi. Indeed, by definition each \sigma_\alpha sends each vector in \Phi back to another vector in \Phi, and so shuffles them around. So if \Phi has k vectors, the Weyl group can be realized as a subgroup of S_k.

In particular, \mathcal{W} is a finite group, as a subgroup of another finite group. In fact, we even know that the number of transformations in \mathcal{W} divides k!. It may well (and usually does) have elements which are not of the form \sigma_\alpha, but there are still only a finite number of them.

The first thing we want to take note of is how certain transformations in \mathrm{GL}(V) act on \mathcal{W} by conjugation. Specifically, if \tau leaves \Phi invariant, then it induces an automorphism on \mathcal{W} that sends the generator \sigma_\alpha to \tau\sigma_\alpha\tau^{-1} — which (it turns out) is the generator \sigma_{\tau(\alpha)} — for all \alpha\in\Phi. Further, it turns out that \beta\rtimes\alpha=\tau(\beta)\rtimes\tau(\alpha) for all \alpha,\beta\in\Phi.

Indeed, we can calculate

\displaystyle\left[\tau\sigma_\alpha\tau^{-1}\right](\tau(\beta))=\tau(\sigma_\alpha(\beta))=\tau(\beta-(\beta\rtimes\alpha)\alpha)=\tau(\beta)-(\beta\rtimes\alpha)\tau(\alpha)

Now, every vector in \Phi is of the form \tau(\beta) for some \beta, and so \tau\sigma_\alpha\tau^{-1} sends it to the vector \tau(\sigma_\alpha(\beta)), which is again in \Phi, so it leaves \Phi invariant. The transformation \tau\sigma_\alpha\tau^{-1} also fixes every vector in the hyperplane \tau(P_\alpha), for if \beta is orthogonal to \alpha, then the above formula shows that \tau(\beta) is left unchanged by the transformation. Finally, \tau\sigma_\alpha\tau^{-1} sends \tau(\alpha) to -\tau(\alpha).

This is all the data we need to invoke our lemma, and conclude that \tau\sigma_\alpha\tau^{-1} is actually equal to \sigma_{\tau(\alpha)}. Specifying the action on the generators of \mathcal{W} is enough to determine the whole automorphism. Of course, we can also just let \sigma act on each element of \mathcal{W} by conjugation, but it’s useful to know that the generating reflections are sent to each other exactly as their corresponding vectors are.

Now we can calculate from the definition of a reflection

\displaystyle\left[\tau\sigma_\alpha\tau^{-1}\right](\tau(\beta))=\sigma_{\tau(\alpha)}(\tau(\beta))=\tau(\beta)-(\tau(\beta)\rtimes\tau(\alpha))\tau(\alpha)

Comparing this with the equation above, we find that \tau(\beta)\rtimes\tau(\alpha)=\beta\rtimes\alpha, as asserted.

January 21, 2010 Posted by | Algebra, Geometry, Group Actions, Group theory, Root Systems | 16 Comments

Groupoids (and more group actions)

A groupoid is the natural extension of a group, considered as a category. A groupoid is a category where each morphism is invertible. If a groupoid has only one object it’s a group.

These structures are the central players in John Baez’ “Tale of Groupoidification”, which started in this issue of This Week’s Finds. They’re also a rather popular subject over at The n-Category Café.

Unfortunately, one of the best examples of a groupoid is still beyond us at this point, but there are others. One nice place groupoids come up is from group actions. In fact, Baez is of the opinion that the groupoid viewpoint is actually more natural than the group action viewpoint, but I think it would be difficult to start teaching from that end.

So how does this work? Let’s say we have a group G and a left action of G on a set S. Now let’s build a groupoid from this information. The high-level view is that every single move from one state (element of S) to another will be a morphism, and we can compose morphisms if the outgoing state of the first is the incoming state of the second. Now for the details.

We take the objects of our groupoid to be the set S, and the morphisms to be the set G\times S. The source of a morphism (g,s) will be s, and the target will be g\cdot s. For each object s we have the identity morphism (e,s), where e is the identity of G. If we have two morphisms (g,s) and (g',s'), and g\cdot s=s' (so the pair are composable), then we have the composite (g',s')\circ(g,s)=(g'g,s). Note that this still has source s, and its target is (g'g)\cdot s=g'\cdot(g\cdot s)=g'\cdot s', as it should be.

Well this is enough to show we have a category, but now we need to show that each morphism has an inverse. If we have a morphism (g,s) going from s to g\cdot s, we’ll need the inverse to go from g\cdot s to s=(g^{-1}g)\cdot s=g^{-1}\cdot(g\cdot s). The clear choice is (g^{-1},g\cdot s), and indeed we find that (g^{-1},g\cdot s)\circ(g,s)=(e,s), and (g,s)\circ(g^{-1},g\cdot s)=(e,g\cdot s). Thus we have a groupoid.

This result we call the “action groupoid” or the “weak quotient”, and write S//G. Remember that the “real” quotient is the set of orbits of G on S — we consider two elements of S to be “the same” if they are related by an element of G. Here we don’t consider them to be the same; we just make them isomorphic. Since we’ve replaced “the same” by “isomorphic”, we call this a “weak” quotient.

Now, an action groupoid is not just any groupoid. For one thing, we’ve got a functor S//G\rightarrow G. Just send every single object of S//G to the unique object of G, considered as a category. Then send the morphism (g,s) to g. We’re sort of folding up the groupoid S//G into the groupoid (with one object) G. But here’s the thing: this functor is faithful! Indeed, we see that \hom_{S//G}(s,s') is the set of g so that s'=g\cdot s. In particular, it’s a subset of the elements of G, and the functor acts on this hom set by the inclusion function of this subset into G, which is injective. Even though the functor loses a lot of information (like, which state a given morphism started at) it’s still faithful because “faithful” just pays attention to what happens in each hom set, not what happens to the objects.

It turns out we can find a (somewhat) simpler groupoid \mathcal{H} equivalent to S//G and compatible with this faithful functor. That is, if the functor above is F:S//G\rightarrow G, we can find a groupoid \mathcal{H} with functors E:\mathcal{H}\rightarrow S//G and I:\mathcal{H}\rightarrow G. The functor E will be an equivalence, I will be faithful, and we’ll have I=F\circ E. The really special thing about H is that it will be a collection of groups with no morphisms between any distinct objects.

For the objects of \mathcal{H}, take the set of G-orbits of S. There will be no morphisms between distinct objects, so we just need to specify a group of morphisms on each object. So, given an orbit O\subseteq S pick a point x\in O and let \hom_\mathcal{H}(O,O)=G_x — the stabilizer of x. Of course, different representative points may give different stabilizers, but the stabilizers of any two points in the same orbit are isomorphic. For the functor I, just send each object of \mathcal{H} to the single object of G and include each hom set into G as a subgroup, just like we did for F.

Now we define our equivalence. Since we’ve already picked a representative point in each orbit, let’s just send the object of \mathcal{H} corresponding to that orbit to the object of S//G corresponding to that point. Then we can just send \hom_\mathcal{H}(O,O)=G_x=\hom_{S//G}(x,x) to itself. Clearly this is fully faithful, and it’s also essentially surjective because every point of S is in some G-orbit. So we have an equivalence. Also it should be clear that I=F\circ E.

In fact, we can adapt this to any groupoid \mathcal{G} with a faithful functor to a group G. Just replace “in the same orbit” by “have an arrow between them”. Then chop up the objects of \mathcal{G} into equivalence classes, make each one an object of our new groupoid \mathcal{H}, and make the morphisms on an object in \mathcal{H} the “stabilizer” of a representative object from \mathcal{G}. It all goes through to give the same sort of factorization.

And then if you push just a little bit harder you can take any discrete groupoid \mathcal{H} (“discrete” = no morphisms between distinct objects) with a faithful functor \mathcal{H}\rightarrow G and puff it up into an action groupoid. In fact, it suffices to show how to do this for a single object in \mathcal{H}, since all the others go the same way.

In this case we have a subgroup H\subseteq G and we need to see it as the stabilizer of some G action. We use the set G/H of left cosets of H in G. This may not be a group (since H may not be normal), but it’s at least a set, and G certainly acts on it by left-multiplication. What subgroup of G fixes the coset eH? Exactly H. So, we puff H out into G/H and take its weak quotient by G to get an action groupoid equivalent to H.

Putting this all together we see that any groupoid \mathcal{G} with a faithful functor \mathcal{G}\rightarrow G is equivalent to the action groupoid S//G for some G-set S. And any G action gives an action groupoid with a faithful functor to G. The two concepts are essentially the same.

June 9, 2007 Posted by | Algebra, Category theory, Group Actions, Group theory | 15 Comments

Groups and group actions — categorically

The theory of group actions looks really nice when we translate it into the language of categories. That’s what I plan to do today.

We know that a monoid is essentially the same thing as a category with one object, and a group is a special kind of monoid. So any group G can be considered as a category with one object in which every morphism has an inverse. So what’s a (left) group action? Well, it’s descibed by choosing a set S for G to act on, and a homomorphism from G to the group of bijections on S. But S is an object in the category \mathbf{Set} of sets, and bijections from S to itself are just the invertible morphisms in \hom_\mathbf{Set}(S,S). What we’re describing here is a functor from G to \mathbf{Set}! A (left) action of G is an object of the category \mathbf{Set}^G of (covariant) functors from G to \mathbf{Set}. We know it’s a category because G has (for our purposes) just a set of morphisms — it’s small.

Now I was adding these parentheticals above, since there’s also a notion of a right G-action. This is pretty much the same, but it satisfies s\cdot(gh)=(s\cdot g)\cdot h instead of (gh)\cdot s=g\cdot(h\cdot s). That is, it switches the order of composition. But we know how to do that! A right G-action is a contravariant functor — an object of \mathbf{Set}^{G^\mathrm{op}}.

So these actions form categories. What are the morphisms? Since these are functor categories, they’re natural transformations. Let’s say we have (left) actions A_1:G\rightarrow\mathbf{Set} and A_2:G\rightarrow\mathbf{Set}, and that A_1 and A_2 send the single object \bullet of G to the sets S_1 and S_2, respectively. Now, what’s a natural transformation \eta:A_1\rightarrow A_2?

Well, there’s only one object in G, so a transformation only has one component: \eta_\bullet:S_1\rightarrow S_2. For any morphism (group element) g\in G it must satisfy the naturality condition \eta_\bullet(g\cdot s)=g\cdot\eta_\bullet(s) for all s\in S_1. Note that the dot on the left denotes the action of G on S_1, and the one on the right denotes that on S_2. So we see that \eta_\bullet must be a function which “intertwines” the two actions of G. That is, it preserves the G-action, just like homomorphisms of monoids preserve the composition and so on — a very natural notion of morphism of G-actions indeed! As a special case, a natural transformation from A_1 to itself is a permutation of the elements of S_1 which commutes with the actions of all the elements of G.

Okay, so we can translate this theory into categorical language and it looks pretty. So what? Hold on tight, because now I’m going to hit it with Yoneda’s Lemma (and its meaning).

Since there’s only one object in G we only get one covariant functor h_\bullet and one contravariant functor h'_\bullet. The covariant one gives us the group G acting on its set of elements by left-multiplication, and the contravariant one gives the same set with the action of right-multiplication. Now given any other left G-action (covariant functor) on S Yoneda’s Lemma tells us that the set S is in bijection with the set of functions f:G\rightarrow S satisfying f(gh)=g\cdot f(h). In particular, we must have f(g)=f(ge)=g\cdot f(e), where e is the identity of the group, so the image of the identity element specifies the function completely. That is, if we have a left G-action on a set S then every element s\in S gives us an intertwining function satisfying f_s(e)=s, and every intertwining function sends e to some element of S, giving us our bijection. A similar situation holds for right G-actions.

What about the Yoneda embedding \mathbf{y}:G\rightarrow\mathbf{Set}^{G^\mathrm{op}}? Well as we noted above, this sends the single object of G to the set of elements of G acting on itself on the right (because the target is the category of contravariant functors). But \mathbf{y} is a functor, so it sends morphisms of G (group elements) to morphisms of \mathbf{Set}^{G^\mathrm{op}} (G-intertwining functions). Specifically, a group element g gets sent to a function \mathbf{y}(g):G\rightarrow G satisfying \left[\mathbf{y}(g)\right](h_1h_2)=\left[\mathbf{y}(g)\right](h_1)h_2.

Even better, we can compose these natural transformations! Since \mathbf{y} is a functor we have \mathbf{y}(g_1g_2)=\mathbf{y}(g_1)\circ\mathbf{y}(g_2). Also, \mathbf{y}(e) must be the identity function on G — \left[\mathbf{y}(e)\right](h)=h. Putting this all together, we see that \left[\mathbf{y}(g)\right](h)=gh, and indeed multiplying by g on the left commutes with multiplying by another element of G on the right, since group composition is associative! So we have a function sending G to the group of permutations of the elements of G, and this function preserves group multiplication and identities. Then it must also preserve inverses, and we have a group homomorphism from G to \mathrm{Bij}(G).

And now for the coup de grâce: the Yoneda embedding y is fully faithful! Firstly, this means that the homomorphism G\rightarrow\mathrm{Bij}(G) is injective — its kernel is trivial — so every group is isomorphic to a subgroup of a permutation group. Secondly, this means that every permutation of the elements of G which commutes with right-multiplication is given by left-multiplication by some element of G.

As a coda, we’re always more interested in representable functors than in represented functors, since we only care about things up to isomorphism. It turns out that there’s a special name for representable functors in this setup: torsors. I’ll be mentioning these again, to be sure, but a basic definition is that a G-torsor is a (left) G-action on a set, which is isomorphic to the action of G on itself by left-multiplication. That link will take you to an excellent explanation (with great examples) by John Baez.

June 8, 2007 Posted by | Algebra, Category theory, Group Actions, Group theory | 1 Comment

A few more facts about group actions

There’s another thing I should have mentioned before. When a group G acts on a set S, there is a bijection between the orbit of a point x and the set of cosets of G_x in G. In fact, gx=hx if and only if h^{-1}gx=x if and only if h^{-1}g is in G_x if and only if gG_x=hG_x. This is the the bijection we need.

This has a few immediate corollaries. Yesterday, I mentioned the normalizer N_G(K) of a subgroup K. When a subgroup H acts on G by conjugation we call the isotropy group of an element x of G the “centralizer” C_H(x) of x in H. This gives us the following special cases of the above theorem:

  • The number of elements in the conjugacy class of x in G is the number of cosets of C_G(x) in G.
  • The number of subgroups conjugate to K in G is the number of cosets of N_G(K) in G.

In fact, since we’re starting to use this “the number of cosets” phrase a lot it’s time to introduce a bit more notation. When H is a subgroup of a group G, the number of cosets of H in G is written \left[G:H\right]. Note that this doesn’t have to be a finite number, but when G (and thus H) is finite, it is equal to the number of elements in G divided by the number in H. Also notice that if H is normal, there are \left[G:H\right] elements in G/H.

This is why we could calculate the number of permutations with a given cycle type the way we did: we picked a representative g of the conjugacy class and calculated \left[S_n:C_{S_n}(g)\right].

One last application: We call a group action “free” if every element other than the identity has no fixed points. In this case, G_x is always the trivial group, so the number of points in the orbit of x is \left[G:G_x\right] is the number of elements of G. We saw such a free action of Rubik’s Group, which is why every orbit of the group in the set of states of the cube has the same size.

February 24, 2007 Posted by | Algebra, Group Actions, Group theory | 5 Comments

Conjugacy classes in symmetric groups

Let’s work out how symmetric groups act on themselves by conjugation. As I’m writing I notice that what I said before about composition of permutations is sort of backwards. It’s one of those annoying conventions that doesn’t really change anything, but can still be a bit confusing. From here on when we write permutations in cycle notation we compose by reading the cycles from right to left. That is, (1\,2)(1\,3)=(1\,3\,2). Before I was reading them left to right. The new way behaves more like group actions. The exposition comes after the jump.
Read more »

February 23, 2007 Posted by | Algebra, Group Actions, Group theory | 3 Comments

Conjugation

One of the most useful examples of a group acting on a set comes directly from group theory itself. Let G be a group and H be a subgroup of G. The subgroup H acts on the set of all subgroups of G as follows.

If K is any subgroup of G and h is any element of H, then the set hKh^{-1} of elements of G of the form hkh^{-1} with k in K is another subgroup of G. Indeed, if we take two elements hkh^{-1} and hk'h^{-1} of this set, their product is hkh^{-1}hk'h^{-1}=hkk'h^{-1}, which is again of the proper form since kk' is in K. We call this subgroup the conjugation of K by h.

Given two elements of H we can check that (hh')K(hh')^{-1}=hh'Kh'^{-1}h^{-1}, so conjugating by hh' is the same as conjugating by h', then by h. That is, this defines an action of H on the set of all subgroups of G.

Even better, hKh^{-1} is not just another subgroup of G, it is isomorphic to K. In proving that hKh^{-1} is a subgroup we showed that the function sending k to hkh^{-1} is a homomorphism. We can undo it by conjugating by h^{-1}, so it’s an isomorphism. We say that two subgroups of G related by a conjugation are conjugate.

The subgroup of H sending K to itself — those h in H so that hKh^{-1}=K — is called the normalizer of K in H, written N_H(K). We can verify that K is a normal subgroup in N_G(K), and that K is normal in G exactly when N_G(K)=G.

One orbit is particularly interesting to consider: G is always sent to itself by conjugation. That is, given an element h of G the homomorphism sending g to hgh^{-1} is an automorphism of G. In fact, given any group G, the automorphisms of G themselves form a group, called {\rm Aut}(G). Conjugation gives us a homomorphism c from G to {\rm Aut}(G): given an element g, c(g) is the automorphism of conjugation by g.

We call automorphisms arising in this way “inner automorphisms”. The group {\rm Inn}(G) of inner automorphisms on G is the image of c in {\rm Aut}(G). If g is an element of G and f is any automorphism of G, then f\circ c(g)\circ f^{-1} is the automorphism sending x in G to

f(gf^{-1}(x)g^{-1})=f(g)f(f^{-1}(x))f(g^{-1})=f(g)xf(g)^{-1}

Which is just conjugation of x by f(g). This proves that {\rm Inn}(G) is normal in {\rm Aut}(G). The quotient {\rm Aut}(G)/{\rm Inn}(G) is the group of outer automorphisms {\rm Out}(G).

The kernel of c is the set of elements g so that gg'g^{-1}=g' for all g' in G. That is, for any g' we have gg'=g'g, so the kernel of c is the subgroup of G consisting of elements that commute with every element of G. We call this subgroup the center of G.

Now, consider the group S_n of permutations on n letters. Determine how this group acts on itself by conjugation. Write out some conjugations in cycle notation to get an idea of what the answer should be.

February 22, 2007 Posted by | Algebra, Group Actions, Group theory | 7 Comments

Group actions

Okay, now we’ve got all the setup for one big use of group theory.

Most mathematical structures come with some notion of symmetries. We can rotate a regular n-sided polygon \frac{1}{n} of a turn, or we can flip it over. We can rearrange the elements of a set. We can apply an automorphism of a group. The common thread in all these is a collection of reversible transformations. Performing one transformation and then the other is certainly also a transformation, so we can use this as a composition. The symmetries of a given structure form a group!

What if we paint one side of the above n-gon black and the other white, so flipping it over definitely changes it. Then we can only rotate. The rotations are the collection of symmetries that preserve the extra structure of which side is which, and they form a subgroup of the group of all symmetries of the n-gon. The symmetries of a structure preserving some extra structure form a subgroup!

As far as we’re concerned right now, mathematical structures are all built on sets. So the fundamental notion of symmetry is rearranging the elements of a set. Given a set S, the set of all bijections from S to itself {\rm Bij}(S) is a group. We’ve actually seen a lot of these before. If S is a finite set with n elements, {\rm Bij}(S) is the symmetric group on n letters.

Now, a group action on a set is simply this: a homomorphism from G to {\rm Bij}(S). That is, for each element g in G there is a bijection p_g of S and p_{gh}(x)=p_g(p_h(x)).

It’s important to note what seems like a switch here. It’s really due to the notation, but can easily seem confusing. What’s written on the right is “do the permutation corresponding to h, then the one corresponding to g“. So we have to think of the multiplication in G as “first do h, then do g“.

In what follows I’ll often write p_g(x) as gx. The homomorphism property then reads (gh)x=g(hx)

I’ll throw out a few definitions now, and follow up with examples in later posts.

We can slice up S into subsets so that if x and x' are in the same subset, x'=gx for some g, and not if they’re not in the same subset. In fact, this is rather like how we sliced up G itself into cosets of H. We call these slices the “orbits” of the G action.

As an important special case of the principle that fixing additional structure induces subgroups, consider the “extra structure” of one identified point. We’re given an element x of S, and want to consider those transformations in G which send x to itself. Verify that this forms a subgroup of G. We call it the “isotropy group” or the “stabilizer” of x, and write it G_x.

I’ll leave you to ponder this: if x and x' are in the same G-orbit, show that G_x and G_{x'} are isomorphic.

February 20, 2007 Posted by | Algebra, Group Actions, Group Homomorphisms, Group theory | 18 Comments

   

Follow

Get every new post delivered to your Inbox.

Join 224 other followers