Every permutation σ of a set has an inverse permutation σ⁻¹. The inverse satisfies σ ∘ σ⁻¹ = σ⁻¹ ∘ σ = e, where e is the identity permutation. To find the inverse, reverse every mapping: if σ(a) = b, then σ⁻¹(b) = a. For a cycle, the inverse is obtained by reversing the direction of the cycle.
Inverse of a Permutation
The inverse of a permutation reverses its mapping and restores every element to its original position.
σ ∘ σ⁻¹ = σ⁻¹ ∘ σ = e
Explanation
Example or application
A worked example has not yet been added.
Key Properties
Every permutation is invertible.
The inverse is unique.
The inverse reverses each mapping.
The inverse of a cycle reverses its direction.
The inverse of a transposition is the transposition itself.
(σ ∘ τ)⁻¹ = τ⁻¹ ∘ σ⁻¹.
Examples
| Permutation | Inverse | Explanation |
|---|---|---|
σ = (1 2 3) | σ⁻¹ = (1 3 2) | The inverse reverses the direction of the 3-cycle. |
σ = (1 2)(3 4) | σ⁻¹ = (1 2)(3 4) | Each transposition is its own inverse, and the two disjoint transpositions commute. |
Common Mistakes
Reversing the order of a product incorrectly.
Assuming every permutation is its own inverse.
Confusing inverse with a negative number or subtraction.
Related Concepts
Permutation
Composition of Permutations
Cycle Notation
Transpositions
Learning Outcomes
Find the inverse of a permutation.
Reverse mappings correctly.
Calculate inverses of cycles and products.
Learning Guide
Core Idea
The inverse of a permutation reverses its mapping and restores every element to its original position.
Worked Example
Permutation: σ = (1 2 3)
Inverse: σ⁻¹ = (1 3 2)
Explanation: The inverse reverses the direction of the 3-cycle.
Permutation: σ = (1 2)(3 4)
Inverse: σ⁻¹ = (1 2)(3 4)
Explanation: Each transposition is its own inverse, and the two disjoint transpositions commute.
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 inverse of a permutation? | The inverse of a permutation reverses its mapping and restores every element to its original position. |
What definition, condition, or property should you check first when solving a problem about inverse of a permutation? | Start by checking the relevant defining properties: Every permutation is invertible; The inverse is unique; The inverse reverses each mapping; The inverse of a cycle reverses its direction. Verify every required hypothesis before applying a theorem. |
How is inverse of a permutation connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Permutation, Composition of Permutations, Cycle Notation, Transpositions. |
Mastery Checklist
I can state the definition of inverse 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 definitions and results; no specific external reference has been independently verified.