The Approximate Functional Equation, Analytic Conductor, and Convexity Bound
Anchor (Master): Iwaniec-Kowalski 2004 *Analytic Number Theory* (AMS Colloquium 53) Ch. 5 (the canonical treatment of the analytic conductor and the approximate functional equation in the general $L$-function framework); Hardy-Littlewood 1916 *Acta Math.* 41 (originator of the approximate functional equation for $\zeta$); Phragmén-Lindelöf 1908 *Acta Math.* 31 (the convexity principle); Lindelöf 1908 *Bull. Sci. Math.* 32; Titchmarsh 1986 *The Theory of the Riemann Zeta-Function* (2nd ed., Oxford) Ch. 4-5; Iwaniec 2014 *Lectures on the Riemann Zeta Function* (AMS ULECT 62)
Intuition Beginner
The Riemann zeta function only adds up to a finite value when the real part of is bigger than . But the most interesting questions about prime numbers live on the line where the real part of equals , far outside the region where the sum converges. So you face a basic practical problem: how big is at a point like , where the defining sum is useless? You need a finite, computable expression that approximates the value.
The approximate functional equation is the answer. It says that even though the infinite sum does not converge, you can still recover the value by adding up only the first few hundred terms, then adding a second short sum that is a kind of mirror image of the first, weighted by a fixed twisting number. The two short sums together pin down the true value with a tiny error. The length of each sum is roughly the square root of the height you are evaluating at: to reach height , you need about terms in each piece, not infinitely many.
This idea exists because it converts a question about an infinite object into arithmetic with a finite list. Once you have a short finite expression, you can bound its size, and that bound is the convexity estimate: the value of on the critical line cannot grow faster than roughly the fourth root of the height.
Visual Beginner
A picture of the complex plane. The shaded region on the right, where the real part of is bigger than , is labelled "sum converges here." A vertical line at real part is drawn as the critical line. At a point high up that line, marked , two short horizontal brackets are drawn: a left bracket labelled "first sum, about terms" and a right bracket labelled "mirror sum, about terms, twisted by a fixed factor." An arrow connects the two brackets through a box labelled "tiny error."
The picture shows the trade you are making. You cannot sum forever, so you sum a little from the left, a little from the right, and accept a controlled error. The total length of computation grows like , which is what the analytic conductor measures.
Worked example Beginner
Estimate how many terms the approximate functional equation needs to evaluate at , and compare with the naive sum.
Step 1. The height is . The recipe says each of the two short sums runs up to about terms. Compute .
Step 2. Take the square root: . So each sum needs about terms, and the two sums together need about terms.
Step 3. Compare with trying to use the original definition. The defining sum does not even converge at real part , so the naive approach needs infinitely many terms and still fails. Even at a point where the sum did converge, you would need millions of terms to get three digits of accuracy.
What this tells us: the approximate functional equation replaces an impossible infinite computation with adding up about numbers. The work grows only like the square root of the height, which is why this single identity is the workhorse for every numerical and theoretical estimate of on the critical line.
Check your understanding Beginner
Formal definition Intermediate+
Throughout, with . The objects of study are -functions in the axiomatic shape shared by and the Dirichlet -functions studied in 21.03.01 and 06.01.16.
Definition (functional-equation data). An -function in the present sense is a Dirichlet series , absolutely convergent for , together with a completed function
where is the conductor scale, the with are the local parameters, and is the real gamma factor. The data is required to satisfy the functional equation
where has coefficients , and is the root number. For one has , , absorbed into , , and ; the completed function is , entire after removal of the pole.
Definition (analytic conductor). The analytic conductor of at is
It is a smooth, polynomially varying positive quantity that measures the local complexity of at : it combines the arithmetic conductor (through ) with the archimedean data (through the shifted gamma parameters). For at one finds , so on the critical line. The bracket constant keeps and is a normalisation convention; any fixed constant gives an equivalent quantity.
Definition (root number and sign). The root number is the unimodular constant relating to . When the coefficients are real () and the gamma data is self-conjugate, is self-dual and ; the case forces , a central zero of arithmetic significance.
Counterexamples to common slips
"The analytic conductor is the arithmetic conductor of the character." For a Dirichlet -function of modulus , the analytic conductor at is , not . It blends the modulus with the height ; the two enter on the same footing, which is the entire point of packaging them into one quantity. Bounds stated as then specialise to the -aspect ( fixed, ) and the -aspect ( fixed, ) uniformly.
"The approximate functional equation has free to choose, so it is not really an identity." The balancing length is free, but for any admissible the identity holds exactly (with its error term). The optimal choice equalises the two sums; other choices lengthen one sum and shorten the other but never break the identity. Freedom in is a feature exploited in the moment method, not a defect.
"Convexity gives the truth on the critical line." The convexity bound is an upper bound, not an asymptotic. It is provably non-optimal under the Lindelöf hypothesis, which predicts . Any power saving with is a theorem of subconvexity type and is genuinely hard.
Key theorem with proof Intermediate+
The signature result is the convexity bound, derived from the functional equation by the Phragmén-Lindelöf principle. We first record the approximate functional equation, then prove convexity, since the convexity argument is the cleaner consequence of the functional-equation data and the maximum-modulus circle of ideas from 06.01.12.
Theorem (approximate functional equation). Let have functional-equation data as above, with entire (or with the polar contribution subtracted). Fix a holomorphic even test function , normalised by , with rapid decay in vertical strips. For and ,
where are smooth cutoff functions, each for argument and rapidly decaying beyond, defined by the inverse Mellin transforms
The optimal balance truncates both sums at length .
Proof. Consider the contour integral
where . On the line the Dirichlet series for converges absolutely; inserting it and integrating term by term gives, after dividing by ,
since the -integral of is exactly . Now shift the contour from to . The integrand has a simple pole at from the factor , with residue . (If has a pole, the polar terms of contribute additional explicit residues, which is the parenthetical error/main-term adjustment.) Hence
In the shifted integral substitute and apply the functional equation . Writing out and expanding as its Dirichlet series on gives, after dividing through by , the second sum with its smooth cutoff and the explicit prefactor . Equating the two evaluations of yields the stated identity. The cutoffs are for small and for large , for every , by moving the -contour in their Mellin definitions and using the rapid decay of together with Stirling's bound on . Choosing makes the effective ranges of both sums up to logarithmic losses.
Theorem (convexity bound). With the same data, for ,
Proof. Define , the order of growth on the vertical line . For the Dirichlet series is bounded, so . The functional equation rearranges to . By Stirling's formula, as , and in the -aspect. Therefore on we read off in the normalised height , matching from the reflection. Concretely, supplies the two anchor values for and for .
The function is convex. This is the Phragmén-Lindelöf theorem: is holomorphic and of finite order in the strip , with at most polynomial growth on the two boundary lines, so by the maximum-modulus principle applied to for a suitable linear (the unbounded-strip extension of the principle in 06.01.12), is a convex function of on each fixed- scale. Convexity of between the anchors and forces, by linear interpolation,
At this is , which is exactly . The same interpolation, run with the analytic conductor in place of to keep the -aspect uniform, gives the stated -uniform bound.
Bridge. The convexity bound builds toward the subconvexity programme and appears again in every moment computation for -functions: the foundational reason a convexity exponent of is even available is that the functional equation pairs the line with itself, so the two boundary anchors and sit symmetrically about the critical line, and Phragmén-Lindelöf interpolates between them. This is exactly the maximum-modulus principle of 06.01.12 deployed on an unbounded strip, and the central insight is that the gamma factors, through Stirling, convert the reflection into the power that fixes the slope of . Putting these together, the approximate functional equation and the convexity bound are two faces of the same contour shift — one keeps the sums, the other keeps only their size — and both generalise from in 21.03.01 to the full Selberg-class framework that organises 21.13.04 and the Langlands -functions of 21.10.01.
Exercises Intermediate+
Advanced results Master
The convexity exponent as a slope, and where it is beaten
The function is the Lindelöf -function: . It is non-increasing, convex, non-negative, and tends to as [Titchmarsh]. The functional equation gives the exact reflection , so the two anchors () and () determine up to its convex interior. Convexity alone yields the convexity bound on , with the critical value . Every theorem that lowers below is a subconvexity result.
The first subconvexity bound for is the Weyl-Hardy-Littlewood exponent , obtained by bounding the exponential sums appearing in the approximate functional equation through Weyl differencing (van der Corput's method of exponent pairs). Successive refinements — van der Corput, Phillips, Min, Bombieri-Iwaniec 1986, Huxley's discrete-Hardy-Littlewood method — have lowered the exponent to Bourgain's (2017), the current record. The Lindelöf hypothesis is the assertion , equivalent to ; it is implied by the Riemann hypothesis but is strictly weaker.
The general analytic conductor and uniform subconvexity
For a general -function attached to an automorphic representation , the analytic conductor unifies the level, the height , and the archimedean parameters of into a single quantity, and the convexity bound is the uniform statement [Iwaniec-Kowalski 2004]. The strength of the analytic-conductor formulation is that subconvexity in any aspect — the -aspect, the level (conductor) aspect, or the spectral (eigenvalue) aspect — is one and the same inequality , with the aspect determined by which parameter is sent to infinity. The Burgess bound is subconvexity in the -aspect; the Weyl bound is the -aspect; Duke-Friedlander-Iwaniec's amplification method delivers subconvexity in the conductor aspect for -functions.
Why convexity is the natural barrier
The convexity bound is exactly what the functional equation alone can supply: it uses no information about the coefficients beyond their being bounded on average, only the gamma factors, the root number, and the maximum-modulus principle. Subconvexity must therefore exploit cancellation among the — additive cancellation in the exponential sums (van der Corput, Weyl), multiplicative cancellation via the spectral theory of automorphic forms (Kuznetsov, Petersson), or cancellation through the amplification and moment methods. The square-root-of-the-conductor truncation in the approximate functional equation is precisely the threshold at which such cancellation becomes available: each sum has length , and beating the term-by-term bound on each sum is the analytic content of subconvexity.
Synthesis. The approximate functional equation and the convexity bound are the two structural outputs of a single contour shift, and putting these together gives the working geometry of every -function on its critical line. The foundational reason the convexity exponent equals is that the functional equation reflects onto itself, so the Phragmén-Lindelöf interpolation between and deposits exactly at the centre; this is exactly the slope that Stirling's asymptotics for the gamma factors impose, and it generalises verbatim from to the Selberg class and the automorphic -functions of 21.10.01. The central insight is that the analytic conductor is the single scalar in which all of this is uniform: the truncation length is , the convexity ceiling is , and subconvexity is any power saving below it. The bridge is between the maximum-modulus principle of 06.01.12 — a statement in pure complex analysis — and the arithmetic of primes encoded in the coefficients , and the approximate functional equation is dual to the convexity bound in the precise sense that one retains the arithmetic sums while the other retains only their archimedean size. This is the foundational reason that subconvexity, not convexity, is where the arithmetic begins.
Full proof set Master
Proposition (analytic conductor is multiplicative-stable under shifts). For fixed with , with implied constants depending only on the degree and the parameters .
Proof. By definition . For each , the triangle inequality gives , and likewise . Hence
since and for . Taking the product over the factors, the ratio lies in .
Proposition (cutoff functions are smooth and rapidly decaying). The function satisfies as and as , for every , uniformly for in the strip with .
Proof. For large , move the contour to . No pole is crossed (the integrand is holomorphic for since has its pole at ), so . On this line , the ratio is bounded by via Stirling (Proposition above plus the Stirling asymptotic for ), contributes , and decays rapidly making the integral converge; the total is , and with rescaling absorbs the into the truncation length, giving in the effective variable. For small , move the contour to , crossing the simple pole at with residue ; the remaining integral on is by the same estimate with the sign of reversed. Hence . The evenness and normalisation are what make the residue exactly .
Proposition (convexity is sharp for the gamma factors). On the lines and the convexity bound is attained in order of magnitude: , so and are exact, not merely upper bounds.
Proof. From Exercise 4, with the asymmetric functional-equation factor, and for . On , is bounded above and below by absolute constants times powers of (the Dirichlet series and its zero-free region), so exactly. On , the functional equation combined with and (up to logs) gives , so exactly. The interior bound is therefore the genuine convexity ceiling, and the open question is whether it is attained — Lindelöf says it is not.
Connections Master
The convexity bound is the maximum-modulus principle of
06.01.12applied on an unbounded vertical strip: the Phragmén-Lindelöf extension converts the two boundary growth rates into the interior interpolation , so the entire convexity exponent is a complex-analytic fact about holomorphic functions of finite order, with the arithmetic entering only through the gamma factors.The approximate functional equation specialises the functional equation of from
21.03.01and06.01.16: the same completed function and its symmetry are the input to the contour shift, so this unit is the quantitative companion to the qualitative functional equation proved there.The analytic conductor and the convexity-subconvexity dichotomy extend to the automorphic -functions of the Langlands programme in
21.10.01: the degree- gamma factor is exactly the archimedean local factor of an automorphic representation, and subconvexity in the conductor aspect is a central tool in the arithmetic applications (equidistribution, the subconvexity-to-Duke-theorem pipeline).
Historical & philosophical context Master
The approximate functional equation originates with Hardy and Littlewood, who in their 1916 Acta Mathematica memoir [Hardy-Littlewood 1916] proved that in the critical strip is well approximated by two truncated Dirichlet sums of lengths and with , replacing Riemann-Siegel-type contour estimates with an explicit finite expression. The Riemann-Siegel formula, recovered by Siegel in 1932 from Riemann's unpublished Nachlass, refined the error term and remains the basis of large-scale numerical verification of the Riemann hypothesis.
The convexity bound rests on the Phragmén-Lindelöf principle, established by Phragmén and Lindelöf in their 1908 Acta Mathematica paper [Phragmén-Lindelöf 1908] as an extension of the maximum-modulus principle to unbounded regions under a growth hypothesis. In the same year Lindelöf [Lindelöf 1908] introduced the function measuring the order of on vertical lines, proved its convexity, and formulated the hypothesis now bearing his name. The convexity bound is the immediate corollary; the gap between and the conjectured has driven a century of work in exponential sums and, since the 1990s, in the spectral theory of automorphic forms.
The analytic-conductor formulation is due to Iwaniec and Kowalski, whose 2004 Colloquium volume [Iwaniec-Kowalski 2004] placed the conductor at the centre of the analytic theory, unifying the -aspect, level aspect, and spectral aspect into a single scalar and stating convexity and subconvexity uniformly across all aspects. The reframing turned a collection of aspect-specific estimates into instances of one inequality.
Bibliography Master
@article{HardyLittlewood1916,
author = {Hardy, G. H. and Littlewood, J. E.},
title = {Contributions to the theory of the Riemann zeta-function and the theory of the distribution of primes},
journal = {Acta Mathematica},
volume = {41},
year = {1916},
pages = {119--196},
note = {Originator of the approximate functional equation for zeta}
}
@article{PhragmenLindelof1908,
author = {Phragm\'en, E. and Lindel\"of, E.},
title = {Sur une extension d'un principe classique de l'analyse et sur quelques propri\'et\'es des fonctions monog\`enes dans le voisinage d'un point singulier},
journal = {Acta Mathematica},
volume = {31},
year = {1908},
pages = {381--406},
note = {The maximum-modulus principle for unbounded strips}
}
@article{Lindelof1908,
author = {Lindel\"of, E.},
title = {Quelques remarques sur la croissance de la fonction $\zeta(s)$},
journal = {Bulletin des Sciences Math\'ematiques},
volume = {32},
year = {1908},
pages = {341--356},
note = {The function mu(sigma) and the Lindelof hypothesis}
}
@book{Titchmarsh1986,
author = {Titchmarsh, E. C.},
title = {The Theory of the Riemann Zeta-Function},
publisher = {Oxford University Press},
edition = {2nd, revised by D. R. Heath-Brown},
year = {1986},
note = {Ch. 4 (approximate functional equation), Ch. 5 (order of zeta, Lindelof hypothesis)}
}
@book{IwaniecKowalski2004,
author = {Iwaniec, Henryk and Kowalski, Emmanuel},
title = {Analytic Number Theory},
publisher = {American Mathematical Society},
series = {Colloquium Publications},
volume = {53},
year = {2004},
note = {Ch. 5: analytic conductor, approximate functional equation, convexity}
}
@book{Iwaniec2014,
author = {Iwaniec, Henryk},
title = {Lectures on the Riemann Zeta Function},
publisher = {American Mathematical Society},
series = {University Lecture Series},
volume = {62},
year = {2014},
note = {Modern lecture treatment of the approximate functional equation and moments}
}