Math 2.0

Group theory and generalizations Proposition

Disjoint cycles commute

Builds on Cycle notationSymmetric group

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).

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cycle notation concept
  2. Group concept
  3. Symmetric group definition
  4. Disjoint cycles commute statement

Where this leads

21 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cyclic_permutation, Basic properties
About this page
Tag07E6D8R4D6
URIm2://07E6D8R4D6
Kindstatement, proposition
WritingW0 stub
MSC20B30
StatusThis copy of the site has no build data. Run m2 status 07E6D8R4D6.
UsesCycle notation, Symmetric group

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by