# Sato–Tate conjecture

In mathematics, the **Sato–Tate conjecture** is a statistical statement about the family of elliptic curves *E _{p}* over the finite field with

*p*elements, with

*p*a prime number, obtained from an elliptic curve

*E*over the rational number field, by the process of reduction modulo a prime for almost all

*p*. If

*N*denotes the number of points on

_{p}*E*and defined over the field with

_{p}*p*elements, the conjecture gives an answer to the distribution of the second-order term for

*N*. That is, by Hasse's theorem on elliptic curves we have

_{p}as *p* → ∞, and the point of the conjecture is to predict how the O-term varies.

## Contents

## Statement

Define *θ*_{p} as the solution to the equation

Let *E* be an elliptic curve without complex multiplication. Then, for every two real numbers
and for which
,

## Details

It is easy to see that we can in fact choose the first *M* of the *E*_{p} as we like, as an application of the Chinese remainder theorem, for any fixed integer *M*.Template:Clarify In the case where *E* has complex multiplication the conjecture is replaced by another, simpler law.

By Hasse's theorem on elliptic curves, the ratio

is between -1 and 1. Thus it can be expressed as cos *θ* for an angle *θ*; in geometric terms there are two eigenvalues accounting for the remainder and with the denominator as given they are complex conjugate and of absolute value 1. The *Sato–Tate conjecture*, when *E* doesn't have complex multiplication,^{[1]} states that the probability measure of *θ* is proportional to

This is due to Mikio Sato and John Tate (independently, and around 1960, published somewhat later).^{[3]} It is by now supported by very substantial evidence.

## Proofs and claims in progress

On March 18, 2006, Richard Taylor of Harvard University announced on his web page the final step of a proof, joint with Laurent Clozel, Michael Harris, and Nicholas Shepherd-Barron, of the Sato–Tate conjecture for elliptic curves over totally real fields satisfying a certain condition: of having multiplicative reduction at some prime.^{[4]} Two of the three articles have since been published.^{[5]} Further results are conditional on improved forms of the Arthur–Selberg trace formula. Harris has a conditional proof of a result for the product of two elliptic curves (not isogenous) following from such a hypothetical trace formula.^{[6]} Template:As of, Richard Taylor has posted on his website an article (joint work with Thomas Barnet-Lamb, David Geraghty, and Michael Harris) which claims to prove a generalized version of the Sato–Tate conjecture for an arbitrary non-CM holomorphic modular form of weight greater than or equal to two,^{[7]} by improving the potential modularity results of previous papers. They also assert that the prior issues involved with the trace formula have been solved by Michael Harris' "Book project"^{[8]} and work of Sug Woo Shin.^{[9]}^{[10]} In 2013 Taylor was awarded the Breakthrough Prize in Mathematics "for numerous breakthrough results in (...) the Sato–Tate conjecture."^{[11]}

## Generalisation

There are generalisations, involving the distribution of Frobenius elements in Galois groups involved in the Galois representations on étale cohomology. In particular there is a conjectural theory for curves of genus *n* > 1.

Under the random matrix model developed by Nick Katz and Peter Sarnak,^{[12]} there is a conjectural correspondence between (unitarized) characteristic polynomials of Frobenius elements and conjugacy classes in the compact Lie group USp(2*n*) = Sp(*n*). The Haar measure on USp(2*n*) then gives the conjectured distribution, and the classical case is USp(2) = SU(2).

## More precise questions

There are also more refined statements. The **Lang–Trotter conjecture** (1976) of Serge Lang and Hale Trotter predicts the asymptotic number of primes *p* with a given value of *a*_{p},^{[13]} the trace of Frobenius that appears in the formula. For the typical case (no complex multiplication, trace ≠ 0) their formula states that the number of *p* up to *X* is asymptotically

with a specified constant *c*. Neal Koblitz (1988) provided detailed conjectures for the case of a prime number *q* of points on *E*_{p}, motivated by elliptic curve cryptography.^{[14]}

Lang-Trotter conjecture is an analogue of Artin's conjecture on primitive roots, generated in 1977.

## Notes

- ↑ In the case of an elliptic curve with complex multiplication, the Hasse–Weil L-function is expressed in terms of a Hecke L-function (a result of Max Deuring). The known analytic results on these answer even more precise questions.
- ↑ To normalise, put 2/
*π*in front. - ↑ It is mentioned in J. Tate,
*Algebraic cycles and poles of zeta functions*in the volume (O. F. G. Schilling, editor),*Arithmetical Algebraic Geometry*, pages 93–110 (1965). - ↑ That is, for some
*p*where*E*has bad reduction (and at least for elliptic curves over the rational numbers there are some such*p*), the type in the singular fibre of the Néron model is multiplicative, rather than additive. In practice this is the typical case, so the condition can be thought of as mild. In more classical terms, the result applies where the j-invariant is not integral. - ↑ Template:Harvnb and Template:Harvnb, with the remaining one (Template:Harvnb) set to appear.
- ↑ See Carayol's Bourbaki seminar of 17 June 2007 for details.
- ↑ Theorem B of Template:Harvnb
- ↑ Some preprints available here [1] (retrieved July 8, 2009).
- ↑ Preprint "Galois representations arising from some compact Shimura varieties" on author's website [2] (retrieved May 22, 2012).
- ↑ See p. 71 and Corollary 8.9 of Template:Harvnb
- ↑ https://breakthroughprize.org/?controller=Page&action=laureates&p=3&laureate_id=59
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}, preprint (available here)

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}, preprint (available here)

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}, preprint (available here)