The order of a permutation σ is the smallest positive integer m such that σᵐ = e. When a permutation is expressed as a product of disjoint cycles, its order is the least common multiple of the lengths of those cycles. This works because disjoint cycles act independently, and each cycle returns to the identity after a number of applications equal to its length.
The Order of a Permutation
The order of a permutation is the smallest positive number of times it must be composed with itself to produce the identity permutation.
ord(σ) = lcm(k₁, k₂, ..., kᵣ)
Explanation
Example or application
A worked example has not yet been added.
Key Properties
The identity permutation has order 1.
A k-cycle has order k.
Disjoint cycles have order equal to the least common multiple of their lengths.
The order of a permutation divides the order of its finite group.
Fixed elements do not affect the least common multiple.
Examples
| Permutation | Cycle Lengths | Order | Explanation |
|---|---|---|---|
(1 2 3) |
| 3 | A 3-cycle returns to the identity after three applications. |
(1 2 3)(4 5) |
| 6 | The least common multiple of 3 and 2 is 6. |
(1 2)(3 4 5 6) |
| 4 | The least common multiple of 2 and 4 is 4. |
Common Mistakes
Adding the lengths of disjoint cycles instead of taking their least common multiple.
Multiplying cycle lengths in every case.
Including fixed points as if they changed the least common multiple.
Related Concepts
Cycle Notation
Disjoint Cycles
Order of a Group Element
Least Common Multiple
Learning Outcomes
Determine the order of a permutation.
Decompose a permutation into disjoint cycles.
Calculate the least common multiple of cycle lengths.
Learning Guide
Core Idea
The order of a permutation is the smallest positive number of times it must be composed with itself to produce the identity permutation.
Worked Example
Permutation: (1 2 3)
Cyclelengths: 3
Order: 3
Explanation: A 3-cycle returns to the identity after three applications.
Permutation: (1 2 3)(4 5)
Cyclelengths: 3, 2
Order: 6
Explanation: The least common multiple of 3 and 2 is 6.
How To Study
Write the formal definition and identify every object, operation, and hypothesis.
Work through the supplied example one step at a time; explain why each step is valid.
Check the listed properties and compare the example with at least one common mistake.
Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.
Self Check
| Question | Answer |
|---|---|
In your own words, what is the order of a permutation? | The order of a permutation is the smallest positive number of times it must be composed with itself to produce the identity permutation. |
What definition, condition, or property should you check first when solving a problem about the order of a permutation? | Start by checking the relevant defining properties: The identity permutation has order 1; A k-cycle has order k; Disjoint cycles have order equal to the least common multiple of their lengths; The order of a permutation divides the order of its finite group. Verify every required hypothesis before applying a theorem. |
How is the order of a permutation connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Cycle Notation, Disjoint Cycles, Order of a Group Element, Least Common Multiple. |
Mastery Checklist
I can state the definition of the order of a permutation accurately.
I can identify the assumptions and notation used in a problem.
I can explain at least one example and justify each important step.
I can recognize a common mistake and explain why it is incorrect.
Applications
Provides a foundational tool for later topics in permutation groups.
Supports precise mathematical reasoning, proof construction and the comparison of algebraic structures.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Standard abstract-algebra results on permutation orders; no specific external reference has been independently verified.