A binary quadratic form is a quadratic form in two variables, written or . In number theory an integral binary quadratic form has integer polynomial coefficients . It represents an integer when for some integers .
The homogeneous polynomial identity distinguishes a form from a general quadratic polynomial with constant or linear terms. The discriminant of a binary quadratic form is . For example, has and represents , while has and represents at .
Changing integer coordinates can conceal the same arithmetic. Substituting into gives . The transformation has determinant one and an integer inverse, so both forms represent exactly the same integers. Proper equivalence of binary quadratic forms records this reversible change, and the reduction algorithm for a positive definite binary quadratic form chooses a small representative for each such equivalence class.
A prime number has an integer representation exactly when or . The case three is , and two is impossible.
For necessity when , reducing the equation modulo three gives . The value cannot be zero, so it is one.
Conversely, for , the quadratic character of minus three shows that is a quadratic residue modulo . Thus the discriminant criterion for prime representation by a binary quadratic form produces a positive definite form of discriminant representing . It is primitive because .
Enumeration of reduced binary quadratic forms gives only and at discriminant : the bound is , and the integrality and boundary conditions leave those two. The second is imprimitive, so proper equivalence carries the representing form to . This proves sufficiency. Examples are and .
Let be an integral ideal of an imaginary quadratic number field and an integral basis of . Its normalized norm is a positive definite binary quadratic form. An unramified rational prime is represented by this form exactly when there is an integral prime ideal of norm with . Indeed, a representation gives an element with , so is integral of norm . Conversely, with produces a representation by expressing in the basis. Artin reciprocity then detects this ideal class by Frobenius in the Hilbert class field.
Let be an odd prime and let be an integer congruent to zero or one modulo four. Some integral binary quadratic form of discriminant of a binary quadratic form represents if and only if is a square modulo .
For necessity, a representing vector must have , since a common divisor greater than one would make its square divide . Bézout's identity completes this vector to the first column of a determinant-one integer matrix. Under that proper equivalence, the leading polynomial coefficient becomes , so the transformed form is . Its discriminant gives .
Conversely, choose a root modulo and adjust its parity so . Adding changes parity because is odd. Thenhas integer polynomial coefficients, discriminant and value at . If , it is positive definite. If , it is also a primitive binary quadratic form: a common divisor of its coefficients would have to be , contradicting .
The conclusion concerns some form, not every form of that discriminant. For , the construction gives , which represents three. The same-discriminant form does not represent three. Deciding the particular form requires the proper equivalence classes, not only the local square test. When , imprimitive forms can occur, so primitiveness must be checked separately.
Integral binary quadratic forms and are properly equivalent ifThe matrix has integer entries and determinant one. Its inverse also has integer entries, so the change is a bijection of the integer lattice. Consequently and represent the same integers, and the discriminant of a binary quadratic form is unchanged.
Allowing determinant minus one as well gives the broader equivalence under unimodular matrices. Proper equivalence retains orientation. For example, the shear is proper and takes to . The reflection instead has determinant minus one and takes to ; those two forms need not be properly equivalent. This distinction matters when counting the class number of a negative discriminant.
An integral binary quadratic form is primitive when . This condition concerns its polynomial coefficients, rather than the values of a particular representing pair. For example, is primitive, while has a common divisor two and represents only even integers.
Primitivity is invariant under proper equivalence. Expanding an integer change of variables expresses every new polynomial coefficient as an integer linear combination of the old ones, so every common divisor of the old coefficients divides the new ones. The integer inverse gives the converse. Their greatest common divisor, called the content, is therefore unchanged.
A primitive representation separately means in . Even a primitive form can have nonprimitive representations: for . A representation of a prime number, however, must use a coprime pair, since a common divisor would force to divide that prime. This observation drives the discriminant criterion for prime representation by a binary quadratic form.
The discriminant of a binary quadratic form is . For integer polynomial coefficients, is congruent to zero or one modulo four. Completing the square givesThus for real polynomial coefficients with , positive definiteness holds exactly when . For the form is an indefinite quadratic form, taking values of both signs; for it is degenerate. For example, has , whereas has .
Over the real numbers, use the symmetric matrix . Its determinant is . An integer coordinate change gives , soIn particular unimodular matrices preserve , proving its invariance under proper equivalence. Changes with other determinants can change the discriminant. For instance, replacing by takes to and multiplies by four. The chosen half-coefficient matrix convention matters in this calculation.
An integral binary quadratic form with and negative discriminant of a binary quadratic form is reduced whenwith the additional convention whenever or . These inequalities bound the polynomial coefficients without changing the represented integers.
Every proper equivalence class of positive definite forms has exactly one reduced representative with this boundary convention. For primitive binary quadratic forms, this is the classical reduction theorem; the general case follows by dividing by the common content, which is invariant under proper equivalence.[ref]
Binary Quadratic Forms and the Ideal Class Group by Seth Viren Neel. §2.2, Definition 1 and Theorem 2.3, printed p. 5: primitive positive definite reduction and uniqueness
The sign rule removes actual duplicates. A shear takes to , and the determinant-one rotation takes to . Keeping the nonnegative middle polynomial coefficient chooses one boundary copy. For example, is not reduced; the reduction algorithm for a positive definite binary quadratic form takes it back to .
For a positive definite integral binary quadratic form with discriminant of a binary quadratic form , choose an integer so that lies in . The determinant-one shear givesThe last polynomial coefficient is also . If , use the determinant-one rotation to replace the form by , and repeat.
Each rotation strictly decreases the positive integer leading polynomial coefficient. Thus only finitely many rotations occur. At termination, . The chosen interval already gives when ; if and , one final rotation changes its sign. Every step preserves proper equivalence and the discriminant of a binary quadratic form, so this constructs a reduced positive definite binary quadratic form.
For example, start with , of discriminant of a binary quadratic form . Taking gives . Rotate to , then take again to obtain . The coefficients can shrink dramatically while the represented integers remain unchanged. Using a plain swap of variables would instead have determinant minus one; the sign in the rotation keeps every step proper.
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.
A class number problem asks which number field or order in a number field has a prescribed class number. The family is part of the question: fixing the value alone does not specify the degree, discriminant or type of field.
For imaginary quadratic fields, it becomes a problem about negative fundamental discriminants and the class number of a negative discriminant . Allowing nonfundamental discriminants instead includes an order in a number field smaller than the full ring of integers. A reduced positive definite binary quadratic form and the enumeration of reduced binary quadratic forms make each fixed negative-discriminant case an explicit finite calculation.
For example, class number one for discriminant minus sixty-seven proves by exhausting the reduced coefficient possibilities. In a number field, class number one means every ideal of the ring of integers is principal, so the ring is a principal ideal domain. This connects a numerical classification with the arithmetic question of whether ideal obstructions to unique factorization remain. A computation for one discriminant does not by itself classify all discriminants of that class number.
For a negative discriminant of a binary quadratic form or , the class number of a negative discriminant counts proper equivalence classes of primitive binary quadratic forms that are positive definite and have discriminant .
Uniqueness of the reduced positive definite binary quadratic form in each class makes this the number of reduced primitive forms. Enumeration of reduced binary quadratic forms proves finiteness and gives an explicit procedure. For example, , represented by , while , with the four forms listed under reduced positive definite binary quadratic forms of discriminant minus thirty-nine.
Imprimitive forms do not enter . At , the reduced form has content two, so the three reduced forms listed under reduced forms of discriminant minus thirty-two contribute only two primitive classes. If is a fundamental discriminant, this form class number agrees with the class number of the imaginary quadratic field of discriminant . For nonfundamental , the associated order in a number field need not be the full ring of integers, so that distinction must be retained.
For an odd prime , the formsare primitive binary quadratic forms of discriminant of a binary quadratic form . Their diagonal polynomial coefficients are positive, so they are positive definite, and makes both satisfy the reduced positive definite binary quadratic form inequalities.
Their proper equivalence classes are distinct. The first represents one at , but the second has minimum positive value two: if , , while and give at least two. Since proper equivalence preserves represented integers, the two forms cannot be equivalent.
Thus . If the class number of a negative discriminant is exactly two, these are all its primitive proper classes. That completeness hypothesis is the reason a local square test can select one specific form in prime representation when h of minus eight q equals two.
Suppose is a prime number with and . For each prime number , there is an integer representationexactly when and as a Legendre symbol.
Necessity follows directly. Modulo , is a nonzero square. Since is odd, is odd, so modulo eight the value is one when is even and seven when is odd, using .
Conversely, the two conditions giveby quadratic reciprocity and the second supplementary law for quadratic reciprocity. The discriminant criterion for prime representation by a binary quadratic form therefore gives a primitive positive definite form of discriminant representing .
By two distinguished classes of discriminant minus eight q and the hypothesis , it reduces to or . Any odd value of the second form has odd , and is three or five modulo eight. It cannot represent this , so the first form must. For , the two reduced forms of discriminant are and ; the permitted prime seven is .
Let be a positive odd integer with distinct prime factors. Thenwhere is the class number of a negative discriminant.
Assign each complete prime power in the prime factorization of to one of two factors . There are ordered integer factorizations with coprime factors. Interchanging and pairs them without a fixed pair, because and coprime equal factors would both be one. Thus there are unordered pairs.
Each pair gives the primitive binary quadratic form of discriminant of a binary quadratic form . It is a reduced positive definite binary quadratic form, so distinct pairs give distinct equivalence classes under proper equivalence by uniqueness of the reduced positive definite binary quadratic form. This proves the lower bound. For the excluded case , the separate value also satisfies the weaker numerical inequality .
Articles by others on the same topic
There are currently no matching articles.