As per en.wikipedia.org/w/index.php?title=Semidirect_product&oldid=1040813965#Properties, unlike the Direct product, the semidirect product of two goups is neither unique, nor does it always exist, and there is no known algorithmic way way to tell if one exists or not.

This is because reaching the "output" of the semidirect produt of two groups requires extra non-obvious information that might not exist. This is because the semi-direct product is based on the product of group subsets. So you start with two small and completely independent groups, and it is not obvious how to join them up, i.e. how to define the group operation of the product group that is compatible with that of the two smaller input groups. Contrast this with the Direct product, where the composition is simple: just use the group operation of each group on either side.

Product of group subsets

So in other words, it is not a function like the Direct product. The semidiret product is therefore more like a property of three groups.

The semidirect product is more general than the direct product of groups when thinking about the group extension problem, because with the direct product of groups, both subgroups of the larger group are necessarily also normal (trivial projection group homomorphism on either side), while for the semidirect product, only one of them does.

Conversely, en.wikipedia.org/w/index.php?title=Semidirect_product&oldid=1040813965 explains that if

G = N ⋊ H

, and besides the implied requirement that N is normal, H is also normal, then

G = N \times H

Smallest example:

D_{6} = C_{3} ⋊ C_{2}

where

D

is a dihedral group and

C

are cyclic groups.

C_{3}

(the rotation) is a normal subgroup of

D_{6}

, but

C_{2}

(the flip) is not.

Note that with the Direct product instead we get

C_{6}

and not

D_{6}

, i.e.

C_{3} \times C_{2} = C_{6}

as per the direct product of two cyclic groups of coprime order is another cyclic group.

TODO:

why does one of the groups have to be normal in the definition?
what is the smallest example of a non-simple group that is neither a direct nor a semi-direct product of any two other groups?

Bibliography: math.stackexchange.com/questions/1726939/is-this-intuition-for-the-semidirect-product-of-groups-correct

 Ancestors (5)

 Incoming links (6)

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (2)

Direct product of groups by

Codex  0 Created 2026-09-24 Updated 2026-10-20

 View more

A direct product combines two groups into one while keeping their operations in separate coordinates. Its underlying set is the Cartesian product

G \times H

, and its group operation is

(g_{1}, h_{1}) (g_{2}, h_{2}) = (g_{1} g_{2}, h_{1} h_{2}) .

(1)

The identity element is

(e_{G}, e_{H})

, and the inverse element of

(g, h)

(g^{- 1}, h^{- 1})

. Associativity follows coordinate by coordinate. For finite groups, the multiplication principle gives

∣ G \times H ∣ = ∣ G ∣∣ H ∣

For example, write the cyclic group

C_{m}

as the additive group of residue classes modulo

m

. In

C_{2} \times C_{3}

(1, 2) + (1, 2) = (0, 1),

(2)

since each coordinate reduces with its own integer modulus. A pair can track two cyclic counters that advance independently. Updating the first coordinate does not alter the second, and vice versa.

This independence has an algebraic form. The embedded factor elements always commute:

(g, e_{H}) (e_{G}, h) = (g, h) = (e_{G}, h) (g, e_{H}) .

(3)

The coordinate maps

(g, h) \mapsto g

and

(g, h) \mapsto h

are group homomorphisms, so one can analyze either component separately. This does not make the full product an abelian group when one of its factors is nonabelian: two arbitrary pairs need not commute.