Supersingular prime (algebraic number theory)

From testwiki
Jump to navigation Jump to search

Template:Short description In algebraic number theory, a supersingular prime for a given elliptic curve is a prime number with a certain relationship to that curve. If the curve E is defined over the rational numbers, then a prime p is supersingular for E if the reduction of E modulo p is a supersingular elliptic curve over the residue field 𝔽p.Template:Sfn

Equivalently, for a prime p>3 of good reduction for E, the prime is supersingular for E if and only if the trace of the Frobenius endomorphism ap=p+1−#E(𝔽p) is zero, that is, #E(𝔽p)=p+1.Template:Sfn This condition means that the reduction of E modulo p has the maximum possible endomorphism ring—an order in a quaternion algebra—rather than an order in an imaginary quadratic field.Template:Sfn

Distribution

Complex multiplication case

When E has complex multiplication (CM) by an order in an imaginary quadratic field K, the distribution of supersingular primes is well understood. A classical result of Deuring (1941) implies that a prime p of good reduction is supersingular for E if and only if p is inert or ramified in K.Template:Sfn By the Chebotarev density theorem, these primes constitute exactly half of all primes, so the set of supersingular primes for a CM curve has natural density 1/2.Template:Sfn

Non-CM case

When E does not have complex multiplication, the situation is more subtle. In 1968, Serre proved that the set of supersingular primes has asymptotic density zero by applying the Chebotarev density theorem to the number fields generated by coordinates of the torsion points of E.Template:SfnTemplate:Sfn Serre later obtained the unconditional upper bound

πE,0(x)≪x(log⁡x)3/2−ε

for any ε>0, where πE,0(x) denotes the number of supersingular primes up to x, and showed that under the Generalized Riemann Hypothesis (GRH) one could achieve the bound πE,0(x)≪x3/4.Template:SfnTemplate:Sfn The unconditional exponent was subsequently improved by Wan (1990), who showed

πE,0(x)≪x(log⁡x)2−ε

by incorporating sieve-theoretic techniques.Template:Sfn

Despite this rarity, Noam Elkies proved in 1987 that every elliptic curve over ℚ has infinitely many supersingular primes.Template:Sfn His proof uses the theory of complex multiplication and Deuring's lifting lemma: given any finite set S of primes, one can find a negative fundamental discriminant −D such that the Hilbert class polynomial PD(X) evaluated at the j-invariant j(E) has a prime factor outside S, and this prime is necessarily supersingular for E.Template:Sfn Elkies later extended this result to elliptic curves defined over any number field with at least one real embedding.Template:Sfn

Lang–Trotter conjecture

Template:Harvtxt conjectured that the number of supersingular primes less than a bound X satisfies

πE,0(X)∼CEXlog⁡X

as X→∞, where CE>0 is an explicit constant depending on E.Template:Sfn This prediction arises from a probabilistic heuristic: by the Hasse bound, |ap|≤2p, so the "probability" that ap=0 for a random prime p is roughly 1/p, and summing this over primes up to X gives an expected count on the order of X/log⁡X.Template:Sfn Template:As of, this conjecture remains open.Template:Sfn

Example

Consider the elliptic curve E:y2+y=x3−x2−10x−20, which is the modular curve X0(11) with j-invariant j=−212/11. The supersingular primes for this curve begin: 2, 19, 29, 199, 569, 809, 1289, 1439, 2539, 3319, ... Template:OEIS.Template:Sfn These are exactly the primes p for which the coefficient of qp in η(τ)2η(11τ)2 vanishes modulo p, where η is the Dedekind eta function.

Generalization

More generally, if K is any global field—that is, a finite extension of ℚ or of 𝔽p(t)—and A is an abelian variety defined over K, then a supersingular prime 𝔭 for A is a finite place of K such that the reduction of A modulo 𝔭 is a supersingular abelian variety.Template:Sfn It is conjectured that every abelian variety over a number field has infinitely many supersingular primes, but this is known only in special cases.Template:Sfn

See also

Notes

Template:Reflist

References

Template:Refbegin

Template:Refend

Template:Prime number classes