Cycle notation is a compact way to represent permutations. A cycle (a₁ a₂ ... aₖ) sends a₁ to a₂, a₂ to a₃, and continues until aₖ is sent back to a₁. Elements not appearing in the cycle remain fixed. A cycle of length k is called a k-cycle. Every permutation of a finite set can be expressed as a product of disjoint cycles.
Cycle Notation
Cycle notation describes a permutation by showing how elements move from one position to another in a repeating sequence.
Explanation
Example or application
A worked example has not yet been added.
Definition
(a₁ a₂ ... aₖ): a₁ → a₂ → ... → aₖ → a₁
Key Properties
A k-cycle moves k elements cyclically.
Elements outside a cycle remain fixed.
A 1-cycle represents a fixed element and is usually omitted.
Every finite permutation can be decomposed into disjoint cycles.
A cycle of length k has order k.
Examples
| Permutation | Mapping | Fixed Elements | Explanation |
|---|---|---|---|
(1 2 3) |
|
| The cycle moves 1, 2, and 3 while leaving 4 and 5 fixed. |
(1 4 2) |
| Following the cycle returns to the starting element after three applications. |
Common Mistakes
Reading a cycle as a list of elements without understanding the mapping.
Assuming elements not written in a cycle are undefined.
Confusing a cycle's length with the number of elements in the entire permutation set.
Related Concepts
Permutation
Disjoint Cycles
Cycle Length
Order of a Permutation
Learning Outcomes
Read and interpret cycle notation.
Translate cycles into mappings.
Identify fixed elements and cycle lengths.
Learning Guide
Core Idea
Cycle notation describes a permutation by showing how elements move from one position to another in a repeating sequence.
Worked Example
Permutation: (1 2 3)
Mapping: 1 → 2, 2 → 3, 3 → 1
Fixedelements: 4, 5
Explanation: The cycle moves 1, 2, and 3 while leaving 4 and 5 fixed.
Permutation: (1 4 2)
Mapping: 1 → 4, 4 → 2, 2 → 1
Explanation: Following the cycle returns to the starting element after three applications.
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 cycle notation? | Cycle notation describes a permutation by showing how elements move from one position to another in a repeating sequence. |
What definition, condition, or property should you check first when solving a problem about cycle notation? | Start by checking the relevant defining properties: A k-cycle moves k elements cyclically; Elements outside a cycle remain fixed; A 1-cycle represents a fixed element and is usually omitted; Every finite permutation can be decomposed into disjoint cycles. Verify every required hypothesis before applying a theorem. |
How is cycle notation connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Permutation, Disjoint Cycles, Cycle Length, Order of a Permutation. |
Mastery Checklist
I can state the definition of cycle notation 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 definitions and examples; no specific external reference has been independently verified.