Exercise 3.7.5 (Number of automorphisms)

Show that for any given d < 0 , the primitive positive definite quadratic forms of discriminant d all have the same number of automorphs.

Answers

Following modern authors, I will say “automorphisms of forms” rather than “automorphs”.

Proof. Let Aut ( f ) denote the group of automorphisms of a form f . Then w ( f ) = | Aut ( f ) | is the order of this group. Consider two primitive positive definite quadratic forms f = ( a , b , c ) and g = ( a , b , c ) of same discriminant d , so that

d = b 2 4 ac = b 2 4 a c < 0 .

  • If w ( f ) = 4 , then by Theorem 3.26, a = c and b = 0 . Since f is primitive and positive definite, a = c = 1 , so f ( x , y ) = x 2 + y 2 . Then d = 4 . Since H ( 4 ) = h ( 4 ) = 1 , all forms of discriminant 4 are properly equivalent to f , so g + f . By Theorem 2.36,

    w ( f ) = w ( g ) = 4 .

  • If w ( f ) = 6 , then the same theorem shows that a = b = c . Since f is primitive and positive definite, a = b = c = 1 , so f ( x , y ) = x 2 + xy + y 2 , and d = 3 . By Problem 3, H ( 3 ) = h ( 3 ) = 1 , so g + f , and by Theorem 3.26

    w ( f ) = w ( g ) = 6 .

  • If w ( f ) 4 and w ( f ) 6 , then w ( f ) = 2 . Assume, for the sake of contradiction, that w ( g ) = 4 or w ( g ) = 6 . Then, by the first two items applied to g , w ( f ) = w ( g ) { 4 , 6 } , which is false. Therefore

    w ( f ) = w ( g ) = 2 .

For any given d < 0 , the primitive positive definite quadratic forms of discriminant d all have the same number of automorphisms. □

User profile picture
2024-12-07 11:43
Comments