Methods of Proof

A mathematical proof is a logical argument that establishes the truth of a statement beyond any doubt. Unlike experimental science, where evidence supports a theory, a proof guarantees that a result is always true — no exceptions, no counter-examples possible. Learning to construct and read proofs is one of the most important skills in mathematics, because it transforms intuition and pattern-spotting into certainty. There are several standard methods of proof used throughout mathematics. The three most fundamental at this level are: proof by deduction (also called direct proof), proof by contradiction (reductio ad absurdum), and proof by exhaustion (checking all cases). Each method suits different types of problems, and choosing the right approach is part of the art of mathematics. This article explores each method with clear definitions, worked examples, and tips for recognising which technique to apply. By understanding these methods, you gain access to the same tools that professional mathematicians use — from proving simple number properties to tackling complex theorems.

Key takeaways
  • Proof by Deduction (Direct Proof)
  • Proof by Contradiction (Reductio ad Absurdum)
  • Proof by Exhaustion (Case Analysis)
  • Choosing the Right Method

Proof by Deduction (Direct Proof)

A direct proof starts from known facts, definitions, or axioms and uses logical steps to arrive at the conclusion. Every step follows necessarily from the previous one. For example, to prove 'if n is even, then n² is even', we write n = 2k for some integer k (definition of even), then n² = (2k)² = 4k² = 2(2k²). Since 2k² is an integer, n² = 2 × (integer), so n² is even. The chain of reasoning is unbroken and each line is justified. Direct proof works best when there is a clear algebraic or logical path from hypothesis to conclusion.

Proof by Contradiction (Reductio ad Absurdum)

In a proof by contradiction, you assume the opposite of what you want to prove, then show that this assumption leads to a logical impossibility — a statement that contradicts a known fact, an axiom, or even itself. The classic example is proving that √2 is irrational. Assume √2 = p/q in lowest terms (so gcd(p,q) = 1). Then 2 = p²/q², giving p² = 2q², so p² is even, meaning p is even. Write p = 2m; then 4m² = 2q², so q² = 2m², meaning q is also even. But then both p and q are even, contradicting gcd(p,q) = 1. The contradiction shows our assumption was false, so √2 must be irrational. This method is especially powerful when directly constructing the proof seems impossible.

Proof by Exhaustion (Case Analysis)

Proof by exhaustion divides the problem into a finite number of cases and proves the result for every case individually. Once all cases are covered, the proof is complete. For example, to prove that n² + n is even for all integers n, consider two cases: Case 1 — n is even: write n = 2k, then n² + n = 4k² + 2k = 2(2k² + k), which is even. Case 2 — n is odd: write n = 2k + 1, then n² + n = (4k² + 4k + 1) + (2k + 1) = 4k² + 6k + 2 = 2(2k² + 3k + 1), which is even. Both cases yield an even number, so the statement holds for all integers. The key requirement is that the cases must be exhaustive (cover all possibilities) and mutually exclusive (no overlap or redundancy).

Choosing the Right Method

Selecting the best proof method is a skill developed with practice. Use direct proof when the hypothesis gives you something concrete to manipulate algebraically. Use contradiction when the negation of the conclusion is easy to state and likely leads to a conflict with known facts — it is particularly useful for proving irrationality or the infinitude of primes. Use exhaustion when the number of cases is small and manageable, such as results that depend on whether a number is odd or even, or on the possible remainders when dividing by 3 or 4. Sometimes multiple methods work; choosing the most elegant is a matter of mathematical taste.

The Key Equation

¬Q⇒¬P≡P⇒Q\neg Q \Rightarrow \neg P \equiv P \Rightarrow Q
  • P — Hypothesis (logical): The starting assumption or given condition of a statement
  • Q — Conclusion (logical): The result to be proved, following from the hypothesis
  • \Rightarrow — Implies (logical connective): Logical implication: if the left side is true, the right side must be true
  • \neg — Negation (logical): The logical NOT operator — negates a statement, turning true to false and vice versa

Worked Example

Problem. Prove by contradiction that there are infinitely many prime numbers.

The set {p∈Z:p is prime} is infinite.\text{The set } \{p \in \mathbb{Z} : p \text{ is prime}\} \text{ is infinite.}

Answer. There are infinitely many prime numbers (proved by contradiction).

Figure
Diagram
Structure of a Proof by ContradictionAssume ¬Q(Negate the conclusion)Apply P (given)and logic rulesReachContradiction (⊥)Impossible!Conclusion Qmust be TRUEAssume / DeduceContradictionConclusion
Origins · 1 minEuclid of Alexandria and how this was discovered
EO
Euclid of Alexandria
-325–-265 · Greek

Euclid's Elements (c. 300 BCE) is one of the most influential works in the history of mathematics. It systematically developed geometry and number theory using axioms, definitions, and rigorous logical proofs — establishing the deductive method as the gold standard for mathematical reasoning. The proof that there are infinitely many primes (Book IX, Proposition 20) is one of the earliest and most celebrated proofs by contradiction. The Elements was used as a mathematics textbook in schools and universities for over 2000 years — making it one of the most widely read books in history after religious texts.