Class number of a negative discriminant Created 2026-09-24 Updated 2026-11-05
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.
Coprime-factorization lower bound for a quadratic-form class number Created 2026-09-24 Updated 2026-11-05
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 .
Discriminant criterion for prime representation by a binary quadratic form Created 2026-10-05 Updated 2026-11-05
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.
Enumeration of reduced binary quadratic forms Created 2026-09-24 Updated 2026-11-05
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.
Reduced positive definite binary quadratic form Created 2026-09-24 Updated 2026-11-05
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 .
Two distinguished classes of discriminant minus eight q Created 2026-09-24 Updated 2026-11-05
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.