17 ms·
Baffling ABC maths proof now has impenetrable 300-page ‘summary’
- svisser 9y agoThe opening sentence of a linked article sums it up quite well: "If nobody understands a mathematical proof, does it count?" The abc conjecture may be solved today but only when a sufficient number of people understand and accept the proof as a proof.
- tobhahn 9y agoAccording to the article, there are more than 10 people who understand and accept the proof.
- pacala 9y agoFormalize it with Isabelle / Coq / Lean. Then it counts.
- tobhahn 9y agoMath is more about figuring out why things are true than what is true. Mathematicians want to understand Mochizuki. They couldn't care less if hn thinks it counts.
- SomeStupidPoint 9y agoI don't know why this got flagged. At the point that we no longer understand the relationship between the formal proof witnesses (and really, the class of possible witnesses) and the axioms we choose, we can no longer do mathematics, because we can no longer meaningfully explore axioms -- our ability to make guided changes is destroyed by our inability to understand their effect. It's important for the community to understand something of why a thing, not just that it's true, because that's why drives the development of mathematics forward. (And indeed, particularly so in the ABC conjecture, which sits at a node between the nature of multiplication and addition, which don't usually have much to do with each other.) I actually wonder if US (and perhaps other) math education is harmful here: the focus on rote learning and just knowing that a thing is true (to mechanistically apply it) has conditioned people to not understand why the hesitance over proofs that humans don't understand -- for most of those people, they never understood the proofs anyway.
- pacala 9y agoThat is an excellent point. The future is mechanical proofs. Which will bring tools for proof search, proof refactoring, proof minimization, proof navigation, theorem generation. We'll be able to tackle _much_ harder problems, while still being able to get the gist of it. Sometimes I'm saddened that this future may come slower than we'd like due to imperfect funding structures. But I've grown a lot of patience over the years :)
- SomeStupidPoint 9y agoI'm actually very pro-formalization and mechanical verification -- both for mathematics and computer science. $HOBBYPROJECT involves automated theorem proving, while I'm trying to convince $DAYJOB to adopt some formal methods. I was just pointing out that the person got flagged for commenting that "witness and dump" isn't actually very useful for mathematics as a field, except as a signal that we should investigate a topic further. But in the case of the ABC conjecture, we already have plenty of incentive to investigate. I think mathematics and science have a lot of learn from computer science in terms of managing large models, proofs, etc -- and that we'll get a lot of automatic tools. That will all be really great. But there are proofs that are basically just brute-forcing a solution for which we have no higher-level understanding, and those don't really add much by way of knowledge to mathematics. At the point that those are all we can generate for "big" problems, we may be in trouble.
- pacala 9y agoAnother excellent point. Right now it's a "winner takes all" competition. It matters to prove a result, and much less to provide an "elegant" proof. I can only hope for a future where we measure the algorithmic entropy of a proof [log proof length][0], and results like "ABC theorem proof using half the bits as best known proof" become notable. [0] https://en.wikipedia.org/wiki/Kolmogorov_complexity https://en.wikipedia.org/wiki/Kolmogorov_complexity
- haskellandchill 9y agoI'm interested in your $HOBBYPROJECT. I'm hoping to develop some software similar to edukera.com, ie using proof assistants as educational tools for mathematics. Would love to swap some cool links and references. Thanks!
- sanxiyn 9y agoIndeed. We now actually have some math results of interest for which we have only formal proofs and no human proofs. https://arxiv.org/abs/1509.05468 https://arxiv.org/abs/1509.05468 is an example.
- mikebenfield 9y agoWe are very far from the point where that is feasible for many new results in math.
- deleted 9y ago[deleted]
- MikkoFinell 9y ago>"If nobody understands a mathematical proof, does it count?" Just wait until general AI really kicks off, then all of new math will be like that. It's not that humans are bad at logical thinking, our weakness is memory. That won't be the case for an artificial agent with instantaneous perfect recall of everything it has ever seen.
- LeifCarrotson 9y agoEven an AI will have various levels of cache. Some memories will be register-level instant, some will be thousands of miles and quite a few servers away, and others in between.
- MikkoFinell 9y agoThat's a good point. Lets throw "instantaneous" out, having the ability to store and perfectly recall data is a critical advantage for any thinking entity.
- BucketSort 9y agolol. I think the resurgence of interest in constructionist mathematics via Homotopy Type Theory will lead to better proofs ( since all proofs in HoTT are like programs and can be computationally verified in a straightforward way ).
- deleted 9y ago[deleted]
- KGIII 9y agoMathematics is a language. You don't really need to memorize it, you can read it. Unfortunately, most people aren't exposed to anything higher than arithmetic.
- posterboy 9y agoyeah, well, have fun reading e.g. the stacks project[1] of round about 4000 pages without remember the necessary steps leading up to a corollary. [1] https://stacks.math.columbia.edu/browse https://stacks.math.columbia.edu/browse - abstract algebra as far as I can tell
- crazygringo 9y agoI know there has been a lot of work in automated theorem proving. I'm curious if anyone here is able to describe the state of the art in that. Is it really just a toy for basic things right now, or how realistic is it that we'd ever get to a point where the author of a paper like this could use a formal language to show that their proof is indeed valid and complete?
- LeanderK 9y agoI am not an expert, but I recently took a course on formal systems, which included theorem proving. It was more focused on proving properties for code since this is the focus of my professor, but I was really surprised how well it was working. I also recently tried out Liquid-Haskell, which adds an SMT solver (i think...) to Haskell. In my opinion, theorem proving has come a long way and I think the challenge is now equal in theorem-proving and programming language. We have to get the ergonomics right, deriving properties for imperative code is awful. We need a super elegant, easy to use and not too restrictive language that can be verified automatically. The overhead of using it must be minimal.
- smaddox 9y ago[Idris](https://en.wikipedia.org/wiki/Idris_(programming_language) https://en.wikipedia.org/wiki/Idris_(programming_language)) looks promising for theorem proving. I'm not sure I would say the overhead of using it is minimal, but it's at least a very expressive language.
- xvilka 9y agoThere is Agda, which was created for that, and even HoTT has a formalization in this language.
- sanxiyn 9y agoIt is realistic in the sense that it has already been done! But it's still laborious in the extreme. Kepler conjecture was stated in 1611 and had been unsolved since. Thomas Hales started a project to attack it in 1992. After six years of work, he announced the proof in 1998, in the form of 250 pages of argument and 3 gigabytes of computer calculation. He submitted it to Annals of Mathematics, one of the most prestigious math journal, for review. Reviewers and the author tried valiantly for five years, gave up, and published it in 2003 with a warning that while reviewers were 99% certain, it couldn't be completely reviewed. Soon after getting this both rejection and acceptance, Thomas Hales announced the plan to formalize his proof to remove any uncertainty. It was enthusiastically received by automated theorem proving community. For a while Thomas Hales "shopped" for the prover tool to use and basically leaders of every significant provers tried to "sell" it to him. He decided on HOL Light, wrote the detailed plan for formalization, and estimated it would take 20 years. He actually carried out this plan, announced the completion in 2014, wrote the paper on formalization, and submitted the formalization paper, with 21 collaborators, in 2015. The formalization paper was published in 2017. So there's that. The formal proof of Kepler conjecture is at the moment the most significant corpus of formalized mathematics in existence.
- rusanu 9y ago> “The language strikes me as substantially more accessible than that of the original papers.” So is not really a summary, is more of a reformulation, an easier to read rewrite.
- deleted 9y ago[deleted]
- ZenoArrow 9y agoI'm not a mathematician, so I don't know the significance of the ABC conjecture, but for those that are laymen like me, here's a quick introduction to the ABC conjecture: https://m.youtube.com/watch?v=RkBl7WKzzRw https://m.youtube.com/watch?v=RkBl7WKzzRw
- Joe-Z 9y agoNot sure why you're being downvoted. The video actually explains the ABC conjecture, which the article really doesn't. Also, the second-highest comment in this thread right now is one explaining this conjecture.
- Koshkin 9y agoThis one is a bit more informative: https://www.youtube.com/watch?v=XYisYYhKKYA https://www.youtube.com/watch?v=XYisYYhKKYA.
- deleted 9y ago[deleted]
- math_and_stuff 9y agoSome bitter conflict is referenced in footnote 1 of the 300 page summary. """ The author hears that a mathematician (I. F.), who pretends to understand inter-universal Teichm¨uller theory, suggests in a literature that the author began to study inter-universal Teichm¨uller theory “by his encouragement”. But, this differs from the fact that the author began it by his own will. The same person, in other context as well, modified the author’s email with quotation symbol “>” and fabricated an email, seemingly with ill-intention, as though the author had written it. The author would like to record these facts here for avoiding misunderstandings or misdirections, arising from these kinds of cheats, of the comtemporary and future people. """ I wonder if "I.F." is referring to the same "I.F." quoted in the original article. [1] http://www.kurims.kyoto-u.ac.jp/~gokun/DOCUMENTS/abc_ver6.pdf http://www.kurims.kyoto-u.ac.jp/~gokun/DOCUMENTS/abc_ver6.pd... [2] https://www.maths.nottingham.ac.uk/personal/ibf/activity.html https://www.maths.nottingham.ac.uk/personal/ibf/activity.htm...
- sanxiyn 9y agoYes, I.F. is the one and the same.
- kazinator 9y agoI've personally modified thousands of e-mails with the ">" symbol; it's called replying. That, per se, has nothing to do with fabricating an e-mail; why mention it? Of course > symbols are fairly likely to be used in a forged e-mail, possibly next to fake quoted text; but that then is not simply an alteration of genuine text by the addition of those symbols.
- mintplant 9y ago>I've personally modified thousands of e-mails with the ">" symbol; it's called replying. That, per se, has nothing to do with fabricating an e-mail; why mention it? I read it as "I.F." making it look like something the author wrote was the author quoting "I.F.", or vice-versa. For example, From: John Doe <johndoe@gmail.com> The meaning of life is 42. becomes From: John Doe <johndoe@gmail.com> > The meaning of life is 42. Thanks for the help!
- dmh2000 9y agoquestion: if a reviewer is given a proof to verify, then is it possible to simply step through each transformation and verify it, without really understanding the entirety? Or in cases such as this are there steps that are new or obtuse enough that there isn't a way to verify them without understanding the whole thing. Or, are there individual steps that require so much work that it is impractical to verify them?
- sanxiyn 9y agoIf you write a proof in sufficient detail (which nobody does but is manifestly possible), it can be verified with no understanding at all. Indeed, it can be verified by ~300 lines of Python: http://us.metamath.org/downloads/mmverify.py http://us.metamath.org/downloads/mmverify.py
- rocqua 9y agoIn practice, a proof contains many steps that are highly non-obvious unless you have a deep understanding of the subject. This is done not just for the sake of brevity, but also clarity. In a proof, there are a few key ideas you want to show. Around that, you need glue to convince the reader that your key ideas work, and save them from some the tedium and hard work of verifying that stuff. A 1/4 page proof, when made as simple as you suggested, could easily bloom to 2 pages. At this point, your reader can no longer find those few key ideas, and is instead lost in the rigor.
- pfortuny 9y agoThis process is very similar to analyzing the plot of a novel to the utmost detail: it depends not only on the "facts" but very much on the writing style (compare f.i. Joyce and H. James).
- lvh 9y agoThe article didn't explain the abc conjecture in much detail ("The original proof is of the long-standing ABC conjecture that explores the deep nature of numbers, centred on the simple equation a + b = c."). That's unfortunate, because even though the proof is inscrutable, the conjecture itself isn't very complicated: If three numbers a, b, and c are coprime and two numbers a and b have large prime factors, then their sum c generally does not. To make that a little more formal, it means that the radical (product of distinct prime factors) of their product abc is usually less than the sum c, up to some exponent 1+eps: rad(abc)^(1+eps) < c ... for some eps. That eps is important! There are infinitely many numbers a, b, c where this isn't true for some eps (and there are ways to construct those), but the conjecture states that for any given eps, there are finitely many. To find maximal counterexamples (which, because mathematics consistently uses intuitive terminology, are said to be "high-quality") you typically look for numbers that are smooth (small prime factors) but not powersmooth (larger prime-factors-raised-to-a-power). Typically you'll also fix a to be really small, to limit the search space somewhat. [MM14] describes other methods for finding triples. Here's a simple example of a high-quality triple: a = 1 b = 2*3^7 = 4374 c = 5^4*7 = 4375 Because all factors are unique, rad(abc) = rad(a) rad(b) rad(c). c > (rad(abc))^(1+eps) c > (rad(a) * rad(b) * rad(c))^(1+eps) 5^4*7 > (rad(1) * rad(2*3^7) * rad(5^4*7))^(1+eps) 5^4*7 > (1 * 2 * 3 * 5 * 7)^(1+eps) 4375 > (210)^(1+eps) This is a great example, because the exponent (sometimes called q) is about 1.57, which is extraordinarily high. In the first billion c's, there are only 34 with q > 1.4. This is the fifth best such triple we know of. [triples] Consider a trivial case where all three numbers are prime; a = 2, b = 3, c = 5. Primes are their own radical, so: 5 > (2 + 3)^1+eps This is the edge case. [triples]: https://www.math.leidenuniv.nl/~desmit/abc/index.php?set=2 https://www.math.leidenuniv.nl/~desmit/abc/index.php?set=2 [MM14]: https://arxiv.org/pdf/1409.2974.pdf https://arxiv.org/pdf/1409.2974.pdf
- TimTheTinker 9y agoThe proof apparently rests on an entirely new (not yet vetted) branch of number theory developed by the proof's author, "Inter-universal Teichmüller Theory". 45-page overview linked: http://www.kurims.kyoto-u.ac.jp/%7Emotizuki/Panoramic%20Overview%20of%20Inter-universal%20Teichmuller%20Theory.pdf http://www.kurims.kyoto-u.ac.jp/%7Emotizuki/Panoramic%20Over...
- Phosphenes 9y agoThey should probably break it up into more manageable pieces. Maybe by starting with Frobenioids?
- dmix 9y agoTwo paragraphs that highlight the potential source of the problem in the sublinked article: > Despite mathematics being a universal language, culture clash could be getting in the way, says Kim. “In Japan people are pretty used to long, technical discussions by the lecturer that require a lot of concentration,” he says. “In America or England we expect much more interaction, pointed questions coming from the audience, at least some level of heated debate.” > There is a growing consensus that Mochizuki has over-engineered his work, contributing to the confusion. “Most of the large theories that he builds are not essential. He could have written things in a much more streamlined way,” says Voloch. This is a problem in a lot of technical fields but also in writing in general. It's always easier to write 1000 words to say something than 100 to say it well.
- sebcat 9y agoOr writing a lot of code that does something, compared to writing less code that does something well.
- dmix 9y agoEach takes time and concentration which is always a finite resource. But inexcusible when what you produce stumps even the experts who were willing to dedicate significant amount of time.
- ghgr 9y ago> It's always easier to write 1000 words to say something than 100 to say it well. As (probably) Pascal said: "If I had more time, I would have written a shorter letter". https://quoteinvestigator.com/2012/04/28/shorter-letter/ https://quoteinvestigator.com/2012/04/28/shorter-letter/
- KGIII 9y agoMy verbosity is a shortcoming. Were I able, I'd be more precise and brevity would be the result. This is actually something I work on improving.
- 9y ago
- shad0wca7 9y agoThis reads like an academic paper created by 'machine learning' to be unintelligible yet look legitimate at-a-glance...
- nautilus12 9y agoThis sheds an interesting light on the referee process in that referees are given an inordinate amount of power in the scientific process. Suppose I am a referee, then I am a mathematician and I generally want new and interesting work released having to do with my subject area because I want more students interested in those topics validating my general area of research. If I dont plan to personally build on this work (because maybe its too confusing or doesn't shed light on what I am working on), then in a case like this where the paper is so confounding, whats to keep me from simply saying "I understand this and its correct" even if that is not the case? Its not like if you referee and approve a paper that is later proven wrong (especially in a case like this) you are run out of the mathematical community. Do they need to provide detailed explanations as to why they think its right? What would stop a referee from simply going along with it and approving this paper, especially when the community is confounded by it and doesn't want to do the work itself. Does the rigor of scientific process ultimately just come down to unrigorous consensus?
- deleted 9y ago[deleted]
- luckyt 9y ago> What's to keep me from simply saying "I understand this and its correct" even if that is not the case? Then you should be able to have intelligent discussions about the paper and answer questions that come up. If you're pretending to understand it, a quick 5-minute discussion with a mathematician would reveal that this is not the case.
- impendia 9y agoProfessional mathematician here. That can occasionally happen with much less important papers; e.g. someone is asked to referee something, and doesn't really feel like actually reading it but would still like to see it published. If they are not conscientious they might only briefly skim the proof and write a hasty referee report. But ABC is a major claim. The community will not be nearly so quick to reach a consensus. In particular, from what I can tell now there are a handful of mathematicians other than Mochizuki vouching for the proof, but even that is still not enough: overall, the community has yet to come to a consensus that this is enough.
- deleted 9y ago[deleted]