List of incomplete proofs

Last updated

This page lists notable examples of incomplete published mathematical proofs. Most of these were accepted as correct for several years but later discovered to contain gaps. There are both examples where a complete proof was later found and where the alleged result turned out to be false.

Contents

Results later proved rigorously

Incorrect results

Status unclear

See also

Notes

  1. Thomas L. Saaty and Paul C. Kainen (1986). The Four-Color Problem: Assaults and Conquest. Dover Publications. ISBN   978-0-486-65092-0.
  2. Ernst Schröder (1898), Kaiserliche Leopoldino-Carolinische Deutsche Akademie der Naturforscher (ed.), "Ueber zwei Definitionen der Endlichkeit und G. Cantor'sche Sätze", Nova Acta, Halle a. S.: Johann Ambrosius Barth Verlag, 71 (6): 303–376 (proof: p.336–344)
  3. Alwin R. Korselt (1911), Felix Klein; Walther von Dyck; David Hilbert; Otto Blumenthal (eds.), "Über einen Beweis des Äquivalenzsatzes", Mathematische Annalen , Leipzig: B. G. Teubner, 70 (2): 294–296, doi:10.1007/bf01461161, ISSN   0025-5831, S2CID   119757900
  4. Felix Hausdorff (2002), Egbert Brieskorn; Srishti D. Chatterji; et al. (eds.), Grundzüge der Mengenlehre (1. ed.), Berlin/Heidelberg: Springer, p. 587, ISBN   3-540-42224-2 Original edition (1914)
  5. Korselt (1911), p.295
  6. 1 2 Yulij Ilyashenko (2002). "Centennial History of Hilbert's 16th problem" (PDF). Bulletin of the AMS. 39 (3): 301–354. doi: 10.1090/s0273-0979-02-00946-1 .
  7. Zubkov, A. M. (2011). "Euler and combinatorial calculus". Proceedings of the Steklov Institute of Mathematics. 274: 162–168. doi:10.1134/s0081543811070030. S2CID   121881906.
  8. Legendre, Adrien-Marie. Essai sur la théorie des nombres. 1798.
  9. Grünbaum, Branko (2010), "The Bilinski dodecahedron and assorted parallelohedra, zonohedra, monohedra, isozonohedra, and otherhedra" (PDF), The Mathematical Intelligencer , 32 (4): 5–15, doi:10.1007/s00283-010-9138-7, hdl: 1773/15593 , MR   2747698, S2CID   120403108, archived from the original (PDF) on 2015-04-02.
  10. "Ho.history overview - Widely accepted mathematical results that were later shown to be wrong?".
  11. Boerger, Egon; Grädel, Erich; Gurevich, Yuri (1997). The Classical Decision Problem. Springer. p. 188. ISBN   3-540-42324-9.
  12. Goldfarb, Warren (1986). Feferman, Solomon (ed.). Kurt Gödel: Collected Works. Vol. 1. Oxford University Press. pp. 229–231. ISBN   0-19-503964-5.
  13. Roos, Jan-Erik (1961). "Sur les foncteurs dérivés de lim. Applications". C. R. Acad. Sci. Paris. 252: 3702–3704. MR   0132091.
  14. Neeman, Amnon (2002). "A counterexample to a 1961 "theorem" in homological algebra". Inventiones Mathematicae. 148 (2): 397–420. Bibcode:2002InMat.148..397N. doi:10.1007/s002220100197. MR   1906154. S2CID   121186299.
  15. Roos, Jan-Erik (2006), "Derived functors of inverse limits revisited", J. London Math. Soc. , Series 2, 73 (1): 65–83, doi:10.1112/S0024610705022416, MR   2197371, S2CID   122666355
  16. Porter, Roy (2003). The Cambridge History of Science . Cambridge University Press. p.  476. ISBN   0-521-57199-5.
  17. G. D. Birkhoff and W. J. Trjitzinsky (1933). "Analytic theory of singular difference equations". Acta Math. 60 (1): 1–89. doi: 10.1007/BF02398269 . S2CID   121809579.
  18. J. Wimp and D. Zeilberger (1985). "Resurrecting the asymptotics of linear recurrences". J. Math. Anal. Appl. 111 (1): 162–176. doi: 10.1016/0022-247X(85)90209-4 .
  19. P. Flajolet and R. Sedgewick (2009). Analytic Combinatorics. Cambridge University Press. pp. 582/683. ISBN   9780521898065.
  20. "Geometry - Has anyone ever actually seen this Daniel Biss paper?".
  21. Mnev, N. "On DK Biss' papers" The homotopy type of the matroid Grassmannian" and" Oriented matroids, complex manifolds, and a combinatorial model for BU"." arXiv : 0709.1291 (2007).
  22. Bordg, A. A Replication Crisis in Mathematics?. Math Intelligencer (2021). https://doi.org/10.1007/s00283-020-10037-7

Related Research Articles

<span class="mw-page-title-main">Conjecture</span> Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics.

Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible.

<span class="mw-page-title-main">Louis de Branges de Bourcia</span> French-American mathematician

Louis de Branges de Bourcia is a French-American mathematician. He is the Edward C. Elliott Distinguished Professor of Mathematics at Purdue University in West Lafayette, Indiana. He is best known for proving the long-standing Bieberbach conjecture in 1984, now called de Branges's theorem. He claims to have proved several important conjectures in mathematics, including the generalized Riemann hypothesis.

A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "student John Smith is not lazy" is a counterexample to the generalization “students are lazy”, and both a counterexample to, and disproof of, the universal quantification “all students are lazy.”

In mathematics, Hilbert's second problem was posed by David Hilbert in 1900 as one of his 23 problems. It asks for a proof that the arithmetic is consistent – free of any internal contradictions. Hilbert stated that the axioms he considered for arithmetic were the ones given in Hilbert (1900), which include a second order completeness axiom.

<span class="mw-page-title-main">Hilbert's problems</span> 23 mathematical problems stated in 1900

Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. They were all unsolved at the time, and several proved to be very influential for 20th-century mathematics. Hilbert presented ten of the problems at the Paris conference of the International Congress of Mathematicians, speaking on August 8 at the Sorbonne. The complete list of 23 problems was published later, in English translation in 1902 by Mary Frances Winston Newson in the Bulletin of the American Mathematical Society.

In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object. This is in contrast to a non-constructive proof, which proves the existence of a particular kind of object without providing an example. For avoiding confusion with the stronger concept that follows, such a constructive proof is sometimes called an effective proof.

The Kepler conjecture, named after the 17th-century mathematician and astronomer Johannes Kepler, is a mathematical theorem about sphere packing in three-dimensional Euclidean space. It states that no arrangement of equally sized spheres filling space has a greater average density than that of the cubic close packing and hexagonal close packing arrangements. The density of these arrangements is around 74.05%.

<span class="mw-page-title-main">Pierre Deligne</span> Belgian mathematician

Pierre René, Viscount Deligne is a Belgian mathematician. He is best known for work on the Weil conjectures, leading to a complete proof in 1973. He is the winner of the 2013 Abel Prize, 2008 Wolf Prize, 1988 Crafoord Prize, and 1978 Fields Medal.

The Gelfond–Schneider constant or Hilbert number is two to the power of the square root of two:

In mathematics, Hilbert's fourteenth problem, that is, number 14 of Hilbert's problems proposed in 1900, asks whether certain algebras are finitely generated.

The twenty-first problem of the 23 Hilbert problems, from the celebrated list put forth in 1900 by David Hilbert, concerns the existence of a certain class of linear differential equations with specified singular points and monodromic group.

In mathematics, a proof of impossibility is a proof that demonstrates that a particular problem cannot be solved as described in the claim, or that a particular set of problems cannot be solved in general. Such a case is also known as a negative proof, proof of an impossibility theorem, or negative result. Since they show that something cannot be done, proofs of impossibility often are the resolutions to decades or centuries of work attempting to find a solution. Proving that something is impossible is usually much harder than the opposite task, as it is often necessary to develop a proof that works in general, rather than to just show a particular example. Impossibility theorems are usually expressible as negative existential propositions or universal propositions in logic.

In mathematics, the Nagata conjecture on curves, named after Masayoshi Nagata, governs the minimal degree required for a plane algebraic curve to pass through a collection of very general points with prescribed multiplicities.

This is a timeline of pure and applied mathematics history. It is divided here into three stages, corresponding to stages in the development of mathematical notation: a "rhetorical" stage in which calculations are described purely by words, a "syncopated" stage in which quantities and common algebraic operations are beginning to be represented by symbolic abbreviations, and finally a "symbolic" stage, in which comprehensive notational systems for formulas are the norm.

<span class="mw-page-title-main">Wiles's proof of Fermat's Last Theorem</span> 1995 publication in mathematics

Wiles's proof of Fermat's Last Theorem is a proof by British mathematician Andrew Wiles of a special case of the modularity theorem for elliptic curves. Together with Ribet's theorem, it provides a proof for Fermat's Last Theorem. Both Fermat's Last Theorem and the modularity theorem were almost universally considered inaccessible to prove by contemporaneous mathematicians, meaning that they were believed to be impossible to prove using current knowledge.

In mathematics, class field theory is the study of abelian extensions of local and global fields.

References

Further reading

Lecat, Maurice (1935), Erreurs de mathématiciens des origines à nos jours, Bruxelles - Louvain: Librairie Castaigne - Ém. Desbarax — Lists over a hundred pages of (mostly trivial) published errors made by mathematicians.

MathOverflow questions

StackExchange questions