What Is a Counterexample? One Case That Ends an Argument
By the BrainSnail editorial team. How these articles are written and checked, and how to tell us when one is wrong.
A universal claim says something holds in every case, and a single case where it does not is enough to destroy it completely. That asymmetry between proving and disproving is one of the most useful tools in reasoning and is why mathematicians and philosophers spend so much effort hunting for exceptions.
The asymmetry
Confirming a universal claim requires checking every case, which is usually impossible, while refuting one requires a single instance. That is why no number of white swans establishes that all swans are white and one black swan settles it, an example used so often that it has become the standard illustration and which happens to be historically accurate, since Europeans held the belief until encountering Australian swans. The asymmetry underpins falsificationism in the philosophy of science, on which a theory earns its status by making claims that could be refuted and surviving attempts to refute them, and it explains the emphasis on prediction rather than accumulation of confirming instances. It also explains a common frustration in argument, since someone defending a general claim can always retreat by narrowing it, and a claim narrowed enough to be immune to counterexample has usually given up most of what made it interesting. The productive response to a counterexample is generally to revise the claim precisely rather than to abandon or defend it.
Where they do their work
The device operates in several fields with recognisably the same logic:
- •Mathematics, where a single counterexample disproves a conjecture outright, and where some conjectures have survived computer checks of billions of cases while remaining unproven because checking is not proof
- •Philosophy of knowledge, where cases constructed by Edmund Gettier in 1963 showed that justified true belief can fail to be knowledge, which redirected an entire field
- •Ethics, where constructed cases test whether a proposed principle gives acceptable verdicts, which is most of what trolley problems are for
- •Linguistics, where a single sentence a native speaker accepts can refute a proposed grammatical rule
- •Law, where a hypothetical applying a proposed rule to an unintended situation is the standard way of testing legislation and is exactly what appellate judges do in oral argument
- •Everyday argument, where a counterexample is the quickest way to show that a generalisation is doing less work than its user believes
How they are constructed
Finding one is a skill with recognisable methods. Searching the extremes is the commonest, since a claim that works for typical cases frequently fails at the boundaries, so the smallest, largest, empty, zero and infinite cases are checked first. Varying one feature at a time isolates which part of the claim is doing the work. Constructing an artificial case rather than searching for a natural one is legitimate and is standard in philosophy, though it invites the objection that the case is too contrived to matter. Looking in adjacent domains helps, since a claim about one kind of thing frequently fails when applied to a neighbouring kind. In mathematics, computer search has become a substantial method, and several long-standing conjectures have been refuted by counterexamples with enormous numbers of digits that no person would have found, which raises its own questions about what a proof or refutation requires when no human can survey it.
The ways they are resisted
Responses to a counterexample follow a limited set of patterns and only some of them are legitimate. Accepting it and narrowing the claim is the honest move, and the resulting narrower claim may still be valuable. Denying that the case falls under the claim is legitimate if the claim was genuinely ambiguous and is an evasion otherwise. Adding a qualification specifically to exclude the offending case, with no independent motivation, is the manoeuvre known as saving the hypothesis, and it is the move that falsificationists identify as the mark of an unfalsifiable theory, since a claim that can absorb any counterexample by amendment no longer forbids anything. Redefining a term so the case no longer counts is the no true Scotsman move, named for exactly that pattern. Dismissing the case as unrealistic is sometimes fair, since a claim about how the world works need not survive a case the world cannot produce, and it is frequently used to avoid an argument that the claim cannot answer.
The takeaway
A universal claim needs every case and a refutation needs one, which is why a single black swan settles what any number of white ones cannot. Gettier's constructed cases redirected the theory of knowledge with two pages. Searching extremes, varying one feature and building artificial cases are the standard methods. Adding a qualification purely to exclude the case that refuted you is the move that makes a theory unfalsifiable.