Direct Proof, Contradiction, and Contrapositive

students, in real analysis, proving statements is just as important as learning definitions 📘. This lesson focuses on three of the most common proof methods: direct proof, proof by contradiction, and proof by contrapositive. These methods help us show that a statement is true with clear logic instead of guessing or checking only a few examples.

Why proof methods matter

Mathematics is built on statements that must be justified. For example, if we say that every even integer is divisible by $2$, or that the sum of two rational numbers is rational, we need a logical argument that works in all cases. That is what a proof does.

The main objectives of this lesson are to help you:

explain what direct proof, contradiction, and contrapositive mean;
apply each method to real analysis-style statements;
connect proof methods to logic, sets, and functions;
recognize when one method is easier than another;
use examples to support mathematical reasoning.

A good proof is like a carefully built bridge 🌉: each step must connect to the next step, and no gap is allowed.

Direct proof: start with the facts and move forward

A direct proof begins by assuming the hypothesis of a statement and then using definitions, algebra, and known results to reach the conclusion. This method is often used for statements of the form “if $P$, then $Q$.”

The structure is:

assume $P$ is true;
use logic and definitions;
show that $Q$ must follow.

Direct proof is especially effective when the statement involves definitions that already give useful information. For example, to prove that the sum of two even integers is even, let the integers be $2m$ and $2n$, where $m$ and $n$ are integers. Then

$$2m+2n=2(m+n),$$

and since $m+n$ is an integer, the result is even.

This is a direct proof because we started with the assumption that the numbers are even and moved straight to the conclusion.

Example from real analysis

Suppose you want to prove: if $x>2$, then $x^2>4$.

A direct proof works like this:

Assume $x>2$.
Then $x-2>0$.
Also, $x+2>0$ because $x>2$.
Multiply the two positive numbers:

$$ (x-2)(x+2)>0. $$

Expanding gives

$$ x^2-4>0, $$

$$ x^2>4. $$

This is a clean direct argument. Notice how the conclusion comes from algebraic manipulation rather than trying many values of $x$.

Direct proof is often the first method to try because it is usually the most straightforward 🧠.

Contrapositive: prove the equivalent statement

Sometimes proving $P\to Q$ directly is awkward. In that case, we can prove its contrapositive, which is the statement $\lnot Q\to \lnot P$.

A key logic fact is that a statement and its contrapositive are logically equivalent. That means they are always true or false together. So if proving $P\to Q$ directly is hard, proving $\lnot Q\to \lnot P$ is enough.

The structure is:

assume $\lnot Q$;
show that $\lnot P$ must follow.

Example

Let us prove: if $n^2$ is even, then $n$ is even, for an integer $n$.

A direct proof is possible, but the contrapositive is often easier. The contrapositive is:

if $n$ is odd, then $n^2$ is odd.

Now prove that. If $n$ is odd, then $n=2k+1$ for some integer $k$. Then

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

So $n^2$ is odd.

Because the contrapositive is true, the original statement is also true.

Why this works

Contrapositive proofs are useful when the negation of the conclusion is easier to handle than the original hypothesis. For example, if the conclusion says something is “even,” its negation is “odd.” If the hypothesis is complicated, proving the contrapositive may simplify the work.

In real analysis, contrapositive arguments often appear in proofs about inequalities, limits, and sequences. For instance, proving that a sequence is not convergent can sometimes be approached by showing that if it were convergent, certain necessary conditions would fail.

Proof by contradiction: assume the opposite and find an impossibility

In a proof by contradiction, we assume that the statement we want to prove is false and then show this assumption leads to a contradiction, meaning something impossible or logically inconsistent.

If we want to prove a statement $P$, we assume $\lnot P$ and derive a contradiction such as $1=0$, or a result that violates a known fact.

The structure is:

assume $\lnot P$;
use definitions and logical steps;
reach a contradiction;
conclude that $P$ must be true.

This method is powerful because it works even when a direct proof is not obvious. It is also common in advanced mathematics, including real analysis 📌.

Classic example: $\sqrt{2}$ is irrational

We want to prove that $\sqrt{2}$ cannot be written as a fraction of integers. Assume the opposite: suppose $\sqrt{2}=\frac{a}{b}$, where $a$ and $b$ are integers with no common factor and $b\neq 0$.

Squaring both sides gives

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

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

This means $a^2$ is even, so $a$ is even. Let $a=2k$ for some integer $k$. Then

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

which simplifies to

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

and then

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

So $b^2$ is even, which means $b$ is even too. But now both $a$ and $b$ are even, so they share a factor of $2$. That contradicts the assumption that $\frac{a}{b}$ was in lowest terms.

Therefore, $\sqrt{2}$ is irrational.

The contradiction shows that the original assumption was impossible.

How to choose a proof method

students, choosing a proof method is a skill that gets better with practice.

Use a direct proof when:

the hypothesis gives useful information immediately;
definitions can be applied clearly;
algebra or known theorems can lead directly to the conclusion.

Use a contrapositive proof when:

the original conclusion is hard to prove directly;
the negation of the conclusion is simpler;
the statement has the form $P\to Q$ and $\lnot Q$ is easier to work with.

Use contradiction when:

the statement is difficult to prove directly or by contrapositive;
assuming the negation creates a clear impossible situation;
the result is about existence, uniqueness, irrationality, or impossibility.

A practical strategy is to read the statement carefully, identify the hypothesis and conclusion, and ask: “Would it be easier to work forward, work backward through the negation, or assume the opposite and trap it in a contradiction?” 🤔

Connections to logic, sets, and functions

These proof methods are rooted in logic. A statement like “if $P$, then $Q$” is a conditional statement. Its contrapositive is $\lnot Q\to \lnot P$. Its converse is $Q\to P$, which is not logically equivalent to the original statement.

This matters in set language too. If $A\subseteq B$, that means every element of $A$ is in $B$. A direct proof might start with an arbitrary element $x\in A$ and show $x\in B$.

For functions, these ideas appear when proving properties such as injectivity or surjectivity. For example, to prove a function is injective, one may assume $f(x_1)=f(x_2)$ and show that $x_1=x_2$. That is often a direct or contradiction-style argument.

In real analysis, these proof methods help establish the behavior of sequences, limits, continuity, and inequalities. For example, proving that a limit is unique often uses contradiction. Showing that a sequence stays bounded may use direct proof from the definition. So these techniques are not separate from analysis; they are the language of analysis itself.

Conclusion

Direct proof, contradiction, and contrapositive are three essential tools in students’s mathematical toolkit 🛠️. A direct proof moves forward from the hypothesis to the conclusion. A contrapositive proof replaces $P\to Q$ with the equivalent statement $\lnot Q\to \lnot P$. A contradiction proof assumes the statement is false and shows that this leads to an impossibility.

These methods are central to logic, sets, and functions, and they appear constantly in real analysis. With practice, you will learn to spot which method fits a statement best and how to write a proof that is clear, precise, and logically complete.

Study Notes

A direct proof assumes the hypothesis and derives the conclusion step by step.
A contrapositive proof of $P\to Q$ proves $\lnot Q\to \lnot P$ instead.
A contradiction proof assumes the negation of the statement and derives an impossible result.
A statement and its contrapositive are logically equivalent.
The converse of $P\to Q$ is $Q\to P$, and it is not automatically equivalent to the original statement.
Direct proofs often use definitions, algebra, and known theorems.
Contrapositive proofs are useful when the negation of the conclusion is simpler than the original statement.
Contradiction is powerful for irrationality proofs, uniqueness arguments, and existence results.
In set language, proving $A\subseteq B$ often means taking an arbitrary $x\in A$ and showing $x\in B$.
In real analysis, these methods support proofs about limits, sequences, continuity, inequalities, and functions.
A strong proof is clear, logically ordered, and based on definitions, not just examples.