\( \def\C{\mathbb C} \def\R{\mathbb R} \def\Z{\mathbb Z} \def\Q{\mathbb Q} \def\F{\mathbb F} \def\smash{} \def\phantomplus{} \def\nobreak{} \def\omit{} \def\hidewidth{} \renewcommand{\mathnormal}{} \renewcommand{\qedhere}{} \renewcommand{\o}{\phi} \def\sp{^} \def\sb{_} \def\vrule{|} \def\hrule{} \def\dag{\dagger} \def\llbracket{[\![} \def\rrbracket{]\!]} \def\llangle{\langle\!\langle} \def\rrangle{\rangle\!\rangle} \def\sssize{\scriptsize} \def\mathpalette{} \def\mathclap{} \def\coloneqq{\,:=\,} \def\eqqcolon{\,=:\,} \def\colonequals{\,:=\,} \def\equalscolon{\,=:\,} \def\textup{\mbox} \def\makebox{\mbox} \def\vbox{\mbox} \def\hbox{\mbox} \def\mathbbm{\mathbb} \def\bm{\boldsymbol} \def\/{} \def\rq{'} \def\lq{`} \def\noalign{} \def\iddots{\vdots} \def\varint{\int} \def\l{l} \def\lefteqn{} \def\slash{/} \def\boxslash{\boxminus} \def\ensuremath{} \def\hfil{} \def\hfill{} \def\pmod#1{~(\mathrm{mod}~#1)} \def\dasharrow{\dashrightarrow} \def\eqno{\hskip 50pt} \def\curly{\mathcal} \def\EuScript{\mathcal} \def\widebar{\overline} \newcommand{\Eins}{\mathbb{1}} \newcommand{\textcolor}[2]{#2} \newcommand{\textsc}[1]{#1} \newcommand{\textmd}[1]{#1} \newcommand{\emph}{\text} \newcommand{\uppercase}[1]{#1} \newcommand{\Sha}{{III}} \renewcommand{\setlength}[2]{} \newcommand{\raisebox}[2]{#2} \newcommand{\scalebox}[2]{\text{#2}} \newcommand{\stepcounter}[1]{} \newcommand{\vspace}[1]{} \newcommand{\displaybreak}[1]{} \newcommand{\textsl}[1]{#1} \newcommand{\cline}[1]{} \newcommand{\prescript}[3]{{}^{#1}_{#2}#3} \def\llparenthesis{(\!\!|} \def\rrparenthesis{|\!\!)} \def\ae{a\!e} \def\nolinebreak{} \def\allowbreak{} \def\relax{} \def\newline{} \def\iffalse{} \def\fi{} \def\func{} \def\limfunc{} \def\roman{\mathrm} \def\mathbold{\mathbf} \def\mathscr{\mathit} \def\bold{\mathbf} \def\dvtx{\,:\,} \def\widecheck{\check} \def\spcheck{^\vee} \def\sphat{^{{}^\wedge}} \def\degree{{}^{\circ}} \def\tr{tr} \def\defeq{\ :=\ } \newcommand\rule[3][]{} \newcommand{\up}[1]{\textsuperscript{#1}} \newcommand{\textsuperscript}[1]{^{#1}} \newcommand{\fracwithdelims}[4]{\left#1\frac{#3}{#4}\right#2} \newcommand{\nicefrac}[2]{\left. #1\right/#2} \newcommand{\sfrac}[2]{\left. #1\right/#2} \newcommand{\discretionary}[3]{#3} \newcommand{\xlongrightarrow}[1]{\xrightarrow{\quad #1\quad}} \def\twoheadlongrightarrow{ \quad \longrightarrow \!\!\!\!\to \quad } \def\xmapsto{\xrightarrow} \def\hooklongrightarrow{\ \quad \hookrightarrow \quad \ } \def\longlonglongrightarrow{\ \quad \quad \quad \longrightarrow \quad \quad \quad \ } \def\rto{ \longrightarrow } \def\tto{ \longleftarrow } \def\rcofib{ \hookrightarrow } \def\L{\unicode{x141}} \def\niplus{\ \unicode{x2A2E}\ } \def\shuffle{\ \unicode{x29E2}\ } \def\fint{{\LARGE \unicode{x2A0F}}} \def\XXint#1#2#3{\vcenter{\hbox{$#2#3$}}\kern-0.4cm} \newcommand{\sym}{\mathrm{sym}} \newcommand{\ext}{\mathrm{ext}} \newcommand{\spin}{\mathrm{spin}} \newcommand{\tr}{\mathrm{tr}} \newcommand{\A}{{\mathbb A}} \newcommand{\Q}{{\mathbb Q}} \newcommand{\Z}{{\mathbb Z}} \newcommand{\R}{{\mathbb R}} \newcommand{\C}{{\mathbb C}} \newcommand{\idm}{{1}} \newcommand{\HH}{\mathcal H} \newcommand{\p}{\mathfrak p} \newcommand{\OF}{{\mathfrak o}} \newcommand{\GL}{{\rm GL}} \newcommand{\PGL}{{\rm PGL}} \newcommand{\SL}{{\rm SL}} \newcommand{\SO}{{\rm SO}} \newcommand{\Symp}{{\rm Sp}} \newcommand{\Sp}{{\rm Sp}} \newcommand{\GSp}{{\rm GSp}} \newcommand{\PGSp}{{\rm PGSp}} \newcommand{\sgn}{{\rm sgn}} \newcommand{\St}{{\rm St}} \newcommand{\triv}{{\mathbf1}} \newcommand{\K}[1]{{\rm K}(\p^{#1})} \newcommand{\Kl}[1]{{\rm Kl}(\p^{#1})} \newcommand{\Si}[1]{{\rm Si}(\p^{#1})} \newcommand{\para}{K^{\rm para}} \newcommand{\val}{{\rm val}} \newcommand{\GSO}{{\rm GSO}} \newcommand{\GO}{{\rm GO}} \newcommand{\Ind}{{\rm Ind}} \newcommand{\ind}{{\rm ind}} \renewcommand{\P}{\mathfrak{P}} \renewcommand{\Hom}{{\rm Hom}} \newcommand{\SSp}{{\rm Sp}} \newcommand{\mat}[4]{{\setlength{\arraycolsep}{0.5mm}\left[ \begin{array}{cc}#1 & #2\\#3 & #4\end{array}\right]}} \newcommand{\forget}[1]{} \newcommand{\nl}{ \vspace{2ex}} \newcommand{\nll}{ \vspace{1ex}} \def\qdots{\mathinner{\mkern1mu\raise0pt\vbox{\kern7pt\mbox{.}}\mkern2mu \raise3.4pt\mbox{.}\mkern2mu\raise7pt\mbox{.}\mkern1mu}} \renewcommand{\labelenumi}{\roman{enumi})} \renewcommand{\labelenumii}{\alph{enumii})} \)

Section 1Introduction

An \(L\)-function is a Dirichlet series that converges absolutely in some right half plane, has a meromorphic continuation to a function of order \(1\), with finitely many poles, satisfies a functional equation, and admits an Euler product. For example, the (incomplete) \(L\)-functions attached to tempered, cuspidal automorphic representations, or the Hasse-Weil \(L\)-functions attached to non-singular, projective, algebraic varieties defined over a number field, conjecturally satisfy these conditions.

In this paper, using standard techniques from analytic number theory, we prove a strong multiplicity one result for such \(L\)-functions (without reference to any underlying automorphic or geometric object). We closely follow the work of Kaczorowski and Perelli [12] and we redo their arguments for two reasons. First, our results are more general in that they have slightly weaker hypotheses. Second, we think that the techniques should be better known, especially to those who study \(L\)-functions automorphically.

One of the defining axioms for the class of \(L\)-functions we consider is the existence of an Euler product. There exists a number \(d\), called the degree of the \(L\)-function, such that the local Euler factor is of the form \(Q_p(p^{-s})^{-1}\), where \(Q_p(X)\) is a polynomial satisfying \(Q_p(0)=1\), and \(Q_p(X)\) has degree \(d\) for almost all primes. We say that a given \(L\)-function satisfies the Ramanujan conjecture, if the roots of \(Q_p\) are of absolute value at least \(1\), for all \(p\).

The multiplicity one results we discuss in this paper are statements which assert that if two \(L\)-functions are sufficiently close, then they must be equal. A model example is:

The precise conditions on the functional equation and Euler product are described in Section 2.1. A weaker version of Theorem 1.1, requiring equality of the local Euler factors instead of the \(p\)th Dirichlet coefficients, is given in  [24]. Theorem 1.1 is also a consequence of the main result in  [12]. The result we will actually prove, Theorem 2.2.1, is stronger. First, instead of requiring equality of the \(p\)th Dirichlet series coefficients, we only require that they are close on average. Second, the Ramanujan hypothesis can be slightly relaxed.

We will present three applications of strong multiplicity one for \(L\)-functions. The first application is to cuspidal automorphic representations of \(\GL(n,\A_\Q)\), where \(\A_\Q\) denotes the ring of adeles of the number field \(\Q\). Any such representation \(\pi\) factors as \(\pi=\otimes\pi_p\), where \(\pi_p\) is an irreducible admissible representation of \(\GL(n,\Q_p)\) (we mean \(\Q_p=\R\) for \(p=\infty\)). Attached to \(\pi\) is an automorphic \(L\)-function \(L(s,\pi)\), whose finite part is \(L_{{\rm fin}}(s,\pi) = \prod_{p < \infty} L(s, \pi_p)\). The completion of \(L_{{\rm fin}}(s,\pi)\) is known to be "nice", and hence \(L_{{\rm fin}}(s,\pi)\) is the kind of function to which Theorem 1.1 applies. At almost all primes \(p\) we have \(L(s,\pi_p)=\det(1-A(\pi_p)p^{-s})^{-1}\), where \(A(\pi_p)={\rm diag}(\alpha_{1,p},\ldots,\alpha_{n,p})\) is a diagonal matrix whose entries are the Satake parameters at \(p\). The Ramanujan conjecture is the assertion that each \(\pi_p\) is tempered, which in this context implies that \(|\alpha_{j,p}|=1\). In particular note that \(L(s,\pi_p)\) is a polynomial in \(p^{-s}\) and this polynomial has all its roots on the unit circle.

An easy consequence of Theorem 1.1 is the following.

Most statements of strong multiplicity one in the literature are phrased in terms of \(A(\pi_p)\) and \(A(\pi_p')\) being conjugate, instead of the much weaker condition of the equality of their traces. Using the stronger version of Theorem 1.1, we will in fact prove a stronger result which only requires that the traces are close enough on average; see Theorem 3.1.1 for the precise statement.

Our second application is to Siegel modular forms of degree \(2\). For such modular forms Weissauer [31] has proved the Ramanujan conjecture. The Dirichlet coefficients \(a_i(p)\) appearing in Theorem 1.1 are essentially the Hecke eigenvalues for the Hecke operator \(T(p)\). We therefore have the following:

The remarkable fact here is that the Hecke operator \(T(p)\) alone does not generate the local Hecke algebra at \(p\). This Hecke algebra is generated by \(T(p)\) and \(T(p^2)\). The fact that the coincidence of the eigenvalues for \(T(p)\) is enough is of course a global phenomenon. Using the result of [25], we see that if Böcherer's conjecture is true then not only are the Hecke eigenvalues of \(F_1, F_2\) in Theorem 1.3 equal but we get \(F_1 = F_2\). Again, using the averaged version of Theorem 2.2.1, we can prove a stronger result; see Theorem 3.2.1.

Our third application concerns the Hasse-Weil zeta function of hyperelliptic curves; see Proposition 3.4.1. This Proposition is in a similar spirit to those mentioned above. Assuming the \(L\)-functions satisfy a functional equation of a form they are expected to satisfy, we can apply our analytic theorems to prove a result about the underlying (in this case) geometric object.

Now that we have described the consequences of our main result, we briefly compare our result to other "analytic" strong multiplicity one results due to Murty and Murty [18], Murty [17], Kaczorowski and Perelli [12] and Kaczorowski [11]. Roughly speaking, these earlier versions of strong multiplicity one place more and more conditions on the two \(L\)-function. In [18], one can find the hypothesis that \(a_1(p)=a_2(p)\) and \(a_1(p^2)=a_2(p^2)\), in [17] it is assumed that \(a_1(p)=a_2(p)\) and some conditions on the twists of the \(L\)-functions. Later, in [12], the conditions on the twists of the \(L\)-functions is replaced with the assumption that the \(L\)-functions have Euler products of a form similar to what we assume.

We highlight a few notable differences between these earlier versions of strong multiplicity one and ours, making a more thorough comparison between the version by Kaczorowski [11] as it is the most recent and is closest to our version. There are a couple of ways in which our version is stronger. First, in [11] it is assumed that the \(L\)-functions satisfy the Ramanujan bound while we only assume a partial Ramanujan bound. Second, [11] requires the coefficients to be close in the sense \(|a_1(p)-a_2(p)|\ll p^{-\frac12 -\delta}\) for some \(\delta>0\), while we allow \(\delta=0\). In the proof, our result requires an analysis of possible zeros on the \(\sigma=\frac12\)-line, while this is avoided if \(\delta>0\). Finally, the main corollaries of our result do not follow if one requires \(\delta>0\). Despite these differences, the method of proof is similar, being closely based on  [12].

The most salient difference between this paper and the papers with the earlier versions of strong multiplicity one is that we have applications in mind. We prove a number of, to us, very remarkable consequences of this analytic result, as indicated above. The applications are of broad interest, lie in different areas of number theory and we include the proofs of the analytic results for completeness and to expose these techniques to as broad an audience as possible.

Subsection Notation

We review some notation from analytic number theory for completeness. Given two functions \(f(x),\,g(x)\),

  • we write \(f(x)\sim g(x)\) as \(x\to\infty\) if \(\lim_{x\to\infty} f(x)/g(x)=1\);
  • we write \(f(x) \ll g(x)\) as \(x \to \infty\) if there exists \(C>0\) and \(x_0>0\) so that if \(x > x_0\) then \(|f(x)| \leq C |g(x)|\); this is also written as \(f(x)=\mathcal{O}(g(x))\) as \(x\to\infty\).

In this paper we drop the phrase "as \(x\to\infty\)" when using the above notation.