Math 2.0

definition

Cycle type

Definition

Let σ∈Sn\sigma \in S_n. Write σ\sigma as a product of disjoint cycles, and include a 11-cycle for each fixed point. The cycle type of σ\sigma is the multiset of the lengths of these cycles.

Remarks

The disjoint cycle decomposition is unique up to order, so the cycle type is well defined. The lengths add up to nn, so the cycle type is a partition of nn. For example, (1 2)(3 4 5)∈S6(1\ 2)(3\ 4\ 5) \in S_6 has cycle type (3,2,1)(3, 2, 1).

Explanations

L1 human

The cycle type forgets which points are in which cycle and keeps only the sizes of the cycles. Two permutations with the same cycle type have the same shape. In the symmetric group, the shape decides exactly when two permutations are conjugate.

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 definition
  4. Disjoint cycles commute statement
  5. Decomposition of a permutation into disjoint cycles statement
  6. Cycle type definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Permutation, Cycle type