Explicit bounds on the coefficients of modular polynomials for the elliptic -invariant

By Florian Breuer and Fabien Pazuki

Abstract

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials for any . These polynomials vanish at pairs of -invariants of elliptic curves linked by cyclic isogenies of degree . The main term in the bound is asymptotically optimal as tends to infinity.

1. Introduction

For any nonzero polynomial in one or more variables and complex coefficients, we define its height to be

Let be a positive integer and denote by the (classical) modular polynomial, which vanishes at pairs of -invariants of elliptic curves linked by a cyclic -isogeny; see Reference La87, Chapter 5. Alternatively, if we view as the function on the complex upper half-plane where is the -invariant of the complex elliptic curve , then is the minimal polynomial of over .

Modular polynomials have important applications in cryptography and certain algorithms for computing require explicit bounds on the size of the coefficients, so one is interested in explicit bounds on .

Paula Cohen Tretkoff Reference Coh84 proved that when tends to

where

but the implied bounded function is not explicit.

In the case where is prime, Br├╢ker and Sutherland Reference BrSu10 estimated the constants in CohenтАЩs argument to obtain

In the general case, the second author obtained Reference Paz19, Corollary 4.3 via a different method,

Inequality Equation 2 has the merit of being completely explicit for all , but the main term is slightly too big when compared with the asymptotic of Equation 1.

The goal of the present paper is to prove the following result, where we solve this issue and provide an upper bound with the correct main term for all . Let us first define

Theorem 1.1.

Let . The height of the modular polynomial is bounded by

We prove this theorem using a different path than the one followed in Reference Paz19. The main new ingredient is a finer estimate of the Mahler measure of -invariants, coming from previous work of Pascal Autissier Reference Aut03. We also use precise analytic estimates for the discriminant modular form on the fundamental domain of the upper half-plane (under the classical action of ), and a classical interpolation method to help us derive bounds on the height of a polynomial in two variables, from knowledge of the height of several specializations of this polynomial.

Let us now discuss the optimality of the bound. The main term is the expected one. For lower order terms, notice that

so one changes little replacing by in Theorem 1.1. On the other hand, one would like to get rid of the spurious term, but for practical purposes this might be less useful than keeping the constant as small as possible.

It is interesting to consider the functions and for which

These functions are plotted in Figure 1 for , based on computations of by Andrew Sutherland Reference Suth using the algorithms in Reference BKS12 (for prime ) and Reference BOS16 (for composite ).

The content of CohenтАЩs theorem is that and thus also are bounded functions. Theorem 1.1 is equivalent to , which is clearly seen to hold for ; in fact, in this range.

In our proof of Theorem 1.1 we may thus assume that . We explain in Remark 3.2 and in Lemma 3.3 that more computations for lead to minor improvements on the constant .

From Figure 1 it appears that is bounded more tightly than , thus suggesting that is a more natural function to use in the bound for than is .

2. Preliminary results

Denote the complex upper half-plane by

Every defines a lattice in , and it is well known that every complex elliptic curve is isomorphic to for some . If we denote the -invariant of this elliptic curve by , then

defines an analytic function on .

The group acts on the upper half-plane by

A fundamental domain for this action is given by

Thus every is -equivalent to an element , which we call reduced.

The modular function is -invariant. We define

then the Fourier expansion at infinity of can be written as a -expansion

We denote by the modular discriminant function

which is a weight 12 cusp form for . We normalize so that its -expansion is

We point out that the discriminant of the elliptic curve is given by , which is why most sources (e.g., Reference La87) normalize differently, multiplying the above product by the factor . We choose our normalization to be consistent with Reference Paz19, which contains estimates that we will use.

Let us denote, for ,

We have

The elements of encode cyclic -isogenies in the following way. Let be an elliptic curve. For each

we let

Then the natural map

is a cyclic -isogeny.

Furthermore, up to isomorphism, every cyclic -isogeny with source arises in this way. In particular, we have the factorization

Our goal is to bound the coefficients of the modular polynomial . By interpolation, it is enough to estimate the height of for several carefully chosen .

By Reference BrZu20, Lemma 1.6 the height of is bounded in terms of its Mahler measure

by

We will concentrate on estimating for a fixed .

In general, wonтАЩt be reduced, so we choose

for which

is reduced. Since

we obtain

Also, since is a modular form of weight for , we find that

so

Note that by Reference Paz19, Lemma 2.4 we have

for each , provided that .

We need a few more preliminaries.

By Reference Aut03, Lemme 2.2, we have

so we get

Furthermore, Reference Aut03, Lemme 2.3 says

which combined with

gives

Finally, since , Reference Paz19, (2.22) gives usтАФif we denote тАФ

whereas Reference Paz19, (3.18) gives, for any ,

This last estimate depends on our choice of normalization of .

We note that the identities Equation 10 and Equation 11 from Reference Aut03 involve the nonreduced , whereas the estimates Equation 9, Equation 12, and Equation 13 from Reference Paz19 depend on the reduced . The main idea of this paper is to combine these ingredients using Equation 8.

3. Proof of Theorem 1.1

We are now ready to start our main calculation on the sum from Equation 5.

hence we get

At this point we record the following intermediate result. If then we may apply Equation 9 and obtain

We continue our calculation from Equation 15.