List of incomplete or incorrect mathematical proofs

Last updated

A technical argument by a trusted author, which is hard to check and looks similar to arguments known to be correct, is hardly ever checked in detail.

Contents

Vladimir Voevodsky, [1]

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

Results later proved rigorously

Incorrect results

Status unclear

See also

Notes

  1. 1 2 Voevodsky, Vladimir (March 26, 2014). "Univalent Foundations" (PDF). Institute for Advanced Study .
  2. Saaty, Thomas L.; Kainen, Paul C. (1986). The four-color problem: assaults and conquest. New York: Dover Publications. ISBN   978-0-486-65092-0.
  3. Schröder, Ernst (1898). Kaiserliche Leopoldino-Carolinische Deutsche Akademie der Naturforscher (ed.). Ueber zwei Definitionen der Endlichkeit und G. Cantor'sche Sätze. Vol. 71. Johann Ambrosius Barth Verlag. pp. 303–376 (proof: p.336–344).
  4. Korselt, A. (June 1911). Klein, Felix; Walther von Dyck; David Hilbert; Otto Blumenthal (eds.). "Über einen Beweis des Äquivalenzsatzes". Mathematische Annalen (in German). 70 (2). Leipzig: B. G. Teubner: 294–296. doi:10.1007/BF01461161. ISSN   0025-5831. S2CID   119757900.
  5. Hausdorff, Felix; Brieskorn, Egbert (2001). Gesammelte Werke: einschliesslich der under dem Pseudonym Paul Mongré erschienenen philosophischen und literarischen Schriften und ausgewählter Texte aus dem Nachlass (1. ed.). Berlin ; New York: Springer. p. 587. ISBN   978-3-642-25598-4. OCLC   57368353.Original edition (1914)
  6. Korselt 1911 , p. 295
  7. 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 .
  8. Zubkov, A. M. (2011). "Euler and combinatorial calculus". Proceedings of the Steklov Institute of Mathematics. 274: 162–168. doi:10.1134/s0081543811070030. S2CID   121881906.
  9. Legendre, Adrien-Marie (1798). Essai sur la théorie des nombres. Paris: Duprat.
  10. 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.
  11. "Ho.history overview - Widely accepted mathematical results that were later shown to be wrong?".
  12. Boerger, Egon; Grädel, Erich; Gurevich, Yuri (1997). The Classical Decision Problem. Springer. p. 188. ISBN   3-540-42324-9.
  13. Goldfarb, Warren (1986). Feferman, Solomon (ed.). Kurt Gödel: Collected Works. Vol. 1. Oxford University Press. pp. 229–231. ISBN   0-19-503964-5.
  14. Roos, Jan-Erik (1961). "Sur les foncteurs dérivés de lim. Applications". C. R. Acad. Sci. Paris. 252: 3702–3704. MR   0132091.
  15. 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.
  16. 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
  17. Porter, Roy (2003). The Cambridge History of Science . Cambridge University Press. p.  476. ISBN   0-521-57199-5.
  18. 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.
  19. 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 .
  20. P. Flajolet and R. Sedgewick (2009). Analytic Combinatorics. Cambridge University Press. pp. 582/683. ISBN   9780521898065.
  21. "Geometry - Has anyone ever actually seen this Daniel Biss paper?".
  22. Mnev, N. (2007). "On D.K. Biss' papers 'The homotopy type of the matroid Grassmannian' and 'Oriented matroids, complex manifolds, and a combinatorial model for BU'". arXiv: 0709.1291 [math.CO].
  23. Bordg, Anthony (December 2021). "A Replication Crisis in Mathematics?". The Mathematical Intelligencer. 43 (4): 48–52. doi:10.1007/s00283-020-10037-7. ISSN   0343-6993. PMC   8700325 . PMID   34966193.

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 conjecture, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

<span class="mw-page-title-main">David Hilbert</span> German mathematician (1862–1943)

David Hilbert was a German mathematician and philosopher of mathematics and one of the most influential mathematicians of his time.

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.

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 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.

Foundations of mathematics is the logical and mathematical framework that allows the development of mathematics without generating self-contradictory theories, and, in particular, to have reliable concepts of theorems, proofs, algorithms, etc. This may also include the philosophical study of the relation of this framework with reality.

<span class="mw-page-title-main">Algebraic number theory</span> Branch of number theory

Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.

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.

<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.

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

In mathematics, an impossibility theorem is a theorem that demonstrates a problem or general set of problems cannot be solved. These are also known as proofs of impossibility, negative proofs, or negative results. Impossibility theorems often resolve decades or centuries of work spent looking for a solution by proving there is no 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.

<span class="mw-page-title-main">Fermat's Last Theorem</span> 17th-century conjecture proved by Andrew Wiles in 1994

In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions.

A timeline of mathematical logic; see also history of logic.

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.

In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.

<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 believed to be impossible to prove using previous knowledge by almost all living mathematicians at the time.

References

Further reading

MathOverflow questions

StackExchange questions