The Outer Automorphism of S6

08.01.2025

These are notes about the fact that Sn is complete for all n2,6. Another title for these notes might be "How the Number 6 Misbehaves in a Natural Way".

Innies and Outies

Given a finite group G, it is natural to look at the group of its automorphisms Aut(G), i.e. the group (under composition) of bijective homomorphisms from G to itself. These automorphisms can be classified into two categories: inner and outer. An inner automorphism ϕ:GG is an automorphism defined by conjugation of a fixed element gG. That is, ϕ can be expressed as ϕ:GGγgγg1 for some fixed gG. In this case, we write ϕ as ϕg. It's easy to check that the collection of all inner automorphisms Inn(G) of G forms a normal subgroup of Aut(G).

Define the group of outer automorphisms of G by Out(G):=Aut(G)/Inn(G). By somewhat abuse of notation, an element of Out(G) is called an outer automorphism — really, these are classes of automorphisms. One can think of inner and outer automorphisms by the information they define: an inner automorphism is defined with information from within the group, whereas an outer automorphism is defined by some information coming from outside the group.

Already it is worth taking a quick moment for philosophy: to know the full symmetries of a group, one needs to have information from the inside and the outside. It would be nice, both for simplicity and computation, if no automorphisms of G were outer. In this case, everything we might want to know about G, at least in terms of its symmetry, can be found within the group itself. This will motivate our definition of completeness.

The following lemma follows quickly from definitions:

Lemma 1. For a finite group G, Inn(G)G/Z(G).

Proof. Consider the map Φ:GAut(G)gϕg. By definition, the image of Φ is Inn(G). Note that Φ is not, in general, injective. Suppose gkerΦ. Then ϕg=id, i.e. gγg1=γ for all γG. This is exactly to say that gZ(G). In the other direction, any gZ(G) yields ϕg=id. So kerΦ=Z(G).
By the first isomorphism theorem, Inn(G)G/Z(G).

Using the notation above, this can be summarized in the following exact sequence: Z(G)GΦAut(G)Out(G). Thus the kernel of Φ is Z(G) and the cokernel of Φ is Out(G). In this sense, the center of G is dual to its group of outer automorphisms.

Complete Groups

Since it is generally hard to find a group's automorphism group, our best bet might be to just hope that it is something easy...if we're lucky, maybe it's trivial! This would be good for computation, but ends up being too simple: if G is finite and Aut(G)1, then G1 or Z2.

Instead, we might want that Aut(G)G. But observe that this still might get complicated — the isomorphism might not be obvious. Consider the dihedral group D8=s,r|s2=r4=1,sr1=rs. Its center is r2, and so the group of inner automorphisms has four elements. (...something here about how to see this automorhpism group...) But its outer automorphism group (think about the automorphisms of Z4) is isomorphic to Z2. It turns out that the whole automorphism group is isomorphic to D8.

Then it's clear that the best case scenario is when Aut(G) is naturally isomorphic to G, i.e. when Φ is an isomorphism. In other words, G has trivial center and trivial outer automorphism group. In this case, we say G is complete. The terminology here makes sense — if G is complete, then we know exactly what its automorphism group is, and, in some sense, the group is totally self-contained.

UNDER CONSTRUCTION