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 , let be the set of -cycles in , and let be the subgroup generated by . Products are composites of maps, and the right factor acts first.
- By the sign of a cycle, each -cycle has sign . So , by the definition of the alternating group.
- The set is the kernel of the sign homomorphism, so it is a subgroup of . Since is the smallest subgroup that contains , step 1 gives .
- For the other inclusion, we first show that each product of two transpositions lies in . Let and be transpositions.
- If , then , and .
- If and move exactly one common point , write and with distinct. Then sends , and , and fixes the other points.
- So in cycle notation , which lies in .
- If and move no common point, write and with distinct. Let .
- Compute point by point: , , , . Other points are fixed.
- So . It is a product of two elements of , so it lies in .
- 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 .
- Now let . By the decomposition into transpositions, with transpositions .
- By the definition of the sign, , so is even. Write .
- Then . Each bracket lies in by steps 4 to 10, and is closed under products. So .
- Thus . With step 2, , so is generated by the -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 -cycle, or a product of two -cycles. So the -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.
- Binary operation definition
- Cycle notation concept
- Definition by recursion concept
- Divisibility definition
- Element definition
- Group concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proposition concept
- Identity element definition
- Set definition
- Conjugate elements definition
- Group homomorphism definition
- Subgroup definition
- Symmetric group definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Inverse element definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Conjugate subgroup definition
- Kernel of a homomorphism definition
- Transposition definition
- Intersection definition
- Union definition
- Proof that an intersection of subgroups is a subgroup proof
- Addition of natural numbers definition
- Set-builder notation concept
- The successor function is injective statement
- Zero is not a successor statement
- Biconditional definition
- Existential quantifier definition
- Universal quantifier definition
- Proof of the cancellation laws proof
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Disjoint sets definition
- Normal subgroup definition
- Proof of the commutativity of addition by induction proof
- Subset definition
- Union of a family of sets definition
- Order on the natural numbers definition
- Axiom of extensionality statement
- Uniqueness quantifier definition
- Uniqueness of inverses statement
- Cancellation laws statement
- Binary relation definition
- Partition of a set definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Proof that homomorphisms preserve identity and inverses proof
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Proof of the laws of exponents in a group proof
- Proof of the subgroup criterion proof
- Function definition
- Strong induction statement
- Homomorphisms preserve identity and inverses statement
- Equivalence relation definition
- Laws of exponents in a group statement
- Subgroup criterion statement
- Injective function definition
- Proof of the well-ordering principle from strong induction proof
- Proof that the kernel is a normal subgroup proof
- Proof that disjoint cycles commute proof
- Intersection of subgroups is a subgroup statement
- Equivalence class definition
- Well-ordering principle statement
- The kernel is a normal subgroup statement
- Disjoint cycles commute statement
- Subgroup generated by a subset definition
- Proof that equivalence classes form a partition proof
- Proof of the division algorithm proof
- Equivalence classes form a partition statement
- Division algorithm statement
- Proof of the decomposition of a permutation into disjoint cycles proof
- Decomposition of a permutation into disjoint cycles statement
- Proof of the decomposition of a permutation into transpositions proof
- Decomposition of a permutation into transpositions statement
- Sign of a permutation definition
- Even and odd permutations definition
- Proof that the sign is a homomorphism proof
- Proof of the sign of a cycle proof
- Sign of a cycle statement
- Sign is a homomorphism statement
- Alternating group definition
- Proof that the alternating group is generated by three-cycles proof
Where this leads
8 pages build on this one.
- Simplicity of the alternating group
- The alternating group A5 is simple
- The symmetric group on five or more letters is not solvable
- The alternating group is generated by three-cycles
- Abel–Ruffini theorem
- Proof of the simplicity of the alternating group by three-cycles
- Quintic equation
- Proof that the symmetric group on five or more letters is not solvable
Further reading
- Web https://en.wikipedia.org/wiki/Alternating_group, Generators and relations
About this page
| Tag | CP7NVGNN08 |
|---|---|
| URI | m2://CP7NVGNN08 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 20B30 |
| Proves | The alternating group is generated by three-cycles |
| Uses | Alternating 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 |
| Changed | 4 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.