Processing math: 100%

Wednesday, June 11, 2014

How to compute with elliptic curve L-functions and estimate analytic rank

In a previous post I defined what an elliptic curve L-function LE(s) is, and indicated why the behaviour of the function at the central point s=1 is of such great interest: the order of vanishing of LE(s) at s=1 is conjecturally precisely equal to the algebraic rank of E.

Because this equality is still conjectural, we will cal the former quantity -- then number of derivitaves of LE(s) that vanish at s=1 - the analytic rank of E. The topic of this post is to address the question: given an elliptic curve E, how do we go about computing its analytic rank?

Before we can hope to answer this question, we need to know how to evaluate LE(s) itself for any given s. In the previous post I gave both the Euler product and Dirichlet series definitions for LE(s); to jog your memory, here's the Euler product of LE(s):
LE(s)=p(1apps+ϵpp2s)1,

where the product runs over all prime numbers, ap=p+1#{E(Fp)}, and ϵp=0 if p divides the conductor of E and 1 otherwise. The Dirichlet series is LE(s)=nanns, which is precisely what you get when you multiply out the Euler product. Note that we are suppresing the dependence on E in both the an and ϵp constants.

However, both the Euler product and Dirichlet series representations of LE(s) will only converge absolutely when the real part of s exceeds 32. Although the Sato-Tate Conjecture (now a theorem, but the name has stuck) implies that the expansions will in fact converge conditionally for s>12, the convergence is so slow that attempting to evaluate LE(s) near the central point by multiplying or summing enough terms is horribly inefficient. As such, we need a better way to evaluate LE(s) - and thankfully, such better ways do indeed exit.

Remember how I mentioned in the previous post that L-functions obey a very nice symmetry condition? Well, here's that condition exactly: first, we need to define something called the completed L-function ΛE(s). This is just LE(s) multiplied by some extra factors. Specifically,
ΛE(s)=Ns2(2π)sΓ(s)LE(s),

where N is the conductor of E and Γ(s) is the usual Gamma function on C (the one that gives you (n1)! when you evaluate it at the positive integer s=n).

We can show that ΛE(s) is entire on C; that is, it doesn't have any poles. Moreover, ΛE(s) obeys the glorious symmetry property
ΛE(s)=wEΛE(2s),

where wE is either 1 or 1 and depends on E. This is called the functional equation for the L-function attached to E.

Another way to put it is that shifted completed L-function ΛE(1+s) is either an even or an odd function of s. Because the factors Ns2, (2π)s and Γ(s) are all readily computable, this allows us to determine the value of LE(s) when the real part of s is less than 12.

What's left, then, is to figure out how to efficinetly evaluate LE(s) in the strip 12(s)32. This is called the critical strip for the L-function, and it is here that the behaviour of the function is most interesting.

[Aside: we can, for example, show that ΛE(1+s) is never zero outside of the critical strip. The Generalized Riemann Hypothesis in fact asserts that elliptic curve L-functions are only ever zero along the exact center of this strip, the critical line (s)=1. We'll get back to the zeros of elliptic curve L-functions in a later post.]

To evaluate ΛE(s) in the critical strip, we make use of the modularity of E. The modularity theorem states that elliptic curves are modular: for every elliptic curve E over the rationals there exists a weight 2 cuspidal eigenform fE of level N (where N is precisely the conductor of E), such that the an of E as defined previously equal the Fourier coefficients of fE. If you haven't studied modular forms before, the crucial piece of knowledge is that there is a natural procedure for constructing L-functions from modular forms in such a way that the definition makes sense for all complex inputs s, and that the L-function attached to the cusp form fE will exactly equal the elliptic curve L-function LE(s). This is in fact how we show that elliptic curve L-functions can be analytically continued to all of C.

The take-away is that via modularity there is an infinite sum representation for LE(s) which converges absolutely for all s. Here it is: define the auxiliary function
λE(s)=(N2π)sn=1annsΓ(s,2πNn),

where all the quantities are as defined previously, and Γ(s,x) is the upper incomplete Gamma function (note that since Γ(s,x) goes to zero exponentially as x goes to infinity, this sum will converge absolutely for any s, with rate of convergence scaling with N). Then we have
ΛE(s)=λE(s)+wEλE(2s).

Because we know how to compute incomplete Gamma functions, this gives us a way to evaluate ΛE(s), and thus LE(s), in the critical strip. The upside with this formula and variations thereof is that it works for any value of s you stick in - including values near s=1. Similar formulae exist for the derivatives of LE(s), so we can in theory compute L(n)E(1), the nth derivative of LE(s) at the central point, to any degree of accuracy for any n.

Thus if we want to compute a curve's analytic rank, what's stopping us from just evaluating successive derivatives of LE(s) at s=1 until we hit one which is not zero?

Two reasons. The first is that there's no way around the fact that you need about N terms to compute LE(s) or its derivatives to decent precision. If the conductor of the curve is too big, as is often the case, it takes an inordinate amount of time to simply evaluate the L-function near the central point. This makes direct evaluation impractical for all but the smallest-conductor curves -- and for those curves we can usually compute rank via other methods anyway.

The second reason is a more subtle one: how do you tell numerically if the nth derivative of LE(s) at s=1 is zero? If you think about it, it's easy to answer this question in one direction only: if you evaluate L(n)E(1) to some precision and get digits that aren't all zero, then (assuming your code is correct) the nth derivative of LE(s) does not vanish. However, no matter how many digits of precision we compute getting all zeros, the possibility will always remain that the next digit along might not be zero.

In general, there is no numerical way to determine if the value of a black-box complex-valued function at a point is zero, or just really really close to zero. This is why, if you look in the literature, you'll find "methods to estimate analytic rank", but never to compute the quantity exactly. It's impossible to do without extra knowledge. Specifically, we'd need to have some sort of a computable lower bound on the size of the derivatives of LE(s) at the central. Unfortunately, no such theorems currently exist, so we're stuck with estimating analytic rank for now.

Thankfully, the N-dependence issue is more hopeful. The next post will detail a method that provides good estimates for the analytic rank that scales much more slowly with the curve's conductor.

No comments:

Post a Comment