Exercise 2.9.13

Show that the automorphism group of the form ( 1 , 0 , 5 ) is infinite.

Answers

Proof. By Theorem 2.5.5, the group Aut ( f ) , where f = ( 1 , 0 , 5 ) is in bijective correspondence with the set (group) of solutions of the Pell equation

x 2 20 y 2 = ± 4 . (1)

Every solution of this equation is such that x is even. If we write X = x 2 , Y = y , then ( X , Y ) is a solution of

X 2 5 Y 2 = ± 1 , (2) and the sets of solutions of these two equations are in bijective correspondence.

The solution ( 2 , 1 ) of equation (2) corresponds to the solution ( 4 , 1 ) of (1).

If ( X , Y ) is a solution of (2), so is ( 2 X + 5 Y , X + 2 Y ) , since

( 2 X + 5 Y ) 2 5 ( X + 2 Y ) 2 = ( X 2 5 Y 2 ) .

Define ( X 0 , Y 0 ) = ( 1 , 0 ) , and ( X n + 1 , Y n + 1 ) = ( 2 X n + 5 Y n , X n + 2 Y n ) for all n .

Then X n > 0 , Y n > 0 for all n > 0 , and X n + 1 > 2 X n , thus all these solutions are distinct. Therefore the sets of solutions of (2) or (1) are infinite, and so Aut ( f ) is infinite.

The first positive solutions of (2) are

( 1 , 0 ) , ( 2 , 1 ) , ( 9 , 4 ) , ( 38 , 17 ) , ( 161 , 72 ) ,

corresponding to the solutions

( 2 , 0 ) , ( 4 , 1 ) , ( 18 , 4 ) , ( 76 , 17 ) , ( 322 , 72 ) , .

This gives the automorphisms

I 2 , U = ( 2 5 1 2 ) , U 2 = ( 9 20 4 9 ) , U 3 = ( 38 85 17 38 ) , U 4 = ( 161 360 72 161 ) ,

with

U 1 = ( 2 5 1 2 ) , U 2 ,

The matrices U n with n even are in Aut + ( f ) , which is also infinite. □

User profile picture
2024-06-22 20:39
Comments