TOPICS
Search

Proof


A proof is a rigorous mathematical argument that unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem.

According to Hardy (1999, pp. 15-16), "all physicists, and a good many quite respectable mathematicians, are contemptuous about proof. I have heard Professor Eddington, for example, maintain that proof, as pure mathematicians understand it, is really quite uninteresting and unimportant, and that no one who is really certain that he has found something good should waste his time looking for proof.... [This opinion], with which I am sure that almost all physicists agree at the bottom of their hearts, is one to which a mathematician ought to have some reply."

To prove Hardy's assertion, Feynman is reported to have commented, "A great deal more is known than has been proved" (Derbyshire 2004, p. 291).

A computer-assisted proof can reduce a proposition to finitely many cases and use a program to check each case. Appel and Haken's proof of the four-color theorem used computer computations for checks that were impractical to carry out by hand (Gonthier 2008).

A proof assistant checks a formal derivation, including the argument that connects any verified computations to the conclusion. Gonthier (2008) describes a later formal proof of the four-color theorem checked by Coq, covering both the logical argument and its computational steps.

In AI-assisted mathematics, a model can propose a formal derivation and a proof assistant such as Lean can check it against a precisely stated proposition (de Moura and Ullrich 2021).

Machine checking separates two questions. It can verify that a formal derivation establishes a formal statement from a stated axiomatic system, but this does not itself show that the formal statement faithfully expresses the intended informal claim. Checking the formalization is therefore distinct from checking the derivation (Wolfram 2026).

A proof can establish a result without explaining why its key ideas work or how they might apply elsewhere. In discussing AI-generated proofs, Terence Tao observed that producing more proofs need not yield more mathematical understanding (Numberphile 2026).

A page of proof-related humor is maintained by Chalmers.


See also

AI-Assisted Mathematics, Axiomatic System, Conjecture, Constructive Proof, Deep Theorem, Direct Proof, Dissection Proof, Existence Problem, Existence Theorem, Experimental Mathematics, Hypothesis, Indirect Proof, Lemma, Nonconstructive Proof, Paradox, Proof without Words, Proposition, Q.E.D., Reductio ad Absurdum, Rigorous, Theorem, Trivial, Two-Column Proof

Explore with Wolfram|Alpha

References

Aigner, M. and Ziegler, G. M. Proofs from the Book. New York: Springer-Verlag, 1999.Allenby, R. Numbers and Proofs. Oxford, England: Oxford University Press, 1997.Benson, D. C. The Moment of Proof: Mathematical Epiphanies. Oxford, England: Oxford University Press, 1999.Chalmers, D. "Philosophical Humor." https://consc.net/philosophical-humor/.de Moura, L. and Ullrich, S. "The Lean 4 Theorem Prover and Programming Language." In Proc. Automated Deduction--CADE 28 (Ed. A. Platzer and G. Sutcliffe). Cham, Switzerland: Springer, pp. 625-635, 2021. https://doi.org/10.1007/978-3-030-79876-5_37.Derbyshire, J. Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. New York: Penguin, 2004.Epstein, D. and Levy, S. "Experimentation and Proof in Mathematics." Not. Amer. Math. Soc. 42, 670-674, 1995.Garnier, R. and Taylor, J. 100% Mathematical Proof. New York: Wiley, 1996.Gonthier, G. "Formal Proof--The Four-Color Theorem." Not. Amer. Math. Soc. 55, 1382-1393, 2008. https://www.ams.org/notices/200811/tx081101382p.pdf.Greenwald, S. J. "Simpsons Math." http://www.cs.appstate.edu/~sjg/simpsonsmath/blackboard.html.Hardy, G. H. "Mathematical Proof." Mind 38, 1-25, 1929.Hardy, G. H. Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work, 3rd ed. New York: Chelsea, 1999.Krantz, S. G. Techniques of Problem Solving. Providence, RI: Amer. Math. Soc., 1997.Laczkovich, M. Conjecture and Proof. Washington, DC: Math. Assoc. Amer., 2001.Numberphile. "No More Heroes--Terence Tao Talks to Numberphile About AI." Featuring T. Tao. Oct. 15, 2026. https://www.youtube.com/watch?v=bAnwMdfcMVw.The Omega Group. "The OMEGA System." http://www.ags.uni-sb.de/~omega/soft/omega/.Pólya, G. Mathematical Discovery: On Understanding, Learning, and Teaching Problem Solving, 2 vols. in One. New York: Wiley, 1981.Pólya, G. How to Solve It: A New Aspect of Mathematical Method, 2nd ed. Princeton, NJ: Princeton University Press, 1988.Pólya, G. Mathematics and Plausible Reasoning, Vol. 1: Induction and Analogy in Mathematics. Princeton, NJ: Princeton University Press, 1990.Pólya, G. Mathematics and Plausible Reasoning, Vol. 2: Patterns of Plausible Inference. Princeton, NJ: Princeton University Press, 1990.Research Institute for Symbolic Computation. "Overview of Theorema." https://risc.jku.at/research_topic/automated-reasoning/.Solow, D. How to Read and Do Proofs: An Introduction to Mathematical Thought Process, 2nd ed. New York: Wiley, 1990.Vakil, R. A Mathematical Mosaic: Patterns and Problem Solving. Washington, DC: Math. Assoc. Amer., 1997.Wickelgren, W. A. How to Solve Mathematical Problems: Elements of a Theory of Problems and Problem Solving. New York: Dover, 1995.Wolfram, S. A New Kind of Science. Champaign, IL: Wolfram Media, p. 1157, 2002.Wolfram, S. "What's the Future for Pure Math Research in the Age of AI?" Sep. 28, 2026. https://writings.stephenwolfram.com/2026/09/whats-the-future-for-pure-math-research-in-the-age-of-ai/.

Referenced on Wolfram|Alpha

Proof

Cite this as:

Weisstein, Eric W. "Proof." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Proof.html

Subject classifications