1.1PureStretch

Proof by Contradiction

Proof by contradiction is a powerful technique: to prove a statement true, you assume it is false and show that this forces an impossibility. It is the method behind the classic proofs that √2 is irrational and that there are infinitely many primes.

30 min Algebraic Methods
Edexcel A level Maths: 1.1 Proof by ContradictionCurated by Kepler, not produced by us. Watch it before the notes below.
Open on YouTube

What you'll be able to do

  • Understand the logic of proof by contradiction
  • Set up the negation of a statement
  • Prove a statement by reaching a contradiction
  • Follow the standard proofs (√2 irrational, infinite primes)
1

The logic

To prove a statement PP by contradiction, assume the opposite\textbf{assume the opposite} (PP is false) and reason logically until you reach something impossible. Since the reasoning is valid, the only flaw must be the assumption — so PP must be true.

Assume ¬P  ⇒  contradiction  ⇒  P is true\text{Assume } \neg P \;\Rightarrow\; \text{contradiction} \;\Rightarrow\; P \text{ is true}
Assume the negation; derive an impossibility.

Tip — Start every proof by clearly writing the assumption: “Assume, for contradiction, that …”.

2

Worked idea: √2 is irrational

Assume 2\sqrt{2} is rational, so 2=ab\sqrt{2} = \dfrac{a}{b} in lowest terms. Squaring gives a2=2b2a^2 = 2b^2, so a2a^2 is even, hence aa is even. Writing a=2ka = 2k leads to b2=2k2b^2 = 2k^2, so bb is also even — but then aa and bb share a factor of 2, contradicting “lowest terms”.

Example 1Why does the √2 proof work?
1Assume 2=ab\sqrt{2} = \tfrac{a}{b} in lowest terms.
2Deduce aa and bb are both even.
3That contradicts the fraction being in lowest terms.
Answer
so 2\sqrt{2} cannot be rational
3

Other classic proofs

The same structure proves there are infinitely many primes\textbf{infinitely many primes} (assume finitely many, multiply them all and add 1, get a number with no prime factor in the list) and that there is no smallest positive rational number. Recognising the “assume the negation” opening is the key skill.

Formula recap

Assume ¬P→⊥⇒P\text{Assume } \neg P \to \bot \Rightarrow P
Structure of the proof.
a even⇒a2 even (and converse)a \text{ even} \Rightarrow a^2 \text{ even (and converse)}
Used in the √2 proof.
rational=ab, b≠0\text{rational} = \tfrac{a}{b}, \ b \neq 0
Definition to negate.

Common mistakes to avoid

Assuming the statement you are trying to prove.
Assume its NEGATION — the opposite — then seek a contradiction.
Stopping before clearly stating the contradiction.
Explicitly identify the impossibility (e.g. “contradicts lowest terms”).

Key takeaways

  • Assume the statement is false, then derive a contradiction.
  • The contradiction shows the assumption was wrong, so the statement is true.
  • Know the standard results: √2 irrational, infinitely many primes.

Test yourself

Answer a few questions, then review anything you missed.

Prefer paper? Open the written self-check

Answer each question before opening its answer. This self-check does not record a quiz score.

  1. To prove a statement by contradiction, you first:

    • Assume it is false
    • Assume it is true
    • Test examples
    • Differentiate
    Show answer and explanation

    Answer: Assume it is false

    Assume the negation.

  2. Reaching a contradiction shows the assumption was:

    • False
    • True
    • Irrelevant
    • Incomplete
    Show answer and explanation

    Answer: False

    So the original statement is true.

  3. In proving √2 is irrational, we assume √2 equals:

    • ab\tfrac{a}{b} in lowest terms
    • an integer
    • 2b2b
    • an even number
    Show answer and explanation

    Answer: ab\tfrac{a}{b} in lowest terms

    The rational assumption.

  4. The √2 proof reaches a contradiction because a and b turn out to both be:

    • Even
    • Odd
    • Prime
    • Negative
    Show answer and explanation

    Answer: Even

    Contradicting “lowest terms”.

  5. If a2a^{2} is even, then aa is:

    • Even
    • Odd
    • Prime
    • Zero
    Show answer and explanation

    Answer: Even

    Key lemma in the √2 proof.

  6. The proof that there are infinitely many primes assumes:

    • There are finitely many primes
    • There are no primes
    • 2 is the only prime
    • All numbers are prime
    Show answer and explanation

    Answer: There are finitely many primes

    Then constructs a number contradicting that.

Next step

Keep practising

Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.

Browse practice topics

Related lessons

All 5 lessons

Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.