HOME

TheInfoList



OR:

A counterexample is any exception to a
generalization A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims. Generalizations posit the existence of a domain or set of elements, as well as one or more common characteri ...
. In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premises ...
a counterexample disproves the generalization, and does so rigorously in the fields of
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
and
philosophy Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, knowledge, values, mind, and language. Such questions are often posed as problems to be studied or resolved. Some ...
. For example, the fact that "John Smith is not a lazy student" is a counterexample to the generalization “students are lazy”, and both a counterexample to, and disproof of, the
universal quantification In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other w ...
“all students are lazy.” In mathematics, the term "counterexample" is also used (by a slight abuse) to refer to examples which illustrate the necessity of the full hypothesis of a theorem. This is most often done by considering a case where a part of the hypothesis is not satisfied and the conclusion of the theorem does not hold.


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.


Rectangle example

Suppose that a mathematician is studying
geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is c ...
and
shape A shape or figure is a graphics, graphical representation of an object or its external boundary, outline, or external Surface (mathematics), surface, as opposed to other properties such as color, Surface texture, texture, or material type. A pl ...
s, and she wishes to prove certain theorems about them. She
conjecture In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (a conjecture until proven in 19 ...
s that "All
rectangles In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as: an equiangular quadrilateral, since equiangular means that all of its angles are equal (360°/4 = 90°); or a parallelogram containin ...
are
squares In Euclidean geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles (90-degree angles, π/2 radian angles, or right angles). It can also be defined as a rectangle with two equal-length adj ...
", and she is interested in knowing whether this statement is true or false. In this case, she can either attempt to prove the truth of the statement using
deductive reasoning Deductive reasoning is the mental process of drawing deductive inferences. An inference is deductively valid if its conclusion follows logically from its premises, i.e. if it is impossible for the premises to be true and the conclusion to be fals ...
, 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 A hypothesis (plural hypotheses) is a proposed explanation for a phenomenon. For a hypothesis to be a scientific hypothesis, the scientific method requires that one can test it. Scientists generally base scientific hypotheses on previous obse ...
. 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 In plane Euclidean geometry, a rhombus (plural rhombi or rhombuses) is a quadrilateral whose four sides all have the same length. Another name is equilateral quadrilateral, since equilateral means that all of its sides are equal in length. The ...
. Thus, the mathematician now knows that both assumptions were indeed necessary.


Other mathematical examples

A counterexample to the statement "all
prime number A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
s are
odd numbers In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because \begin -2 \cdot 2 &= -4 \\ 0 \cdot 2 &= 0 \\ 41 ...
" is the number 2, as it is a prime number but is not an odd number. 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 In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''Cardinal n ...
s are either
prime A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
or
composite Composite or compositing may refer to: Materials * Composite material, a material that is made from several different substances ** Metal matrix composite, composed of metal and other parts ** Cermet, a composite of ceramic and metallic materials ...
" has the number 1 as a counterexample, as 1 is neither prime nor composite.
Euler's sum of powers conjecture Euler's conjecture is a disproved conjecture in mathematics related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that for all integers and greater than 1, if the sum of many th powers of positive integers is ...
was disproved by counterexample. It asserted that at least ''n'' ''n''th powers were necessary to sum to another ''n''th power. This conjecture was disproved in 1966, with a counterexample involving ''n'' = 5; other ''n'' = 5 counterexamples are now known, as well as some ''n'' = 4 counterexamples.
Witsenhausen's counterexample Witsenhausen's counterexample, shown in the figure below, is a deceptively simple toy problem in decentralized stochastic control. It was formulated by Hans Witsenhausen in 1968. It is a counterexample to a natural conjecture that one can generali ...
shows that it is not always true (for control problems) that a quadratic
loss function In mathematical optimization and decision theory, a loss function or cost function (sometimes also called an error function) is a function that maps an event or values of one or more variables onto a real number intuitively representing some "cost ...
and a linear equation of evolution of the
state variable A state variable is one of the set of variables that are used to describe the mathematical "state" of a dynamical system. Intuitively, the state of a system describes enough about the system to determine its future behaviour in the absence of a ...
imply optimal control laws that are linear. Other examples include the disproofs of the
Seifert conjecture In mathematics, the Seifert conjecture states that every nonsingular, continuous vector field on the 3-sphere has a closed orbit. It is named after Herbert Seifert. In a 1950 paper, Seifert asked if such a vector field exists, but did not phrase ...
, the
Pólya conjecture In number theory, the Pólya conjecture (or Pólya's conjecture) stated that "most" (i.e., 50% or more) of the natural numbers less than any given number have an ''odd'' number of prime factors. The conjecture was set forth by the Hungarian mat ...
, the conjecture of
Hilbert's fourteenth problem In mathematics, Hilbert's fourteenth problem, that is, number 14 of Hilbert's problems proposed in 1900, asks whether certain algebras are finitely generated. The setting is as follows: Assume that ''k'' is a field and let ''K'' be a subfield of ...
,
Tait's conjecture In mathematics, Tait's conjecture states that "Every 3-connected planar cubic graph has a Hamiltonian cycle (along the edges) through all its vertices". It was proposed by and disproved by , who constructed a counterexample with 25 faces, 69 ed ...
, and the
Ganea conjecture Ganea's conjecture is a claim in algebraic topology, now disproved. It states that : \operatorname(X \times S^n)=\operatorname(X) +1 for all n>0, where \operatorname(X) is the Lusternik–Schnirelmann category of a topological space ''X'', and ' ...
.


In philosophy

In
philosophy Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, knowledge, values, mind, and language. Such questions are often posed as problems to be studied or resolved. Some ...
, 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 Plato ( ; grc-gre, Πλάτων ; 428/427 or 424/423 – 348/347 BC) was a Greek philosopher born in Athens during the Classical period in Ancient Greece. He founded the Platonist school of thought and the Academy, the first institution ...
's ''
Gorgias Gorgias (; grc-gre, Γοργίας; 483–375 BC) was an ancient Greek sophist, pre-Socratic philosopher, and rhetorician who was a native of Leontinoi in Sicily. Along with Protagoras, he forms the first generation of Sophists. Several doxogr ...
'',
Callicles Callicles (; el, Καλλικλῆς; c. 484 – late 5th century BC) is thought to have been an ancient Athenian political philosopher. He figures prominently in Plato’s dialogue '' Gorgias'', where he "presents himself as a no-holds-barred, ...
, trying to define what it means to say that some people are "better" than others, claims that those who are stronger are better. But
Socrates Socrates (; ; –399 BC) was a Greek philosopher from Athens who is credited as the founder of Western philosophy and among the first moral philosophers of the ethical tradition of thought. An enigmatic figure, Socrates authored no te ...
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 ''Prima facie'' (; ) is a Latin expression meaning ''at first sight'' or ''based on first impression''. The literal translation would be 'at first face' or 'at first appearance', from the feminine forms of ''primus'' ('first') and ''facies'' (' ...
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 In traditional logic, a contradiction occurs when a proposition conflicts either with itself or established fact. It is often used as a tool to detect disingenuous beliefs and bias. Illustrating a general tendency in applied logic, Aristotle's ...
*
Exception that proves the rule "The exception that proves the rule" is a saying whose meaning is contested. Henry Watson Fowler's ''Modern English Usage'' identifies five ways in which the phrase has been used, and each use makes some sort of reference to the role that a partic ...
*
Minimal counterexample 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 ...


References


Further reading

*
Imre Lakatos Imre Lakatos (, ; hu, Lakatos Imre ; 9 November 1922 – 2 February 1974) was a Hungarian philosopher of mathematics and science, known for his thesis of the fallibility of mathematics and its "methodology of proofs and refutations" in its pr ...
, ''
Proofs and Refutations ''Proofs and Refutations: The Logic of Mathematical Discovery'' is a 1976 book by philosopher Imre Lakatos expounding his view of the progress of mathematics. The book is written as a series of Socratic dialogues involving a group of students who ...
'' Cambridge University Press, 1976, * James Franklin and Albert Daoud, ''Proof in Mathematics: An Introduction'', Kew, Sydney, 2011. , ch. 6. *
Lynn Arthur Steen Lynn Arthur Steen (January 1, 1941 – June 21, 2015) was an American mathematician who was a Professor of Mathematics at St. Olaf College, Northfield, Minnesota in the U.S. He wrote numerous books and articles on the teaching of mathematics. H ...
and
J. Arthur Seebach, Jr. J. Arthur Seebach Jr (May 17, 1938 – December 3, 1996) was an American mathematician. Seebach studied Greek language as an undergraduate, making it a second major with mathematics. Seebach studied with A. I. Weinzweig at Northwestern Univ ...
: ''
Counterexamples in Topology ''Counterexamples in Topology'' (1970, 2nd ed. 1978) is a book on mathematics by topologists Lynn Steen and J. Arthur Seebach, Jr. In the process of working on problems like the metrization problem, topologists (including Steen and Seebach) hav ...
'', Springer, New York 1978, . * Joseph P. Romano and Andrew F. Siegel: ''Counterexamples in Probability and Statistics'', Chapman & Hall, New York, London 1986, . * Gary L. Wise and Eric B. Hall: ''Counterexamples in Probability and Real Analysis''. Oxford University Press, New York 1993. . * Bernard R. Gelbaum, John M. H. Olmsted: ''Counterexamples in Analysis''. Corrected reprint of the second (1965) edition, Dover Publications, Mineola, NY 2003, . * Jordan M. Stoyanov: ''Counterexamples in Probability''. Second edition, Wiley, Chichester 1997, . * Michael Copobianco & John Mulluzzo (1978) ''Examples and Counterexamples in Graph Theory'', Elsevier North-Holland .


External links

*{{wikiquote-inline Mathematical terminology Logic Interpretation (philosophy) Methods of proof