Class Numbers of Imaginary Quadratic Fields

Q: Why is the imaginary case easier than the real case?

Because the unit group is finite, so the regulator is 1 and the class number is isolated. In the real case the analytic formula constrains only the product hR, so neither can be determined without the other.

Q: How accurate must the L-value be?

Accurate enough that the error is provably below one half after multiplication by the prefactor. Since the prefactor grows like √|D|, the required relative accuracy in the L-value tightens as |D| grows.

Q: Does enumeration give the group structure directly?

It gives every element, so composing them determines the structure. In practice one composes reduced forms to find element orders and assembles the abelian group from those — more work than counting, but the same enumeration underlies both.

Executive summary

The easiest class group in the subject, and still not easy

Imaginary quadratic fields have unit rank 0, so the regulator is trivial and the class number stands alone — the only setting in the subject where it can be computed without simultaneously computing a unit group. Enumerating reduced forms is exact and costs about √|D|; the analytic formula is much faster but delivers a real number that must be rounded, so it needs an error bound. Beyond about 20 digits, only sub-exponential methods remain.

Learning objectives

Count class numbers by enumerating reduced forms.
Apply the analytic class number formula with a controlled error bound.
Choose a method appropriate to the size of the discriminant.
State the Gauss class number problem and its resolution.

Section 01Counting reduced forms

Every class contains exactly one reduced form, and a reduced form satisfies |b| ≤ a ≤ c with a ≤ √(|D|/3). Enumeration is therefore a finite double loop.

AlgorithmClass number by enumerationin: D < 0 → out: the exact class number h(D)

Set h ← 0. For b from 0 (or 1) to √(|D|/3), matching the parity of D:
Set q ← (b² − D)/4. This must be a positive integer; the parity condition guarantees it.
For each divisor a of q with b ≤ a ≤ √q:
Set c ← q/a. If gcd(a, b, c) ≠ 1, skip — the form is imprimitive.
Increment h by 1, or by 2 if 0 < b < a < c (counting the form with −b).
Return h.

It gives the structure too

Enumeration produces every reduced form, so composing them reveals the group structure, not merely the order. That is more information than the analytic method provides, and it is often what is actually wanted.

Section 02The analytic formula

For D < −4 the class number is given by

h(D) = (w√|D| / 2π) L(1, χ_D)

with w the number of roots of unity (2 except for D = −3, −4) and χ_D the Kronecker character. The L-value is computed from a rapidly convergent series, and the result is rounded to the nearest integer.

Rounding needs a proven error bound

The formula gives a real number. Rounding it is valid only if the truncation error is provably below 1/2 — and for large |D| that requires many terms. Unconditional error bounds are weak; under GRH far fewer terms suffice. A class number obtained this way inherits whatever conditionality its error bound carries.

Method selection by discriminant size
Range of \|D\|	Method	Character
Up to about 10⁸	Enumeration of reduced forms	Exact, unconditional, also gives structure
Up to about 10¹⁶	Analytic formula with error bound	Fast; conditional if a GRH bound is used
Up to about 10²⁰	Shanks baby-step giant-step	O(\|D\|^1/4); gives the group structure
Beyond	Sub-exponential (McCurley, Buchmann)	L[1/2] complexity; conditional on GRH

Section 03The Gauss class number problem

Gauss conjectured that h(D) → ∞ as D → −∞, and asked for the complete list of discriminants with each small class number. The case h = 1 has exactly nine solutions.

1934Heilbronn and LinfootProved h(D) → ∞, and that at most one further discriminant with h = 1 could exist beyond the nine known — an ineffective result, giving no bound on where it might be.
1952 / 1967Heegner, Baker and StarkThe class number one problem resolved: exactly nine discriminants, −3, −4, −7, −8, −11, −19, −43, −67, −163.
1980sGoldfeld, Gross and ZagierAn effective lower bound for h(D), via the arithmetic of elliptic curves — making complete determination for small h a finite computation.
1990s onwardComplete lists for small hThe full lists for each small class number were established computationally on the back of the effective bound.

Why −163 is famous

Because h(−163) = 1, the value exp(π√163) is within 10⁻¹² of an integer. This is not a numerical accident but a consequence of complex multiplication: the j-invariant of the corresponding curve is a rational integer exactly because the class number is 1.

ReferenceFrequently asked questions

Why is the imaginary case easier than the real case?

Because the unit group is finite, so the regulator is 1 and the class number is isolated. In the real case the analytic formula constrains only the product hR, so neither can be determined without the other.

How accurate must the L-value be?

Accurate enough that the error is provably below one half after multiplication by the prefactor. Since the prefactor grows like √|D|, the required relative accuracy in the L-value tightens as |D| grows.

Does enumeration give the group structure directly?

It gives every element, so composing them determines the structure. In practice one composes reduced forms to find element orders and assembles the abelian group from those — more work than counting, but the same enumeration underlies both.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Class Numbers of Imaginary Quadratic Fields. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Class Numbers of Imaginary Quadratic Fields as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—class, number, quadratic, imaginary, fields—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Class Numbers of Imaginary Quadratic Fields?