---
tag: CP7NVGNN08
kind: proof
name: Proof that the alternating group is generated by three-cycles
msc: [20B30]
proves: 0KFZ0QX83G
uses: [0T13HM377F, 0RG9SPQSWM, 0V0E04DWX2, 0XK6FECMW5, 0SK90238BH, 0JEJJCB0EX, 0C9ZKYSPYR, 02DTRYKGE8, 0ZKPH2BD1T]
sources:
  - url: https://en.wikipedia.org/wiki/Alternating_group
    locator: Generators and relations
---

## Proof

We show two inclusions. Let $n \geq 3$, let $T$ be the set of $3$-cycles in $S_n$, and let $H = \langle T \rangle$ be the [[subgroup generated|0RG9SPQSWM]] by $T$. Products are composites of maps, and the right factor acts first.

1. By the [[sign of a cycle|0V0E04DWX2]], each $3$-cycle has sign $(-1)^{2} = 1$. So $T \subseteq A_n$, by the [[definition of the alternating group|0T13HM377F]].
2. The set $A_n$ is the kernel of the [[sign homomorphism|0JEJJCB0EX]], so it is a [[subgroup|0C9ZKYSPYR]] of $S_n$. Since $H$ is the smallest subgroup that contains $T$, step 1 gives $H \subseteq A_n$.
3. For the other inclusion, we first show that each product of two [[transpositions|02DTRYKGE8]] lies in $H$. Let $\alpha$ and $\beta$ be transpositions.
4. If $\alpha = \beta$, then $\alpha \beta = e$, and $e \in H$.
5. If $\alpha$ and $\beta$ move exactly one common point $a$, write $\alpha = (a\ b)$ and $\beta = (a\ c)$ with $a, b, c$ distinct. Then $\alpha\beta$ sends $a \mapsto c$, $c \mapsto b$ and $b \mapsto a$, and fixes the other points.
6. So in [[cycle notation|0ZKPH2BD1T]] $\alpha \beta = (a\ c\ b)$, which lies in $T \subseteq H$.
7. If $\alpha$ and $\beta$ move no common point, write $\alpha = (a\ b)$ and $\beta = (c\ d)$ with $a, b, c, d$ distinct. Let $\gamma = (a\ c\ b)(a\ c\ d)$.
8. Compute $\gamma$ point by point: $a \mapsto c \mapsto b$, $b \mapsto b \mapsto a$, $c \mapsto d \mapsto d$, $d \mapsto a \mapsto c$. Other points are fixed.
9. So $\gamma = (a\ b)(c\ d) = \alpha \beta$. It is a product of two elements of $T$, so it lies in $H$.
10. Steps 4 to 9 cover all cases, because two transpositions move two points each and share zero, one or two points. Sharing two points means $\alpha = \beta$.
11. Now let $\sigma \in A_n$. By the [[decomposition into transpositions|0XK6FECMW5]], $\sigma = \tau_1 \tau_2 \cdots \tau_m$ with transpositions $\tau_i$.
12. By the [[definition of the sign|0SK90238BH]], $(-1)^m = \operatorname{sgn}(\sigma) = 1$, so $m$ is even. Write $m = 2r$.
13. Then $\sigma = (\tau_1 \tau_2)(\tau_3 \tau_4) \cdots (\tau_{2r-1} \tau_{2r})$. Each bracket lies in $H$ by steps 4 to 10, and $H$ is closed under products. So $\sigma \in H$.
14. Thus $A_n \subseteq H$. With step 2, $A_n = H$, so $A_n$ is generated by the $3$-cycles.

## Idea

An even permutation is a product of an even number of transpositions, so it is a product of pairs of transpositions. Each pair is either trivial, a $3$-cycle, or a product of two $3$-cycles. So the $3$-cycles already produce every even permutation.