A topic in the Open Knowledge Graph — a free, open map of 15,495 topics and the order to learn them in.

Semidirect Products

Graduate Depth 109 in the knowledge graph ☐ I know this ☆ Set as goal
483prerequisites beneath it
See this on the map →
Direct Products of GroupsGroup Homomorphisms+3 more→
abstract-algebra group-theory semidirect-product automorphisms group-construction

Core Idea

A semidirect product builds a group from two groups N and H when H acts on N by automorphisms. Given a homomorphism φ: H → Aut(N), the semidirect product N ⋊_φ H is the set of pairs (n, h) with multiplication (n₁, h₁)(n₂, h₂) = (n₁·φ_{h₁}(n₂), h₁h₂). When φ is trivial this is the direct product; otherwise the result is a new, usually nonabelian, group. Internally, a group G is a semidirect product of N and H when N is normal, H is a subgroup, N ∩ H = {e} and NH = G.

How It's Best Learned

Start with the dihedral group D_n, where rotations form a normal cyclic subgroup and a reflection conjugates each rotation to its inverse. Rewrite D_n as ℤ_n ⋊ ℤ_2 and check that the multiplication rule reproduces its familiar relations. Then construct new groups by listing the homomorphisms ℤ_p → Aut(ℤ_q) ≅ ℤ_q^×, for example the nonabelian group of order 21. Compare with direct products to see what the twisting changes.

Common Misconceptions

Explainer

The direct product N × H combines two groups so that they do not interact: (n₁, h₁)(n₂, h₂) = (n₁n₂, h₁h₂). Many groups are built from smaller pieces that do interact. The semidirect product describes the most common kind of interaction, in which one factor acts on the other by automorphisms.

Look at the dihedral group D_n of symmetries of a regular n-gon. The rotations form a cyclic subgroup R ≅ ℤ_n, and R is normal. A single reflection s generates a subgroup S ≅ ℤ_2 with R ∩ S = {e} and RS = D_n. If D_n were R × S, rotations and reflections would commute. They do not: s r s⁻¹ = r⁻¹. Conjugation by s acts on R as an automorphism (inversion), and that action is what the direct product leaves out.

Here is the general construction. Let N and H be groups and φ: H → Aut(N) a homomorphism; write φ_h for the automorphism attached to h. Define N ⋊_φ H to be the set N × H with product

(n₁, h₁)(n₂, h₂) = (n₁·φ_{h₁}(n₂), h₁h₂).

When the H-part h₁ passes the N-part n₂, it changes n₂ by the automorphism φ_{h₁}. One can check that this operation is associative, that (e, e) is the identity, and that the inverse of (n, h) is (φ_{h⁻¹}(n⁻¹), h⁻¹). The copy N × {e} is normal, the copy {e} × H is a subgroup, and conjugating (n, e) by (e, h) gives (φ_h(n), e). So inside the new group, the abstract action becomes conjugation.

The internal version runs the other way. If G has a normal subgroup N and a subgroup H with N ∩ H = {e} and NH = G, then G ≅ N ⋊_φ H where φ_h(n) = hnh⁻¹. If the action is trivial, meaning H commutes with N, this reduces to the direct product.

Semidirect products are a main tool for building and classifying groups. Since Aut(ℤ_n) ≅ ℤ_n^×, actions of a cyclic group on a cyclic group are easy to list. For example, Aut(ℤ_7) ≅ ℤ_6 has elements of order 3, so ℤ_3 has a nontrivial action on ℤ_7, and ℤ_7 ⋊ ℤ_3 is a nonabelian group of order 21. Combined with the Sylow theorems, this shows that for primes p < q there is a nonabelian group of order pq exactly when p divides q - 1.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Combining Small Groups Within 5 → Number Bonds Within 5 → Number Bonds to 10 → Tens and Ones Place Value → Reading and Writing Three-Digit Numbers → Comparing Three-Digit Numbers → Comparing and Ordering Three-Digit Quantities → Comparing and Ordering Whole Numbers → Comparing Numbers 1 to 20 → Ordering Numbers to 20 → Number Line 0 to 20 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Opposites and Additive Inverses → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Semidirect Products

Longest path: 110 steps · 483 total prerequisite topics

Prerequisites (5)

Leads To (0)

No topics depend on this one yet.