A transposition is a cycle of length two, written (a b). It swaps a and b while leaving every other element unchanged. Every permutation of a finite set can be expressed as a product of transpositions. A transposition is its own inverse and has order two. The number of transpositions in a decomposition is not necessarily unique, but its parity is always the same.
Transpositions
A transposition is a permutation that exchanges exactly two elements and leaves all other elements fixed.
(a b)² = e
Explanation
Example or application
A worked example has not yet been added.
Key Properties
A transposition exchanges exactly two elements.
Every other element remains fixed.
A transposition is its own inverse.
Every transposition has order two.
Every finite permutation can be expressed as a product of transpositions.
The parity of the number of transpositions is independent of the chosen decomposition.
Examples
| Permutation | Mapping | Fixed Elements | Transposition Decomposition | Explanation |
|---|---|---|---|---|
(1 3) |
|
| ||
(1 2 3) | (1 3)(1 2) | A 3-cycle can be expressed as a product of two transpositions. |
Common Mistakes
Thinking a transposition can move more than two elements.
Assuming every permutation is itself a transposition.
Assuming the exact number of transpositions is the same in every decomposition.
Related Concepts
Cycle Notation
Disjoint Cycles
Even and Odd Permutations
Alternating Group
Learning Outcomes
Identify transpositions.
Express simple cycles as products of transpositions.
Explain the inverse and order of a transposition.
Learning Guide
Core Idea
A transposition is a permutation that exchanges exactly two elements and leaves all other elements fixed.
Worked Example
Permutation: (1 3)
Mapping: 1 → 3, 3 → 1
Fixedelements: 2, 4, 5
Permutation: (1 2 3)
Transpositiondecomposition: (1 3)(1 2)
Explanation: A 3-cycle can be expressed as a product of two transpositions.
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 transpositions? | A transposition is a permutation that exchanges exactly two elements and leaves all other elements fixed. |
What definition, condition, or property should you check first when solving a problem about transpositions? | Start by checking the relevant defining properties: A transposition exchanges exactly two elements; Every other element remains fixed; A transposition is its own inverse; Every transposition has order two. Verify every required hypothesis before applying a theorem. |
How is transpositions connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Cycle Notation, Disjoint Cycles, Even and Odd Permutations, Alternating Group. |
Mastery Checklist
I can state the definition of transpositions 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.