Exercise 3.7.6

Determine all primitive representations of 3 by a form of discriminant 3 by the same method that was used in Example 3.1.3.

Answers

Proof. Here Δ = 3 and p = 3 . Using Proposition 3.4.5, we obtain R ( Δ , p ) = R ( 3 , 3 ) = 33 + 1 = 1 , and

F ( Δ , p ) = F ( 3 , 3 ) = { ( 3 , b ( 3 , 3 ) , c ( 3 , 3 ) ) Γ } .

From (3.10), we obtain b ( 3 , 3 ) = 3 and c ( 3 , 3 ) = 1 , therefore

F ( 3 , 3 ) = { ( 3 , 3 , 1 ) Γ } .

Write f = ( 3 , 3 , 1 ) . Then 3 = f ( 1 , 0 ) gives a primitive representation of 3 by f . Since 3 is prime, all representations of 3 by f are primitive. By Proposition 2.6.2, there is only one equivalence class of proper representations of 3 by f .

Here Aut ( f ) is the set of matrices U ( f , x , y ) (see (2.20)), given by

U ( f , x , y ) = ( x 3 y 2 y 3 y x + 3 y 2 ) ,

where x , y are the roots of x 2 + 3 y 2 = 4 , that is

( x , y ) { ( 1 , 1 ) , ( 1 , 1 ) , ( 1 , 1 ) , ( 1 , 1 ) , ( 2 , 0 ) , ( 2 , 0 ) } .

By Exercise 2.9.9, these solutions form a cyclic group of order 6 generated by ( 1 , 1 ) . Thus Aut ( f ) = U , where

U = ( 1 1 3 2 ) .

This gives

Aut ( f ) = { ( 1 0 0 1 ) , ( 1 1 3 2 ) , ( 2 1 3 1 ) , ( 1 0 0 1 ) , ( 1 1 3 2 ) , ( 2 1 3 1 ) } ,

All (primitive) representations of 3 by f = ( 3 , 3 , 1 ) are given by the first column of these matrices. This gives

± ( 1 , 0 ) , ± ( 1 , 3 ) , ± ( 2 , 3 ) .

Verification: f ( 1 , 3 ) = 3 9 + 8 = 3 , f ( 2 , 3 ) = 12 18 + 9 = 3 .

Note: As f = ( 3 , 3 , 1 ) + ( 1 , 1 , 1 ) , we can determine all representations of 3 by ( 1 , 1 , 1 ) . That is Exercise 2.9.11. □

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