Proof by exhaustion

This article is about the type of mathematical proof. For the method of calculating limits, see Method of exhaustion.
"Brute force method" redirects here. For similarly named methods in other disciplines, see Brute force (disambiguation).
"Proof by cases" redirects here. For the concept in propositional logic, see Disjunction elimination.

Proof by exhaustion, also known as proof by cases, proof by case analysis, complete 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 or sets of equivalent cases, and where each type of case is checked to see if the proposition in question holds.[1] This is a method of direct proof. A proof by exhaustion typically contains two stages:

  1. A proof that the set of cases is exhaustive; i.e., that each instance of the statement to be proved matches the conditions of (at least) one of the cases.
  2. A proof of each of the cases.

The prevalence of digital computers has greatly increased the convenience of using the method of exhaustion (e.g., the first computer-assisted proof of four color theorem in 1976), though such approaches can also be challenged on the basis of mathematical elegance. Expert systems can be used to arrive at answers to many of the questions posed to them. In theory, the proof by exhaustion method can be used whenever the number of cases is finite. However, because most mathematical sets are infinite, this method is rarely used to derive general mathematical results.[2]

In the Curry–Howard isomorphism, proof by exhaustion and case analysis are related to ML-style pattern matching.[citation needed]

  1. ^ Reid, D. A; Knipping, C (2010), Proof in Mathematics Education: Research, Learning, and Teaching, Sense Publishers, p. 133, ISBN 978-9460912443.
  2. ^ S., Epp, Susanna (2011-01-01). Discrete mathematics with applications. Brooks/Cole. ISBN 978-0495391326. OCLC 970542319.{{cite book}}: CS1 maint: multiple names: authors list (link)