AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's NEW Intermediate Counting & Probability by David Patrick.
Personal tools

Semi-direct product

From AoPSWiki

The (external) semi-direct product, in group theory, is a generalization of the direct product.

Two Equivalent Definitions

Let be a group, a normal subgroup of , and a subgroup of . If and , then is called the (left) (external) semi-direct product of and .

Since is normal, the restriction of each inner automorphism of to is an automorphism of . In particular, there exists a function which associates each element of with an automorphism on (namely, the restriction to of the inner automorphism on ). Then is called the (external) semi-direct product of by relative to and is denoted . Each element of is identified with its corresponding element of , and the group law on is defined as (f,g)(f',g') = (f \cdot {^{g}f'}, gg'), for fgf'g' = f(gfg^{-1}) \cdot gg' = f \cdot {^g f'} \cdot gg' .

Conversely, let and be groups, and let be a homomorphism from into the group of automorphisms of . The set under the operation (f,g)(f',g') = (f \cdot {^{g}f'}, gg') is a group; it is . Indeed, \begin{align*}\bigl( (f,g)(f',g') \bigr) (f'',g'') &= (f \cdot {^g f'},gg')(f'',g'') = (f \cdot {^g f'} \cdot {^{gg'} f''}, gg'g'') \\&= (f,g)(f' \cdot {^{g'} f''}, g'g'') = (f,g) \bigl( (f',g') (f'',g'') \bigr),\end{align*} so the law of composition is associative; the identity is ; and the inverse of is .

Semi-direct products and extensions

Evidently, if is a semidirect product of by , then it is a group extension of by with a section (the projection onto ). The converse is also true. Indeed, if \mathcal{E} : F \stackrel{i}{\to} E \stackrel{p}{\to} G be an extension of by with a section , then , and is a normal subgroup of .

See also

AoPS hosts local and state communities
as well as national communities in Europe and Asia supporting several languages.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us