Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.5.22 (Group of upper triangular matrices as semidirect product)
Problem 5.5.22 (Group of upper triangular matrices as semidirect product)
Let be a field, let be a positive integer and let be the group of upper triangular matrices in (cf. Exercise 16, Section 2.1)
- (a)
- Prove that is the semidirect product where is the set of upper triangular matrices with ’s down the diagonal (cf. Exercise 17, Section 2.1) and is the set of diagonal matrices in .
- (b)
- Let . Recall that and (cf. Exercise 11 in Section 3.1). Describe the homomorphism from into explicitly in terms of these isomorphisms (i.e., show how each element of acts as an automorphism on ).
Answers
Proof. Let be the group of upper triangular matrices in .
- (a)
-
If
where * is for any element in , then
so .
By definition of and ,
If
is any matrix in , then , where and . Explicitly,
so .
Since
- ,
- ,
- ,
by Theorem 9,
where is the homomorphism associated to the action by conjugation.
- (b)
-
Let
. By Exercise 3.1.11,
are isomorphisms, so that and .
By part (a), , where
If , then , and
Consider
By the proof of Theorem B in the Appendix, where ,
Indeed, consider defined by , and defined for and by
Then for all , and for all ,
Therefore
By the proof of Theorem B of the Appendix, is an isomorphism, and so
where is the homomorphism
APPENDIX.
The following Theorem was used implicitly in many exercises of this Chapter. Here we use it explicitly, and prove it.
Theorem B.
Let and be group isomorphisms. To each homomorphism there corresponds a homomorphism such that
Proof. To each , we can associate making the following diagram commutative:
namely .
This allows us to define
If is the map defined by , then, for all and all ,
therefore , which shows that is bijective.
Furthermore, if
therefore is an isomorphism of on .
We can now use to match each homomorphism to a homomorphism making the following diagram commutative:
or , which is indeed a homomorphism, because it is composed of three homomorphisms.
Let us now construct the isomorphism Consider
Then is bijective, of reciprocal . Let’s check that is indeed a homomorphism. If , then
And
It remains to prove , for all and all , which amounts to showing that , i.e.
By definition of and , using ,
This completes the proof that is an isomorphism. □