Proof by Contradiction

Logic
process

Also known as: indirect proof

Grade 9-12

View on concept map

Proof by contradiction (reductio ad absurdum) assumes the negation of what you want to prove, then derives a logical contradiction, thereby establishing that the original statement must be true. Proof by contradiction is essential when direct proof is difficult โ€” it is used to prove irrationality of \sqrt{2}, infinitude of primes, and countless other results.

Definition

Proof by contradiction (reductio ad absurdum) assumes the negation of what you want to prove, then derives a logical contradiction, thereby establishing that the original statement must be true.

๐Ÿ’ก Intuition

Assume the opposite of what you want to prove, then follow the logic to a statement that is impossibly false โ€” proving your assumption must have been wrong.

๐ŸŽฏ Core Idea

A contradiction in assumptions validates the original statement.

Example

ext{Assume }sqrt2= rac pq ext{ in lowest terms }Rightarrow p,q ext{ both even (contradiction)}

Notation

Structure: Assume $
eg P, derive contradiction, conclude P$.

๐ŸŒŸ Why It Matters

Proof by contradiction is essential when direct proof is difficult โ€” it is used to prove irrationality of \sqrt{2}, infinitude of primes, and countless other results.

๐Ÿ’ญ Hint When Stuck

Write 'Assume for contradiction that [negation of what you want to prove].' Then reason forward from that assumption until you reach a statement that contradicts a known fact or your own assumption.

Formal View

Proof by Contradiction can be formalized with precise domain conditions and rule-based inference.

๐Ÿšง Common Stuck Point

Students derive a surprising result, but not an actual contradiction.

โš ๏ธ Common Mistakes

  • Forgetting to clearly state the assumption you are contradicting at the start
  • Reaching a 'contradiction' that is not actually contradictory โ€” make sure the two statements genuinely conflict
  • Confusing proof by contradiction with proof by contrapositive โ€” contradiction assumes \neg Q AND P, contrapositive assumes only \neg Q

Frequently Asked Questions

What is Proof by Contradiction in Math?

Proof by contradiction (reductio ad absurdum) assumes the negation of what you want to prove, then derives a logical contradiction, thereby establishing that the original statement must be true.

When do you use Proof by Contradiction?

Write 'Assume for contradiction that [negation of what you want to prove].' Then reason forward from that assumption until you reach a statement that contradicts a known fact or your own assumption.

What do students usually get wrong about Proof by Contradiction?

Students derive a surprising result, but not an actual contradiction.

How Proof by Contradiction Connects to Other Ideas

To understand proof by contradiction, you should first be comfortable with contradiction, logical statement and direct proof.