Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 3.5.7 (There are finitely many classes if the discriminant is a positive perfect square)

Exercise 3.5.7 (There are finitely many classes if the discriminant is a positive perfect square)

Let f ( x , y ) be a quadratic form whose discriminant d is a positive perfect square. Show that f is equivalent to a form a x 2 + bxy + c y 2 for which c = 0 and 0 a < | b | . Deduce that there are only finitely many equivalence classes of form of this discriminant.

Hint. Recall Problem 3 in this section and Problem 9 of Section 3.4.

Answers

Proof.

(a)
Let f ( x , y ) = A x 2 + Bxy + C y 2 be a quadratic form whose discriminant d 0 is a perfect square, so that d = δ 2 > 0 for some positive integer δ . By Problem 3.4.9, there are integers h 1 , k 1 , h 2 , k 2 such that f ( x , y ) = ( h 1 x + k 1 y ) ( h 2 x + k 2 y )

(read again the second solution of Problem 3.4.9).

Then ( h 1 , k 1 ) ( 0 , 0 ) , otherwise f = 0 and d = 0 . Thus h 1 k 1 0 , and f ( k 1 , h 1 ) = 0 , therefore

f ( k 1 h 1 k 1 , h 1 h 1 k 1 ) = 0 .

Put x 0 = k 1 h 1 k 1 , y 0 = h 1 h 1 k 1 . Then f ( x 0 , y 0 ) = A x 0 2 + B x 0 y 0 + C y 0 2 = 0 , and x 0 y 0 = 1 , so that 0 is properly represented by f .

By Problem 3, there are integers u , v such that A = ( x 0 u y 0 v ) Γ . Put g = f A , i.e.

g ( x , y ) = f ( x 0 x + uy , y 0 x + vy ) = A ( x 0 x + uy ) 2 + B ( x 0 x + uy ) ( y 0 x + vy ) + ( y 0 x + vy ) 2 = ( A x 0 2 + B x 0 y 0 + C y 0 2 ) x 2 + rxy + s y 2 ,

where r , s are integers.

Since f ( x 0 , y 0 ) = A x 0 2 + B x 0 y 0 + C y 0 2 = 0 , we obtain g ( x , y ) = rxy + s y 2 , that is g = ( 0 , r , s ) .

(Alternatively, we can apply the result of Problem 4 to n = 0 .)

For any integer k , g T k = ( 0 , r , rk + s ) (recall that T = ( 1 1 0 1 ) and ( a , b , c ) T k = ( a , b + 2 ak , a k 2 + bk + c ) ).

Since d 0 , then r 0 , thus we can choose k such that 0 rk + s < | r | . Put a = rk + s , and b = r . For this value of k , h = g T k = ( 0 , b , a ) , and 0 a < | b | .

Finally put q = h S , where S = ( 0 1 1 0 ) . Then q = ( a , b , 0 ) , i.e.

q ( x , y ) = a x 2 + bxy ,

and q is properly equivalent to f .

In conclusion, f is properly equivalent to a form q ( x , y ) = a x 2 + bxy + c y 2 for which c = 0 and 0 a < | b | .

(b)
The discriminant of q is b 2 , and b is equivalent to f , thus b 2 = d = δ 2 , so b = ± δ . Moreover 0 a < | b | = δ . Hence there are finitely many forms ( a , b , 0 ) of discriminant d satisfying 0 a < | b | . Since every form of discriminant d is properly equivalent to such a form by part (a), there are only finitely many equivalence classes of form of this discriminant.

Note: We can prove that 0 is properly represented by f without using the not so easy Problem 9 of Section 4.

If A = 0 , then 0 = f ( 1 , 0 ) .

If A 0 , then

4 Af ( x , y ) = ( 2 Ax + By ) 2 δ 2 y 2 = ( 2 Ax + ( B δ ) y ) ( 2 Ax + ( B + δ ) y ) ,

thus f ( x 1 , y 1 ) = 0 , where x 1 = B + δ , y 1 = 2 A 0 . Therefore f ( x 0 , y 0 ) = 0 , where x 0 = x 1 ( x 1 y 1 ) , y 0 = y 1 ( x 1 y 1 ) , so that x 0 y 0 = 1 . This shows that 0 is properly represented by f . The remaining of the proof in part (a) shows that f is equivalent to the form q ( x , y ) = x ( ax + by ) . This gives a third proof of Problem 3.4.9

User profile picture
2024-11-18 09:27
Comments