A topic in the Open Knowledge Graph — a free, open map of 15,495 topics and the order to learn them in.
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.
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.
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.
No topics depend on this one yet.