Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 3.5.13 ($H(d) = \sum_{r>0,\, r^2 \mid d} h(d/r^2)$)

Exercise 3.5.13 ($H(d) = \sum_{r>0,\, r^2 \mid d} h(d/r^2)$)

A binary quadratic form a x 2 + bxy + c y 2 is called primitive if g . c . d . ( a , b , c ) = 1 . Prove that if a x 2 + bxy + c y 2 is a form of discriminant d and r = g . c . d . ( a , b , c ) then ( a r ) x 2 + ( b r ) xy + ( c r ) y 2 is a primitive form of discriminant d r 2 . If d is not a perfect square, let h ( d ) denote the number of classes of primitive forms with discriminant d . Prove that H ( d ) = h ( d r 2 ) where the sum is over all positive integers r such that r 2 d .

Answers

Proof. Let f ( x , y ) = a x 2 + bxy + c y 2 be a form of discriminant d = b 2 4 ac and r = gcd ( a , b , c ) . We suppose that f 0 , so that r 0 .

Then a = rA , b = rB , c = rC , where A , B , C are integers satisfying gcd ( A , B , C ) = 1 , because r = a b c = rA rB rc = r ( A B C ) , so A B C = 1 . Then g ( x , y ) = ( a r ) x 2 + ( b r ) xy + ( c r ) y 2 = A x 2 + Bxy + C y 2 is a form of discriminant D = B 2 4 AC = d r 2 , and this form is primitive since A B C = 1 .

For every integer d such that d is not a perfect square, let Cl ( d ) denote the set of classes of of forms of discriminant d , and let P ( d ) denote the set of classes of primitive forms of discriminant d (these forms are supposed definite positive if d < 0 ).

Let C r be the set of classes of forms f ( x , y ) = a x 2 + bx + cy of discriminant d such that a b c = r (this makes sense because the discriminant and the g.c.d. of the coefficients does not depend on the choice of a representative of the class by Problem 11).

Then

Cl ( d ) = r C r ,

this union being a disjoint union. If r = a b c , then r > 0 , and r a , r b , r c , thus r 2 d = b 2 4 ac . So C r = if these conditions are not satisfied. This gives

Cl ( d ) = r > 0 , r 2 d C r . (1)

Consider now, for r > 0 , r 2 d , the map

φ { C r P ( d r 2 ) f ¯ : f ( x , y ) = a x 2 + bxy + c y 2 g ¯ : g ( x , y ) = ( a r ) x 2 + ( b r ) xy + ( c r ) y 2 ,

which sends the class f ¯ of f ( x , y ) = a x 2 + bxy + c y 2 on the class g ¯ of g ( x , y ) = ( a r ) x 2 + ( b r ) xy + ( c r ) y 2 , where r = a b c .

We show first that this map is well defined. If f + f , where f ( x , y ) = a x 2 + b xy + c y 2 , then r = a b c = a b c (Problem 11). There is a matrix A = ( α β γ δ ) Γ such that f = f A , i.e.

f ( x , y ) = f ( αx + βy , γx + δy ) .

If g ( x , y ) = ( a r ) x 2 + ( b r ) xy + ( c r ) y 2 , then

g ( x , y ) = ( 1 r ) ( a x 2 + b xy + c y 2 ) = ( 1 r ) [ a ( αx + βy ) 2 + b ( αx + βy ) ( γx + δy ) + c ( γx + δy ) 2 ] = ( a r ) ( αx + βy ) 2 + ( b r ) ( αx + βy ) ( γx + δy ) + ( c r ) ( γx + δy ) 2 ) = g ( αx + βy , γx + δy ) .

Therefore g = g A + g , thus g ¯ does not depend on the choice of the representative f of f ¯ , and so φ is well defined.

Moreover, φ is a bijection, whose reciprocal bijection sends the class of the primitive form A x 2 + Bxy + C y 2 on the class of rA x 2 + rBxy + rC y 2 in C r . This shows that

| C r | = | P ( d r 2 ) | .

Then the equality (1) gives

H ( d ) = | Cl ( d ) | = r > 0 , r 2 d | C r | = r > 0 , r 2 d | P ( d r 2 ) | = r > 0 , r 2 d h ( d r 2 ) .

So

H ( d ) = r > 0 , r 2 d h ( d r 2 ) .

User profile picture
2024-11-22 10:00
Comments