Serre's modularity conjecture

From Wikipedia, the free encyclopedia
(Redirected from Serre modularity conjecture)
Jump to navigation Jump to search
Serre's modularity conjecture
FieldAlgebraic number theory
Conjectured byJean-Pierre Serre
Conjectured in1975
First proof byChandrashekhar Khare
Jean-Pierre Wintenberger
First proof in2008

In mathematics, Serre's modularity conjecture, introduced by Jean-Pierre Serre (1975, 1987), states that an odd, irreducible, two-dimensional Galois representation over a finite field arises from a modular form. A stronger version of this conjecture specifies the weight and level of the modular form. The conjecture in the level 1 case was proved by Chandrashekhar Khare in 2005,[1] and a proof of the full conjecture was completed jointly by Khare and Jean-Pierre Wintenberger in 2008.[2]

Formulation

[edit | edit source]

The conjecture concerns the absolute Galois group G of the rational number field .

Let ρ be an absolutely irreducible, continuous, two-dimensional representation of G over a finite field F=𝔽r.

ρ:GGL2(F).

Additionally, assume ρ is odd, meaning the image of complex conjugation has determinant -1.

To any normalized modular eigenform

f=q+a2q2+a3q3+

of level N=N(ρ), weight k=k(ρ), and some Nebentype character

χ:/NF*,

a theorem due to Shimura, Deligne, and Serre-Deligne attaches to f a representation

ρf:GGL2(𝒪),

where 𝒪 is the ring of integers in a finite extension of . This representation is characterized by the condition that for all prime numbers p, coprime to N we have

Trace(ρf(Frobp))=ap

and

det(ρf(Frobp))=pk1χ(p).

Reducing this representation modulo the maximal ideal of 𝒪 gives a mod representation ρf of G.

Serre's conjecture asserts that for any representation ρ as above, there is a modular eigenform f such that

ρfρ.

The level and weight of the conjectural form f are explicitly conjectured in Serre's article. In addition, he derives a number of results from this conjecture, among them Fermat's Last Theorem and the now-proven Taniyama–Weil (or Taniyama–Shimura) conjecture, now known as the modularity theorem (although this implies Fermat's Last Theorem, Serre proves it directly from his conjecture).

Optimal level and weight

[edit | edit source]

The strong form of Serre's conjecture describes the level and weight of the modular form.

The optimal level is the Artin conductor of the representation, with the power of l removed.

Proof

[edit | edit source]

A proof of the level 1 and small weight cases of the conjecture was obtained in 2004 by Chandrashekhar Khare and Jean-Pierre Wintenberger,[3] and by Luis Dieulefait,[4] independently.

In 2005, Chandrashekhar Khare obtained a proof of the level 1 case of Serre conjecture,[5] and in 2008 a proof of the full conjecture in collaboration with Jean-Pierre Wintenberger.[6]

Notes

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). and Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). and Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..

References

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

See also

[edit | edit source]
[edit | edit source]