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)
“It is not the number of years we have behind us, but the number we have before us, that makes us careful and responsible and determined to find out the truth about everything.”
—George Bernard Shaw (1856–1950)
“Medication alone is not to be relied on. In one half the cases medicine is not needed, or is worse than useless. Obedience to spiritual and physical laws—hygeine [sic] of the body, and hygeine of the spirit—is the surest warrant for health and happiness.”
—Harriot K. Hunt (1805–1875)