Ultimate Guide to The Nature of Proof: Negations, Converses, and Contrapositives

Introduction

In the previous guide, we learned how to construct basic logical statements using implications ( $P \Rightarrow Q$ ) and quantifiers ( $\forall, \exists$ ). But in mathematics, we frequently need to flip, reverse, or deny these statements to prove complex theorems. In this guide, we will explore how to manipulate logical propositions by forming their negation, converse, and contrapositive, and we will introduce the concept of logical equivalence (if and only if).

Executive Summary

This guide covers the core logical manipulations required for advanced proof:

Negation ( $\sim P$ ): Asserting that a statement is "not" true, and the rules for negating implications and quantifiers.
The Converse ( $Q \Rightarrow P$ ): Reversing an implication, and why a true implication does not guarantee a true converse.
Equivalence ( $P \Leftrightarrow Q$ ): "If and only if" statements, meaning both the implication and its converse are true.
The Contrapositive ( $\sim Q \Rightarrow \sim P$ ): Denying the conclusion to deny the premise, and why it is logically equivalent to the original implication.

What is this about?

Suppose a theorem states: "If an integer is a multiple of 4, then it is even." ( $P \Rightarrow Q$ ). Is the reverse true? "If an integer is even, then it is a multiple of 4." No! (For example, the number 6 is even but not a multiple of 4). This reverse statement is called the converse.

However, consider this statement: "If an integer is NOT even, then it is NOT a multiple of 4." This is absolutely true! This statement is called the contrapositive. The fact that an implication and its contrapositive always share the exact same truth value is a cornerstone of mathematical proof.

Main Content

1. Negation ( $\sim P$ )

The negation of a statement $P$ is the statement "not $P$ ". It is denoted by $\sim P$ (or sometimes $\neg P$ ). If $P$ is true, $\sim P$ is false. If $P$ is false, $\sim P$ is true.

Important Negation Rules:

Negation of a Negation: $\sim(\sim P) \equiv P$ . (A double negative makes a positive).
Negating Quantifiers:
- The negation of "For all" ( $\forall$ ) is "There exists" ( $\exists$ ).
- The negation of "There exists" ( $\exists$ ) is "For all" ( $\forall$ ). Example: The negation of "All swans are white" is NOT "No swans are white". The correct negation is "There exists at least one swan that is not white." Mathematically: $\sim(\forall x, P) \equiv \exists x, \sim P$
Negating an Implication: How do you prove an implication "If $P$ then $Q$ " is false? You must show a case where the condition $P$ happens, but the conclusion $Q$ does not happen. Mathematically: $\sim(P \Rightarrow Q) \equiv P \text{ and } \sim Q$ .

2. The Converse ( $Q \Rightarrow P$ )

The converse of the implication $P \Rightarrow Q$ is formed by swapping the premise and the conclusion: $Q \Rightarrow P$ (Read as "If $Q$ , then $P$ ").

Crucial Rule: The truth of an implication tells you nothing about the truth of its converse. They must be evaluated entirely independently.

3. Equivalence ( $P \Leftrightarrow Q$ )

If an implication $P \Rightarrow Q$ is true, AND its converse $Q \Rightarrow P$ is also true, we say the statements $P$ and $Q$ are equivalent. We write this as: $P \Leftrightarrow Q$ This is read as " $P$ if and only if $Q$ ", which is commonly abbreviated to " $P$ iff $Q$ ". When proving an "iff" statement in an exam, you must provide two proofs: you must prove the forward direction ( $\Rightarrow$ ) and the reverse direction ( $\Leftarrow$ ).

4. The Contrapositive ( $\sim Q \Rightarrow \sim P$ )

The contrapositive of the implication $P \Rightarrow Q$ is formed by negating both statements AND swapping their order: $\sim Q \Rightarrow \sim P$ (Read as "If not $Q$ , then not $P$ ").

The Most Important Rule of Logic: An implication is logically equivalent to its contrapositive. $(P \Rightarrow Q) \equiv (\sim Q \Rightarrow \sim P)$ If one is true, the other is guaranteed to be true. If one is false, the other is guaranteed to be false. We use this constantly in proof: if $P \Rightarrow Q$ is too hard to prove directly, we just prove $\sim Q \Rightarrow \sim P$ instead!

Simple Worked Example

Question: Consider the implication: "If $x > 0$ , then $x^2 > 0$ ". (a) Write the converse. Is the converse true or false? (b) Write the contrapositive.

Solution: (a) Write the converse. The original implication is: ( $x > 0$ ) $\Rightarrow$ ( $x^2 > 0$ ). To find the converse, swap $P$ and $Q$ : Answer: "If $x^2 > 0$ , then $x > 0$ ". This statement is false. Counterexample: Let $x = -2$ . Then $x^2 = 4 > 0$ , but $-2$ is not greater than $0$ .

(b) Write the contrapositive. To find the contrapositive, negate both parts and swap them. Negation of $Q$ : $x^2 \le 0$ Negation of $P$ : $x \le 0$ Answer: "If $x^2 \le 0$ , then $x \le 0$ ". (Since the original statement was true, this contrapositive is also mathematically true).

mini-FAQ page

Q: Are "iff" and "equivalent" exactly the same thing? A: Yes. Saying " $P$ iff $Q$ " is just a shorthand way of saying that statement $P$ is logically equivalent to statement $Q$ . If you prove one, you have automatically proven the other.

Q: What is the "inverse" of a statement? A: The inverse of $P \Rightarrow Q$ is $\sim P \Rightarrow \sim Q$ . It is not explicitly listed in the Extension 2 syllabus, but it is good to know that an implication is not equivalent to its inverse. (The inverse is actually equivalent to the converse!)

Common mistakes to avoid

Negating $\ge$ incorrectly: The negation of $x > 5$ is $x \le 5$ , NOT $x < 5$ . You must account for the equals sign.
Negating an implication as an implication: Many students think the negation of $P \Rightarrow Q$ is $\sim P \Rightarrow \sim Q$ . This is entirely wrong! The negation of an implication is an "and" statement: $P \text{ and } \sim Q$ .

Practice on Vu's Maths Hub

Mastering contrapositives is the secret to unlocking the hardest proof questions.

Practice forming converses, inverses, and contrapositives in the HSC Proof Booklet.
Test your logic skills with tricky true/false questions at Vu's Maths Hub.

Connect with me

Want to master Mathematical Logic and guarantee top marks in HSC Mathematics Extension 2? Visit Vu's Maths Hub for in-depth booklets, rigorous worked solutions, and expert advice to help you ace your exams!