Proof by exhaustion, also known as proof by cases, perfect induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases and each case is checked to see if the proposition in question holds. A proof by exhaustion contains two stages:
- A proof that the cases are exhaustive; i.e., that each instance of the statement to be proved matches the conditions of (at least) one of the cases.
- A proof of each of the cases.
In the Curry–Howard isomorphism, proof by exhaustion and case analysis are related to ML-style pattern matching.
Read more about Proof By Exhaustion: Example, Number of Cases
Famous quotes containing the words proof and/or exhaustion:
“A short letter to a distant friend is, in my opinion, an insult like that of a slight bow or cursory salutation—a proof of unwillingness to do much, even where there is a necessity of doing something.”
—Samuel Johnson (1709–1784)
“The becoming of man is the history of the exhaustion of his possibilities.”
—Susan Sontag (b. 1933)