Math 2.0

statement proposition

Order of the symmetric group

Statement

Let nn be a positive integer. The symmetric group SnS_n has order n!n!.

Remarks

A permutation σ\sigma has nn choices for σ(1)\sigma(1), then n−1n - 1 choices for σ(2)\sigma(2), and so on, down to 11 choice for σ(n)\sigma(n). For example, ∣S3∣=6|S_3| = 6 and ∣S4∣=24|S_4| = 24.

Explanations

L1 human

To make a permutation, you choose where each symbol goes, one symbol after the other. Each choice removes one place from the next choices. So the number of permutations is n⋅(n−1)⋯1=n!n \cdot (n-1) \cdots 1 = n!.

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 4 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. Group concept
  2. Order of a group definition
  3. Symmetric group definition
  4. Order of the symmetric group statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

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