ABC conjecture: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
No edit summary
Mabcp (talk | contribs)
Line 80: Line 80:
*[http://news.sciencemag.org/sciencenow/2012/09/abc-conjecture.html ABC Proof Could Be Mathematical Jackpot], Science, 12 Sept 2012
*[http://news.sciencemag.org/sciencenow/2012/09/abc-conjecture.html ABC Proof Could Be Mathematical Jackpot], Science, 12 Sept 2012
*[http://www.nytimes.com/2012/09/18/science/possible-breakthrough-in-maths-abc-conjecture.html A Possible Breakthrough in Explaining a Mathematical Riddle], The New York Times, 17 Sept 2012
*[http://www.nytimes.com/2012/09/18/science/possible-breakthrough-in-maths-abc-conjecture.html A Possible Breakthrough in Explaining a Mathematical Riddle], The New York Times, 17 Sept 2012
*[http://www.telegraph.co.uk/news/worldnews/asia/japan/9552155/Worlds-most-complex-mathematical-theory-cracked.html World's most complex mathematical theory 'cracked'], The Telegraph, 19 Sept 2012
*[http://www.telegraph.co.uk/news/worldnews/asia/japan/9552155/Worlds-most-complex-mathematical-theory-cracked.html World's most complex mathematical theory 'cracked'], The Telegraph, 19 Sept 2012, reprinted by several other news outlets
*[http://www.dailyprincetonian.com/2012/09/20/31183/ U.-educated mathematician offers proof of pivotal number theory conjecture], The Daily Princetonian, 20 Sept 2012

Revision as of 01:21, 20 September 2012

The abc conjecture asserts, roughly speaking, that if a+b=c and a,b,c are coprime, then a,b,c cannot all be too smooth; in particular, the product of all the primes dividing a, b, or c has to exceed [math]\displaystyle{ c^{1-\varepsilon} }[/math] for any fixed [math]\displaystyle{ \varepsilon \gt 0 }[/math] (if a,b,c are smooth).

This shows for instance that [math]\displaystyle{ (1-\varepsilon) \log N / 3 }[/math]-smooth a,b,c of size N which are coprime cannot sum to form a+b=c. This unfortunately seems to be too weak to be of much use for the finding primes project.

A probabilistic heuristic justification for the ABC conjecture can be found at this blog post.

Mochizuki's proof

Papers

Mochizuki's claimed proof of the abc conjecture is conducted primarily through the following series of four papers:

  1. (IUTT-I) Inter-universal Teichmuller Theory I: Construction of Hodge Theaters, Shinichi Mochizuki
  2. (IUTT-II) Inter-universal Teichmuller Theory II: Hodge-Arakelov-theoretic Evaluation, Shinichi Mochizuki
  3. (IUTT-III) Inter-universal Teichmuller Theory III: Canonical Splittings of the Log-theta-lattice, Shinichi Mochizuki
  4. (IUTT-IV) Inter-universal Teichmuller Theory IV: Log-volume Computations and Set-theoretic Foundations, Shinichi Mochizuki, 30 August 2012

See also these earlier slides of Mochizuki on inter-universal Teichmuller theory. The answers to this MathOverflow post (and in particular Minhyong Kim's answer) describe the philosophy behind Mochizuki's proof strategy.

The argument also relies heavily on Mochizuki's previous work on the Hodge-Arakelov theory of elliptic curves, including the following references:

Anyone seeking to get a thorough "bottom-up" understanding of Mochizuki's argument will probably be best advised to start with these latter papers first.

In order to apply the theory developed in (IUTT I-IV) to obtain quantitative Diophantine results such as the abc conjecture, the results from the paper

are used. (Note that the published version of this paper requires some small corrections, listed here.)

Here are the remainder of Shinichi Mochizuki's papers, and here is the Wikipedia page for Shinichi Mochizuki.

Specific topics

The last part of (IUTT-IV) explores the use of different models of ZFC set theory in order to more fully develop inter-universal Teichmuller theory (this part is not needed for the applications to the abc conjecture). There appears to be an inaccuracy in a remark in Section 3, page 43 of that paper regarding the conservative nature of the extension of ZFC by the addition of the Grothendieck universe axiom; see this blog comment. However, this remark was purely for motivational purposes and does not impact the proof of the abc conjecture.

There is some discussion at this MathOverflow post as to whether the explicit bounds for the abc conjecture are too strong to be consistent with known or conjectured lower bounds on abc.

The question of whether the results in this paper can be made completely effective (which would be of importance for several applications) is discussed in some of the comments to this blog post.

Blogs

Q & A

Discussions

News Media