Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.5.9 (Groups of order $1805$)

Problem 5.5.9 (Groups of order $1805$)

Show that the matrix ( 0 − 1 1 4 ) is an element of order 5 in GL 2 ( 𝔽 19 ) . Use this matrix to construct a non-abelian group of order 1805 and give a presentation of this group. Classify groups of order 1805 (there are three isomorphism types).

Answers

Proof. Put

A = ( 0 − 1 1 4 ) ∈ GL 2 ( 𝔽 19 ) .

We check A 5 = I :

sage: G = GL(2, GF(19))
sage: G.order()
123120
sage: A = matrix([[0,-1],[1,4]]); A = G(A); A

[ 0 18]
[ 1  4]
sage: A^5

[1 0]
[0 1]

Note that 1805 = 1 9 2 ⋅ 5 .

Consider the map

φ { ℤ ∕ 5 ℤ → Aut ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ≃ GL 2 ( 𝔽 19 ) x ¯ = [ x ] 5 ↦ φ x ¯ { ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ → ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ( a b ) ↦ A x ( a b ) (1)

As in Exercise 8, since A 5 = I , φ x ¯ is well defined, and φ is a homomorphism. Therefore

G 0 = ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ⋊ φ ℤ ∕ 5 ℤ

is a non-abelian group of order 1805 .

The law of G 0 is given by

( ( a b ) , x ) ( ( a ′ b ′ ) , x ′ ) = ( ( a b ) + ( 0 − 1 1 4 ) x ( a ′ b ′ ) , x + x ′ ) (2)

where a , b , a ′ , b ′ ∈ ℤ ∕ 19 ℤ , x , x ′ ∈ ℤ ∕ 5 ℤ .

Presentation of G 0 .

Consider the three elements of G 0 defined by

a = ( ( 1 0 ) , 0 ) , b = ( ( 1 0 ) , 0 ) , c = ( ( 0 0 ) , 1 ) ,

If ( ( u ¯ v ¯ ) , x ¯ ) is any element of G 0 , then

( ( u ¯ v ¯ ) , x ¯ ) = a u b v c w ,

so G 0 = ⟨ a , b , c ⟩ .

By (2), we have

a 19 = b 19 = ( ( 0 0 ) , 0 ) = 1 c 5 = ( ( 0 0 ) , 0 ) = 1 , 𝑎𝑏 = 𝑏𝑎 𝑐𝑎 c − 1 = ( ( 0 1 ) , 0 ) = b 𝑐𝑏 c − 1 = ( A ( 0 1 ) , 0 ) = ( ( − 1 4 ) , 0 ) = a − 1 b 4 .

Now we prove that

( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ⋊ φ ℤ ∕ 5 ℤ ≃ ⟨ a , b , c ∣ a 19 = b 19 = 1 , c 5 = 1 , 𝑎𝑏 = 𝑏𝑎 , 𝑐𝑎 c − 1 = b , 𝑐𝑏 c − 1 = a − 1 b 4 ⟩ .

To this end, we must prove that if Γ is any group containing elements α , β , γ such that

α 19 = β 19 = 1 , γ 5 = 1 , 𝛼𝛽 = 𝛽𝛼 , 𝛾𝛼 γ − 1 = β , 𝛾𝛽 γ − 1 = α − 1 β 4 , (3) 

then there is a unique homomorphism ψ : G 0 → Γ such that

ψ ( a ) = α , ψ ( b ) = β , ψ ( c ) = γ . (4)
  • Unicity. If ψ : G 0 → Γ is a homomorphism that satisfies (3) and (4), then

    ψ ( ( u ¯ v ¯ ) , x ¯ ) = ψ ( a u b v c w ) = ψ ( a ) u ψ ( b ) v ψ ( c ) w = α u β v γ w .

    This proves the unicity of ψ .

  • Existence. We define the map ψ : G 0 → Γ by

    ψ ( ( u ¯ v ¯ ) , x ¯ ) = α u β v γ w .

    Since α 19 = β 19 = 1 and γ 5 = 1 by (3), ψ is a well defined application such that (4) is true.

    We show that ψ is a homomorphism. We prove first by induction on x that for all integers s , t , w , z ,

    γ x ( α s β t ) γ − x = α w β z where ( w ¯ z ¯ ) = A x ( s ¯ t ¯ ) . (5)

    It is true when x = 0 . Suppose that (5) is true for some integer x ≥ 0 . Then

    γ x + 1 ( α u β v ) γ − ( x + 1 ) = γ ( γ x α u β v γ − x ) γ − 1 = γ α w β z γ − 1 = ( γ α w γ − 1 ) ( γ β w γ − 1 ) = ( 𝛾𝛼 γ − 1 ) w ( 𝛾𝛽 γ − 1 ) z = β w ( α − 1 β 4 ) z = α − z β w + 4 z = α w ′ β z ′ ,

    where

    ( w ¯ ′ z ¯ ′ ) = ( − z ¯ w ¯ + 4 z ¯ ) = ( 0 − 1 1 4 ) ( w ¯ z ¯ ) = A ⋅ A x ( u ¯ v ¯ ) = A x + 1 ( u ¯ v ¯ ) .

    The induction is done, which proves that (5) is true for any x ≥ 0 .

    If x < 0 , by (5) applied to − x > 0 , then γ − x α w β z γ x = α s β t , where ( s ¯ t ¯ ) = A − x ( w ¯ z ¯ ) , thus γ x α s β t γ − x = α w β z , where ( w ¯ z ¯ ) = A x ( u ¯ v ¯ ) , so (5) is true for all integers x .

    Then, for all u ¯ , v ¯ s ¯ , t ¯ ∈ ℤ ∕ 19 ℤ and for all x ¯ , y ¯ ∈ ℤ ∕ 5 ℤ ,

    ψ ( ( u ¯ v ¯ ) , x ¯ ) ψ ( ( s ¯ t ¯ ) , y ¯ ) = α u β v γ x α s β t γ y = α u β v [ γ x ( α s β t ) γ − x ] γ x γ y = α u β v α w β z γ x γ y ( where  ( w ¯ z ¯ ) = A x ( s ¯ t ¯ ) ) = α u + w β v + z γ x + y ,

    and

    ψ [ ( ( u ¯ v ¯ ) , x ¯ ) ( ( s ¯ t ¯ ) , y ¯ ) ] = ψ ( ( u ¯ v ¯ ) + A x ( s ¯ t ¯ ) , x ¯ + y ¯ ) = ψ ( ( u + w ¯ v + z ¯ ) , x + y ¯ ) = α u + w β v + z γ x + y .

    So ψ is a homomorphism.

Put G 1 = ⟨ A , B , C ∣ A 19 = B 19 = 1 , C 5 = 1 , 𝐴𝐵 = 𝐵𝐴 , 𝐶𝐴 C − 1 = B , 𝐶𝐵 C − 1 = A − 1 B 4 ⟩ . The preceding reasoning shows that there is a homomorphism ψ : G 0 → G 1 such that ψ ( a ) = A , ψ ( b ) = B and ψ ( c ) = C . By definition of a presentation, there is an homomorphism λ : G 1 → G 0 such that λ ( A ) = a , λ ( B ) = b and λ ( C ) = c . Then λ ∘ ψ satisfies ( λ ∘ ψ ) ( a ) = a , ( λ ∘ ψ ) ( b ) = b , ( λ ∘ ψ ) ( c ) = c . Since G 0 = ⟨ a , b , c ⟩ , this shows that λ ∘ ψ = id . Similarly, ψ ∘ λ = id . So ψ is bijective, and ψ is an isomorphism. This proves, with a slight notation modification,

( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ⋊ φ ℤ ∕ 5 ℤ ≃ ⟨ a , b , c ∣ a 19 = b 19 = 1 , c 5 = 1 , 𝑎𝑏 = 𝑏𝑎 , 𝑐𝑎 c − 1 = b , 𝑐𝑏 c − 1 = a − 1 b 4 ⟩ .

Classification of groups of order 1805 . Let G be a group of order 1805 = 1 9 2 ⋅ 5 . By Theorem 5, if G is abelian,

G ≃ Z 361 × Z 5 or G ≃ Z 19 × Z 19 × Z 5 .

Now we assume that G is a non-abelian group.

By Sylow’s Theorem, n 19 ∣ 5 and n 19 ≡ 1 ( 𝑚𝑜𝑑 5 ) , thus n 19 = 1 . Let H be the unique Sylow 19 -subgroup, and let K be a 5 -Sylow subgroup. Similarly, n 5 ≡ 1 ( 𝑚𝑜𝑑 5 ) and n 5 ∣ 1 9 2 , thus n 5 = 1 or n 5 = 1 9 2 .

If n 5 = 1 , then H ⊴ G and K ⊴ G , and G = 𝐻𝐾 ≃ H × K is abelian, in contradiction with our hypothesis. Therefore

n 19 = 1 and n 5 = 1 9 2 = 361 .

Since H ⊴ G , 𝐻𝐾 is a subgroup of G . Moreover H ∩ K = { 1 } (if a ∈ H ∩ K , then | a | divides 5 and 1 9 2 , thus a = 1 ). Therefore G = H ⋊ ψ K . Moreover, H ≃ ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ or H ≃ ℤ ∕ 361 ℤ .

If H ≃ ℤ ∕ 361 ℤ , then | Aut ( H ) | = φ ( 1 9 2 ) = 1 9 2 − 19 = 342 = 2 ⋅ 3 2 ⋅ 19 , so g . c . d . ( | K | , | Aut ( H ) | ) = 1 . The homomorphism ψ : K → Aut ( H ) is the trivial homomorphism and G is abelian: contradiction. Therefore

G ≃ ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ⋊ ξ ℤ ∕ 5 ℤ ,

for some homomorphism ξ : ℤ ∕ 5 ℤ → Aut ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ≃ GL 2 ( 𝔽 19 ) .

There is some matrix B ∈ GL 2 ( 𝔽 19 ) such that

ξ { ℤ ∕ 5 ℤ → Aut ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ≃ GL 2 ( 𝔽 19 ) x ¯ = [ x ] 5 ↦ ξ x ¯ { ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ → ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ( a b ) ↦ B x ( a b ) (6)

Since ξ 1 ¯ 5 = id , then B 5 = I , and since ξ is not trivial, B ≠ I .

With some help of Sagemath(see APPENDIX) , we obtain that the set

{ X ∈ GL 2 ( 𝔽 19 ) ∣ X ≠ I , X 5 = I } ,

of cardinality 684 , is the union of two disjoint conjugacy classes 𝒞 A and 𝒞 B , where

A = ( 0 − 1 1 4 ) , A 1 = ( 2 17 17 12 ) .

Both classes have cardinality 342 .

Moreover A 1 2 ∈ 𝒞 A , and for Q = ( 10 4 0 5 ) , we obtain

𝑄𝐴 Q − 1 = A 1 2 .

With these results, we can show that G ≃ G 0 :

  • If B ∈ 𝒞 A , then B = 𝑃𝐴 P − 1 for some P ∈ GL 2 ( 𝔽 19 ) .
  • If B ∈ 𝒞 A 1 , then B = R A 1 R − 1 for some R ∈ GL 2 ( 𝔽 19 ) . Therefore

    B 2 = R A 1 2 R − 1 = R ( 𝑄𝐴 Q − 1 ) R − 1 = ( 𝑅𝑄 ) A ( 𝑅𝑄 ) − 1 = 𝑃𝐴 P − 1 where  P = 𝑅𝑄 .

In both cases there is some integer k ( k = 1 or k = 2 ) and some P ∈ GL 3 ( 𝔽 2 ) such that

𝑃𝐴 P − 1 = B k .

If σ ∈ Aut ( 𝔽 19 2 ) is defined by σ ( X ) = 𝑃𝑋 , then for all X ∈ 𝔽 19 2 (where X ′ = 𝑃𝑋 = σ ( X ) ), and all x ¯ ∈ ℤ ∕ 5 ℤ ,

( ξ k ( x ¯ ) ∘ σ ) ( X ) = ξ k ( x ¯ ) ( X ′ ) = B 𝑘𝑥 X ′ = P A x P − 1 X ′ = P A x X = ( σ ∘ φ ( x ¯ ) ) ( X ) .

Therefore ξ k ( x ¯ ) ∘ σ = σ ∘ φ ( x ¯ ) for all x ¯ ∈ K = ℤ ∕ 5 ℤ , thus

ξ k ( K ) = 𝜎𝐾 σ − 1 ,

where K = ℤ ∕ 5 ℤ is cyclic.

By Exercise 6,

( ℤ ∕ 19 ℤ ) 2 ⋊ φ ℤ ∕ 5 ℤ ≃ ( ℤ ∕ 19 ℤ ) 3 ⋊ ξ ℤ ∕ 5 ℤ .

There is a unique non-abelian group of order 1805 , up to isomorphism.

So there are 3 types of groups of order 1805 :

ℤ ∕ 361 ℤ × ℤ ∕ 5 ℤ , ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ × ℤ ∕ 5 ℤ , ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) ⋊ φ ℤ ∕ 5 ℤ ,

where

φ { ℤ ∕ 5 ℤ → Aut ( ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ) x ¯ = [ x ] 5 ↦ φ x ¯ { ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ → ℤ ∕ 19 ℤ × ℤ ∕ 19 ℤ ( a b ) ↦ ( 0 − 1 1 4 ) x ( a b ) □

APPENDIX:

sage: G = GL(2, GF(19))
sage: order(G), order(G).factor()
(123120, 2^4 * 3^4 * 5 * 19)
sage: A = G(matrix([[0, -1],[1,4]])); A

[ 0 18]
[ 1  4]
sage: I = G(1)
sage: CA = A.conjugacy_class().list(); len(CA)
342
sage: liste = []
sage: for B in G:
....:     if B != I and B^5 == I:
....:         liste.append(B)
....:
sage: len(liste)
684
sage: for B in liste:
....:     if B not in CA:
....:         break
....:
sage: B

[ 2 17]
[17 12]
sage: CB = B.conjugacy_class().list(); len(CB)
342
sage: B in CA
False
sage: B^2 in CA
True
sage: for P in G:
....:     if P * A * P^-1 == B^2:
....:         break
....:
sage: P

[10  4]
[ 0  5]
sage: P * A * P^-1, B^2

                                                                  

                                                                  
(
[ 8 10]  [ 8 10]
[10 15], [10 15]
)

User profile picture
2026-09-15 11:04
Comments