A proof by contrapositive works by flipping and negating an “if-then” statement, then proving that flipped version directly. Instead of proving “if P, then Q,” you prove “if not Q, then not P.” These two statements are logically identical, so proving one automatically proves the other. It’s one of the most useful techniques in mathematics, especially when the original direction feels like a dead end.
Why the Contrapositive Is Logically Equivalent
Every conditional statement “if P, then Q” has a contrapositive: “if not Q, then not P.” A truth table confirms that these two forms produce identical truth values for every possible combination of P and Q. When P is true and Q is true, both the original and the contrapositive evaluate to true. When P is true and Q is false, both evaluate to false. The match holds across all four rows of the table. They are not just related; they are the same logical claim expressed differently.
This is different from the converse and the inverse, which are not equivalent to the original. The converse of “if P, then Q” is “if Q, then P,” which simply swaps the two parts. The inverse is “if not P, then not Q,” which negates both parts without swapping. Neither the converse nor the inverse is guaranteed to have the same truth value as the original statement. Only the contrapositive shares that guarantee.
The Three Steps
The method follows a clean sequence:
- Identify your statement’s structure. Write what you’re trying to prove in the form “if P, then Q.” Be explicit about what P and Q are.
- Form the contrapositive. Negate both parts and swap their positions: “if not Q, then not P.”
- Prove the contrapositive directly. Assume “not Q” is true, then use definitions, algebra, or logic to show that “not P” must follow.
That last step is just a standard direct proof, applied to the contrapositive statement. You assume the hypothesis (not Q) and work forward until you reach the conclusion (not P). Once you’ve done that, the original statement is proven.
A Classic Example: If n² Is Even, Then n Is Even
This is the textbook case where contrapositive shines. The original statement is: for all integers n, if n² is even, then n is even. Trying to prove this directly is awkward. You’d start by assuming n² is even, meaning n² = 2k for some integer k, and then you’d need to somehow show n itself equals twice some integer. Taking a square root of 2k doesn’t give you anything clean to work with.
The contrapositive is: if n is not even (meaning n is odd), then n² is not even (meaning n² is odd). Now the proof practically writes itself.
Assume n is odd. By definition, that means n = 2k + 1 for some integer k. Square both sides:
n² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1
Since 2k² + 2k is an integer, n² has the form 2(something) + 1, which is the definition of an odd number. So n² is odd. That proves the contrapositive, and therefore proves the original statement.
When to Use Contrapositive Over Direct Proof
The contrapositive is your best option when the conclusion of the original statement gives you very little to work with, but the negation of that conclusion gives you a concrete starting point. In the example above, “n is even” as a conclusion is hard to extract from information about n². But “n is odd” as an assumption hands you n = 2k + 1, which you can square and manipulate immediately.
Look for these signals that contrapositive will be easier:
- The conclusion involves a property that’s hard to “reverse engineer.” If you’d need to undo a square, a modular operation, or a function that isn’t one-to-one, the direct route is often messy.
- The negation of the conclusion gives you a specific algebraic form. “Not even” becomes “odd,” which means 2k + 1. “Not divisible by 3” means the remainder is 1 or 2. These negations hand you something concrete.
- The hypothesis is hard to negate but easy to assume. If “not P” would be complicated to reach as a conclusion but P itself is a natural assumption, direct proof may still be better. Contrapositive helps most when both the negated hypothesis and the negated conclusion are clean, workable statements.
Another Example: If 3n + 2 Is Odd, Then n Is Odd
The contrapositive is: if n is even, then 3n + 2 is even. Assume n is even, so n = 2k for some integer k. Then 3n + 2 = 3(2k) + 2 = 6k + 2 = 2(3k + 1). Since 3k + 1 is an integer, 3n + 2 is even. Done.
The direct version would require you to assume 3n + 2 is odd, write 3n + 2 = 2k + 1, then solve for n = (2k – 1)/3 and argue this is odd. It’s doable but messier, and you’d need to justify that (2k – 1) is divisible by 3 in the relevant cases. The contrapositive sidesteps all of that.
Contrapositive vs. Contradiction
Proof by contrapositive is sometimes confused with proof by contradiction, but they’re different techniques. In a contrapositive proof, you directly prove “if not Q, then not P.” In a proof by contradiction, you assume the original statement is false (P is true and Q is false) and derive something impossible, like 1 = 0 or a number being both even and odd.
Contrapositive is generally cleaner when it applies. You’re building a straightforward chain of logic from assumption to conclusion, just in the reverse direction. Contradiction requires you to hunt for an impossibility, which can feel less structured. If you can set up the problem as a contrapositive, that’s typically the better choice. Save contradiction for situations where you genuinely need to show that an assumption leads to an absurdity, such as proving that the square root of 2 is irrational.
Common Mistakes to Avoid
The most frequent error is confusing the contrapositive with the converse or the inverse. If your original statement is “if it rains, then the ground is wet,” the contrapositive is “if the ground is not wet, then it did not rain.” The converse (“if the ground is wet, then it rained”) is a completely different claim that could be false. Always negate both parts and swap them.
Another mistake is negating statements incorrectly, especially when quantifiers or compound conditions are involved. The negation of “n is greater than or equal to 5” is “n is less than 5,” not “n is less than or equal to 5.” The negation of “x is even and positive” is “x is odd or x is not positive.” When you negate an “and,” it becomes an “or,” and vice versa. Getting the negation wrong means you’re proving a different statement entirely.
Finally, remember that your contrapositive proof must work for all cases in the domain, just like any direct proof. If your original statement says “for all integers n,” your contrapositive must hold for all integers n too. You can’t just check a few examples and call it done.