Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Modularity theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Relates rational elliptic curves to modular forms}} {{Distinguish|Serre's modularity conjecture}} {{Infobox mathematical statement | name = Modularity theorem | image = | caption = | field = [[Number theory]] | conjectured by = [[Yutaka Taniyama]]<br>[[Goro Shimura]] | conjecture date = 1957 | first proof by = [[Christophe Breuil]]<br>[[Brian Conrad]]<br>[[Fred Diamond]]<br>[[Richard Taylor (mathematician)|Richard Taylor]] | first proof date = 2001 | open problem = | known cases = | implied by = | generalizations = | consequences = [[Fermat's Last Theorem]] }} In [[number theory]], the '''modularity theorem''' states that [[elliptic curve]]s over the field of [[rational number]]s are related to [[modular form]]s in a particular way. [[Andrew Wiles]] and [[Richard Taylor (mathematician)|Richard Taylor]] proved the modularity theorem for [[semistable elliptic curve]]s, which was enough to imply [[Fermat's Last Theorem]]. Later, a series of papers by Wiles's former students [[Brian Conrad]], [[Fred Diamond]] and Richard Taylor, culminating in a joint paper with [[Christophe Breuil]], extended Wiles's techniques to prove the full modularity theorem in 2001. Before that, the statement was known as the '''Taniyama–Shimura conjecture''', '''Taniyama–Shimura–Weil conjecture''', or the '''modularity conjecture for elliptic curves'''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)