ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Sato-Tate conjecture - Wikipedia, the free encyclopedia

Sato-Tate conjecture

From Wikipedia, the free encyclopedia

In mathematics, the Sato-Tate conjecture is a statistical statement about the family of elliptic curves Ep 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 Np denotes the number of points on Ep and defined over the field with p elements, the conjecture gives an answer to the distribution of the second-order term for Np. That is, by Hasse's theorem on elliptic curves we have

Np/p = 1 + O(1/√p)

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

Contents

[edit] Details

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

It is known from the general theory that the remainder

−½(Np − (p + 1))/√p

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

sin2 θ.dθ.[2]

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.

[edit] Taylor's announcement

On March 18, 2006, Richard Taylor of Harvard University announced on his web page a proof of the Sato-Tate conjecture for elliptic curves over totally real fields satisfying a certain condition: of having multiplicative reduction at some prime. 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.

[edit] 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,[4] there is a conjectural correspondence between (unitarized) characteristic polynomials of Frobenius elements and conjugacy classes in the compact Lie group USp(2n)=Sp(n). The Haar measure on USp(2n) then gives the conjectured distribution, and the classical case is USp(2)=SU(2).

[edit] 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 ap, 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

constant × √X/ log X

with a specified constant. Neal Koblitz (1988) provided detailed conjectures for the case of a prime number q of points on Ep, motivated by elliptic curve cryptography.

[edit] Note

  1. ^ In the case of an elliptic curve with complex multiplication, the Hasse-Weil L-function is expressed in terms of a Hecke L-function (result of Max Deuring. The known analytic results on these answer even more precise questions.
  2. ^ To normalise, put 2/π in front.
  3. ^ 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).
  4. ^ "Random matrices, Frobenius Eigenvalues, and Monodromy", Nicholas M. Katz and Peter Sarnak, AMS, 1999.

[edit] External links

Languages


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -