# Disjoint Cycles Commuting

Tags:
1. Jun 19, 2014

### PsychonautQQ

1. The problem statement, all variables and given/known data
I'm taking an online class this summer and the notes gave the proposition that Disjoint Cycles Commute with the following proof.

Proof. Let σ and τ represent two disjoint cycles in Sn and choose some arbitrary
j ∈ {1,2, . . . , n}. Since σ and τ are disjoint, at most one of them ﬁxes j, so suppose τ
ﬁxes j. But then τ must also ﬁx σ.j since the cycles are disjoint. Hence στ.j = σ.k and
τσ.j = σ.j.

What does this proof mean when it says that it "fixes" j? what exactly does commute mean again? can anyone help me make sense of this?

2. Relevant equations

3. The attempt at a solution

2. Jun 19, 2014

### pasmith

$\sigma$ fixes $j$ if and only if $\sigma(j) =j$.

$\sigma$ and $\tau$ commute if and only if for all $j \in \{1, 2, \dots, n\}$, $\sigma(\tau(j)) = \tau(\sigma(j))$.

3. Jun 20, 2014

### bloby

At most or at least?

4. Jun 20, 2014

### PsychonautQQ

The notes say at most, but there have been errors before, i'll bring it up with him at our next meeting. Thanks guys :D