Mp2 - Conjectures and counterexamples
Counterexamples test the reach of a mathematical claim. You will choose admissible inputs, show an exact failure and explain what has been disproved. You will also read an argument critically: an unconvincing proof, a false conjecture and a proved replacement are three different outcomes.
Conjectures depend on their domain
Can squaring a positive number make it smaller? The values and suggest the opposite, but . Before trusting a pattern, ask which inputs the claim includes.
You already know
The integers include negative whole numbers, zero and positive whole numbers. Squaring a negative input gives a non-negative result. A prime is an integer greater than with exactly two positive divisors; is not prime.
Even many consecutive successes can disguise a failure. The expression gives at . It gives primes right through , but at it gives , which is composite.
Conjecture
A conjecture is a mathematical claim believed to be true but not yet proved. Its domain specifies the cases it claims to cover. For example, “ for every integer ” and “ for every real ” are different conjectures, even though their displayed inequalities match.
The first of those is true. For an integer , ; for an integer , multiplying by positive gives . The cases cover all integers. The real-number version is false at . A non-integer cannot disprove the integer version.
A rational number has the form , where and ; and qualify. An irrational number is real and has no such representation: and are examples. The real numbers contain both kinds. Terminating and recurring decimals are rational, but a finite display can approximate an irrational exact input. The display does not show that equals that fraction.
Key idea
Successful checks provide evidence. A proof must cover every case in the domain; a disproof needs just one allowed failure.
Technology can search for a failure efficiently. It cannot turn a finite set of successful checks into an argument about every positive integer. Exact arithmetic also keeps a rounded near-equality from hiding a counterexample.
A true premise and a false conclusion
A useful counterexample is a small piece of reasoning, not just a number. It checks the hypothesis and then shows the conclusion fail.
For a claim about positive inputs, choosing a negative value misses the point: that input was never promised to work.
Counterexample
A counterexample to “if , then ” is an input in the stated domain for which is true and is false. A strict inequality also fails when the two sides are equal.
Reciprocals give quick, exact tests of a plausible-looking claim.
Worked example 1: testing a reciprocal claim
Question. Disprove the conjecture that for every positive real .
Plan. Choose a positive fraction less than ; its reciprocal will be greater than .
Why this step? Checking the positive-input condition makes the failed comparison a valid disproof of this particular implication.
Answer. is a counterexample.
Check. , so the reciprocal is correct.
Example 2 changes only the denominator's exponent. You still need a true premise and a false conclusion, rather than a general theory of the function.
Worked example 2: squaring the denominator
Question. Disprove the conjecture that for every positive real .
Plan. Try and keep the square inside the denominator.
Why this step? means the reciprocal of the square, not the square of a rounded display.
Answer. The positive input disproves the conjecture.
Check. The denominator is ; multiplying it by the result gives .
Number-set conjectures use exactly the same test. Both and are irrational, yet their sum is , which is rational. Also . These examples disprove “always irrational” for the sum and the product respectively. They do not prove “always rational”.
Watch out
Wrong: “ refutes a claim about positive .”
Right: the premise must hold at the chosen input. A failed conclusion outside the stated domain is irrelevant to that implication.
Counterexample reasoning is not supplied on the formula sheet. Change the exponent once more and make both checks visible.
Diagnosing and repairing a claim
After a disproof, a revised statement has to earn your trust afresh. Changing “for all positive inputs” to a smaller domain can repair a claim, but further sample calculations still do not prove it.
There is also a different kind of repair: replacing a weak argument for a true result. Checking does not prove even for every integer. The conclusion is true because contains an even factor. The incomplete trials neither prove nor disprove it.
Worked example 3: repairing a strict inequality
Question. A student checks , then claims for every positive real . Explain the gap, give a counterexample and prove the repaired claim for .
Plan. Separate the sample evidence, a valid failure and the general sign argument.
The three trials leave other positive real inputs unchecked. At ,
For every ,
Why this step? A sign argument covers the whole revised domain, including inputs not among the original trials.
Answer. The original claim is false, but is true for every .
Check. At the boundary , equality holds, so that boundary cannot enter the repaired strict claim.
Example 4 changes only the required inequality from strict to non-strict. That small change admits the boundary input.
Worked example 4: deciding whether equality is allowed
Question. Disprove for every positive real , then prove it for .
Plan. Use a fractional failure, then inspect the factors at and above the boundary.
At ,
For ,
Why this step? The second factor can be zero, so the conclusion must allow equality.
Answer. for every ; equality occurs at .
Check. , while , agreeing with the boundary and interior cases.
A reciprocal claim can be repaired with another general difference. For , the proposed fails at , . Its correct replacement follows from
because both numerator and denominator are positive. That establishes for every allowed pair. A counterexample to the wrong direction and a proof of the right direction answer different questions.
Problem-solving
When critiquing an argument, name the gap rather than guessing that its conclusion is false. When repairing a false claim, state the new conditions and prove the new claim generally.
These comparison results are not supplied on the formula sheet. Try a new exponent, retaining the boundary care from example 4.
Quick Recap
- A domain tells you which inputs a claim promises to cover.
- A counterexample keeps the premise true and makes the conclusion false.
- An incomplete argument can end at a true conclusion; a disproof needs an actual allowed failure.
- A revised claim needs its own proof, with strict or non-strict boundaries checked.
Squaring can make a positive number smaller: . The opening pattern from larger inputs did not cover the full positive real domain.