Cayley's Theorem states that every group G is isomorphic to a subgroup of the symmetric group on the underlying set of G. The theorem provides a concrete permutation representation of every abstract group. For each element g ∈ G, define a permutation L_g of G by left multiplication: L_g(x) = gx. Each L_g is bijective, with inverse L_(g⁻¹). The assignment g ↦ L_g is an injective homomorphism from G into Sym(G). Therefore, the image of this mapping is a subgroup of Sym(G) isomorphic to G. For a finite group of order n, this gives an embedding into S_n.
Cayley's Theorem
Cayley's Theorem states that every group is isomorphic to a subgroup of a symmetric group.
G ≅ H, where H ≤ Sym(G)
Explanation
Variables
| Symbol | Meaning |
|---|---|
G | The group being represented. |
Sym(G) | The symmetric group of all permutations of the elements of G. |
L_g | The left-multiplication permutation associated with g. |
g, x | Elements of G. |
Example or application
Description: Consider the cyclic group Z_3 = {0, 1, 2} under addition modulo 3.
Permutations: Translation by 0: identity permutation.; Translation by 1: 0 → 1, 1 → 2, 2 → 0.; Translation by 2: 0 → 2, 1 → 0, 2 → 1.
Conclusion: These three permutations form a subgroup of S_3 isomorphic to Z_3.
Key Properties
Every group can be represented as a permutation group.
The representation uses left multiplication on the elements of G.
The mapping g ↦ L_g is a homomorphism.
The mapping is injective.
A finite group of order n is isomorphic to a subgroup of S_n.
Applications
Representing abstract groups as permutation groups.
Connecting group theory with symmetric groups.
Constructing faithful permutation representations.
Providing a foundation for computational group theory.
Common Mistakes
Claiming every group is equal to a symmetric group rather than isomorphic to a subgroup.
Using a mapping that is not bijective on the underlying set.
Confusing left multiplication with conjugation.
Related Concepts
Permutation Representations
Group Actions on Sets
Symmetric Groups
Group Homomorphisms
Learning Guide
Core Idea
Cayley's Theorem states that every group is isomorphic to a subgroup of a symmetric group.
Worked Example
Description: Consider the cyclic group Z_3 = {0, 1, 2} under addition modulo 3.
Permutations: Translation by 0: identity permutation.; Translation by 1: 0 → 1, 1 → 2, 2 → 0.; Translation by 2: 0 → 2, 1 → 0, 2 → 1.
Conclusion: These three permutations form a subgroup of S_3 isomorphic to Z_3.
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 cayley's theorem? | Cayley's Theorem states that every group is isomorphic to a subgroup of a symmetric group. |
What definition, condition, or property should you check first when solving a problem about cayley's theorem? | Start by checking the relevant defining properties: Every group can be represented as a permutation group; The representation uses left multiplication on the elements of G; The mapping g ↦ L_g is a homomorphism; The mapping is injective. Verify every required hypothesis before applying a theorem. |
How is cayley's theorem connected to the wider study of abstract algebra? | It belongs to Group actions and advanced group theory. It connects naturally with Permutation Representations, Group Actions on Sets, Symmetric Groups, Group Homomorphisms. |
Mastery Checklist
I can state the definition of cayley's theorem 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.
Examples
| Name | Description |
|---|---|
Worked example | Description: Consider the cyclic group Z_3 = {0, 1, 2} under addition modulo 3. |
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.