Math 2.0

example

The symmetric group S3 is not abelian

Example

Let S3S_3 be the symmetric group on {1,2,3}\{1, 2, 3\}. Compose permutations from right to left. Take the transpositions (1 2)(1\,2) and (1 3)(1\,3). Then (1 2)(1 3)=(1 3 2)(1\,2)(1\,3) = (1\,3\,2) and (1 3)(1 2)=(1 2 3)(1\,3)(1\,2) = (1\,2\,3). These two products are different. Thus S3S_3 is not abelian.

Remarks

S3S_3 has 66 elements. It is the smallest group that is not abelian.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Cycle notation concept
  2. Group concept
  3. Symmetric group concept
  4. Symmetric group definition
  5. Transposition definition
  6. The symmetric group S3 is not abelian example

Sources

  1. Web https://en.wikipedia.org/wiki/Dihedral_group_of_order_6, lead section