Jump to content

Minimal counterexample

From Wikipedia, the free encyclopedia

In mathematics, a minimal counterexample is the smallest example which falsifies a claim, and a proof by minimal counterexample is a method of proof which combines the use of a minimal counterexample with the ideas of proof by induction and proof by contradiction.[1][2] More specifically, in trying to prove a proposition P, one first assumes by contradiction that it is false, and that therefore there must be at least one counterexample. With respect to some idea of size (which may need to be chosen carefully), one then concludes that there is such a counterexample C that is minimal. In regard to the argument, C is generally something quite hypothetical (since the truth of P excludes the possibility of C), but it may be possible to argue that if C existed, then it would have some definite properties which, after applying some reasoning similar to that in an inductive proof, would lead to a contradiction, thereby showing that the proposition P is indeed true.[3]

If the form of the contradiction is that we can derive a further counterexample D, that is smaller than C in the sense of the working hypothesis of minimality, then this technique is traditionally called proof by infinite descent. In which case, there may be multiple and more complex ways to structure the argument of the proof.

The assumption that if there is a counterexample, there is a minimal counterexample, is based on a well-ordering of some kind. The usual ordering on the natural numbers is clearly possible, by the most usual formulation of mathematical induction; but the scope of the method can include well-ordered induction of any kind.



The minimal counterexample method has been much used in the classification of finite simple groups. The Feit–Thompson theorem, that finite simple groups that are not cyclic groups have even order, was proved based on the hypothesis of some, and therefore some minimal, simple group G of odd order. Every proper subgroup of G can be assumed a solvable group, meaning that much theory of such subgroups could be applied.[4]

Euclid's proof of the fundamental theorem of arithmetic is a simple proof which uses a minimal counterexample.[5][6]

Courant and Robbins used the term minimal criminal for a minimal counter-example in the context of the four color theorem.[7]


  1. ^ Chartrand, Gary, Albert D. Polimeni, and Ping Zhang. Mathematical Proofs: A Transition to Advanced Mathematics. Boston: Pearson Education, 2013. Print.
  2. ^ Klipper, Michael (Fall 2012). "Proof by Minimum Counterexample" (PDF). alpha.math.uga.edu. Archived from the original (PDF) on 2018-04-17. Retrieved 2019-11-28.
  3. ^ Lewis, Tom (Fall 2010). "§20 Smallest Counterexample" (PDF). math.furman.edu. Retrieved 2019-11-28.
  4. ^ Feit, Walter; Thompson, John G. (1963), "Solvability of groups of odd order", Pacific Journal of Mathematics, 13: 775–1029, doi:10.2140/pjm.1963.13.775, ISSN 0030-8730, MR 0166261
  5. ^ "The Fundamental Theorem of Arithmetic | Divisibility & Induction | Underground Mathematics". undergroundmathematics.org. Retrieved 2019-11-28.
  6. ^ "The fundamental theorem of arithmetic". www.dpmms.cam.ac.uk. Retrieved 2019-11-28.
  7. ^ Richard Courant; Herbert Robbins (1996). What is Mathematics? (2nd ed.). Oxford: Oxford University Press. ISBN 9780195105193. Here: p.495: "Since there is no point in making bad maps bigger, we go the opposite way and look at the smallest bad maps, colloquially known as minimal criminals."