Key Concepts of Cayley's Theorem

Why This Matters

Cayley's Theorem is one of the most powerful results in abstract algebra because it bridges the gap between abstract group structures and concrete permutation actions. When you're studying groups and geometries, you're constantly asked to recognize when two seemingly different algebraic objects share the same underlying structure—and Cayley's Theorem gives you a universal framework for doing exactly that. Every group, no matter how abstractly defined, can be "seen" as permutations shuffling elements around.

This theorem connects directly to core exam concepts: group isomorphisms, group actions, symmetric groups, and representation theory. You'll need to understand not just what the theorem states, but why the left regular representation works and how to apply it to specific groups. Don't just memorize the statement—know how to construct the embedding for a given group and recognize when two groups have equivalent permutation representations.

---

The Core Theorem and Its Statement

The fundamental insight is that abstract group multiplication can always be reinterpreted as function composition of permutations.

Statement of Cayley's Theorem

• Every group $G$ is isomorphic to a subgroup of $S_G$—the symmetric group on the underlying set of $G$ itself
• The embedding is constructive—we don't just know it exists, we can explicitly build the map using left multiplication
• No restrictions on $G$—the theorem applies to finite groups, infinite groups, abelian groups, and non-abelian groups alike

Proof Outline of Cayley's Theorem

• Define $\phi: G \to S_G$ by $\phi(g) = \lambda_g$—where $\lambda_g(x) = gx$ is left multiplication by $g$
• $\phi$ is an injective homomorphism—injectivity follows from cancellation; the homomorphism property from associativity
• The image $\phi(G)$ is the desired subgroup—establishing that $G \cong \phi(G) \leq S_G$

---

Foundational Structures

These are the building blocks that make Cayley's Theorem possible—you need fluency with each concept independently before the theorem clicks.

Group Isomorphism

• A bijective homomorphism between groups—preserves the operation, meaning $\phi(ab) = \phi(a)\phi(b)$
• Isomorphic groups are structurally identical—they have the same order, same subgroup lattice, same number of elements of each order
• Classification power—isomorphisms let us say "these are the same group" even when elements look completely different

Symmetric Group and Its Properties

• $S_n$ contains all permutations of $n$ elements—it has exactly $n!$ elements
• Non-abelian for $n \geq 3$—permutation composition doesn't commute in general, which is why $S_n$ can "host" non-abelian subgroups
• Universal container—Cayley's Theorem says $S_n$ is large enough to contain (a copy of) every group of order $n$ or less

Definition of a Regular Group Action

• Free and transitive simultaneously—free means only the identity fixes any point; transitive means any point can reach any other
• Unique group element for each pair—given $x$ and $y$ in the set, exactly one $g \in G$ satisfies $g \cdot x = y$
• The left regular action is the prototype—$G$ acting on itself by left multiplication is the canonical example

---

The Representation Mechanism

The left regular representation is the engine that drives Cayley's Theorem—it converts group elements into permutations systematically.

Left Regular Representation

• Each $g \in G$ becomes the permutation $\lambda_g: G \to G$—defined by $\lambda_g(x) = gx$
• Multiplication becomes composition—$\lambda_g \circ \lambda_h = \lambda_{gh}$, which is why this gives a homomorphism
• Faithful representation—different group elements give different permutations, so no information is lost

Relationship to Permutation Groups

• Permutation groups are subgroups of some $S_X$—groups whose elements are bijections on a set $X$
• Cayley's Theorem says every group IS a permutation group—up to isomorphism, there's no distinction between "abstract" and "permutation" groups
• Symmetry made concrete—this links algebraic structure to combinatorial and geometric symmetry

---

Applications and Implications

Cayley's Theorem isn't just a theoretical curiosity—it has concrete consequences for how we study and classify groups.

Implications for Finite Groups

• Every group of order $n$ embeds in $S_n$—this gives an upper bound on the "complexity" of finite groups
• Combinatorial techniques apply—permutation counting, cycle types, and conjugacy classes become tools for studying any finite group
• Subgroup hunting—to find all groups of order $n$, you can (in principle) search for subgroups of $S_n$

Applications in Group Theory

• Foundation for representation theory—Cayley's Theorem is the simplest case of representing groups via linear actions
• Visualization tool—abstract groups become concrete permutations you can write in cycle notation
• Cross-domain connections—links algebra to geometry (symmetry groups), combinatorics (counting), and even computer science (permutation algorithms)

---

Concrete Examples

These examples show Cayley's Theorem in action—practice constructing the embeddings yourself.

Examples Illustrating Cayley's Theorem

• $\mathbb{Z}/3\mathbb{Z}$ embeds in $S_3$—the generator $[1]$ maps to the 3-cycle $(1\ 2\ 3)$, giving a cyclic subgroup of order 3
• $D_4$ acts on square vertices—the 8-element dihedral group embeds in $S_4$, with rotations as 4-cycles and reflections as products of transpositions
• $S_3$ embeds in $S_6$ via left regular representation—though $S_3$ already "is" a permutation group, Cayley's construction gives a different (larger) embedding

---

Quick Reference Table

---

Self-Check Questions

1. Construct the embedding: Write out explicitly how $\mathbb{Z}/4\mathbb{Z}$ embeds into $S_4$ using the left regular representation. What permutation corresponds to the generator $[1]$?

2. Compare and contrast: Both Cayley's Theorem and the First Isomorphism Theorem produce isomorphisms between a group and a subgroup of another structure. What's the key difference in what they accomplish?

3. Identify the concept: If a group $G$ acts on a set $X$ such that for any $x, y \in X$ there exists a unique $g \in G$ with $g \cdot x = y$, what type of action is this? Why is this property essential for Cayley's Theorem?

4. Efficiency question: The left regular representation embeds $D_4$ (order 8) into $S_8$. Can you find a smaller symmetric group containing $D_4$ as a subgroup? What's the geometric interpretation?

5. FRQ-style: Explain why Cayley's Theorem implies that studying permutation groups is sufficient for understanding all finite groups. What are the practical limitations of this approach?