## Section14.7Sage

¶Groups can be realized in many ways, such as as sets of permutations, as sets of matrices, or as sets of abstract symbols related by certain rules (“presentations”) and in myriad other ways. We have concentrated on permutation groups because of their concrete feel, with elements written as functions, and because of their thorough implementation in Sage. Group actions are of great interest when the set they act on is the group itself, and group actions will figure prominently in the proofs of the main results of the next chapter. However, any time we have a group action on a set, we can view that group as a permutation group on the elements of the set. So permutation groups are an area of group theory of independent interest, with its own definitions and theorems.

We will describe Sage's commands applicable when a group action arises naturally via conjugation, and then move into the more general situation in a more general application.

### SubsectionConjugation as a Group Action

We might think we need to be careful how Sage defines conjugation (\(gxg^{-1}\) versus \(g^{-1}xg\)) and the difference between Sage and the text on the order of products. However, if you look at the definition of the center and centralizer subgroups you can see that any difference in ordering is irrelevant. Here are the group action commands for the particular action that is conjugation of the elements of the group.

Sage has a permutation group method `.center()` which returns the subgroup of fixed points. The permutation group method, `.centralizer(g)`, returns a subgroup that is the stabilizer of the group element `g`. Finally, the orbits are given by conjugacy classes, but Sage will not flood you with the full conjugacy classes and instead gives back a list of one element per conjugacy class, the representatives, via the permutation group method `.conjugacy_classes_representatives()`. You can manually reconstruct a conjugacy class from a representative, as we do in the example below.

Here is an example of the above commands in action. Notice that an abelian group would be a bad choice for this example.

Notice that in the one conjugacy class constructed all the elements have the same cycle structure, which is no accident. Notice too that `rep` and `a` are the same element, and the product of the order of the centralizer (\(4\)) and the size of the conjugacy class (\(4\)) equals the order of the group (\(16\)), which is a variant of the conclusion of Theorem 14.11.

Verify that the following is a demonstration of the class equation in the special case when the action is conjugation, but would be valid for any group, rather than just `D`.

### SubsectionGraph Automorphisms

As mentioned, group actions can be even more interesting when the set they act on is different from the group itself. One class of examples is the group of symmetries of a geometric solid, where the objects in the set are the vertices of the object, or perhaps some other aspect such as edges, faces or diagonals. In this case, the group is all those permutations that move the solid but leave it filling the same space before the motion (“rigid motions”).

In this section we will examine something very similar. A **graph** is a mathematical object, consisting of vertices and edges, but the only structure is whether or not any given pair of vertices are joined by an edge or not. The group consists of permutations of vertices that preserve the structure, that is, permutations of vertices that take edges to edges and non-edges to non-edges. It is very similar to a symmetry group, but there is no notion of any geometric relationships being preserved.

Here is an example. You will need to run the first compute cell to define the graph and get a nice graphic representation.

Your plot should look like the vertices and edges of a cube, but may not quite look regular, which is fine, since the geometry is not relevant. Vertices are labeled with strings of three binary digits, \(0\) or \(1\text{,}\) and any two vertices are connected by an edge if their strings differ in exactly one location. We might expect the group of symmetries to have order \(24\text{,}\) rather than order \(48\text{,}\) given its resemblance to a cube (in appearance and in name). However, when not restricted to rigid motions, we have new permutations that preserve edges. One in particular is to interchange two “opposite faces.” Locate two \(4\)-cycles opposite of each other, listed in the same order: \(000, 010, 110, 100\) and \(001, 011, 111, 101\text{.}\) Notice that each cycle looks very similar, but all the vertices of the first end in a zero and the second cycle has vertices ending in a one.

We can create explicitly the permutation that interchanges these two opposite faces, using a text version of the permutation in cycle notation.

We can use this group to illustrate the relevant Sage commands for group actions.

So this action has only one (big) orbit. This implies that every vertex is “like” any other. When a permutation group behaves this way, we say the group is **transitive**.

If every vertex is “the same” we can compute the stabilizer of any vertex, since they will all be isomorphic. Because vertex \(000\) is the simplest in some sense, we compute its stabilizer.

That `S` has \(6\) elements is no surprise, since the group has order \(48\) and the size of the lone orbit is \(8\text{.}\) But we can go one step further. The three vertices of the graph attached directly to \(000\) are \(100\text{,}\) \(010\text{,}\) \(001\text{.}\) Any automorphism of the graph that fixes \(000\) must then permute the three adjacent vertices. There are \(3!=6\) possible ways to do this, and you can check that each appears in one of the six elements of the stabilizer. So we can understand a transitive group by considering the smaller stabilizer, and in this case we can see that each element of the stabilizer is determined by how it permutes the neighbors of the stabilized vertex.

Transitive groups are both unusual and important. To contrast, here is a graph automorphism group that is far from transitive (without being trivial). A path is a graph that has all of its vertices in a line. Run the first compute cell to see a path on \(11\) vertices.

The automorphism group is the trivial identity automorphism (always) and an order \(2\) permutation that “flips” the path end-to-end. The group is far from transitive and there are many orbits.

Most of the stabilizers are trivial, with one exception. As subgroups of a group of order \(2\text{,}\) there really are not too many options.

How would this final example have been different if we had used a path on \(10\) vertices?

*NOTE*: There was once a small bug with stabilizers being created as subgroups of symmetric groups on fewer symbols than the correct number. This is fixed in Sage 4.8 and newer. Note the correct output below, and you can check your installation by running these commands. If you do not see the singleton `[4]` in your output, you should definitely update your copy of Sage.