← mapLogic & Proof

Implication

⚗ Dr. Möbius, from the lab

Now the connective that runs all of mathematics and ruins all of public discourse: if–then. Get this one right and proofs make sense forever. Get it wrong — confuse a statement with its converse — and you join roughly 95% of humanity wallowing in a swamp of catastrophic bullshit reasoning. I will drag you out of that swamp by the collar, whether you like it or not.

THE BIG IDEA

P implies Q is a promise that is broken only when P is true and Q is false, so it is logically equivalent to its contrapositive but NOT to its converse.

Implication is a promise

The statement $P \to Q$ — read " $P$ implies $Q$ ", or "if $P$ then $Q$ " — is the spine of every theorem you will ever meet. $P$ is the hypothesis (the premise, the "if" part); $Q$ is the conclusion (the "then" part).

The cleanest way to understand it: $P \to Q$ is a promise. I tell you, "If it rains, then I bring an umbrella." When is my promise broken — when did I lie to you? Exactly one situation: it rained ( $P$ true) and I showed up umbrella-less ( $Q$ false). In every other case I kept my word.

That single insight hands you the whole truth table. Stare at it. I'll wait.

$P$	$Q$	$P \to Q$
T	T	T
T	F	F
F	T	T
F	F	T

Row 2 is the only false row — promise made, promise broken. Stare at it. The implication is true by default and false only when the hypothesis holds but the conclusion fails. And here's a bonus that ties back to last lesson: this column is identical to $\neg P \lor Q$ . So $P \to Q \equiv \neg P \lor Q$ — implication is secretly just an OR in disguise. Verify it row by row and feel the floor shift.

Vacuous truth: the rows that make people scream

Look at rows 3 and 4 — the ones where $P$ is false. The implication comes out true both times, and students hate this with the fire of a thousand suns. "How can 'if I'm a billionaire, I'll buy you a yacht' be true when I'm broke?!"

Because I never broke the damn promise. The promise only kicks in if I'm a billionaire. I'm not, so the condition never triggered, so I can't have lied. An unfired promise is an unbroken promise. We call this vacuous truth: when the hypothesis is false, the implication is automatically true, for free, no questions asked.

"Every purple elephant in this lab can fly." True! There are no purple elephants in the lab — I checked, and believe me, I'd know — so there's no counterexample, so the statement stands. Weird? Hell yes. Forced by the table? Also yes. And rigor wins over feelings every single time — that's the entire ethic of this place. You'll use vacuous truth the moment you prove things about empty sets.

Converse: the most expensive mistake on Earth

Take $P \to Q$ and swap the parts. You get the converse, $Q \to P$ . It looks almost the same. It is a completely different statement, and conflating the two is the single most common logical error committed by your species, daily, at catastrophic scale. Politicians do it. Doctors do it. Your least favorite statistics teacher certainly does it.

"If it's a dog, then it's a mammal." True. Converse: "If it's a mammal, then it's a dog." Catastrophically false — cats exist.

The truth of $P \to Q$ tells you nothing about $Q \to P$ . They are independent. A medical test that's positive whenever you're sick ( $\text{sick} \to \text{positive}$ ) is worthless shit if it's also positive for healthy people; the converse ( $\text{positive} \to \text{sick}$ ) is the thing you actually wanted, and it does not come free. Tattoo this on the inside of your eyelids: the converse is not the original.

Contrapositive: the secret identical twin

Now a different swap. The contrapositive of $P \to Q$ is $\neg Q \to \neg P$ — negate both parts AND flip the order. And here is the miracle: the contrapositive is logically equivalent to the original. Same truth table, same statement, two costumes. Prove it:

$P$	$Q$	$P \to Q$	$\neg Q$	$\neg P$	$\neg Q \to \neg P$
T	T	T	F	F	T
T	F	F	T	F	F
F	T	T	F	T	T
F	F	T	T	T	T

Columns three and six are identical. So $P \to Q \equiv \neg Q \to \neg P$ , always. "If it's a dog, it's a mammal" says exactly the same thing as "if it's not a mammal, it's not a dog." This isn't a coincidence — it's the engine of an entire proof technique two lessons from now, where a hard $P \to Q$ becomes an easy $\neg Q \to \neg P$ .

So burn the asymmetry into your brain, because it's the entire goddamn lesson: converse = different; contrapositive = same.

Toggle the rows and confirm the equivalence with your own hands — watch $P \to Q$ and $\neg Q \to \neg P$ stay locked together while the converse drifts off on its own:

truth table — tap a row to spotlight it

P	Q	P → Q	¬Q → ¬P	Q → P
T	T	T	T	T
T	F	F	F	T
F	T	T	T	F
F	F	T	T	T

Biconditional: the two-way street

Sometimes both directions are true. When $P \to Q$ and $Q \to P$ both hold, we write $P \leftrightarrow Q$ , read " $P$ if and only if $Q$ " (often abbreviated "iff"). Its table is true exactly when $P$ and $Q$ have the same truth value:

$P$	$Q$	$P \leftrightarrow Q$
T	T	T
T	F	F
F	T	F
F	F	T

" $n$ is even iff $n$ is divisible by $2$ ." Both directions hold, so it's a biconditional — a genuine definition. Whenever you see "iff," brace yourself: you'll have to prove two implications, never just one. Half a biconditional is half a proof, and half a proof is zero proof.

The hidden quantifier in every math claim

Last move, and it's a hell of a doozy. Most mathematical claims are implications in disguise, with a silent "for all" bolted to the front. The Federation of Boring Textbook Authors never bothers to show you this skeleton, which is why students stumble through proofs for years without knowing what they're actually asserting. Take "every multiple of $4$ is even." Unpack it:

$\text{for all integers } n,\quad (4 \mid n) \to (2 \mid n).$

There's the hidden $\forall$ ("for all $n$ ") and the hidden $\to$ ("if $4$ divides $n$ , then $2$ divides $n$ "). "Every $A$ is a $B$ " always means "for all $x$ , if $x$ is an $A$ then $x$ is a $B$ ." Learning to X-ray English sentences into this $\forall \dots \to \dots$ skeleton is the prerequisite for proving anything — which is precisely where the next two lessons are headed. Do the gauntlet; sharpen the X-ray vision.

🔬 SPECIMENS (worked examples)

Worked example 1 — when is the promise broken?▸

Consider the claim: "If $n > 10$ , then $n > 5$ ." For which value of $n$ , if any, is this implication false? Test $n = 12$ , $n = 7$ , and $n = 3$ .

An implication $P \to Q$ is false only when $P$ is true and $Q$ is false. Here $P$ is " $n > 10$ " and $Q$ is " $n > 5$ ".

$n = 12$ : $P$ true ( $12 > 10$ ), $Q$ true ( $12 > 5$ ). Promise kept — true.
$n = 7$ : $P$ false ( $7 \not> 10$ ), $Q$ true ( $7 > 5$ ). Hypothesis fails, so vacuously true.
$n = 3$ : $P$ false ( $3 \not> 10$ ), $Q$ false ( $3 \not> 5$ ). Hypothesis fails again — vacuously true.

There is no value making it false, because there's no number that's both greater than $10$ and not greater than $5$ . The implication is true for every $n$ — it's a genuine theorem. Notice rows where $P$ is false don't threaten it at all.

Worked example 2 — converse vs contrapositive, side by side▸

Take the true statement: "If a quadrilateral is a square, then it has four right angles." Write its converse and its contrapositive, and judge whether each is true.

Let $P$ = "it's a square", $Q$ = "it has four right angles". The original $P \to Q$ is true.

Converse ( $Q \to P$ ): "If a quadrilateral has four right angles, then it's a square." This is false — a non-square rectangle has four right angles but isn't a square. The converse flips the arrow and, as warned, carries no guarantee.

Contrapositive ( $\neg Q \to \neg P$ ): "If a quadrilateral does not have four right angles, then it is not a square." This is true — and it must be, because the contrapositive is logically equivalent to the (true) original. Negate both parts, flip the order, done.

The lesson in one frame: same original, two transformations, opposite fates. Converse can flip truth value; contrapositive never can.

Worked example 3 — the trap: dissecting an English claim like a specimen▸

Rewrite "Every multiple of $6$ is a multiple of $3$ " using explicit quantifier-and-implication notation, then state its converse in English and say whether the converse is true.

"Every $A$ is a $B$ " unpacks to "for all $x$ , if $x$ is an $A$ , then $x$ is a $B$ ." So:

$\text{for all integers } n,\quad (6 \mid n) \to (3 \mid n).$

There's the hidden $\forall$ and the hidden $\to$ the lesson promised. (And the original is true: if $6$ divides $n$ then $n = 6k = 3(2k)$ , so $3$ divides $n$ .)

The converse swaps hypothesis and conclusion: "for all integers $n$ , if $3 \mid n$ then $6 \mid n$ " — in English, "every multiple of $3$ is a multiple of $6$ ."

Is the converse true? No. Take $n = 3$ : it's a multiple of $3$ but not of $6$ . One counterexample is enough to kill a "for all" claim. So the original is true while its converse is false — exactly the asymmetry that makes confusing them so dangerous.

☠ KNOWN HAZARDS

Affirming the converse. From " $P \to Q$ " and " $Q$ is true", you may NOT conclude $P$ . $Q \to P$ is a separate claim. This error is behind most bad real-world arguments, and it drives me to the reactor on a daily basis.
Panicking at vacuous truth. When $P$ is false, $P \to Q$ is true — always, automatically. It's not a loophole, it's the definition. Statements about empty collections are vacuously true.
Confusing contrapositive with converse. Contrapositive negates and flips ( $\neg Q \to \neg P$ , equivalent); converse only flips ( $Q \to P$ , NOT equivalent). One is your twin, one is a stranger.
Proving only one direction of an "iff". $P \leftrightarrow Q$ demands both $P \to Q$ and $Q \to P$ . Prove one and you've proven half a theorem — which earns you no credit and a glare from me.

TL;DR

▸
$P \to Q$ is a promise, false only in the single row $P$ true, $Q$ false. Equivalently $P \to Q \equiv \neg P \lor Q$ .
▸
Vacuous truth: when the hypothesis $P$ is false, $P \to Q$ is automatically true — an unfired promise can't be broken.
▸
The converse $Q \to P$ is a different statement; the truth of $P \to Q$ says nothing about it. This confusion is the most common reasoning error there is.
▸
The contrapositive $\neg Q \to \neg P$ is logically equivalent to $P \to Q$ — same table, prove it by hand.
▸
$P \leftrightarrow Q$ ("iff") means both directions hold; it's true exactly when $P, Q$ share a truth value. Every "every $A$ is a $B$ " hides a $\forall$ and a $\to$ .

unlocks

Quantifiers →