Number of Cases
There is no upper limit to the number of cases allowed in a proof by exhaustion. Sometimes there are only two or three cases. Sometimes there may be thousands or even millions. For example, rigorously solving an endgame puzzle in chess might involve considering a very large number of possible positions in the game tree of that problem.
The first proof of the four colour theorem was a proof by exhaustion with 1,936 cases. This proof was controversial because the majority of the cases were checked by a computer program, not by hand. The shortest known proof of the four colour theorem today still has over 600 cases.
Mathematicians prefer to avoid proofs with large numbers of cases, as they seem inelegant. A proof with a large number of cases leaves an impression that the theorem is only true by coincidence, and not because of some underlying principle or connection. Other types of proofs—such as proof by induction (mathematical induction)—are considered more elegant. However, there are some important theorems for which no other method of proof has been found, such as
- The proof that there is no finite projective plane of order 10.
- The classification of finite simple groups.
- The Kepler conjecture.
Read more about this topic: Proof By Exhaustion
Famous quotes containing the words number of, number and/or cases:
“The poetic act consists of suddenly seeing that an idea splits up into a number of equal motifs and of grouping them; they rhyme.”
—Stéphane Mallarmé (1842–1898)
“Can it be, that the Greek grammarians invented their dual number for the particular benefit of twins?”
—Herman Melville (1819–1891)
“I do not believe in lawyers, in that mode of attacking or defending a man, because you descend to meet the judge on his own ground, and, in cases of the highest importance, it is of no consequence whether a man breaks a human law or not. Let lawyers decide trivial cases.”
—Henry David Thoreau (1817–1862)