Math 2.0

statement proposition

Disjoint cycles commute

Statement

Let σ\sigma and τ\tau be cycles in the symmetric group Sym⁡(X)\operatorname{Sym}(X) whose sets of moved points are disjoint. Then στ=τσ\sigma \tau = \tau \sigma.

Remarks

A point moved by σ\sigma is fixed by τ\tau, and σ\sigma maps it to another point that τ\tau fixes. So both products send it to the same point. The same argument works for the points moved by τ\tau, and the points fixed by both are fixed by both products. Cycles that are not disjoint need not commute, for example (1 2)(1 3)≠(1 3)(1 2)(1\ 2)(1\ 3) \neq (1\ 3)(1\ 2).

Explanations

L1 human

Two disjoint cycles move different points. Each cycle does its work without touching the points of the other cycle. So the order in which you do them does not matter.

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. Cycle notation concept
  2. Group concept
  3. Symmetric group definition
  4. Disjoint cycles commute statement

What depends on this

17 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Cyclic_permutation, Basic properties