## Section 3.4 Sage

Many of the groups discussed in this chapter are available for study in Sage. It is important to understand that sets that form algebraic objects (groups in this chapter) are called “parents” in Sage, and elements of these objects are called, well, “elements.” So every element belongs to a parent (in other words, is contained in some set). We can ask about properties of parents (finite? order? abelian?), and we can ask about properties of individual elements (identity? inverse?). In the following we will show you how to create some of these common groups and begin to explore their properties with Sage.

### Subsection 3.4.1 Integers mod n

We would like to work with elements of `Z8`

. If you were to type a `6`

into a compute cell right now, what would you mean? The integer \(6\text{,}\) the rational number \(\frac{6}{1}\text{,}\) the real number \(6.00000\text{,}\) or the complex number \(6.00000+0.00000i\text{?}\) Or perhaps you really do want the integer \(6\) mod \(8\text{?}\) Sage really has no idea what you mean or want. To make this clear, you can “coerce” `6`

into `Z8`

with the syntax `Z8(6)`

. Without this, Sage will treat a input number like `6`

as an integer, the simplest possible interpretation in some sense. Study the following carefully, where we first work with “normal” integers and then with integers mod 8.

`Z8`

is a bit unusual as a first example, since it has two operations defined, both addition and multiplication, with addition forming a group, and multiplication not forming a group. Still, we can work with the additive portion, here forming the Cayley table for the addition.

When \(n\) is a prime number, the multipicative structure (excluding zero), will also form a group.

The integers mod \(n\) are very important, so Sage implements both addition and multiplication together. Groups of symmetries are a better example of how Sage implements groups, since there is just one operation present.

### Subsection 3.4.2 Groups of symmetries

The symmetries of some geometric shapes are already defined in Sage, albeit with different names. They are implemented as “permutation groups” which we will begin to study carefully in Chapter 5.

Sage uses integers to label vertices, starting the count at `1`

, instead of letters. Elements by default are printed using “cycle notation” which we will see described carefully in Chapter 5. Here is an example, with both the mathematics and Sage. For the Sage part, we create the group of symmetries and then create the symmetry \(\rho_2\) with coercion, followed by outputting the element in cycle notation. Then we create just the *bottom row* of the notation we are using for permutations.

The final list comprehension deserves comment. The `.domain()`

method gives a lait of the symbols used for the permutation group `triangle`

and then `rho2`

is employed with syntax like it is a function (it *is* a function) to create the images that would occupy the bottom row.

With a double list comprehension we can list all six elements of the group in the “bottom row” format. A good exercise would be to pair up each element with its name as given in Figure 3.1.6.

Different books, different authors, different software all have different ideas about the order in which to write multiplication of functions. This textbook builds on the idea of composition of functions, so that \(fg\) is the composition \((fg)(x)=f(g(x))\) and it is natural to apply \(g\) first. Sage takes the opposite view and since we write \(fg\text{,}\) Sage will understand that we want to do \(f\) first. Neither approach is wrong, and neither is necessarily superior, they are just different and there are good arguments for either one. When you consult other books that work with permutation groups, you want to first determine which approach it takes.

The translation here between the text and Sage will be worthwhile practice. Here we will reprise the discussion at the end of Section 3.1, but reverse the order on each product to compute Sage-style and exactly mirror what the text does.

Now that we understand that Sage does multiplication in reverse, we can compute the Cayley table for this group. Default behavior is to just name elements of a group as letters, `a, b, c`

, \dots{} in the same order that the `.list()`

command would produce the elements of the group. But you can also print the elements in the table as themselves (that uses cycle notation here), or you can give the elements names. We will use `u`

as shorthand for \(\mu\) and `r`

as shorthand for \(\rho\text{.}\)

You should verify that the table above is correct, just like Table 3.2 is correct. Remember that the convention is to multiply a row label times a column label, in that order. However, to do a check across the two tables, you will need to recall the difference in ordering between your textbook and Sage.

### Subsection 3.4.3 Quaternions

Sage implements the quaternions, but the elements are not matrices, but rather are permutations. Despite appearances the structure is identical. It should not matter which version you have in mind (matrices or permutations) if you build the Cayley table and use the default behavior of using letters to name the elements. As permutations, or as letters, can you identify \(-1\text{,}\) \(I\text{,}\) \(J\) and \(K\text{?}\)

It should be fairly obvious that `a`

is the identity element of the group (\(1\)), either from its behavior in the table, or from its “bottom row” representation in the list above. And if you prefer, you can ask Sage.

Now \(-1\) should have the property that \(-1\cdot -1= 1\text{.}\) We see that the identity element `a`

is on the diagonal of the Cayley table only when we compute `c*c`

. We can verify this easily, borrowing the third “bottom row” element from the list above. With this information, once we locate \(I\text{,}\) we can easily compute \(-I\text{,}\) and so on.

See if you can pair up the letters with all eight elements of the quaternions. Be a bit careful with your names, the symbol `I`

is used by Sage for the imaginary number \(i\) (which we will use below), but Sage will silently let you redefine it to be anything you like. Same goes for lower-case `i`

. So call your elements of the quaternions something like `QI, QJ, QK`

to avoid confusion.

As we begin to work with groups it is instructive to work with the actual elements. But many properties of groups are totally independent of the order we use for multiplication, or the names or representations we use for the elements. Here are facts about the quaternions we can compute without any knowledge of just how the elements are written or multiplied.

### Subsection 3.4.4 Subgroups

The best techniques for creating subgroups will come in future chapters, but we can create some groups that are naturally subgroups of other groups.

Elements of the quaternions were represented by certain permutations of the integers 1 through 8. We can also build the group of *all* permutations of these eight integers. It gets pretty big, so do not list it unless you want a lot of output! (I dare you.)

As a demonstration of reusing chunks of Sage code, we duplicate the previous example. But in each case the code lives in an external file, just once. So if you wanted to use setup code in more than one division, you could put it in a file and incorporate it similarly. Here we do not test the second instance, and so do not include expected output either. Typically, you would do this copy somewhere further away.

The quaternions, `Q`

, is a subgroup of the full group of all permutations, the symmetric group \(S_8\) or `S8`

, and Sage regards this as a property of `Q`

.

In Sage the complex numbers are known by the name `CC`

. We can create a list of the elements in the subgroup described in Example 3.2.9. Then we can verify that this set is a subgroup by examining the Cayley table, using multiplication as the operation.