Products and Group Structure/Semidirect Products

Lesson 5.21,591 words

Semidirect Products

The semidirect product relaxes the direct product by requiring only one factor to be normal, with the other acting on it through a homomorphism into its automorphism group. This single twisting map lets abelian pieces assemble into non-abelian groups, realizes the dihedral groups as ZnZ2\mathbb{Z}_n \rtimes \mathbb{Z}_2, and, with a recognition theorem, classifies groups of several small orders.

╌╌╌╌

The direct product needs both factors normal, which forces them to commute and keeps the result abelian whenever the factors are. Dropping normality of one factor removes that constraint: the remaining normal factor is acted on by the other, with the action recorded by a homomorphism into its automorphism group. The result can be non-abelian even when the factors are abelian.

Motivation from an existing product

Suppose a group already contains subgroups and with (but not necessarily normal) and . Then is a subgroup, and every element of is written uniquely as . To multiply two such elements we slide the middle factors past each other using normality of :

Because , the conjugate lands back in , so and . The whole multiplication depends only on the operations in and and on how conjugates . Writing the conjugation action as , the rule becomes

Conjugation gives a homomorphism , and this formula shows the product is determined intrinsically by , , and .1 Nothing in it requires that existed first — the three ingredients alone define a group.

The construction

The verification that this is a group uses only that is a genuine action of on .2 Its structure mirrors the motivating picture exactly.

The notation points its open side toward the normal factor . The construction is not symmetric in and : swapping them generally changes the group, unlike the direct product.

A semidirect product : the normal factor is the kernel of projection onto , and acts on by conjugation through . The action twists the multiplication of the two abelian slabs.

Recovering the direct product

The direct product is the special case of trivial action: collapses to exactly when the action is trivial.

A trivial action means for all , so the twisted product formula degenerates to the componentwise one.3 Normality of is equivalent: if is also normal then , so and commute and the action is trivial. The direct product is the semidirect product with no twist; every non-abelian example needs .

Direct product Semidirect product
Normal factorsboth and only
Action trivialany homomorphism
elementscommute
Abelian if factors areyesnot in general
Recoversitself when

Building groups from a twist

The construction produces familiar groups and new ones from small abelian inputs. In each example is cyclic, so is fixed by naming a single automorphism of .

  • Dihedral groups. Let be any abelian group and , with acting by inversion, . Then has as an index- subgroup inverted by . When this is the dihedral group ; when it is the infinite dihedral group .4
  • Non-abelian groups of order . Taking and with inverting (so centralizes it) gives a non-abelian group of order that is neither nor , since its Sylow -subgroup is cyclic of order . This is the group .
  • The holomorph. For any , taking with the identity gives the holomorph , the largest group in which is normal and acts as written. For example .

In the dihedral realization, is rotations acted on by a reflection of order that inverts them.

: the rotation subgroup is normal; the reflection has order and conjugates each rotation to its inverse, .

Split extensions and complements

The semidirect product is the content of a split short exact sequence. A short exact sequence

records that is (a copy of) a normal subgroup of with quotient . It splits when there is a section , a homomorphism whose image is a subgroup meeting trivially and mapping isomorphically to . Such a is a complement to .

A split short exact sequence : the section (dashed) lifts back into as a complement, and . Without a section the extension may be non-split.

The recognition theorem says a complement is all that a semidirect decomposition needs.

So a group factors as a semidirect product exactly when some proper normal subgroup has a complement.5 Not every group qualifies. The quaternion group has no complement to any proper normal subgroup, so it is not a semidirect product of proper subgroups — though it is a quotient of one. Simple groups likewise admit no such decomposition.

Classifying groups of small order

The recognition theorem drives a classification strategy. For a target order , the procedure is fixed.6

Algorithm:Classifying groups of order nn by semidirect products
  1. 1
    find subgroups H,KH, K of every GG with HGH \trianglelefteq G, HK=1H \cap K = 1, G=HKG = HK
  2. 2
    enumerate all isomorphism types for HH and for KK
  3. 3
    for each pair (H,K)(H, K) do
  4. 4
    list every homomorphism φ:KAut(H)\varphi : K \to \operatorname{Aut}(H)
  5. 5
    form HφKH \rtimes_\varphi K for each φ\varphi
  6. 6
    identify which of the resulting semidirect products are isomorphic
  7. 7
    return the distinct isomorphism types

Sylow's theorem supplies the normal factor and its complement ; when and are coprime, is automatic by Lagrange. The count of homomorphisms is small, especially after accounting for the freedom to reselect a generator of a cyclic .

Groups of order

Let be primes and . Sylow forces the Sylow -subgroup to be normal, with complement , so for some . Now is cyclic of order .

  • If , the only homomorphism is trivial, so is cyclic — the unique group of order .
  • If , there is a nontrivial , and all nontrivial choices give isomorphic groups (they differ only by which generator of maps to a fixed automorphism). This yields one non-abelian group of order . When it is .

So there are one or two groups of order , and the divisibility decides which. This is the smallest case where a number-theoretic condition on the order controls the group count.

Groups of order

Order has a non-prime normal factor. Every group of order has a normal subgroup of order ; since , that is cyclic, , by the order- case. A Sylow -subgroup complements it, so for some .7 Now

which has exactly three elements of order . Writing , the three involutions invert only, invert only, or invert both. Each nontrivial sends the generator of to one of them, giving three non-abelian groups, plus the trivial action giving :

Action of on GroupCenter
trivialorder
invert (order ) onlyorder
invert (order ) onlyorder
invert bothorder

There are exactly four groups of order , distinguished by their centers. The method builds nothing here that direct products could not, but it proves the list is complete — which direct products alone cannot.

Groups of order

Order runs the method in full. Either the Sylow -subgroup (isomorphic to or ) or the Sylow -subgroup is normal.8 Working through both cases:

Normal factorComplementAction Group
trivial
order- cyclic
trivial
inversion
inversion

Deduplicating, there are exactly five groups of order , three of them non-abelian: , , and . The alternating group is the case where a Klein four normal subgroup is cyclically permuted by — a decomposition invisible without the semidirect product.

Direct versus semidirect on the same factors

The same and can produce different groups depending on the twist. Fixing and : the trivial action gives the abelian , while the inversion action gives the non-abelian . Same underlying set of pairs, same factor orders, incompatible group structures.

One pair of factors, two products. With trivial action is cyclic; with inversion action is non-abelian. The twist alone separates them.

Limits of the construction

The semidirect product enlarges the reachable groups substantially, but it does not reach everything. A group with no proper normal subgroup that has a complement — a simple group is the clearest case — cannot be assembled this way. This limitation marks the boundary the Hölder program draws: simple groups are the atoms, and semidirect products are one tool for gluing atoms together, but the general gluing problem (the extension problem) is harder.

Iterating the construction through a chain of abelian actions produces the solvable groups, and the fact that solvability stops at is why the quintic has no formula.

Footnotes

  1. Dummit & Foote, Abstract Algebra, §5.5 — Semidirect Products: the multiplication in derived from , rewritten via the conjugation action to depend only on , , and .
  2. Dummit & Foote, §5.5, Theorem 10: the pair-multiplication defines a group of order with , , and conjugation realizing .
  3. Dummit & Foote, §5.5, Proposition 11: the semidirect product equals the direct product iff is trivial iff is normal.
  4. Dummit & Foote, §5.5, Examples following Proposition 11: inversion actions realize and , and the holomorph .
  5. Dummit & Foote, §5.5, Theorem 12: a normal subgroup with a complement gives a semidirect decomposition; is cited as a group that is not a semidirect product of proper subgroups.
  6. Dummit & Foote, §5.5 — Some Classifications: the four-step strategy (find ; enumerate types; enumerate ; deduplicate) and its application to orders and .
  7. Dummit & Foote, §5.5, Example (Groups of Order 30): the normal cyclic subgroup of order , the three involutions in , and the four resulting groups , , , .
  8. Dummit & Foote, §5.5, Example (Groups of Order 12): the case analysis on which Sylow subgroup is normal, yielding five groups of order , three non-abelian; and §5.3 — Table of Groups of Small Order.

╌╌ END ╌╌