Semidirect product
For two groups and , the most basic construction of a group that contains copies of and as subgroups is the direct product . We can embed and into “on the axes” by and for and .
We can also use the direct product to decompose groups not initially constructed as a direct product. Given a group with subgroups and , to recognize whether can be written as the direct product of and , we first observe some properties of the embeddings of and into their direct product :
- they generate : ,
- they intersect trivially: ,
- they commute element-wise: .
These properties can be turned around to craft a recognition theorem for a group to look like a direct product of two subgroups and , as we did previously:
Theorem 1.
Let be a group with subgroups and where
- in ,
- for all and .
Then the map by is an isomorphism.
Note that in place of the third condition, we required and here. However, , so we’re good.
There’s another way to construct a group using two groups and , called the semidirect product. Interesting features include:
- It may be nonabelian even if and are abelian (note that is abelian iff and are abelian), and
- there may be multiple nonisomorphic semidirect products using the same two groups.
Definition 2.
Given any two groups and and a group homomorphism , we can construct a new group , called the semidirect product of and with respect to , defined as follows:
- As a set, is the same as .
- .
Recognizing semidirect products
Theorem 3.
Let be a group with subgroups and such that
- ,
- , and
- .
Let be conjugation: . Then, is a homomorphism and the map by is an isomorphism.