Editing Counterexample

{{Short description|Exception to a proposed general rule}}
A '''counterexample''' is any exception to a [[generalization]].  In [[logic]] a counterexample disproves the generalization, and does so [[rigor|rigorously]] in the fields of [[mathematics]] and [[philosophy]].<ref name=":0">{{Cite web|url=https://www.mathwords.com/c/counterexample.htm|title=Mathwords: Counterexample|website=www.mathwords.com|access-date=2019-11-28}}</ref> For example, the fact that "student John Smith is not lazy" is a counterexample to the generalization "students are lazy", and both a counterexample to, and disproof of, the [[universal quantification]] "all students are lazy."<ref>{{Cite web|url=http://mathworld.wolfram.com/Counterexample.html|title=Counterexample|last=Weisstein|first=Eric W.|website=mathworld.wolfram.com|language=en|access-date=2019-11-28}}</ref>

==In mathematics==
In mathematics, counterexamples are often used to prove the boundaries of possible theorems. By using counterexamples to show that certain conjectures are false, mathematical researchers can then avoid going down blind alleys and learn to modify conjectures to produce provable theorems. It is sometimes said that mathematical development consists primarily in finding (and proving) theorems and counterexamples.<ref>{{Cite web|url=https://www.cut-the-knot.org/WhatIs/WhatIsCounterexample.shtml|title=What Is Counterexample?|website=www.cut-the-knot.org|access-date=2019-11-28}}</ref>

===Rectangle example===
Suppose that a mathematician is studying [[geometry]] and [[shape]]s, and she wishes to prove certain theorems about them. She [[conjecture]]s that "All [[rectangles]] are [[Square (geometry)|squares]]", and she is interested in knowing whether this statement is true or false. 

In this case, she can either attempt to [[Mathematical proof|prove]] the truth of the statement using [[deductive reasoning]], or she can attempt to find a counterexample of the statement if she suspects it to be false. In the latter case, a counterexample would be a rectangle that is not a square, such as a rectangle with two sides of length 5 and two sides of length 7. However, despite having found rectangles that were not squares, all the rectangles she did find had four sides. She then makes the new conjecture "All rectangles have four sides". This is logically weaker than her original conjecture, since every square has four sides, but not every four-sided shape is a square.

The above example explained — in a simplified way — how a mathematician might weaken her conjecture in the face of counterexamples, but counterexamples can also be used to demonstrate the necessity of certain assumptions and [[hypothesis]]. For example, suppose that after a while, the mathematician above settled on the new conjecture "All shapes that are rectangles and have four sides of equal length are squares". This conjecture has two parts to the hypothesis: the shape must be 'a rectangle' and must have  'four sides of equal length'. The mathematician then would like to know if she can remove either assumption, and still maintain the truth of her conjecture. This means that she needs to check the truth of the following two statements:

# "All shapes that are rectangles are squares."
# "All shapes that have four sides of equal length are squares".

A counterexample to (1) was already given above, and a counterexample to (2) is a non-square [[rhombus]]. Thus, the mathematician now knows that each assumption by itself is insufficient.

===Other mathematical examples===
{{See also|Counterexamples in topology|Minimal counterexample}}

A counterexample to the statement "all [[prime number]]s are [[Parity (mathematics)|odd numbers]]" is the number 2, as it is a prime number but is not an odd number.<ref name=":0" /> Neither of the numbers 7 or 10 is a counterexample, as neither of them are enough to contradict the statement. In this example, 2 is in fact the only possible counterexample to the statement, even though that alone is enough to contradict the statement. In a similar manner, the statement "All [[natural number]]s are either [[Prime number|prime]] or [[Composite number|composite]]" has the number 1 as a counterexample, as 1 is neither prime nor composite.

[[Euler's sum of powers conjecture]] was disproved by counterexample. It asserted that at least ''n'' ''n''<sup>th</sup> powers were necessary to sum to another ''n''<sup>th</sup> power. This conjecture was disproved in 1966,<ref>{{cite journal|last=Lander, Parkin|year=1966|title=Counterexample to Euler's conjecture on sums of like powers|journal=Bulletin of the American Mathematical Society|publisher=Americal Mathematical Society|volume=72|issue=6|page=1079|issn=0273-0979|url=https://www.ams.org/journals/bull/1966-72-06/S0002-9904-1966-11654-3/S0002-9904-1966-11654-3.pdf|access-date=2 August 2018|doi=10.1090/s0002-9904-1966-11654-3|doi-access=free}}</ref> with a counterexample involving ''n''&nbsp;=&nbsp;5; other ''n''&nbsp;=&nbsp;5 counterexamples are now known, as well as some ''n''&nbsp;=&nbsp;4 counterexamples.<ref>{{Cite journal|last=Elkies|first=Noam|date=October 1988|title=On A4 + B4 + C4 = D4|url=https://www.ams.org/journals/mcom/1988-51-184/S0025-5718-1988-0930224-9/S0025-5718-1988-0930224-9.pdf|journal=Mathematics of Computation|volume=51|issue=184|pages=825–835}}</ref>

[[Witsenhausen's counterexample]] shows that it is not always true (for [[control theory|control problems]]) that a quadratic [[loss function]] and a linear equation of evolution of the [[state variable]] imply optimal control laws that are linear.

All [[Euclidean plane isometries]] are mappings that preserve [[area]], but the [[converse (logic)|converse]] is false as shown by counterexamples [[shear mapping]] and [[squeeze mapping]].

Other examples include the disproofs of the [[Seifert conjecture]], the [[Pólya conjecture]], the conjecture of [[Hilbert's fourteenth problem]], [[Tait's conjecture]], and the [[Ganea conjecture]].

==In philosophy==
{{norefs|section|date=January 2025}}
In [[philosophy]], counterexamples are usually used to argue that a certain philosophical position is wrong by showing that it does not apply in certain cases. Alternatively, the first philosopher can modify their claim so that the counterexample no longer applies; this is analogous to when a mathematician modifies a conjecture because of a counterexample.

For example, in [[Plato]]'s ''[[Gorgias (dialogue)|Gorgias]]'', [[Callicles]], trying to define what it means to say that some people are "better" than others, claims that those who are stronger are better. [[Socrates]] replies that, because of their strength of numbers, the class of common rabble is stronger than the propertied class of nobles, even though the masses are ''[[prima facie]]'' of worse character. Thus Socrates has proposed a counterexample to Callicles' claim, by looking in an area that Callicles perhaps did not expect — groups of people rather than individual persons.

Callicles might challenge Socrates' counterexample, arguing perhaps that the common rabble really are better than the nobles, or that even in their large numbers, they still are not stronger. But if Callicles accepts the counterexample, then he must either withdraw his claim, or modify it so that the counterexample no longer applies. For example, he might modify his claim to refer only to individual persons, requiring him to think of the common people as a collection of individuals rather than as a mob. As it happens, he modifies his claim to say "wiser" instead of "stronger", arguing that no amount of numerical superiority can make people wiser.

==See also==
*[[Contradiction]]
*[[Exception that proves the rule]]
*[[Minimal counterexample]]

==References==
{{Reflist}}

==Further reading==
* [[Imre Lakatos]], ''[[Proofs and Refutations]]'' (1976) Cambridge University Press {{isbn|0521290384}}
* [[James Franklin (philosopher)|James Franklin]] and Albert Daoud (2011) ''Proof in Mathematics: An Introduction'', Kew, Sydney {{ISBN|978-0-646-54509-7}}, ch. 6.
* [[Lynn Arthur Steen]] and [[J. Arthur Seebach, Jr.]] (1978) ''[[Counterexamples in Topology]]'', Springer, New York {{ISBN|0-486-68735-X}}.
* Joseph P. Romano and Andrew F. Siegel (1986) ''[[Counterexamples in Probability and Statistics]]'' Chapman & Hall, New York, London {{ISBN|0-412-98901-8}}.
* Gary L. Wise and Eric B. Hall (1993) ''Counterexamples in Probability and Real Analysis''. Oxford University Press, New York {{ISBN|0-19-507068-2}}.
* Bernard R. Gelbaum, John M. H. Olmsted (2003) ''Counterexamples in Analysis''. Corrected reprint of the second (1965) edition, Dover Publications, Mineola, NY {{ISBN|0-486-42875-3}}.
* Jordan M. Stoyanov (1997) ''[[Counterexamples in Probability]]'' Second edition, Wiley, Chichester {{ISBN|0-471-96538-3}}.
* Michael Copobianco & John Mulluzzo (1978) ''Examples and Counterexamples in Graph Theory'', Elsevier North-Holland {{ISBN|0-444-00255-3}}.

==External links==
*{{wikiquote-inline}}

[[Category:Mathematical terminology]]
[[Category:Logic]]
[[Category:Interpretation (philosophy)]]
[[Category:Methods of proof]]