Executive summary
Permutations are transformations of a finite set and therefore form groups under composition. They are the language used later to record how branches of a multi-valued function are rearranged by continuation. The source builds permutation theory from cycle decomposition, then introduces transpositions and parity. Every permutation splits into independent cycles and every cycle can be built from transpositions. Parity divides permutations into even and odd classes; the even permutations form a normal subgroup of index two. For five symbols, that even subgroup is non-commutative and has no non-trivial proper normal subgroup, so it is not soluble. The full permutation group on five or more symbols is therefore not soluble.
What this handbook page teaches
- Write permutations in cycle notation and decompose them into independent cycles.
- Express cycles as products of transpositions.
- Determine permutation parity and use its multiplication rules.
- Understand the even-permutation subgroup and its normality.
- Follow the structural proof that the five-symbol permutation group is non-soluble.
Core concepts
The recurring method is to replace the physical meaning of the objects by the rules governing how they combine.
Cycles and decomposition
A permutation can fix some elements and move others in cyclic chains. A cycle (a b c) sends a→b, b→c, c→a and fixes all unlisted elements. Cycles acting on disjoint sets commute. Every permutation has a decomposition into disjoint cycles, unique apart from the order in which the independent cycles are written.
This decomposition exposes element order: the order of a permutation is the least common multiple of the lengths of its independent cycles. It also makes branch permutations easy to read because a local branch point often creates a two-cycle exchanging exactly two sheets.
Transpositions and parity
A transposition is a two-cycle. Every cycle can be written as a product of transpositions, so every permutation can. Although the transposition decomposition is not unique, the parity of the number of transpositions is invariant. A permutation is therefore classified as even or odd.
Even times even and odd times odd are even; products of opposite parity are odd. Inverses preserve parity. Consequently all even permutations form a subgroup, and because parity is unchanged by conjugation this subgroup is normal in the full permutation group.
Why five symbols matter
On five symbols, the even-permutation subgroup has sixty elements. The source classifies non-identity even permutations by cycle type and shows that a normal subgroup containing one element of a given relevant type must contain the whole conjugacy class of that type. Counting possibilities then rules out every non-trivial proper normal subgroup.
Because this sixty-element group is non-commutative and has no proper non-trivial normal subgroup, its derived subgroup cannot shrink: it must be the whole group. It is therefore non-soluble. Since the full five-symbol permutation group contains this subgroup, the full group is also non-soluble. Larger symmetric groups contain a copy of the five-symbol group and are non-soluble as well.
Working method
Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.
- Write the permutation as independent cycles by following each unvisited element until it returns to its start.
- Compute the order using the least common multiple of cycle lengths.
- Convert each cycle of length
mintom−1transpositions to determine parity. - Use parity to identify the even subgroup and the two parity cosets of the full symmetric group.
- For normal-subgroup arguments, group elements by conjugacy-invariant cycle type and count the sizes of the possible classes.
- To prove non-solubility, combine non-commutativity with the absence of proper non-trivial normal subgroups, then use subgroup permanence to extend the result to the full permutation group.
Generating a five-symbol permutation group from pair exchanges
Suppose continuation around four exceptional parameter values produces transpositions that connect the five labels in a chain, for example exchanges corresponding structurally to (1 2), (2 3), (3 4) and (4 5). These elementary adjacent transpositions generate every permutation of the five symbols.
To see the mechanism, any transposition (i j) can be created from adjacent exchanges by moving one symbol along the chain and then reversing the intermediate moves. Since any permutation is a product of transpositions, the generated group is the full symmetric group.
This is the exact kind of generation statement needed in the quintic proof. It is not enough that loops produce 'many' permutations. One must show their generators reach the full non-soluble group, because the contradiction with radical solubility depends on that precise structural conclusion.
Technical reasoning and deeper connections
Permutation composition order must be handled consistently. The source uses the convention that the right-hand permutation acts first. Cycle calculations should follow the same convention throughout; otherwise a correct set of generators can yield incorrect products.
Parity can also be understood through inversions in the two-line representation. Exchanging two entries changes inversion parity, so each transposition flips parity. This gives another route to the same invariant and demonstrates that parity does not depend on a chosen transposition decomposition.
The even subgroup's index is two, so it is automatically normal. Normality alone does not imply solubility; in the five-symbol case, the even subgroup itself is the non-soluble obstruction. This illustrates why the derived-series analysis is needed beyond basic quotient construction.
For degrees below five, the full permutation groups appearing in generic root problems are soluble. This aligns with the existence of radical formulae for generic equations of degrees up to four. At five, the non-soluble even subgroup appears and changes the structural landscape.
Quick-reference matrix
| Permutation feature | How to compute it | Why it matters |
|---|---|---|
| Cycle decomposition | Trace each element until it returns | Gives compact structure and order. |
| Order | LCM of independent cycle lengths | Preserved by isomorphism. |
| Parity | Parity of any transposition decomposition | Defines a normal index-two subgroup. |
| Conjugacy type | Cycle lengths up to relabelling | Controls normal-subgroup class arguments. |
| Generated subgroup | Products of given generators | Identifies monodromy from branch loops. |
Common mistakes
- Treating cycle notation as commutative when cycles are not disjoint.
- Multiplying permutations in inconsistent directions.
- Counting transpositions in one decomposition without explaining why parity is invariant.
- Assuming all even permutations commute.
- Concluding a group is non-soluble merely because it is non-commutative.
- Claiming loop permutations generate the full symmetric group without proving a generating set.
Verification checklist
Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.
- Every permutation is decomposed into disjoint cycles correctly.
- Permutation order agrees with cycle lengths.
- Parity computations are invariant under the chosen decomposition.
- Normality of the even subgroup is justified.
- Non-solubility uses normal-subgroup structure and derived-series logic.
- Generation claims identify a known generating set or explicitly produce arbitrary transpositions.
Frequently asked questions
Are all transpositions odd?
Yes. A transposition is itself a product of one transposition, so its parity is odd.
Can an even permutation be a single cycle?
Yes, when the cycle length is odd. A cycle of length m has parity equal to the parity of m−1.
Why are cycle types useful for normal subgroups?
Conjugation relabels the symbols but preserves cycle lengths, so a normal subgroup containing one permutation must contain its entire conjugacy class.
Why does the five-symbol group appear in polynomial theory?
A generic degree-five root function has five branches, and suitable loops can permute them arbitrarily, producing the full group on five symbols.
Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 1.15. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.