The composition of two permutations σ and τ is the function σ ∘ τ defined by (σ ∘ τ)(x) = σ(τ(x)). This means τ is applied first and σ second. Composition is associative, and the identity permutation acts as an identity element. Composition is generally not commutative, so σ ∘ τ may differ from τ ∘ σ. The symmetric group uses composition as its group operation.
Composition of Permutations
Composition combines permutations by applying one permutation after another, producing a new permutation.
(σ ∘ τ)(x) = σ(τ(x))
Explanation
Example or application
A worked example has not yet been added.
Key Properties
The composition of two permutations is a permutation.
Composition is associative.
The identity permutation leaves every element unchanged.
Every permutation has an inverse under composition.
Composition is generally noncommutative.
The rightmost permutation is applied first under standard function-composition notation.
Examples
| Permutations | Composition | Explanation |
|---|---|---|
| σ ∘ τ = (1 2 3) | Apply τ first and then σ to each element. |
| τ ∘ σ = (1 3 2) | Reversing the order produces a different permutation. |
Common Mistakes
Applying the leftmost permutation first under standard function-composition notation.
Assuming composition is commutative.
Confusing composition with multiplying individual symbols.
Related Concepts
Permutation
Symmetric Group
Cycle Notation
Inverse of a Permutation
Learning Outcomes
Calculate compositions of permutations.
Apply permutations in the correct order.
Recognize noncommutativity in permutation groups.
Learning Guide
Core Idea
Composition combines permutations by applying one permutation after another, producing a new permutation.
Worked Example
Permutations: σ = (1 2), τ = (2 3)
Composition: σ ∘ τ = (1 2 3)
Explanation: Apply τ first and then σ to each element.
Permutations: σ = (1 2), τ = (2 3)
Composition: τ ∘ σ = (1 3 2)
Explanation: Reversing the order produces a different permutation.
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 composition of permutations? | Composition combines permutations by applying one permutation after another, producing a new permutation. |
What definition, condition, or property should you check first when solving a problem about composition of permutations? | Start by checking the relevant defining properties: The composition of two permutations is a permutation; Composition is associative; The identity permutation leaves every element unchanged; Every permutation has an inverse under composition. Verify every required hypothesis before applying a theorem. |
How is composition of permutations connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Permutation, Symmetric Group, Cycle Notation, Inverse of a Permutation. |
Mastery Checklist
I can state the definition of composition of permutations 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.