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 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.
Suppose is a prime number with and . For each prime number , there is an integer representation
exactly 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 give
by 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. 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 .

Articles by others on the same topic (1)

The class number problem is a central question in algebraic number theory that relates to the properties of the ideal class group of a number field, specifically its class number. The class number is an important invariant that measures the failure of unique factorization in the ring of integers of a number field.