Proof by Contradiction

Introduction: Why this method matters 🔍

students, in mathematics, some statements are easy to test with examples, but others need a stronger kind of reasoning. Proof by contradiction is a powerful way to prove a statement by showing that the opposite idea leads to something impossible. This method is widely used in IB Mathematics: Analysis and Approaches HL because it connects logical thinking, number systems, sequences, algebra, and complex numbers.

Learning objectives

By the end of this lesson, you should be able to:

Explain the key ideas and vocabulary of proof by contradiction.
Use proof by contradiction in IB-style mathematical reasoning.
Recognize where this method fits within Number and Algebra.
Use examples to show how a contradiction proves a statement is true.

This method is especially useful when a direct proof is difficult. For example, if you want to prove that a number cannot have a certain property, it may be easier to assume it does have that property and then show that this creates a logical conflict. That conflict tells us the original assumption must be false. 🚀

The core idea of proof by contradiction

Proof by contradiction follows a clear structure:

Start with the statement you want to prove.
Assume the opposite is true.
Use logical reasoning, algebra, or known facts to work from that assumption.
Reach a contradiction, such as a statement that is impossible, like $1=0$ or a claim that violates a known theorem.
Conclude that the original statement must be true.

The key term is contradiction. A contradiction is a statement that cannot be true. For example, if a chain of reasoning leads to both $x>0$ and $x<0$ for the same value of $x$, that is impossible. Another common contradiction is ending with a false statement such as $2=3$.

A proof by contradiction is not a guess. It is a formal logical argument. Every step must follow from earlier steps, algebraic rules, or established properties of numbers.

A simple logical pattern

If you want to prove a statement $P$, then proof by contradiction assumes $\neg P$, where $\neg P$ means “not $P$.” If $\neg P$ leads to an impossibility, then $P$ must be true.

This is based on the logical idea that a statement and its opposite cannot both be true. So if the opposite causes failure, the original statement survives. ✅

Example 1: Proving that $\sqrt{2}$ is irrational

One famous use of contradiction is proving that $\sqrt{2}$ is irrational.

Step 1: Assume the opposite

Suppose $\sqrt{2}$ is rational. Then it can be written as $\frac{a}{b}$, where $a$ and $b$ are integers with no common factor, and $b\neq 0$.

So,

$$\sqrt{2}=\frac{a}{b}$$

Squaring both sides gives

$$2=\frac{a^2}{b^2}$$

and therefore

$$a^2=2b^2$$

This means $a^2$ is even, so $a$ must be even.

Step 2: Use the fact that $a$ is even

Let $a=2k$ for some integer $k$. Substitute into the equation:

$$ (2k)^2=2b^2 $$

$$4k^2=2b^2$$

and simplifying,

$$2k^2=b^2$$

This means $b^2$ is even, so $b$ is also even.

Step 3: Find the contradiction

If both $a$ and $b$ are even, then they have a common factor of $2$. But we assumed $\frac{a}{b}$ was in simplest form, with no common factor. This is impossible.

Therefore, the assumption that $\sqrt{2}$ is rational is false. So $\sqrt{2}$ is irrational.

This proof is important in Number and Algebra because it shows how number properties can be used to prove results about rational and irrational numbers. It also demonstrates how divisibility and parity can create strong logical arguments.

Example 2: Proving there is no smallest positive rational number

Another useful contradiction proof shows that there is no smallest positive rational number.

Step 1: Assume the opposite

Assume there is a smallest positive rational number, call it $r$.

Because $r$ is rational and positive, the number

$$\frac{r}{2}$$

is also rational and positive.

Step 2: Compare the two numbers

Now, since $r>0$,

$$\frac{r}{2}<r$$

This means there is a smaller positive rational number than $r$.

Step 3: Reach the contradiction

That contradicts the assumption that $r$ was the smallest positive rational number.

Therefore, there is no smallest positive rational number.

This example is helpful because it shows how contradiction can be used with the structure of the rational numbers. It also connects to sequences and limits, since it involves making a number smaller while staying in the same set. 📉

How to write a contradiction proof in IB style

When you write a contradiction proof, clarity matters. A strong IB answer should be organized and precise.

Good structure to follow

State clearly what you are proving.
Begin with “Assume the opposite” or a similar phrase.
Define variables carefully.
Show the algebra step by step.
Identify the exact contradiction.
Finish with a conclusion such as “Therefore, the original statement is true.”

Example of sentence structure

You might write:

“Assume, for contradiction, that $P$ is false.”
“Then we obtain $\dots$”
“This contradicts the fact that $\dots$”
“Hence, $P$ must be true.”

These words help the reader see the logic clearly. In IB Mathematics, clear reasoning is just as important as the final answer.

Proof by contradiction in Number and Algebra

Proof by contradiction fits naturally into Number and Algebra because this topic is about the structure and properties of numbers, symbols, and equations. Many statements in this area are hard to prove directly, but easy to handle by assuming the opposite.

Common uses in this topic

Proving that certain numbers are irrational.
Showing that an equation has no integer solution.
Demonstrating that a property cannot hold for all values.
Proving that a set of numbers must satisfy a certain condition.
Establishing results about divisibility or parity.

For example, suppose you want to prove that there is no integer $n$ such that

$$n^2=2$$

If such an integer existed, then $n$ would satisfy $n=\sqrt{2}$, but $\sqrt{2}$ is irrational. So no integer can satisfy the equation. A contradiction proof helps connect the result to the broader theory of integers and irrational numbers.

Another area is systems of equations. Sometimes an assumed property of a solution leads to impossible values. That contradiction shows that the system cannot have a solution with those properties.

A second IB-style example: odd and even numbers

Let’s prove that the square of an odd integer is odd.

This statement can also be proven directly, but contradiction helps show the logic of the method.

Step 1: Assume the opposite

Assume that an odd integer $n$ has an even square, $n^2$.

Since $n$ is odd, write

$$n=2k+1$$

for some integer $k$.

Then

$$n^2=(2k+1)^2=4k^2+4k+1$$

which can be written as

$$n^2=2(2k^2+2k)+1$$

This has the form $2m+1$, so it is odd.

Step 2: Find the contradiction

We assumed $n^2$ was even, but algebra shows $n^2$ is odd. That is a contradiction.

Step 3: Conclude the result

Therefore, the square of an odd integer is odd.

This example shows how contradiction can confirm a property of integers using algebraic structure. It also strengthens your understanding of how expressions like $2k$ and $2k+1$ model even and odd numbers.

Common mistakes to avoid

When using contradiction, students sometimes make logical errors. Watch out for these:

Assuming the conclusion instead of its opposite.
Skipping important algebraic steps.
Reaching a contradiction that is not actually impossible.
Forgetting to clearly state the final conclusion.
Confusing a contradiction with a surprising result.

For example, obtaining a value that seems unusual is not enough. The contradiction must be logically impossible. A correct contradiction might be $n$ being both even and odd, or a result that violates a known property such as the uniqueness of a reduced fraction.

Conclusion

Proof by contradiction is a central reasoning tool in IB Mathematics: Analysis and Approaches HL. students, it works by assuming the opposite of what you want to prove and then showing that this assumption leads to an impossible result. This method is especially useful in Number and Algebra because it helps prove facts about rationality, divisibility, parity, integers, and the structure of number systems.

The main idea is simple, but the reasoning is powerful. If the opposite of a statement cannot be true, then the statement itself must be true. Learning this method improves your ability to write formal proofs and to understand why mathematical statements are valid. 🧠

Study Notes

Proof by contradiction begins by assuming the opposite of the statement you want to prove.
A contradiction is a logical impossibility, such as $1=0$ or a number being both even and odd.
If the assumption leads to a contradiction, the original statement must be true.
This method is especially useful in Number and Algebra for rationality, divisibility, parity, and integer arguments.
A strong proof should be clear, step-by-step, and end with a direct conclusion.
Famous examples include proving that $\sqrt{2}$ is irrational and showing that there is no smallest positive rational number.
In IB Mathematics, proof by contradiction is valued for both accuracy and logical structure.
Remember: assume the opposite, reason carefully, find the contradiction, and conclude the original statement is true.