Exercise 6.4.8

Let G and H be groups where G acts on H by group homomorphisms. As in the text, we let H G denote the set H × G with the binary operation given by (6.9).

(a)
Prove that H G is a group.
(b)
Prove that the map H G G defined by ( h , g ) g is an onto homomorphism with kernel H × { e } .
(c)
Prove that h ( h , e ) defines an isomorphism H H × { e } (where the group structure on H × { e } comes from H G ).

Answers

Proof. By definition of an action by group homomorphisms, there exists a group homomorphism φ : G Aut ( H ) such that for all ( g , h ) G × H ,

g h = φ ( g ) ( h ) ,

so h g h is a group automorphism of H for all g G .

(a)
I If h , h H , g , g G , then g h H , thus ( h ( g h ) , g g ) H × G , so this law defines a binary operation on H × G .

A Let ( h , g ) , ( h , g ) , ( h , g ) H × G . Then

( ( h , g ) . ( h , g ) ) . ( h , g ) = ( h ( g h ) , g g ) . ( h , g ) = ( h ( g h ) ( ( g g ) h ) , g g g ) = ( h ( g h ) ( g ( g h ) ) , g g g ) .

The last equality is true because G acts on H .

( h , g ) . ( ( h , g ) . ( h , g ) ) = ( h , g ) ( ( h ( g h ) , g g ) = ( h ( g ( h ( g h ) ) ) , g g g ) = ( h ( g h ) ( g ( g h ) ) , g g g ) .

The last equality is true because G acts on H by group homomorphism.

Therefore ( ( h , g ) . ( h , g ) ) . ( h , g ) = ( h , g ) . ( ( h , g ) . ( h , g ) ) : the law is associative.

N Write e H , e G the identity of H and the identity of G .

( f , g ) . ( e H , e G ) = ( f ( g e H ) , g e G ) = ( f e H , g e G ) = ( f , g ) , ( e H , e G ) . ( f , g ) = ( e H ( e G f ) , e G g ) = ( e H f , e G g ) = ( f , g ) .

So ( e H , e G ) is the identity of H G , which we will write now ( 1 , 1 ) .

S

Analysis: if ( h , g ) is the inverse of ( h , g ) , then ( h ( g h ) , g g ) = ( 1 , 1 ) . Thus g = g 1 , and g h = h 1 , therefore h = g 1 ( h 1 ) .

Synthesis: we show that ( g 1 ( h 1 ) , g 1 ) is the inverse of ( h , g ) :

( h , g ) . ( g 1 ( h 1 ) , g 1 ) = ( h ( g ( g 1 ( h 1 ) ) ) , g g 1 ) = ( h ( g g 1 ( h 1 ) ) , 1 ) = ( h h 1 , 1 ) = ( 1 , 1 ) ( g 1 ( h 1 ) , g 1 ) ( h , g ) = ( ( g 1 ( h 1 ) ) ( g 1 h ) , g 1 g ) = ( g 1 ( h 1 h ) , 1 ) = ( g 1 1 , 1 ) = ( 1 , 1 )

Every element of H G has an inverse.

H G is a group.

(b)
Let ψ : { H G G ( h , g ) g .

ψ ( ( h , g ) . ( h , g ) ) = ψ ( h ( g h ) , g g ) = g g = ψ ( h , g ) ψ ( h , g ) . ψ is so a group homomorphism.

As every g in G is the image of ( 1 , g ) H G by ψ , ψ is surjective.

ker ( ψ ) = { ( h , g ) H G | g = e } = H × { e } .

(c)
Let χ : { H H × { e } h ( h , e ) .

χ ( h ) χ ( h ) = ( h , e ) ( h , e ) = ( h ( e h ) , e ) = ( h h , e ) = χ ( h h ) : χ is a group homorphisme from H on the subgroup H × { e } of H G .

χ ( h ) = ( e , e ) h = e , thus χ is injective, and surjective since every element of H × { e } is of the form ( h , e ) = χ ( h ) : H H × { e } .

Therefore the sequence { e } H H G G { e } is a short exact sequence, so H G is an extension of H by G .

User profile picture
2022-07-19 00:00
Comments