Valid Arguments and Methods of Proof: Quick Revision
A brief note on validating statements, valid arguments and fallacies, direct proof, the contrapositive, exhaustion, counterexamples, proof by contradiction and proof by cases, with practice and questions.
A brief note on Valid Arguments and Methods of Proof. Read it before a test. Try each question at the end before you open its answer.
Validating a statement
And: show both parts.
Or: assume one part false, show the other.
If-then: direct, contrapositive or contradiction.
If and only if: show both directions.
Arguments
Valid: (premises) ⇒ (conclusion) is a tautology.
Valid forms: modus ponens, modus tollens, the chain rule, disjunctive syllogism.
Fallacies: affirming the consequent, denying the antecedent.
A valid argument with a false premise can have a false conclusion.
Methods of proof
Direct: assume p, reach q.
Contrapositive: assume ∼q, reach ∼p.
Exhaustion: check every one of finitely many cases.
Counterexample: one case disproves a for-all claim.
Contradiction: assume the claim is false, reach the impossible.
Cases: cover every possibility, prove each.
A flow chart of four methods of proof for a statement 'if p then q'. Direct: start from p, a chain of steps, end at q. Contrapositive: start from not q, a chain of steps, end at not p. Contradiction: start from p and not q together, a chain of steps, end at an impossible statement, then conclude that the statement is true. Counterexample: one case with p true and q false shows that a for-all claim is false.
A worked example
Prove that n2−n is even for every integer n.
Factorise.n2−n=n(n−1).
Cases. If n is even, the factor n is even. If n is odd, n−1 is even.
Conclusion. In both cases the product is even.
Practice with new numbers
A program to try
The program checks an argument row by row, and tests a claim on many numbers to look for a counterexample.
Mistakes to avoid
Proving a for-all claim by examples.
Affirming the consequent.
Proving the converse instead of the contrapositive.
Cases that miss a possibility.
Check yourself
From p⇒q and p, what follows?
Give a counterexample to 'every prime is odd'.
What does a proof by contradiction of 'if p then q' assume?
Can a perfect square end in 7?
Among 10 whole numbers, must two leave the same remainder on division by 9?
Sources
NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, and Class XII, Part II, Appendix 1.
Richard Hammack, Book of Proof, third edition, Chapters 4 to 6.