How To Prove By Contrapositive Steps And Examples?

Proof by contrapositive is a method of proving a statement by proving its logical equivalent instead. If you want to prove “If P, then Q,” you assume Q is false and show that P must also be false. Because a statement and its contrapositive are always logically identical, proving one proves the other.

This method is one of the most widely used tools in mathematics, and it appears in standardized tests, university coursework, and everyday logical reasoning. The steps are mechanical once you understand the structure. The examples below walk through the process from start to finish.

What Is Proof by Contrapositive?

Proof by contrapositive works because of a rule in logic: the statement “If P, then Q” is exactly equivalent to “If not Q, then not P.” These two statements are called contrapositives of each other, and they always share the same truth value. If one is true, the other is true.

This means you have a choice. You can prove the original statement directly, or you can prove its contrapositive. Sometimes the contrapositive is far easier to work with.

Consider the claim: “If a number is divisible by 6, then it is divisible by 3.” The contrapositive is: “If a number is not divisible by 3, then it is not divisible by 6.” The second version is often easier to reason about because you start with a simpler condition and work toward a clear conclusion.

The key insight is that you are not changing the meaning of the statement. You are restating it in a form that may be easier to prove.

How To Prove By Contrapositive: Step-by-Step

The process follows a clear sequence. Each step builds on the previous one.

• Step 1: Write the original statement in “If P, then Q” form.
• Step 2: Identify P (the hypothesis) and Q (the conclusion).
• Step 3: Form the contrapositive by negating both parts and swapping them: “If not Q, then not P.”
• Step 4: Assume not Q is true. This is your starting point.
• Step 5: Use definitions, known theorems, and logical deduction to show that not P must follow.
• Step 6: State your conclusion: since the contrapositive is proven, the original statement is proven.

Negating statements correctly is where most mistakes happen. The negation of “x is even” is “x is not even,” which for integers means “x is odd.” The negation of “x > 5” is “x ≤ 5,” not “x < 5." Pay close attention to the exact logical opposite.

Contrapositive vs. Converse vs. Inverse

Students often confuse these three related statements. They are not equivalent to the original in the same way.

Take the statement: “If it is raining, then the ground is wet.”

• Contrapositive: “If the ground is not wet, then it is not raining.” This is logically equivalent to the original. Always.
• Converse: “If the ground is wet, then it is raining.” This is not equivalent. The ground could be wet from a sprinkler.
• Inverse: “If it is not raining, then the ground is not wet.” This is also not equivalent, for the same reason.

Only the contrapositive preserves the truth of the original statement. The converse and inverse are logically equivalent to each other, but neither is equivalent to the original.

This distinction matters. Proving the converse does not prove the original. Many logical errors in arguments and in mathematics come from confusing these forms.

Worked Examples of Contrapositive Proofs

Seeing the method applied makes the steps concrete.

Example 1: Even and Odd Integers

Statement: If n² is even, then n is even.

Proving this directly is awkward. You would need to show that an even square forces an even root. The contrapositive is cleaner.

Contrapositive: If n is not even (that is, n is odd), then n² is not even (that is, n² is odd).

Proof: Assume n is odd. By definition, n = 2k + 1 for some integer k. Then n² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1. Since 2k² + 2k is an integer, n² has the form 2m + 1, which is odd. Therefore n² is not even.

Since the contrapositive is proven, the original statement is proven.

Example 2: Divisibility

Statement: If a number is divisible by 10, then it is divisible by 5.

Contrapositive: If a number is not divisible by 5, then it is not divisible by 10.

Proof: Assume a number n is not divisible by 5. If n were divisible by 10, then n = 10k for some integer k. But 10k = 5(2k), which means n would be divisible by 5. That contradicts our assumption. Therefore n is not divisible by 10.

This example shows how contrapositive proofs often rely on a contradiction within the assumed case.

Example 3: Real Numbers and Inequalities

Statement: If x + y > 10, then x > 5 or y > 5.

Contrapositive: If x ≤ 5 and y ≤ 5, then x + y ≤ 10.

Proof: Assume x ≤ 5 and y ≤ 5. Adding these inequalities gives x + y ≤ 10. This directly proves the contrapositive, and therefore the original statement.

Notice how the negation of “x > 5 or y > 5” is “x ≤ 5 and y ≤ 5.” The “or” becomes “and” when negated, and the inequality flips. Getting this right is essential.

When Should You Use Contrapositive Instead of Direct Proof?

Contrapositive proof is most useful when the direct approach gets tangled. If assuming P and trying to reach Q leads to a dead end, try assuming not Q and working toward not P.

Certain patterns suggest that contrapositive will be easier:

• The conclusion Q is a negative statement, like “is not divisible by” or “is not a perfect square.”
• The hypothesis P is hard to use directly because it gives you little to work with.
• The statement involves “if and only if” conditions where one direction is easier than the other.
• You can derive a clean contradiction or a straightforward chain of reasoning from not Q.

In practice, mathematicians often try direct proof first. If it stalls, they switch to contrapositive. The two methods are complementary, not competing.

Common Mistakes in Contrapositive Proofs

Most errors come from misidentifying the contrapositive or negating incorrectly.

Mistake 1: Confusing contrapositive with converse. The converse of “If P, then Q” is “If Q, then P.” This is not equivalent and cannot be used as a substitute.

Mistake 2: Incorrect negation. The negation of “all” is “some” or “at least one,” not “none.” The negation of “x > 5” is “x ≤ 5,” not “x < 5." Small errors here invalidate the proof.

Mistake 3: Negating only one part. Both the hypothesis and conclusion must be negated and swapped. Negating only Q gives you the inverse, not the contrapositive.

Mistake 4: Assuming the conclusion. In a contrapositive proof, you assume not Q. You do not assume Q or P. Starting with the wrong assumption leads to circular reasoning.

Checking your work against these common errors catches most problems before they become serious.

Why Contrapositive Proof Matters Beyond Math

The logic behind contrapositive reasoning appears in fields far beyond mathematics. In computer science, it is used to verify that algorithms behave correctly. In law, it underlies arguments about causation and liability. In everyday reasoning, it helps identify flawed arguments.

When someone claims “If you study hard, you will pass,” the contrapositive is “If you did not pass, you did not study hard.” This is logically equivalent to the original claim. Recognizing this equivalence helps you evaluate whether the original statement is actually true.

The method is not just a mathematical trick. It is a fundamental tool for clear thinking.