---
tag: 07E6D8R4D6
kind: statement
role: proposition
name: Disjoint cycles commute
msc: [20B30]
uses: [0ZKPH2BD1T, 0RJMNEN3BJ]
sources:
  - url: https://en.wikipedia.org/wiki/Cyclic_permutation
    locator: Basic properties
---

## Statement

Let $\sigma$ and $\tau$ be cycles in the [[symmetric group|0515A6D2Y1]] $\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) \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.