Courses / Mathematics I
Mathematical Language and Reasoning

Proof by Contradiction and Contrapositive

Mathematics I 233 words Free to read

Proof by Contrapositive

Sometimes a direct proof is awkward, so we use indirect techniques. Proof by contrapositive proves if pp then qq by proving the equivalent statement if ¬q\neg q then ¬p\neg p.

Use this when negating the conclusion gives a better starting point.

Example: To prove "if n2n^2 is even, then nn is even," prove the contrapositive: "if nn is odd, then n2n^2 is odd."

StepAction
SetupLet n=2k+1n = 2k+1 (odd)
Squaren2=4k2+4k+1n^2 = 4k^2 + 4k + 1
Resultn2=2(2k2+2k)+1n^2 = 2(2k^2 + 2k) + 1 (odd)

Proof by Contradiction

Proof by contradiction (reductio ad absurdum) assumes the target statement is false, then derives a logical contradiction (like 0=10 = 1). Valid steps cannot lead to a contradiction, so the original statement must be true.

Example (2\sqrt{2} is irrational): Assume 2=a/b\sqrt{2} = a/b in lowest terms. Squaring gives a2=2b2a^2 = 2b^2, forcing aa and bb both even, which contradicts lowest terms.

TechniqueStructureGoal
ContrapositiveProve ¬q¬p\neg q \to \neg pDirect conditional
ContradictionAssume ¬(statement)\neg (\text{statement})Find any absurdity

Pitfall: Don't confuse them. Contrapositive proves an equivalent conditional directly. Contradiction assumes the whole statement false to hunt for an impossibility.

The consequence flies back and breaks the assumption's own seal

Practise this lesson

The explanation above is free to read. The graded practice for this lesson lives in the Tryals app.

11practice questions
2interactive scenes

Mathematical Language and Reasoning