The symmetric group on n symbols, denoted by Sₙ, is the group of all bijections from an n-element set to itself. Its operation is composition of permutations. The identity permutation acts as the identity element, every permutation has an inverse, and composition is associative. The group contains n! elements because there are n choices for the image of the first element, n - 1 choices for the second, and so on. For n greater than or equal to 3, Sₙ is non-Abelian.
The Symmetric Group
The symmetric group Sₙ consists of all permutations of a set containing n elements, with composition as its operation.
|Sₙ| = n!
Explanation
Example or application
A worked example has not yet been added.
Key Properties
Sₙ contains every permutation of an n-element set.
The operation is composition.
The identity permutation is the identity element.
Every permutation has an inverse.
The order of Sₙ is n!.
S₁ and S₂ are Abelian.
Sₙ is non-Abelian for n ≥ 3.
Examples
| Group | Elements | Order | Explanation |
|---|---|---|---|
S₂ |
| 2 | There are 2! = 2 permutations. |
S₃ |
| 6 | There are 3! = 6 permutations. |
Common Mistakes
Confusing the number of permutations with the number of elements in the original set.
Assuming every symmetric group is Abelian.
Using ordinary multiplication instead of composition as the group operation.
Related Concepts
Permutation
Bijective Transformation
Cycle Notation
Alternating Group
Permutation Order
Learning Outcomes
Define the symmetric group.
Calculate the order of Sₙ.
Identify the elements of small symmetric groups.
Recognize when a symmetric group is non-Abelian.
Learning Guide
Core Idea
The symmetric group Sₙ consists of all permutations of a set containing n elements, with composition as its operation.
Worked Example
Group: S₂
Elements: identity, (1 2)
Order: 2
Explanation: There are 2! = 2 permutations.
Group: S₃
Elements: e, (1 2), (1 3), (2 3), (1 2 3), (1 3 2)
Order: 6
Explanation: There are 3! = 6 permutations.
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 symmetric group? | The symmetric group Sₙ consists of all permutations of a set containing n elements, with composition as its operation. |
What definition, condition, or property should you check first when solving a problem about the symmetric group? | Start by checking the relevant defining properties: Sₙ contains every permutation of an n-element set; The operation is composition; The identity permutation is the identity element; Every permutation has an inverse. Verify every required hypothesis before applying a theorem. |
How is the symmetric group connected to the wider study of abstract algebra? | It belongs to Permutation groups. It connects naturally with Permutation, Bijective Transformation, Cycle Notation, Alternating Group. |
Mastery Checklist
I can state the definition of the symmetric group 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.