21.13.02 · number-theory / dirichlet-l-functions-characters

Siegel's Theorem on the Exceptional Zero

shipped3 tiersLean: none

Anchor (Master): Davenport 2000 *Multiplicative Number Theory* 3e §21-22 (the full two-$L$-function proof, ineffectivity, the class-number bound $h(-d) \gg_\varepsilon d^{1/2-\varepsilon}$, the Brauer-Siegel theorem stated); Iwaniec-Kowalski 2004 *Analytic Number Theory* (AMS Colloquium Publications 53) §5.9, §22 (the Landau-Siegel zero, the contrast with Goldfeld-Gross-Zagier); Siegel 1935 *Acta Arithmetica* 1; Goldfeld 1976 *Ann. Scuola Norm. Sup. Pisa*; Gross-Zagier 1986 *Invent. Math.* 84

Intuition Beginner

The zero-free region of 21.13.01 left one stubborn gap: for -functions built from a real-valued character, a single real zero might creep up dangerously close to the line where the real part equals one. The closer sits to one, the worse our control over primes in arithmetic progressions, and the smaller a certain quantity becomes. Siegel's theorem is the strongest known promise that this cannot happen too badly: it says the zero must stay a measurable distance back from one, and equivalently that can never be too small.

The promise has a strange and famous flaw. Siegel's proof argues by cases. Either some real character already has a zero very close to one, or none does. In the first case, that one bad character can be used as a lever to push every other character's zero back. In the second case, there was never a problem to begin with. Either way the conclusion holds — but the argument never tells you which case you are in, because nobody has ever found a single one of these bad zeros. The constant in the bound therefore cannot be computed. We know a number exists; we cannot write it down.

This is the price of the theorem. Siegel gives a strong bound with an invisible constant, while an earlier and weaker bound of Page came with a constant you could actually use. The same invisible constant haunts the consequence Siegel really wanted: a lower bound on the class number of imaginary quadratic fields, the count that measures how badly unique factorisation fails. Gauss had asked whether this count grows; Siegel proved it grows nearly like the square root of the discriminant, but could not say how fast.

Visual Beginner

Picture two real characters as two players, each owning one -function with one possible exceptional zero sitting just left of the line "real part ". Siegel's argument links them: if either player's zero sits very close to the line, that closeness becomes a tool to force the other player's zero back, and to bound the other player's value from below.

situation what Siegel's proof does constant
some character has a near-one zero use it to bound all the others exists but unknown
no character has a near-one zero the bound is direct and clean could be computed
we do not know which holds conclusion holds regardless not computable

The two branches both reach the same conclusion. The reason the constant stays invisible is the bottom row: the proof works without ever deciding the top two rows, and that undecided choice is exactly where the computable constant leaks away.

Worked example Beginner

See how a lower bound on turns into a lower bound on a class number, with concrete numbers, using the Dirichlet class-number formula with for .

Step 1. Take the discriminant , so . Suppose Siegel's bound, at , hands us with (pretend) . Then , so .

Step 2. Plug into the class-number formula with : $$ h(-d) = \frac{2 \cdot 100 \cdot L(1, \chi)}{2\pi} = \frac{100 \cdot L(1, \chi)}{\pi} \geq \frac{100 \cdot 0.1}{\pi} = \frac{10}{\pi} \approx 3.18. $$ Since the class number is a whole number, .

Step 3. Compare with the exponent. Siegel's bound says . The pretend constant gave a weaker numerical floor of here, but the shape is what matters: as grows the floor climbs without bound.

What this tells us: a lower bound on the single number converts, through one multiplication by , into a lower bound on the class number. The catch is Step 1: the constant is the invisible one Siegel cannot compute, so the floor "" is real only in principle, not as a number you could certify for this exact .

Check your understanding Beginner

Formal definition Intermediate+

Throughout, is a real primitive Dirichlet character modulo as in 21.03.02, its -function, the possible exceptional (Siegel) zero of 21.13.01, , and the Riemann zeta function. The notation means " a positive constant depending on times", and denotes such a constant. We follow Davenport [Davenport §21].

Definition (Siegel bound). A real primitive character modulo satisfies the Siegel bound with parameter if $$ L(1, \chi) > c(\varepsilon), q^{-\varepsilon} $$ for a positive . By the relation from 21.13.01, this is equivalent to the exceptional-zero bound .

Definition (effective versus ineffective constant). A constant in such a bound is effective if a finite procedure produces a numerical value of it from alone; otherwise it is ineffective. Siegel's is ineffective for : the proof establishes without a procedure to compute it. Page's bound of 21.13.01 has an effective constant but a weaker rate.

Definition (auxiliary product). For two real primitive characters modulo and modulo (possibly equal), the auxiliary product is $$ F(s) = \zeta(s), L(s, \chi_1), L(s, \chi_2), L(s, \chi_1\chi_2). $$ Its Dirichlet coefficients are non-negative: with and , because is the Dedekind-type zeta function of the genus character data and its logarithm has non-negative coefficients .

Definition (class number, imaginary quadratic). For a fundamental discriminant with Kronecker character and roots of unity ( for ), the class number of is given by the Dirichlet class-number formula $$ h(-d) = \frac{w\sqrt{d}}{2\pi}, L(1, \chi_{-d}). $$

The symbols , , , , , the auxiliary product , , and the regulator used below are recorded in _meta/NOTATION.md.

Counterexamples to common slips

  • "Siegel's bound is effective because the statement names a definite function ." Naming a function does not make it computable. The proof produces via a case-split on the existence of an exceptional zero; the value is determined only once that existence is decided, which it never is for .
  • "Page's bound and Siegel's bound are the same strength up to constants." They differ in rate, not just constant: Page gives , Siegel gives . For the latter is far larger, so Siegel pushes much further from — but loses the computable constant Page keeps.
  • "Siegel's class-number bound determines the list of discriminants." It does not, precisely because it is ineffective: it shows the list is finite but cannot bound the largest member. Identifying the nine Heegner discriminants required separate effective methods (Heegner, Baker, Stark), and the effective growth came later from Goldfeld-Gross-Zagier.

Key theorem with proof Intermediate+

The signature result is Siegel's lower bound, proved by the auxiliary product of two -functions and the dichotomy of 21.13.01.

Theorem (Siegel, 1935). For every there is a constant such that for every real primitive character modulo , $$ L(1, \chi) > c(\varepsilon), q^{-\varepsilon}. $$ The constant is ineffective for .

Proof. Fix . Let be a real primitive character modulo , and let be any real primitive character modulo , with non-principal. Form , whose Dirichlet coefficients are non-negative with , as established for the analogous repulsion product in 21.13.01. The function is holomorphic except for a simple pole at with residue .

By a contour argument applied to the non-negative-coefficient series , for any there is an absolute constant such that $$ F(\sigma_0) \geq 1 - \frac{c_1 \lambda}{1 - \sigma_0}(q_1 q_2)^{c_2(1 - \sigma_0)}, $$ because the truncated Dirichlet polynomial of exceeds its leading term while the pole at contributes the negative correction , the conductor entering through the functional-equation bound on the remainder. Now invoke the dichotomy of 21.13.01.

Case A: some real primitive has an exceptional zero with . Fix this once and for all; it depends only on . Since , evaluating at gives , so the displayed inequality forces . Because is fixed and small, , and . Rearranging, $$ L(1, \chi_2) \gg \frac{(1 - \beta_1)}{(\log q_2)^2}, q_2^{-\varepsilon/2} \gg_\varepsilon q_2^{-\varepsilon}, $$ the constant depending on the fixed .

Case B: no real primitive character has an exceptional zero with . Then for the given , take any auxiliary with non-principal; evaluating at , the absence of a zero of to the right of keeps , and the same inequality, now with fixed, yields , whence after absorbing the bounded factors .

In both cases , and was an arbitrary real primitive character, so the bound holds for all of them. The constant is ineffective because the proof does not decide which case obtains: in Case A the constant depends on the value of a zero whose existence is hypothesised but never exhibited, and one cannot certify that Case B holds without ruling out every exceptional zero.

Bridge. Siegel's theorem builds toward the Siegel-Walfisz theorem on primes in arithmetic progressions and appears again in 21.13.03, where the ineffective constant propagates into the range of uniform validity. The foundational reason the two--function product works is exactly the non-negativity of its coefficients, , the same device that gave Landau's repulsion in 21.13.01: this is exactly the repulsion phenomenon used in reverse, where a near-one zero of one character is converted into a lower bound for another. The central insight is that the case-split is unavoidable, and putting these together the bridge is the dichotomy itself — an exceptional zero, if it exists, is a lever; if it does not, there was nothing to bound — and the ineffectivity is the structural cost of never deciding the lever's existence, which generalises into every consequence the theorem touches.

Exercises Intermediate+

Advanced results Master

Theorem 1 (Siegel's lower bound, sharp form). For every there is an ineffective with for all real primitive modulo [Siegel 1935]. Equivalently for the exceptional zero. The exponent cannot be replaced by any explicit function tending to while keeping the constant effective; the boundary is where ineffectivity sets in, since for the effective Page bound already suffices.

Theorem 2 (the dichotomy made quantitative). The proof of Theorem 1 turns on the alternative of 21.13.01: either (A) some real primitive character has , in which case is a fixed lever bounding for every other through the auxiliary product ; or (B) no such zero exists, in which case the same product with gives the bound directly [Davenport §21]. The two constants disagree, and no algorithm selects between them.

Theorem 3 (class number of imaginary quadratic fields). For fundamental , the Dirichlet class-number formula converts Theorem 1 into [Davenport §21]. This settled Gauss's conjecture that , but ineffectively: the finiteness of the set follows, while its determination — the nine Heegner discriminants — required the independent effective methods of Heegner (1952), Baker (1966), and Stark (1967).

Theorem 4 (Brauer-Siegel). For a sequence of number fields of fixed degree with , [Iwaniec-Kowalski §22]. The residue of at , equal to by the analytic class-number formula, is squeezed between bounds whose lower side is a Siegel-type ineffective estimate; the imaginary-quadratic case recovers Theorem 3.

Theorem 5 (effective Goldfeld-Gross-Zagier bound). There is an effectively computable constant with [Goldfeld 1976; Gross-Zagier 1986]. Goldfeld reduced an effective bound to the existence of a modular elliptic curve whose -function vanishes to order at ; Gross-Zagier's height formula for the Heegner point exhibits such a curve, removing the undecided case and yielding a computable constant — at the cost of the far weaker logarithmic rate.

Synthesis. Siegel's theorem is the foundational reason the analytic theory of primes in arithmetic progressions is uniform at all, and the central insight is that the non-negativity of the auxiliary product converts the repulsion of 21.13.01 into a lower bound: a near-one zero of one character is exactly the lever that bounds another, and this is exactly the same coefficient positivity that forbade two near-one zeros from coexisting. Putting these together, the dichotomy generalises the single-character exceptional-zero theory into a two-character argument, and the bridge is the residue : bounding it below bounds below, which is dual to the class-number formula , so the analytic statement is the arithmetic one. The central insight recurs in the contrast with Goldfeld-Gross-Zagier: Siegel's ineffectivity is the shadow of an undecided case, and the only known route to an effective constant trades the strong power rate for a weak logarithmic one by exhibiting, rather than hypothesising, the analytic object that does the bounding — the high-order zero of an elliptic curve -function supplied by the Heegner-point height. This is dual to Gauss's original effectively-open class-number problem: the same that measures the exceptional zero measures the class number, and the entire quantitative theory is written in the conditional mood the Siegel zero imposes.

Full proof set Master

Proposition 1 (non-negativity of the auxiliary coefficients). For real primitive characters with non-principal, the Dirichlet series has coefficients with .

Proof. Taking logarithms over the Euler product, . The bracket equals since each is real-valued in . Hence has non-negative coefficients, so is a Dirichlet series with non-negative coefficients, and therefore also has non-negative coefficients (the exponential of a non-negative-coefficient series, via the convolution exponential, preserves non-negativity). The constant term is .

Proposition 2 (lower bound from non-negativity and the pole). With as above, residue at , and , there are absolute with .

Proof. Smooth Perron with the Gamma kernel gives, for , $$ \sum_n a_n n^{-\sigma_0} e^{-n/X} = F(\sigma_0) + \lambda,\Gamma(1 - \sigma_0) X^{1 - \sigma_0} + \frac{1}{2\pi i}\int_{(\sigma_0 - 2 - \sigma_0)} F(s + \sigma_0)\Gamma(s) X^s, ds. $$ The left side is at least by non-negativity of the . The shifted integral, on the line , is bounded using the convexity estimate from the functional equations of the four factors and the rapid decay of ; it contributes . Thus . Choosing and using near yields .

Proposition 3 (Case A lever bound). If a fixed real primitive has with small, then for every real primitive with non-principal.

Proof. Evaluate Proposition 2 at . Since makes , the inequality forces , i.e. . Now with and both bounded above (the upper bound is elementary). Therefore , the fixed absorbed into the -constant. Taking gives .

Proposition 4 (ineffectivity). The constant in produced by Propositions 1-3 is ineffective for .

Proof. The bound is proved by the alternative: if some real primitive character has a zero , fix it as the lever in Proposition 3, obtaining a constant depending on ; if none does, Proposition 2 at gives an explicit constant. The two constants are not equal, and the constant delivered by the proof is the one from the branch that actually holds. To name it one must either exhibit (impossible: no exceptional zero is known) or prove no exceptional zero exists with (open: this is the Landau-Siegel zero problem). Since neither sub-problem is solved for , no finite procedure outputs a numerical ; the existence is all that is proved. For , Page's effective bound of 21.13.01 already gives an explicit constant, so ineffectivity is confined to .

Connections Master

  • The exceptional-zero dichotomy, the auxiliary product , Landau's repulsion, and Page's effective bound are all imported from 21.13.01; this unit consumes that infrastructure and runs the repulsion in reverse — where 21.13.01 used coefficient non-negativity to show two near-one zeros cannot coexist, Siegel uses the same product to convert one hypothetical near-one zero into a lower bound for every other .

  • The Dirichlet -function , its Euler product, functional equation, and the boundary non-vanishing all come from 21.03.02; Siegel's theorem is the quantitative refinement of that non-vanishing, replacing the qualitative with the explicit lower order , and the class-number formula that converts the -value into an arithmetic invariant lives in the same character-theoretic chapter.

  • Siegel's ineffective constant propagates into the Siegel-Walfisz theorem of 21.13.03 on primes in arithmetic progressions uniform for ; the modulus range and the ineffectivity of its implied constant are direct inheritances from the bound proved here, making this unit the analytic bottleneck for uniform PNT in progressions.

  • The effective zero-free region for of 21.12.03 is the specialisation of the region whose real-character defect Siegel's theorem repairs; together with 21.13.01 it shows how the same pole-budget method governs both the effective region and the ineffective -function exceptional-zero theory, the contrast between them being precisely the conjugate-symmetry loophole for real characters.

Historical & philosophical context Master

Carl Ludwig Siegel proved the bound in a three-page 1935 paper in Acta Arithmetica [Siegel 1935], whose explicit aim was the class number of imaginary quadratic fields: Gauss had conjectured in the Disquisitiones Arithmeticae of 1801 that as , and Siegel's bound proved it with a near-optimal rate. The auxiliary-product argument refined Landau's 1918 repulsion idea, turning the mutual repulsion of exceptional zeros into a positive lower bound. Richard Brauer extended the residue analysis to general number fields, giving the Brauer-Siegel theorem , which subsumes Siegel's result as the imaginary-quadratic case, where the regulator is .

The ineffectivity was understood from the start as structural rather than technical: the proof selects a favourable case keyed to the existence of an exceptional zero, and that existence remains undecided. The consequence — that Siegel's bound cannot determine the list of one-class discriminants — left the Gauss class-number-one problem open until Heegner (1952), Baker (1966), and Stark (1967) settled it by independent effective means. The first effective lower bound on growing with came only in 1976-1986: Dorian Goldfeld [Goldfeld 1976] reduced effectivity to the existence of an -function with a triple zero at the central point, and Benedict Gross and Don Zagier [Gross-Zagier 1986] supplied one via their height formula for Heegner points, yielding the effective but weak . The Landau-Siegel zero problem — eliminating the exceptional zero outright, which would make Siegel's theorem effective with its strong rate — remains among the central open problems of analytic number theory.

Bibliography Master

@article{siegel1935classenzahl,
  author  = {Siegel, Carl Ludwig},
  title   = {\"{U}ber die Classenzahl quadratischer Zahlk\"{o}rper},
  journal = {Acta Arithmetica},
  volume  = {1},
  pages   = {83--86},
  year    = {1935}
}

@article{goldfeld1976,
  author  = {Goldfeld, Dorian},
  title   = {The class number of quadratic fields and the conjectures of Birch and Swinnerton-Dyer},
  journal = {Annali della Scuola Normale Superiore di Pisa, Classe di Scienze (4)},
  volume  = {3},
  number  = {4},
  pages   = {624--663},
  year    = {1976}
}

@article{grosszagier1986,
  author  = {Gross, Benedict H. and Zagier, Don B.},
  title   = {Heegner points and derivatives of $L$-series},
  journal = {Inventiones Mathematicae},
  volume  = {84},
  number  = {2},
  pages   = {225--320},
  year    = {1986}
}

@book{davenport2000siegel,
  author    = {Davenport, Harold},
  title     = {Multiplicative Number Theory},
  edition   = {3},
  series    = {Graduate Texts in Mathematics},
  volume    = {74},
  publisher = {Springer-Verlag},
  year      = {2000},
  note      = {Revised by H. L. Montgomery; \S21--22: Siegel's theorem and the class number}
}

@book{iwaniec-kowalski2004siegel,
  author    = {Iwaniec, Henryk and Kowalski, Emmanuel},
  title     = {Analytic Number Theory},
  series    = {American Mathematical Society Colloquium Publications},
  volume    = {53},
  publisher = {American Mathematical Society},
  year      = {2004},
  note      = {\S5.9, \S22: the Landau-Siegel zero and the Goldfeld-Gross-Zagier bound}
}

@book{montgomery-vaughan2007siegel,
  author    = {Montgomery, Hugh L. and Vaughan, Robert C.},
  title     = {Multiplicative Number Theory I: Classical Theory},
  series    = {Cambridge Studies in Advanced Mathematics},
  volume    = {97},
  publisher = {Cambridge University Press},
  year      = {2007},
  note      = {\S11: Siegel's theorem and the Siegel-Walfisz theorem}
}