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 F be a field, let n be a positive integer and let G be the group of upper triangular matrices in GL n ( F ) (cf. Exercise 16, Section 2.1)

(a)
Prove that G is the semidirect product U ⋊ D where U is the set of upper triangular matrices with 1 ’s down the diagonal (cf. Exercise 17, Section 2.1) and D is the set of diagonal matrices in GL n ( F ) .
(b)
Let n = 2 . Recall that U ≃ F and D ≃ F × × F × (cf. Exercise 11 in Section 3.1). Describe the homomorphism from D into Aut ( U ) explicitly in terms of these isomorphisms (i.e., show how each element of F × × F × acts as an automorphism on F ).

Answers

Proof. Let G be the group of upper triangular matrices in GL n ( F ) .

(a)
If P = ( d 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ d i ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 d n ) ∈ G , A = ( 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ 1 ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 1 ) ∈ U ,

where * is for any element in F , then

𝑃𝐴 P − 1 = ( d 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ d i ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 d n ) ( 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ 1 ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 1 ) ( d 1 − 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ d i − 1 ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 d n − 1 ) = ( 1 ∗ ⋯ ∗ 0 ⋱ ⋮ ⋱ 1 ⋱ ⋮ ⋮ ⋱ ∗ 0 ⋯ 0 1 ) ∈ U ,

so U ⊴ G .

By definition of U and D ,

U ∩ D = { I } .

If

M = ( a 1 , 1 ⋯ a 1 , i ⋯ a 1 , n 0 ⋱ ⋮ ⋱ a i , i ⋯ a i , n ⋮ ⋱ 0 ⋯ 0 a n , n )

is any matrix in G , then M = ( M D − 1 ) D , where D = diag ( a 1 , 1 , … , a n , n ) ∈ D and M D − 1 ∈ U . Explicitly,

M = ( 1 a 12 a 22 − 1 ⋯ a 1 , i a i , i − 1 ⋯ a 1 , n a n , n − 1 0 1 ⋱ ⋮ ⋱ 1 ⋯ a i , n a n , n − 1 ⋮ ⋱ 0 ⋯ 0 1 ) ( a 1 , 1 0 ⋯ ⋯ 0 0 ⋱ ⋮ ⋮ ⋱ a i , i ⋱ ⋮ ⋱ 0 0 ⋯ 0 a n , n ) ∈ 𝑈𝐷 ,

so G = 𝑈𝐷 .

Since

  • U ⊴ G ,
  • U ∩ D = { I } ,
  • G = 𝑈𝐷 ,

by Theorem 9,

G ≃ U ⋊ φ D ,

where φ : D → Aut ( U ) is the homomorphism associated to the action by conjugation.

(b)
Let n = 2 . By Exercise 3.1.11, σ { F → U α ↦ ( 1 α 0 1 ) τ { F × × F × → D ( γ , δ ) ↦ ( γ 0 0 δ )

are isomorphisms, so that F × × F × ≃ D and F ≃ U .

By part (a), G ≃ U ⋊ φ D , where

φ { D → Aut ( U ) ( γ 0 0 δ ) ↦ φ γ , δ { U → U ( 1 α 0 1 ) ↦ ( γ 0 0 δ ) ( 1 α 0 1 ) ( γ 0 0 δ ) − 1

If u α = ( 1 α 0 1 ) , then φ ( diag ( γ , δ ) ) = φ γ , δ , and

φ γ , δ ( u α ) = ( γ 0 0 δ ) ( 1 α 0 1 ) ( γ 0 0 δ ) − 1 = ( 1 𝛼𝛾 δ − 1 0 1 ) = u 𝛼𝛾 δ − 1 .

Consider

φ ′ { F × × F × → Aut ( F ) ≃ F × ( α , γ ) → φ γ , δ ′ { F → F α ↦ 𝛼𝛾 δ − 1

By the proof of Theorem B in the Appendix, where H = U , K = D , H ′ = F , K ′ = F × × F × , f = σ − 1 , g = τ − 1 ,

G ≃ U ⋊ φ F ≃ F ⋊ φ ′ ( F × × F × ) .

Indeed, consider χ f ∈ Aut ( U ) defined by χ f ( ψ ) = f ∘ ψ ∘ f − 1 , and λ : U ⋊ φ D → F ⋊ φ ′ ( F × × F × ) defined for u = ( 1 α 0 1 ) ∈ U and d = diag ( γ , δ ) = ( γ 0 0 δ ) ∈ D by

λ ( u , d ) = ( f ( u ) , g ( d ) ) = ( σ − 1 ( u ) , τ − 1 ( d ) ) = ( α , ( γ , δ ) ) .

Then for all ( γ , δ ) ∈ K ′ = F × × F × , and for all α ∈ U ′ = F ,

[ ( χ f ∘ φ ∘ g − 1 ) ( γ , δ ) ] ( α ) = { χ f [ φ ( diag ( γ , δ ) ) ] } ( α ) = [ χ f ( φ γ , δ ) ] ( α ) = ( f ∘ φ γ , δ ∘ f − 1 ) ( α ) = f ( φ γ , δ ( u α ) ) = f ( u 𝛼𝛾 δ − 1 ) = 𝛼𝛾 δ − 1 = [ φ ′ ( γ , δ ) ] ( α ) .

Therefore

φ ′ = χ f ∘ φ ∘ g − 1 .

By the proof of Theorem B of the Appendix, λ is an isomorphism, and so

G = U ⋊ φ D ≃ F ⋊ φ ′ ( F × × F × ) ,

where φ ′ = χ f ∘ φ ∘ g − 1 is the homomorphism

φ ′ { F × × F × → Aut ( F ) ≃ F × ( α , γ ) → φ γ , δ ′ { F → F α ↦ 𝛼𝛾 δ − 1

□

APPENDIX.

The following Theorem was used implicitly in many exercises of this Chapter. Here we use it explicitly, and prove it.

Theorem B.

Let f : H → H ′ and g : K → K ′ be group isomorphisms. To each homomorphism φ : K → Aut ( H ) there corresponds a homomorphism φ ′ : K ′ → Aut ( H ′ ) such that

H ⋊ φ K ≃ H ′ ⋊ φ ′ K ′ .

Proof. To each ψ ∈ Aut ( H ) , we can associate ψ ′ ∈ Aut ( H ′ ) making the following diagram commutative:

namely ψ ′ = f ∘ ψ ∘ f − 1 .

This allows us to define

χ f { Aut ( H ) → Aut ( H ′ ) ψ ↦ f ∘ ψ ∘ f − 1 .

If ξ f − 1 : Aut ( H ′ ) → Aut ( H ) is the map defined by ξ f − 1 ( ψ ′ ) = f − 1 ∘ ψ ′ ∘ f , then, for all ψ ∈ Aut ( H ) and all ψ ′ ∈ Aut ( H ′ ) ,

( ξ f − 1 ∘ χ f ) ( ψ ) = f − 1 ∘ ( f ∘ ψ ∘ f − 1 ) ∘ f = ψ , ( χ f ∘ ξ f − 1 ) ( ψ ′ ) = f ∘ ( f − 1 ∘ ψ ′ ∘ f ) ∘ f − 1 = ψ ′ ,

therefore ξ f − 1 ∘ χ f = 1 Aut ( H ) , χ f ∘ ξ f − 1 = 1 Aut ( H ′ ) , which shows that χ f is bijective.

Furthermore, if ψ 1 , ψ 2 ∈ Aut ( H )

χ f ( ψ 1 ) χ f ( ψ 2 ) = ( f ∘ ψ 1 ∘ f − 1 ) ∘ ( f ∘ ψ 2 ∘ f − 1 ) = f ∘ ( ψ 1 ∘ ψ 2 ) ∘ f − 1 = χ f ( ψ 1 ∘ ψ 2 ) ,

therefore χ f is an isomorphism of Aut ( H ) on Aut ( H ′ ) .

We can now use χ f to match each homomorphism φ : K → Aut ( H ) to a homomorphism φ ′ : K ′ → Aut ( H ′ ) making the following diagram commutative:

or φ ′ = χ f ∘ φ ∘ g − 1 , which is indeed a homomorphism, because it is composed of three homomorphisms.

Let us now construct the isomorphism H ⋊ φ K → H ′ ⋊ φ ′ K ′ . Consider

λ { H ⋊ φ K → H ′ ⋊ φ ′ K ′ ( h , k ) ↦ ( f ( h ) , g ( k ) ) .

Then λ is bijective, of reciprocal ( h ′ , k ′ ) ↦ ( f − 1 ( h ) , g − 1 ( k ) ) . Let’s check that λ is indeed a homomorphism. If ( a , b ) , ( c , d ) ∈ H ⋊ φ K , then

λ ( ( a , b ) ( c , d ) ) = λ ( a φ b ( c ) , 𝑏𝑑 ) = ( f ( a φ b ( c ) ) , g ( 𝑏𝑑 ) ) = ( f ( a ) f ( φ b ( c ) ) , g ( b ) g ( d ) ) ,

And

λ ( a , b ) λ ( c , d ) = ( f ( a ) , g ( b ) ) ( f ( c ) , g ( d ) ) = ( f ( a ) φ g ( b ) ′ ( f ( c ) ) , g ( b ) g ( d ) ) .

It remains to prove f ( φ b ( c ) ) = φ g ( b ) ′ ( f ( c ) ) , for all b ∈ K and all c ∈ H , which amounts to showing that f ∘ φ b = φ g ( b ) ′ ∘ f , i.e.

f ∘ φ b ∘ f − 1 = φ g ( b ) ′ , b ∈ K .

By definition of φ ′ and χ f , using φ b = φ ( b ) ,

φ g ( b ) ′ = φ ′ ( g ( b ) ) = ( χ f ∘ φ ∘ g − 1 ) ( g ( b ) ) = ( χ f ∘ φ ) ( b ) = χ f ( φ b ) = f ∘ φ b ∘ f − 1 .

This completes the proof that λ is an isomorphism. □

User profile picture
2026-09-24 12:10
Comments