Let with or . A reduced positive definite binary quadratic form of discriminant of a binary quadratic form satisfiesConsequently every reduced form can be found by a finite search:
- choose ;
- choose with ;
- put and retain ;
- on or , retain only .
To count the class number of a negative discriminant, additionally retain only primitive binary quadratic forms, those with . Otherwise the search also lists imprimitive forms. For example, gives and , but only the first is primitive, so . This distinction is essential when turning an enumeration into a class-number claim.
The reduced positive definite binary quadratic form bounds and imply . Enumerating and using the nonnegative boundary sign convention gives the four triples . Thus the number of reduced forms is four.
The reduced-form bound leaves . Checking and the boundary sign convention gives precisely the displayed forms. The middle one is imprimitive and represents the prime two. Odd represented primes are or modulo eight by the discriminant criterion for prime representation by a binary quadratic form. The first form represents only modulo eight among odd integers, and the last only , so a prime is represented by exactly when it is modulo eight.
For negative discriminant , a reduced positive definite binary quadratic form satisfies and odd with . Checking leaves only under the boundary convention. The reduction algorithm for a positive definite binary quadratic form therefore puts every form in this one proper equivalence class. Its unimodular shears give infinitely many distinct forms .
The reduced positive definite triples are , and . The imprimitive middle form represents only even numbers; the two last forms have identical value sets after reversing one variable.
At discriminant of a binary quadratic form , the reduced positive definite binary quadratic forms are exactlyThe enumeration of reduced binary quadratic forms bound gives . For , the required odd and the divisibility leave precisely those two triples after the boundary sign convention. Both are primitive, so .
For a prime number , represents exactly when both Legendre symbols and are one; represents exactly when both are minus one. The square-completion identitiesprove the necessary signs modulo five and seven: four is a square at both primes, whereas twelve is a quadratic nonresidue at both.
For sufficiency, either matching sign pair gives by quadratic reciprocity. The discriminant criterion for prime representation by a binary quadratic form then supplies a primitive form of discriminant representing . It reduces to one of the two listed forms, and their distinct sign conditions determine which. For example, , whereas .
For odd prime to 35, proper representation by a positive definite binary quadratic form of discriminant is equivalent to being a square modulo every prime divisor of . A primitive representing vector extends to a determinant-one integer matrix, producing a form with leading coefficient and middle coefficient satisfying . Conversely this congruence constructs such a form. Its local roots lift to prime powers and combine by the Chinese remainder theorem. Every class reduces to one of and . The condition is local at each prime divisor; a product Jacobi symbol equal to one alone is insufficient.
Articles by others on the same topic
There are currently no matching articles.