135
$\begingroup$

In principle, a mathematical paper should be complete and correct. New statements should be supported by appropriate proofs. But this is only theory. Because we often cannot enter into the smallest details, we "prove" wrong statements here and then. I plead guilty, having published myself one or two false (fortunately minor) papers.

So far, this is not harmful. The research community is able to point out incorrect statements, at least among those which have some importance in the development of mathematics. In time, the errors are fixed; this is the role of monographs to present a universally accepted state of the art of a topic.

But sometimes, hopefully rarely, the technicalities are such that a consensus does not emerge and a controversy raises, between the author and their critics. I have an example in the realm of wave stability in PDE models for fluid dynamics. The controversy has lasted for a decade or two and I don't see how it can be resolved some day; it could just kill the topic.

Are there famous endless controversies about the correctness of a significant paper? Are there some significant mathematical questions, that remain unsettled because people disagree on the status of released proofs? What should we do in order to salvage mathematical topics that suffer such tensions?

In this question, I am not concerned with other kinds of controversy, about priority or citations.

$\endgroup$
  • 7
    $\begingroup$ Freedman's work on 4-manifolds has also been strongly criticized, and might be what you are looking for: mathoverflow.net/questions/87674/… $\endgroup$ – Ben McKay Oct 5 '17 at 11:21
  • 8
    $\begingroup$ There is also the objectivist vs the subjectivist views of probability and as such no paper which permits the choice of something "at random" is rigorously correct, since there is no such thing as "at random" as demonstrated by Bertrand's paradox en.wikipedia.org/wiki/Bertrand_paradox_(probability) which mathematicans routinely ignore; e.g. when saying that the probability of choosing a $1$ at random from the natural numbers is zero. $\endgroup$ – samerivertwice Oct 5 '17 at 11:36
  • 4
    $\begingroup$ Though my understanding is based largely on just this article for the layperson, I believe there was apparently controversy around Kuranishi structures and a proof of (a version of) the Arnold conjecture for a time. Not endless but apparently non-trivial. $\endgroup$ – Oliver Nash Oct 5 '17 at 12:09
  • 35
    $\begingroup$ Would Shinichi Mochizuki's purported proof of the $abc$-conjecture qualify? $\endgroup$ – Stanley Yao Xiao Oct 5 '17 at 13:13
  • 6
    $\begingroup$ I see three votes to close, and no comments explaining why one should want to close. Please, speak up! $\endgroup$ – Gerry Myerson Oct 5 '17 at 21:34
63
$\begingroup$

(Also mentioned in Oliver Nash's comment)

From a February 2017 article in Quanta Magazine called "A fight to fix geometry's foundations" (the original has relevant links in the text):

...in 2012, a pair of researchers — Dusa McDuff, a prominent symplectic geometer at Barnard College and author of a pair of canonical textbooks in the field, and Katrin Wehrheim, a mathematician now at the University of California, Berkeley — began publishing papers that called attention to the problems, including some in McDuff’s own previous work. Most notably, they raised pointed questions about the accuracy of a difficult, important paper by Kenji Fukaya, a mathematician now at Stony Brook University, and his co-author, Kaoru Ono of Kyoto University, that was first posted in 1996.

This critique of Fukaya’s work — and the attention McDuff and Wehrheim have drawn to symplectic geometry’s shaky foundations in general — has created significant controversy in the field. Tensions arose between McDuff and Wehrheim on one side and Fukaya on the other about the seriousness of the errors in his work, and who should get credit for fixing them.

More broadly, the controversy highlights the uncomfortable nature of pointing out problems that many mathematicians preferred to ignore. “A lot of people sort of knew things weren’t right,” McDuff said, referring to errors in a number of important papers. “They can say, ‘It doesn’t really matter, things will work out, enough [of the foundation] is right, surely something is right.’ But when you got down to it, we couldn’t find anything that was absolutely right.”

$\endgroup$
  • 7
    $\begingroup$ It is my understanding that some players in the story had approached Fukaya prior to 2012 with concerns, but these concerns were taken less seriously by Fukaya back then. $\endgroup$ – Student Oct 5 '17 at 14:42
  • 1
    $\begingroup$ I don't know anything about symplectic geometry, but according to the Quanta article, the mathematical part of this controversy has now been resolved, and so it might not quite count as an "endless controversy." $\endgroup$ – Timothy Chow Dec 31 '18 at 19:23
47
$\begingroup$

The Jordan curve theorem asserts that a simple continuous closed curve separates the plane into two distinct connected open sets. Whether Camille Jordan's original proof is correct or not seems to be a subject of controversy even today.

Here is a 2007 article by Thomas Hales that "defends Jordan’s original proof of the Jordan curve theorem" (from the abstract) and contains opinions from mathematicians who have pondered on the matter.

Here is an excerpt of the paper.

In view of the heavy criticism of Jordan’s proof, I was surprised when I sat down to read his proof to find nothing objectionable about it. Since then, I have contacted a number of the authors who have criticized Jordan, and each case the author has admitted to having no direct knowledge of an error in Jordan’s proof. It seems that there is no one still alive with a direct knowledge of the error.

You can find the proof of Jordan in his cours de l'ecole polytechnique p92ff if you want to form your own opinion.

Don't forget to contribute your own short proof of the Jordan curve theorem, and receive my applause for adding to the long list of proofs of the Jordan theorem, which are probably not short enough, and that contain an argument that is completely trivial (Hales), unsatisfactory to many mathematicians (Veblen), essentially correct (Reeken), invalid (Courant and Robbins), incorrect (M. Kline), not sufficient (another Kline) or simply in need of additional details (Mathoverflow).

$\endgroup$
  • 2
    $\begingroup$ I don't see a proof of the Jordan Curve theorem at page 92, are you sure? $\endgroup$ – Jack M Oct 5 '17 at 21:35
  • $\begingroup$ @Jack The proof starts at page 92 and covers paragraphs 98-104. You may want to start from paragraph 96 at page 90 for the context. The theorem is actually stated as the last sentence of paragraph 102. Paragraphs 98-102 show that a simple closed curve is between two polygonal simple closed curves. $\endgroup$ – coudy Oct 6 '17 at 20:26
36
$\begingroup$

Edit: a (methodo-)logical proposal to make this thread more transparent

It can be argued that, broadly, there are three quite distinct 'types' of such controversies (and I propose that each answer in here gets tagged, by the respective contributor, if so inclined, by one of the following three tags):

(non-sequitur) This is the nightmare of anyone who has had to referee a long submitted paper and felt the responsibility to make a judgemental statement about the 'Is it true?'-part of a referee's three Littlewoodian responsitbilities: the proof contains many true things, but the goal seems not to be reached, but it is so difficult to justify why one is not convinced, all one can say is 'I am not convinced'.

(propositional-contradiction) By this I mean that the result contradicts, on the coarse boolean level of propositional logic, another published result, and both proofs are long, so ferreting out the error is literally a dilemma, a διλήμματος, with two horns (which most of the time, sadly, are not so easy as to be formalizable in Horn logic). This the dream of anyone who has to refereee a long paper, since then there is an undisputable and documentable reason why one cannot give the go-ahead, if the traditional standards of truth are to be upheld at all (which they should), namely that propositional logic is a conditio-sine-qua-non, something like 'checking an arithmetical calculation modulo two'.

(many-small-gaps) By this I mean that neither (non-sequitur) nor (propositional-contradition) are applicable; the overall line of argumentation is convincing, and, by itself, the claimed conclusion seems credible, too, especially as there is no other proposition proved elsewhere which would propositionally contradict it, but there are lots of small mistakes. This is something between the dream and the nightmare: one can then with good conscious recommend publication, or at least, a second round, but the task of patching up all the small errors still is nightmarishly work-intensive.

None of the above three seems to imply any of the others. On a rough intuitive level, these seem mutually distinct 'types' of controversies around a manuscript (in my experience).

I'll 'tag' my proposed contribution to this thread with the second-named 'type'.

A proposed contribution to this thread.

(propositional-contradiction) With trepidation (since I am only beginning to understand what the real issues are), and due respect, let me mention one of the most famous examples these days. To repeat myself: I know that there are many many others round here whom it would behoove more to mention this.

Endlessly fascinatingly- and fertilely-controversial is:

M. M. Kapranov, V. A. Voevodsky: ∞-groupoids and homotopy types. Cahiers de Topologie et Géométrie Différentielle Catégoriques (1991) Volume: 32, Issue: 1, page 29-46

Now the question is of course whether this qualifies as 'endless controversy' since even one of the authors readily acknowledged that there was an error, but a fruitful error, indicative of the traditional methods (both the formal-methods and the social-methods) being inadequate to give 'durable wings' with which to do the 'flights of fancy' (in a positive sense) of higher category theory.

But, while still learning some of the relevant subject matter (and, myself, being mostly working to understand the comparably humble example of the unambiguous interpretability of pasting schemes in good-old-bicategories), I think I can recognize that the above example satisfies each of the requirements

  • famous (why? look around...)

  • endless (why? since this dedicated MO thread seems so unconclusive (to me); after as yet 2624 views on a professional focused site, said thread contains only a "guess" and detailed confirmation *that there is an incorrectness in the sense of propositional logic but it still seems not clear (to me) how to pin down the reason for why the authors 'went wrong'.

  • controversial (why? since one of the authors himself in public lectures said that at first he did not take Simpson's statement that something was wrong serious, rather thought that it was wrong to state that something was wrong; what is endlessly fascinating about this example is the expressiveness of the mathematics which gave rise to this 'controversy')

  • significant (why? because, similar to e.g. Poincaré fertile errors in 'Analysis Situs' and the 5 subsequent 'patches', Kapranov-Voevodsky's error turned out to be a fertile error, for example by motivating one of the authors to find an alternative formal system for mathematics)

A micro-summary is given on a page hosted by the Institute of Advanced Study in Princeton:

During these lectures, Voevodsky identified a mistake in the proof of a key lemma in his paper. Around the same time, another mathematician claimed that the main result of Kapranov and Voevodsky’s “∞-groupoids” paper could not be true, a flaw that Voevodsky confirmed fifteen years later. Examples of mathematical errors in his work and the work of other mathematicians became a growing concern for Voevodsky, especially as he began working in a new area of research that he called 2-theories, which involved discovering new higher-dimensional structures that were not direct extensions of those in lower dimensions. “Who would ensure that I did not forget something and did not make a mistake, if even the mistakes in much more simple arguments take years to uncover?” asked Voevodsky in a public lecture he gave at the Institute on the origins and motivations of his work on univalent foundations.

Voevodsky determined that he needed to use computers to verify his abstract, logical, and mathematical constructions. The primary challenge, according to Voevodsky, was that the received foundations of mathematics (based on set theory) were far removed from the actual practice of mathematicians, so that proof verifications based on them would be useless.

The

fifteen years later

seems to approximate "endless" rather closely.

Again, my apologies if this is off-topic for some reason that I do not see, and I know it is debatable whether this counts as endless controversy, maybe indefinite fertility would be a more fitting heading for this example.

$\endgroup$
  • $\begingroup$ On the subject of formal verification, Neil Strickland gave a talk on the subject. I don't think it's a great talk, but he does mention some of the same qualms as Voevodsky, if that's the way to put it. Personally I don't think formal verification has all the answers, and not only because there is obvious dispute about foundations. I think it is partly, perhaps mostly a problem of culture. $\endgroup$ – James Smith Oct 6 '17 at 18:33
  • $\begingroup$ @JamesSmith: thanks for pointing out. Personally, I like this talk of Neil Strickland very much and watched it at least three times over the last months. I don't think it is an accurate summary to say that he 'mentions some of the same qualms as Voevodsky'. In my understanding of the English language, 'qualm' is always used ironically and criticizingly to mean 'unjustified concern'. I think the concern are justified. While I recognize you didn't say the proponents of formalization say they have "all the answers", this reminds me of (please do not take offense) a 'straw man' argument. [...] $\endgroup$ – Peter Heinig Oct 6 '17 at 18:51
  • $\begingroup$ [...] Surely not an intentional 'straw man', yet this is some of those patterns of arguing where an extreme view, which none from the 'other side' ever voiced, is negated. Again, I am not criticizing you, but one should say that the new 'school' of formalization is informed, humble, and 'embraces' incompleteness, and diversity, and what not. They know what they are doing. One of the deepest things VV has said in the relevant lectures is that this is all about reasoning reliably with inconsistent formal systems. This statement contains much in one sentence. We shouldn't continue here. $\endgroup$ – Peter Heinig Oct 6 '17 at 18:53
  • 10
    $\begingroup$ Sorry for the off-topic comment, but: as a native English speaker, I don't think the word "qualm" has a connotation of irony or unjustified concern. For me, it does sometimes have a connotation of a vague or imprecise concern. But I would have no qualms about saying that I have qualms about a proof of type (non-sequitur). $\endgroup$ – Alex Kruckman Oct 7 '17 at 3:52
  • 1
    $\begingroup$ My experience, and the definition in Wiktionary (sense 3), agrees with @AlexKruckman. $\endgroup$ – LSpice Jan 1 at 1:14
25
$\begingroup$

As far as I know, Wu-Yi Hsiang still maintains that his proof of the Kepler conjecture is complete and correct. Perhaps this does not quite meet your criteria because it seems that nobody other than Hsiang believes that his proof is complete and correct; is that enough agreement to use the word "consensus"?

In the introduction to his delightful anthology, 18 Unconventional Essays on the Nature of Mathematics, Reuben Hersh states, regarding the Flyspeck project of Thomas Hales, that he does not know anyone who either believes that the project will be completed or that, even if claimed to be complete, it will be universally accepted as definitively verifying the correctness of the proof. Of course, the completion of Flyspeck was announced in 2014. My impression is that most people accept that Flyspeck has settled the Kepler conjecture, but there are probably still some skeptics. Back in 2008, I had an email exchange with someone who pointed out that HOL Light is based on OCAML, and that the formal correctness of OCAML has not been established. It may be that there will always be a nontrivial minority of mathematicians who remain skeptical of results whose only proof is not "surveyable" or "humanly comprehensible," in which case such results may remain permanently controversial. (One could imagine that one day the Kepler conjecture will have a humanly comprehensible proof, but there will surely be other results, e.g., in extremal combinatorics, that are unlikely to have any proof other than an immense computer verification.)

$\endgroup$
  • 3
    $\begingroup$ This reminds me of de Branges $\endgroup$ – Steve Huntsman Oct 5 '17 at 21:14
  • 19
    $\begingroup$ @SteveHuntsman: All correct proofs are alike; every incorrect proof is incorrect in its own way? $\endgroup$ – Lucia Oct 6 '17 at 2:54
  • $\begingroup$ I think the whole point of Hale's blueprint proof is that it is humanly comprehensible, certainly so compared to the original submitted to Annals. I've posted a link to Hale's own talk on the subject somewhere on this page, so I think best not to post it again, but it is well worth watching. It is interesting to note your comments about HOL light not itself being fully trustworthy. I didn't know that, I had assumed that it was. $\endgroup$ – James Smith Oct 15 '17 at 12:46
  • $\begingroup$ @JamesSmith : Some time ago Harrison provided a verification of the HOL Light kernel without definitions. However, since HOL Light runs (or originally ran) on top of OCAML, you might wonder about the correctness of OCAML. On the bright side, I gather that there has been some progress in this direction since 2008, e.g., link.springer.com/chapter/10.1007/978-3-319-08970-6_20 Regarding the "blueprint proof," it is humanly comprehensible, but there is still an enormous computer calculation involved whose results you simply have to trust. $\endgroup$ – Timothy Chow Oct 15 '17 at 19:18
  • $\begingroup$ I agree. However, it is worth pointing out in passing that the software making the calculations was also verified as part of the Flyspeck project. $\endgroup$ – James Smith Oct 15 '17 at 20:11
25
$\begingroup$

F. Enriques' claimed in 1904 that, given a smooth projective surface $S$ with irregularity $q>0$, what we call nowadays the Picard scheme of $S$ is an abelian variety of dimension $q$.

Enriques' algebraic proof was considered controversal and led to many disputes among the geometers of the Italian school (in fact, they called Enriques' claimed result the fundamental theorem in the theory of irregular algebraic surfaces, or also the theorem of completeness of the characteristic series).

Actually, Enriques' proof contained lacunae, as well as the subsequent proof by Severi. The first correct proof, using transcendental methods, was given by Poincaré in 1910. For a correct algebraic proof in characteristic $0$ it was necessary to wait for the work of Grothendieck, 50 years later.

Today it is known that the result is false in positive characteristic, as shown by Igusa in 1955. In fact, he constructed a smooth projective surface $S$ with $\mathrm{Pic}^0(S)$ non reduced, and hence not an abelian variety.

$\endgroup$
18
$\begingroup$

One classic example of this, though now resolved, is Euler's polyhedron formula $V - E + F = 2$. The formula initially was asserted without qualification, and gradually people began to point out cautiously (I suppose in deference to Euler) that there were "exceptions" to the theorem. The history of this formula is explored in Imre Lakatos's lovely book Proofs and refutations, written in the form of a drama, but with copious historical references.

This was a fertile error in the sense given above by Peter Heinig.

$\endgroup$
  • $\begingroup$ In fact the story of Lakatos show what mathematics is , and incindently the need for computer proof of what is 'in fine' totaulogical. $\endgroup$ – Jérôme JEAN-CHARLES Oct 9 '18 at 22:33
9
$\begingroup$

Stanley Yao Xiao's comment has been upvoted so highly that it seems worth posting as an answer.

There is a currently unresolved controversy over Shinichi Mochizuki's claimed proof of the abc conjecture. In a ten-page note, Peter Scholze and Jakob Stix have stated:

We, the authors of this note, came to the conclusion that there is no proof. We are going to explain where, in our opinion, the suggested proof has a problem, a problem so severe that in our opinion small modifications will not rescue the proof strategy.

Mochizuki, however, maintains that there are no problems with his proof and that Scholze and Stix suffer from "fundamental misunderstandings."

$\endgroup$
7
$\begingroup$

Nearly two decades after the publication of Adam Elga, Self-locating belief and the Sleeping Beauty problem, Analysis, 60(2): 143-147, 2000, there is apparently no consensus as to the resolution of the problem. See Peter Winkler, The Sleeping Beauty Controversy, The American Mathematical Monthly, Vol. 124, No. 7 (August-September 2017), pp. 579-587

$\endgroup$
  • $\begingroup$ Sleeping beauty paradox discussed at Cross Validated: stats.stackexchange.com/questions/41208/… $\endgroup$ – kjetil b halvorsen Oct 5 '17 at 22:21
  • 7
    $\begingroup$ This seems to me to be a philosophical controversy rather than a mathematical one. $\endgroup$ – Timothy Chow Oct 5 '17 at 23:09
  • 1
    $\begingroup$ @Timothy, maybe so, though it has been the subject of an article in the Math Intelligencer (J S Rosenthal, A mathematical analysis of the Sleeping Beauty problem, 31 (2009) 32-37) and Winkler's essay in the Monthly. $\endgroup$ – Gerry Myerson Oct 6 '17 at 3:07
  • $\begingroup$ The Sleeping Beauty problem looks to hav a lot of similarities to the Monty-Hall problem, but done in reverse, with a slightly different twist as to what one needs to (not) know to change a 1/3 probability into a 1/2 probability, and vice versa $\endgroup$ – Philip Oakley Oct 10 '17 at 14:32
  • 6
    $\begingroup$ The paradox arises because the problem involves two random variables: C, the result of the coin toss, and D, the current day of the week). Since SB will exist (but not necessarily be conscious) for both Monday and Tuesday, the prior distribution of (C,D) is equally distributed among all four possibilities (Heads,Monday), (Heads,Tuesday), (Tails,Monday), (Tails,Tuesday). Thus the prior probability of heads is 1/2. But when SB learns that she is conscious today, she now knows that (Heads,Tuesday) is eliminated, and the posterior probability of heads is now 1/3. $\endgroup$ – Terry Tao Dec 31 '18 at 22:50
-3
$\begingroup$

A seemingly endless controversy that has already lasted 15 years surrounds Yaroslav Sergeyev's proposed theory of infinity, first published in 2003. He has over twenty publications on this topic. Critics maintain that his theory is inconsistent, with whatever valid material actually derived from earlier rigorous sources. He also has some backers including one that posted an answer at MO.

Complete disclosure: I am one of the authors of this 2017 publication in Foundations of Science critical of Sergeyev's production.

Some other possibilities are mentioned in this question.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.