1.01c - Conjectures and counterexamples
A single well-chosen example can defeat a claim that survives hundreds of successful trials. Learn to read the domain, keep a conditional claim's premise true, and demonstrate exactly where its conclusion fails. You will also distinguish disproving a claim from proving a repaired version of it.
Conjectures depend on their domain
Could a formula keep producing primes and then suddenly fail? The values of at are , all prime. In fact it produces primes for every integer from to , then gives at . A very promising pattern has just lost its claim to be universal.
You already know
A prime is an integer greater than with exactly two positive divisors. In particular, is not prime. A composite integer has a divisor other than and itself.
A claim tells you which inputs you are allowed to test. That is its domain, and a counterexample must stay inside it.
Conjecture and counterexample
A conjecture is a mathematical statement believed to be true but not yet proved. A counterexample is an allowed instance in which the claimed conclusion is false. One counterexample disproves a universal claim; a collection of successful instances does not prove it unless the collection covers the entire domain.
The word “integer” can change everything. The integers include negatives and zero. A rational number is a ratio of integers with , such as or . The real numbers contain both rational and irrational numbers, which cannot be expressed as such a ratio; and are irrational.
A terminating or recurring decimal is rational, but a finite calculator display is often an approximation to another exact number. Displaying as does not turn the exact square root into that rational decimal.
For example, holds for every integer . If , then . If , multiply by positive to get . Those cases cover every integer. But over the reals, gives . The fractional value defeats the real-number claim and says nothing against the integer claim.
Key idea
Read the domain before testing the claim. An example outside the domain cannot disprove a statement about inputs inside it.
A spreadsheet is a useful search tool, but its last checked row is not the end of an infinite domain. Keep exact fractions when a rounded decimal could hide equality or a sign.
A true premise and a false conclusion
To disprove “if , then ”, find an input with true and false. Showing only that is false is not enough if your input never satisfied .
For instance, the claim concerns positive real inputs. Negative cannot refute it, even if they make an expression behave unexpectedly.
Counterexample to an implication
A counterexample to is an admissible value for which is true and is false. State the value, verify the premise, then evaluate the conclusion exactly.
Start near a boundary: a strict inequality fails at equality as well as when the opposite strict inequality holds.
Worked example 1: equality can disprove a strict claim
Question. Disprove the conjecture that for every positive real .
Plan. Try the positive boundary value , then compare the two sides.
Why this step? The claim uses , so equality is already a failure; the square need not be smaller.
Answer. is a counterexample, so the conjecture is false.
Check. The chosen value is a positive real number, as required.
Example 2 changes the exponent from to . A number between zero and one gives a more informative failure than equality.
Worked example 2: a fractional input
Question. Disprove the conjecture that for every positive real .
Plan. Choose , whose positive powers become smaller.
Why this step? Exact fractions show the comparison without any rounding uncertainty.
Answer. disproves the claim.
Check. Multiplying by another factor reduces it; doing so twice gives .
The same logic handles number-set claims. The product of two irrational numbers need not be irrational: . Their sum need not be irrational either: . Both inputs in each example are irrational and the result is rational. This does not prove that all such products or sums are rational; it only disproves “always irrational”.
Watch out
Wrong: “The claim fails at , so a claim about positive is false.”
Right: first satisfy the positive-input premise. An inadmissible input cannot be a counterexample.
There is no formula-sheet shortcut for this decision. Change the exponent once more and supply both the admissibility check and the failed comparison.
Diagnosing and repairing a claim
A failed proof and a false conclusion are different things. Diagnose the argument first, then decide whether the claim needs disproving or can be repaired.
Checking cannot prove that is even for every integer: it misses odd integers and almost all even integers. The conclusion is still true, because and one consecutive factor is even. An invalid argument does not itself make its conclusion false.
A false claim may become true on a smaller domain. For ,
because both factors are positive. Thus is proved. At , equality means you may assert , but not . A repaired universal claim needs a new general argument.
Reciprocals are a useful place to practise that separation.
Worked example 3: counterexample, then a general repair
Question. A student claims that whenever . Give a counterexample, then prove the correct inequality.
Plan. Test a simple pair, then compare the fractions over their common positive denominator.
With , ,
For any ,
Why this step? Comparing the difference proves the direction for every admissible pair, not just the chosen one.
Answer. The claim is false; the correct general result is .
Check. At , , the difference is .
Example 4 changes only the positive numerator. The denominator's sign still controls the reasoning.
Worked example 4: a common positive numerator
Question. For , disprove , then prove its correct replacement.
Plan. Use the same test pair and include the positive numerator in the difference.
At , ,
In general,
Why this step? Multiplication by positive preserves the direction already established for reciprocals.
Answer. for every .
Check. , matching .
Do not transfer this conclusion without its conditions: if a denominator were zero, the reciprocal would be undefined; opposite-sign denominators would require a different sign argument. The reciprocal comparison is not supplied on the formula sheet.
Problem-solving
A counterexample answers “Is the original claim true?” A general sign argument answers “Why is the repaired claim true?” Keep those two jobs separate.
Use a new numerical pair, then supply the general justification rather than another list of examples.
Quick Recap
- Check the domain before choosing an input.
- A counterexample to an implication makes its premise true and its conclusion false.
- One failure disproves a universal claim; finite success may be evidence without being proof.
- Prove a repaired claim with its own general argument and conditions.
Yes, a prime-producing pattern can suddenly fail: gives at , so the opening conjecture is false.