1 | initial version |

The results of

```
sage: G = SymmetricGroup(3)
sage: G.list()
[(), (2,3), (1,2), (1,2,3), (1,3,2), (1,3)]
```

are given in cycle notation. If you want to match the bottom three elements of your transition matrix, you can simply convert each to a list, or maybe a dict would make the mapping more explicit:

```
sage: for g in G:
....: print g, g.list(), g.dict()
....:
() [1, 2, 3] {1: 1, 2: 2, 3: 3}
(2,3) [1, 3, 2] {1: 1, 2: 3, 3: 2}
(1,2) [2, 1, 3] {1: 2, 2: 1, 3: 3}
(1,2,3) [2, 3, 1] {1: 2, 2: 3, 3: 1}
(1,3,2) [3, 1, 2] {1: 3, 2: 1, 3: 2}
(1,3) [3, 2, 1] {1: 3, 2: 2, 3: 1}
```

2 | No.2 Revision |

The results of

```
sage: G = SymmetricGroup(3)
sage: G.list()
[(), (2,3), (1,2), (1,2,3), (1,3,2), (1,3)]
```

are given in cycle notation. If you want to match the bottom three elements of your ~~transition ~~matrix, you can simply convert each to a list, or maybe a dict would make the mapping more explicit:

```
sage: for g in G:
....: print g, g.list(), g.dict()
....:
() [1, 2, 3] {1: 1, 2: 2, 3: 3}
(2,3) [1, 3, 2] {1: 1, 2: 3, 3: 2}
(1,2) [2, 1, 3] {1: 2, 2: 1, 3: 3}
(1,2,3) [2, 3, 1] {1: 2, 2: 3, 3: 1}
(1,3,2) [3, 1, 2] {1: 3, 2: 1, 3: 2}
(1,3) [3, 2, 1] {1: 3, 2: 2, 3: 1}
```

3 | No.3 Revision |

The results of

```
sage: G = SymmetricGroup(3)
sage: G.list()
[(), (2,3), (1,2), (1,2,3), (1,3,2), (1,3)]
```

are given in cycle notation. So the book's equivalent of (1,3,2) is one where 1 becomes 3, 3 becomes 2, and 2 becomes 1, which is P6, if I'm reading correctly.

If you want to match the bottom three elements of your matrix, you can simply convert each to a list, or maybe a dict would make the mapping more explicit:

```
sage: for g in G:
....: print g, g.list(), g.dict()
....:
() [1, 2, 3] {1: 1, 2: 2, 3: 3}
(2,3) [1, 3, 2] {1: 1, 2: 3, 3: 2}
(1,2) [2, 1, 3] {1: 2, 2: 1, 3: 3}
(1,2,3) [2, 3, 1] {1: 2, 2: 3, 3: 1}
(1,3,2) [3, 1, 2] {1: 3, 2: 1, 3: 2}
(1,3) [3, 2, 1] {1: 3, 2: 2, 3: 1}
```

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.