Math · Sets & Logic · Grade 9-12 · 5 min read

Proof by Contradiction

Q: What is the fastest recognition cue for Proof by Contradiction?

Look for **suppose not**, **assume the contrary**, **there is no**, **irrational**, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it? That question protects you from using a memorized procedure in the wrong place.

⚡ In one breath

Proof by contradiction (reductio ad absurdum) proves $P$ by assuming $\neg P$ , deriving a contradiction like $0=1$ or 'an integer that is both even and odd', and concluding $P$ holds.

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

Proof by contradiction (reductio ad absurdum) proves $P$ by assuming $\neg P$ , deriving a contradiction like $0=1$ or 'an integer that is both even and odd', and concluding $P$ holds. Use it for nonexistence claims, irrationality, and statements where the negation is concrete but the claim itself is slippery. The cue is that 'suppose this were false' is easier to work with than the claim head-on. Before calculating, ask: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?

Section 2

Why This Matters

Some of mathematics' landmark results — $\sqrt{2}$ is irrational, there are infinitely many primes — have no clean forward proof, and contradiction is the only door in; misusing it (forgetting to actually reach an impossibility) is a classic source of fake proofs, so the structure must be exact. Recognizing it by "Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?" — rather than by familiar numbers — is what lets a student tell it apart from direct proof and contrapositive proof and counterexample in a mixed problem set.

Section 3

Intuitive Explanation

A detective assumes the suspect is innocent, then shows that innocence forces the murder weapon to be in two places at once — since that is impossible, the assumption of innocence collapses and guilt is established. This is the clean version of the idea because the visible structure matches the concept before any formula or procedure is chosen.

Assuming $\neg P$ , deriving some merely surprising-but-true statement, and declaring victory — a proof by contradiction is finished only when you reach a genuine impossibility, not just an unexpected fact. That contrast matters because many wrong answers come from recognizing a surface feature, such as a familiar number or word, instead of the actual task.

A useful way to slow down is to name the signal words and then test them. Words like **suppose not**, **assume the contrary**, **there is no**, **irrational**, **reach a contradiction** are helpful clues, but they are not enough by themselves. They must point to the same structure as the mental model: Proof by contradiction assumes the negation of your claim, follows valid logic until it produces something impossibly false, and concludes the original claim must be true.

The recognition test is simple: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it? If yes, proof by contradiction is probably the right tool; if not, compare with Direct proof or Contrapositive proof or Counterexample before calculating.

Core idea

Proof by contradiction assumes the negation of your claim, follows valid logic until it produces something impossibly false, and concludes the original claim must be true.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use Proof by Contradiction when the claim is a nonexistence or irrationality statement, or assuming its negation is more concrete than proving it directly. Strong signals include **suppose not**, **assume the contrary**, **there is no**, **irrational**, **reach a contradiction**. The safest workflow is to read the final question first, identify what kind of answer it wants, and then test the structure. Do not use proof by contradiction just because familiar numbers appear; first decide whether the situation answers "Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?" with yes.

✨ Pro tip

Ask: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?

Section 5

How to Recognize It

Before using Proof by Contradiction, check the structure of the problem, not just the vocabulary. These questions force the same recognition move from several angles: the task, the signal words, the nearest confusion, and the thing that would make the concept fail.

Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?

If yes, the problem matches proof by contradiction. If no, pause before applying the procedure, because the same numbers may belong to a different idea.
Which words signal the structure?

Look for suppose not, assume the contrary, there is no, irrational. These words are useful only after the situation matches them; a keyword without structure is not proof.
What is the nearest confusion?

Direct proof is the common trap here: Assumes the hypothesis is TRUE and builds forward to the conclusion, with no negation. Compare the desired final answer before choosing a method.
What answer form should I expect?

The answer should fit this mental model: Proof by contradiction assumes the negation of your claim, follows valid logic until it produces something impossibly false, and concludes the original claim must be true. If the expected answer sounds more like direct proof, use the comparison table before solving.
What would make this NOT Proof by Contradiction?

Assuming $\neg P$ , deriving some merely surprising-but-true statement, and declaring victory — a proof by contradiction is finished only when you reach a genuine impossibility, not just an unexpected fact. This tells you when to switch tools instead of forcing the concept.

Section 6

Proof by Contradiction vs Common Confusions

The hard part is recognizing when the task is really about proof by contradiction instead of a nearby idea. Read the final answer the problem wants, then ask which row describes the structure before you start calculating.

Proof by Contradiction vs Common Confusions
Type	Meaning	Key test	Formula	Example
Proof by Contradiction	Use this when the claim is a nonexistence or irrationality statement, or assuming its negation is more concrete than proving it directly. The deciding question is: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?	Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?		Prove that $\sqrt{2}$ is irrational.
Direct proof	Assumes the hypothesis is TRUE and builds forward to the conclusion, with no negation.	Use when assuming $P$ gives a concrete foothold and you can reach $Q$ directly.	$P \Rightarrow Q$	Assume $n=2k$ , show $n^2$ is even
Contrapositive proof	Proves ' $\neg Q \Rightarrow \neg P$ ' directly — assumes ONLY the conclusion's negation, not the whole claim's.	Use for an implication $P \Rightarrow Q$ when flipping it reads more cleanly.	$\neg Q \Rightarrow \neg P$	Prove ' $n$ odd $\Rightarrow n^2$ odd' to get ' $n^2$ even $\Rightarrow n$ even'
Counterexample	DISPROVES a universal claim by exhibiting one case that fails it — the opposite goal.	Use when you want to show a 'for all' statement is false, not prove a statement true.		$n^2-n+41$ is prime fails at $n=41$

Proof by Contradiction

Meaning: Use this when the claim is a nonexistence or irrationality statement, or assuming its negation is more concrete than proving it directly. The deciding question is: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?
Key test: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?
Example: Prove that $\sqrt{2}$ is irrational.

Direct proof

Meaning: Assumes the hypothesis is TRUE and builds forward to the conclusion, with no negation.
Key test: Use when assuming $P$ gives a concrete foothold and you can reach $Q$ directly.
Formula: $P \Rightarrow Q$
Example: Assume $n=2k$ , show $n^2$ is even

Contrapositive proof

Meaning: Proves ' $\neg Q \Rightarrow \neg P$ ' directly — assumes ONLY the conclusion's negation, not the whole claim's.
Key test: Use for an implication $P \Rightarrow Q$ when flipping it reads more cleanly.
Formula: $\neg Q \Rightarrow \neg P$
Example: Prove ' $n$ odd $\Rightarrow n^2$ odd' to get ' $n^2$ even $\Rightarrow n$ even'

Counterexample

Meaning: DISPROVES a universal claim by exhibiting one case that fails it — the opposite goal.
Key test: Use when you want to show a 'for all' statement is false, not prove a statement true.
Example: $n^2-n+41$ is prime fails at $n=41$

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

How to read it: Structure: Assume $\neg P$ , derive contradiction, conclude $P$ .

Section 8

Worked Examples

Example 1 — Irrationality of $\sqrt{2}$

Easy

Problem

Prove that $\sqrt{2}$ is irrational.

Solution

'No fraction equals $\sqrt{2}$ ' is a nonexistence claim — the negation is concrete and workable.

Name the structure before touching arithmetic — that is what makes the right method obvious.
Ask the recognition question: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?

If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
Assume the contrary: $\sqrt{2}=\frac{a}{b}$ in lowest terms, so $a^2=2b^2$ .

The rule is chosen only after the structure matches, so the steps mean something.
Then $a^2$ is even, so $a$ is even ( $a=2c$ ), giving $4c^2=2b^2$ , so $b^2$ is even and $b$ is even too — but then $\frac{a}{b}$ was not in lowest terms.

Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
Check the answer against the original question.

It should fit the mental model — assume the opposite, crash into impossible. If it does not, revisit the recognition step before changing the arithmetic.

Answer

Contradiction, so $\sqrt{2}$ is irrational

Takeaway: Assuming the negation of a nonexistence claim and forcing an impossibility proves the original.

Example 2 — Just the contrapositive

Standard

Problem

Prove: if $n^2$ is even then $n$ is even. A student writes 'assume $n^2$ even and $n$ odd...'. Is this really contradiction?

Solution

Notice why this looks like the same concept.

Nearby language or numbers can tempt you toward assume the opposite, crash into impossible.
They assumed $\neg Q$ ( $n$ odd) AND $P$ ( $n^2$ even) — but the clean route only needs to assume $n$ is odd and show $n^2$ is odd.

Spotting what actually changed is what separates this from the concept it resembles.
Use the contrapositive directly: assume $n$ odd, derive $n^2$ odd; no contradiction machinery needed.

The nearby idea may share numbers but answers a different question, so it needs a different move.
State the result in the language of the actual task.

Contrapositive is cleaner than contradiction here. Name it for what the problem really asked, not the concept you first expected.
Say the contrast in one sentence.

If you never use the hypothesis to manufacture an impossibility, you wanted the contrapositive, not contradiction.

Answer

Contrapositive is cleaner than contradiction here

Takeaway: If you never use the hypothesis to manufacture an impossibility, you wanted the contrapositive, not contradiction.

Example 3 — Spot the trap: Assume the opposite, crash into impossible

Application

Problem

A student starts with this idea: "Negating only part of the claim" What should they check before accepting that reasoning?

Solution

Pause before the first move.

The first move is a decision, not a calculation — does the situation really match assume the opposite, crash into impossible.
Run the recognition test: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?

This is the single check that the trap skips.
the negation of 'for all $x$ , $P(x)$ ' is 'there exists $x$ with not $P(x)$ ', so flip quantifiers carefully.

Stating the safer rule turns the mistake into a checkable step instead of a vague "be careful."
Compare with the nearest confusion, Direct proof.

Assumes the hypothesis is TRUE and builds forward to the conclusion, with no negation.
State the corrected decision and reuse it.

Using the concept only when the structure matches leaves a process the student can repeat on a new problem.

Answer

the negation of 'for all $x$ , $P(x)$ ' is 'there exists $x$ with not $P(x)$ ', so flip quantifiers carefully.

Takeaway: The recognition step prevents the common trap: Negating only part of the claim

Section 9

Common Mistakes

Common slip-up

Negating only part of the claim

The right idea

the negation of 'for all $x$ , $P(x)$ ' is 'there exists $x$ with not $P(x)$ ', so flip quantifiers carefully.

Common slip-up

Ending at a strange-but-true statement and calling it a contradiction

The right idea

you must reach something logically impossible, like $1=0$ or an integer that is both even and odd.

Common slip-up

Confusing it with contrapositive

The right idea

contradiction assumes the negation of the WHOLE claim and seeks any impossibility; contrapositive only flips an implication and stays direct.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

Try these on your own. Tap Reveal when you want to check.

What clue tells you this is a Proof by Contradiction situation: Prove that $\sqrt{2}$ is irrational.

Hint: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?
Prove that $\sqrt{2}$ is irrational.

Hint: Assume the contrary: $\sqrt{2}=\frac{a}{b}$ in lowest terms, so $a^2=2b^2$ .
Why is this a contrast case instead of Proof by Contradiction: Prove: if $n^2$ is even then $n$ is even. A student writes 'assume $n^2$ even and $n$ odd...'. Is this really contradiction?

Hint: They assumed $\neg Q$ ( $n$ odd) AND $P$ ( $n^2$ even) — but the clean route only needs to assume $n$ is odd and show $n^2$ is odd.
Fix this thinking: Negating only part of the claim

Hint: Name the recognition cue before choosing a rule.
Which is the better fit here: Proof by Contradiction or Direct proof? Explain the deciding difference.

Hint: For Proof by Contradiction, ask: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?
Write one sentence that would remind a classmate how to recognize Proof by Contradiction.

Hint: Use the mental model "Assume the opposite, crash into impossible." and one signal word.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Practice this concept → Take a mastery check

Section 11

Frequently Asked Questions

How do I know when to use Proof by Contradiction?

Use Proof by Contradiction when the claim is a nonexistence or irrationality statement, or assuming its negation is more concrete than proving it directly. Do not start from the numbers alone; first name the structure of the situation. The fastest check is: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it? If the answer is yes and the wording matches cues like suppose not, assume the contrary, there is no, then proof by contradiction is probably the right tool.

What is Proof by Contradiction most often confused with?

Proof by Contradiction is often confused with Direct proof. Direct proof means Assumes the hypothesis is TRUE and builds forward to the conclusion, with no negation. The difference is not just vocabulary; it changes the action you take. For proof by contradiction, the key test is "Did I assume the claim is FALSE and then derive a genuinely impossible statement from it?" For direct proof, the better cue is: Use when assuming $P$ gives a concrete foothold and you can reach $Q$ directly.

What is the fastest recognition cue for Proof by Contradiction?

Look for suppose not, assume the contrary, there is no, irrational, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it? That question protects you from using a memorized procedure in the wrong place.

What mistake should I avoid with Proof by Contradiction?

Avoid this thinking: "Negating only part of the claim" That mistake usually happens when the student jumps to a rule before checking the situation. The safer version is: the negation of 'for all $x$ , $P(x)$ ' is 'there exists $x$ with not $P(x)$ ', so flip quantifiers carefully. A good habit is to say the mental model out loud first: "Assume the opposite, crash into impossible." Then choose the calculation or representation.

How can I tell this apart from Contrapositive proof?

Contrapositive proof is the better fit when the task is about this: Proves ' $\neg Q \Rightarrow \neg P$ ' directly — assumes ONLY the conclusion's negation, not the whole claim's. Proof by Contradiction is the better fit when the claim is a nonexistence or irrationality statement, or assuming its negation is more concrete than proving it directly. If both ideas seem possible, compare what the problem wants as the final answer. The desired output often reveals whether you should use proof by contradiction or switch to the nearby concept.

Why does Proof by Contradiction matter?

Some of mathematics' landmark results — $\sqrt{2}$ is irrational, there are infinitely many primes — have no clean forward proof, and contradiction is the only door in; misusing it (forgetting to actually reach an impossibility) is a classic source of fake proofs, so the structure must be exact. The practical value is recognition: once you can spot proof by contradiction, you can choose a method before calculating. That makes later topics easier because you are not memorizing isolated tricks; you are recognizing the same structure when it appears in a new representation.

Section 12

Learning Path

← Before

Contradiction Logical Statement Direct Proof

Proof by Contradiction

You are here

You're at the end!

Before this, students should be comfortable with Contradiction and Logical Statement. This page focuses on the recognition cue: Did I assume the claim is FALSE and then derive a genuinely impossible statement from it? That cue is the bridge between earlier skills and later problem solving: students first learn to identify the structure, then they learn which calculation, diagram, graph, or proof move belongs to it. After this, students can use proof by contradiction as a tool in larger problems.

Section 13