Math 2.0

Group theory and generalizations Proof

Proof that the alternating group is generated by three-cycles

Builds on Alternating groupSubgroup generated by a subsetSign of a cycleDecomposition of a permutation into transpositionsSign of a permutationSign is a homomorphismThe kernel is a normal subgroupTranspositionCycle notation

Proof

We show two inclusions. Let n≥3n \geq 3, let TT be the set of 33-cycles in SnS_n, and let H=⟨T⟩H = \langle T \rangle be the subgroup generated by TT. Products are composites of maps, and the right factor acts first.

  1. By the sign of a cycle, each 33-cycle has sign (−1)2=1(-1)^{2} = 1. So T⊆AnT \subseteq A_n, by the definition of the alternating group.
  2. The set AnA_n is the kernel of the sign homomorphism, so it is a subgroup of SnS_n. Since HH is the smallest subgroup that contains TT, step 1 gives H⊆AnH \subseteq A_n.
  3. For the other inclusion, we first show that each product of two transpositions lies in HH. Let α\alpha and β\beta be transpositions.
  4. If α=β\alpha = \beta, then αβ=e\alpha \beta = e, and e∈He \in H.
  5. If α\alpha and β\beta move exactly one common point aa, write α=(a b)\alpha = (a\ b) and β=(a c)\beta = (a\ c) with a,b,ca, b, c distinct. Then αβ\alpha\beta sends a↦ca \mapsto c, c↦bc \mapsto b and b↦ab \mapsto a, and fixes the other points.
  6. So in cycle notation αβ=(a c b)\alpha \beta = (a\ c\ b), which lies in T⊆HT \subseteq H.
  7. If α\alpha and β\beta move no common point, write α=(a b)\alpha = (a\ b) and β=(c d)\beta = (c\ d) with a,b,c,da, b, c, d distinct. Let γ=(a c b)(a c d)\gamma = (a\ c\ b)(a\ c\ d).
  8. Compute γ\gamma point by point: a↦c↦ba \mapsto c \mapsto b, b↦b↦ab \mapsto b \mapsto a, c↦d↦dc \mapsto d \mapsto d, d↦a↦cd \mapsto a \mapsto c. Other points are fixed.
  9. So γ=(a b)(c d)=αβ\gamma = (a\ b)(c\ d) = \alpha \beta. It is a product of two elements of TT, so it lies in HH.
  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 σ∈An\sigma \in A_n. By the decomposition into transpositions, σ=τ1τ2⋯τm\sigma = \tau_1 \tau_2 \cdots \tau_m with transpositions τi\tau_i.
  12. By the definition of the sign, (−1)m=sgn⁡(σ)=1(-1)^m = \operatorname{sgn}(\sigma) = 1, so mm is even. Write m=2rm = 2r.
  13. Then σ=(τ1τ2)(τ3τ4)⋯(τ2r−1τ2r)\sigma = (\tau_1 \tau_2)(\tau_3 \tau_4) \cdots (\tau_{2r-1} \tau_{2r}). Each bracket lies in HH by steps 4 to 10, and HH is closed under products. So σ∈H\sigma \in H.
  14. Thus An⊆HA_n \subseteq H. With step 2, An=HA_n = H, so AnA_n is generated by the 33-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 33-cycle, or a product of two 33-cycles. So the 33-cycles already produce every even permutation.

Reading path

To understand this page from the ground up, read these 93 pages in order. The foundations come first. The path takes the proofs Proof of the decomposition of a permutation into transpositions, Proof of the commutativity of addition by induction, Proof that equivalence classes form a partition, Proof that disjoint cycles commute, Proof that the kernel is a normal subgroup, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof that an intersection of subgroups is a subgroup, Proof that the sign is a homomorphism, Proof of the decomposition of a permutation into disjoint cycles, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the sign of a cycle, Proof of the uniqueness of inverses, Proof that homomorphisms preserve identity and inverses, Proof of the subgroup criterion, Proof of the cancellation laws.

  1. Binary operation definition
  2. Cycle notation concept
  3. Definition by recursion concept
  4. Divisibility definition
  5. Element definition
  6. Group concept
  7. Mathematical induction concept
  8. Natural numbers object
  9. Peano axioms concept
  10. Proposition concept
  11. Identity element definition
  12. Set definition
  13. Conjugate elements definition
  14. Group homomorphism definition
  15. Subgroup definition
  16. Symmetric group definition
  17. Successor function definition
  18. Conjunction definition
  19. Disjunction definition
  20. Implication definition
  21. Predicate definition
  22. Inverse element definition
  23. Empty set object
  24. Family of sets definition
  25. Ordered pair definition
  26. Conjugate subgroup definition
  27. Kernel of a homomorphism definition
  28. Transposition definition
  29. Intersection definition
  30. Union definition
  31. Proof that an intersection of subgroups is a subgroup proof
  32. Addition of natural numbers definition
  33. Set-builder notation concept
  34. The successor function is injective statement
  35. Zero is not a successor statement
  36. Biconditional definition
  37. Existential quantifier definition
  38. Universal quantifier definition
  39. Proof of the cancellation laws proof
  40. Proof of the uniqueness of inverses proof
  41. Cartesian product definition
  42. Disjoint sets definition
  43. Normal subgroup definition
  44. Proof of the commutativity of addition by induction proof
  45. Subset definition
  46. Union of a family of sets definition
  47. Order on the natural numbers definition
  48. Axiom of extensionality statement
  49. Uniqueness quantifier definition
  50. Uniqueness of inverses statement
  51. Cancellation laws statement
  52. Binary relation definition
  53. Partition of a set definition
  54. Commutativity of addition statement
  55. Proof of strong induction from ordinary induction proof
  56. Proof that homomorphisms preserve identity and inverses proof
  57. Reflexive relation definition
  58. Symmetric relation definition
  59. Transitive relation definition
  60. Proof of the laws of exponents in a group proof
  61. Proof of the subgroup criterion proof
  62. Function definition
  63. Strong induction statement
  64. Homomorphisms preserve identity and inverses statement
  65. Equivalence relation definition
  66. Laws of exponents in a group statement
  67. Subgroup criterion statement
  68. Injective function definition
  69. Proof of the well-ordering principle from strong induction proof
  70. Proof that the kernel is a normal subgroup proof
  71. Proof that disjoint cycles commute proof
  72. Intersection of subgroups is a subgroup statement
  73. Equivalence class definition
  74. Well-ordering principle statement
  75. The kernel is a normal subgroup statement
  76. Disjoint cycles commute statement
  77. Subgroup generated by a subset definition
  78. Proof that equivalence classes form a partition proof
  79. Proof of the division algorithm proof
  80. Equivalence classes form a partition statement
  81. Division algorithm statement
  82. Proof of the decomposition of a permutation into disjoint cycles proof
  83. Decomposition of a permutation into disjoint cycles statement
  84. Proof of the decomposition of a permutation into transpositions proof
  85. Decomposition of a permutation into transpositions statement
  86. Sign of a permutation definition
  87. Even and odd permutations definition
  88. Proof that the sign is a homomorphism proof
  89. Proof of the sign of a cycle proof
  90. Sign of a cycle statement
  91. Sign is a homomorphism statement
  92. Alternating group definition
  93. Proof that the alternating group is generated by three-cycles proof

Where this leads

8 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Alternating_group, Generators and relations
About this page
TagCP7NVGNN08
URIm2://CP7NVGNN08
Kindproof
WritingW0 stub
MSC20B30
ProvesThe alternating group is generated by three-cycles
UsesAlternating group, Subgroup generated by a subset, Sign of a cycle, Decomposition of a permutation into transpositions, Sign of a permutation, Sign is a homomorphism, The kernel is a normal subgroup, Transposition, Cycle notation
Changed4 November 2026

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

No page links to this page yet.