Summer tutorial notes. Section 2.2, Definition 1 and Theorem 2.3 state primitive positive definite reduction and uniqueness; the following argument bounds the reduced coefficients. The primitive-form hypotheses must be retained when counting a class number of a negative discriminant.
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.
Class number problem Created 2026-10-03 Updated 2026-11-05
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.
Let be a positive odd integer with distinct prime factors. Then
where 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 .
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 satisfies
Consequently 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.
Two integral binary quadratic forms are properly equivalent when one is obtained from the other by a change of variables in . For a negative discriminant , the class number of binary quadratic forms is the number of proper equivalence classes of primitive positive-definite forms of discriminant .
If properly represents , then for coprime . Extend to a matrix in ; after the associated variable change, the coefficient of is , so the transformed form is
The converse follows by evaluating this form at .
Such a form has discriminant precisely when
so it exists exactly when . Thus is properly represented by some form of discriminant exactly when is a square modulo .
Now let . If is composite for , it has a prime divisor , and
Conversely, if is a square modulo for a prime , choose an odd square root with . Then and , so that value is composite.
Finally, reduction theory says that every nonprincipal positive-definite class of discriminant has a reduced representative whose leading coefficient has a prime divisor for which is a square modulo . Conversely such a prime produces a represented form not equivalent to the principal form . Combining this with the preceding equivalence gives
Write an integral binary quadratic form as
A positive definite form is a reduced positive definite binary quadratic form when
with on the boundary or . The class number of a negative discriminant is the number of proper equivalence classes of primitive positive definite integral forms of discriminant .
Every such class has a reduced representative. For a reduced form,
so
There are only finitely many possible integers and , and then
is determined. Hence . There is at least one class: the principal form is
and
Thus , in agreement with the enumeration of reduced binary quadratic forms.
Now let be prime. The two forms
are primitive, positive definite, reduced, and have discriminant . They are not properly equivalent: represents one, while the least positive value of is two. Therefore
Assume henceforth that , so these are the only two classes. If
for a prime , then is odd and
Moreover , so is a quadratic residue modulo . This proves the necessity.
Conversely, suppose and is a quadratic residue modulo . By quadratic reciprocity, these two conditions imply
Indeed, for both relevant signs are positive, while for the signs from and reciprocity with cancel. Choose an even integer such that
Then
is a primitive positive definite integral form of discriminant and represents . It belongs to one of the two classes .
The second form cannot represent such a prime. If
then is odd and, since ,
This contradicts . Hence lies in the principal class , and proper equivalence of binary quadratic forms preserves represented integers. Therefore
This is the prime representation when h of minus eight q equals two.
A reduced positive definite binary quadratic form satisfies
with when either or . For or , the class number of a negative discriminant is the number of proper equivalence classes of primitive positive definite integral forms of discriminant , equivalently the number of their reduced representatives.
Write
Partitioning the complete prime-power factors between and gives ordered factorizations with . After identifying with , there are choices with . Each gives the primitive reduced form
whose discriminant is . The uniqueness of reduced representatives makes these classes distinct, proving the coprime-factorization lower bound for a quadratic-form class number
The inequality can be strict. For , there is one distinct prime factor, while the reduced primitive forms of discriminant are
Thus .
Proper equivalence of binary quadratic forms Created 2026-09-24 Updated 2026-11-05
Integral binary quadratic forms and are properly equivalent if
The 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.
Two distinguished classes of discriminant minus eight q Created 2026-09-24 Updated 2026-11-05
For an odd prime , the forms
are 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.