Conditional Statements and Implication

Core Idea

A conditional statement 'if P then Q' (written P → Q) is false only when P is true and Q is false. The statement P is the hypothesis (antecedent) and Q is the conclusion (consequent). Conditionals are the most common form of mathematical claim and the basis for logical deduction.

How It's Best Learned

Work through examples showing when conditionals are true and false, including the counterintuitive case of a false hypothesis making the statement true. Connect to real mathematical examples.

Common Misconceptions

• Thinking P → Q means P and Q are equivalent.
• Confusing the direction (P → Q vs. Q → P).
• Being surprised that a false statement implies anything (vacuous truth).

Explainer

You already know the basic logical connectives — AND (P ∧ Q), OR (P ∨ Q), NOT (¬P) — and how to evaluate them using truth tables. The conditional P → Q ("if P, then Q") is the most important logical form in mathematics, because virtually every theorem is a conditional: "if a function is differentiable, then it is continuous," "if n is even, then n² is even." Mastering implication means mastering the logical skeleton of proofs.

The truth table for P → Q has one counterintuitive row. When P is true and Q is true, the conditional is true (the claim holds). When P is true and Q is false, the conditional is false — this is the only way a conditional can fail. But when P is false, P → Q is true *regardless of Q*. The intuition: think of P → Q as a promise — "if it rains, I'll carry an umbrella." This promise is only broken if it rains and you don't have an umbrella. If it doesn't rain, the promise was never tested, so you can't be accused of breaking it, whether you have an umbrella or not.

The case where P is false making P → Q true is called vacuous truth. "If 2 + 2 = 5, then the moon is made of cheese" is a logically true statement — because the hypothesis is false, the conditional is never violated. This seems odd but is consistent and necessary. It means that from a false premise, you can derive any conclusion by implication. In practice, vacuous truths arise constantly in proofs: "for all n in the empty set, P(n) holds" is vacuously true because there are no n to check.

Direction is everything: P → Q and Q → P are completely different statements and have no logical dependency on each other. "If it is a square, then it is a rectangle" is true; the converse "if it is a rectangle, then it is a square" is false. Confusing a conditional with its converse is one of the most common logical errors in mathematical reasoning. The conditional P → Q, its converse Q → P, its inverse ¬P → ¬Q, and its contrapositive ¬Q → ¬P are four distinct statements — and only the conditional and its contrapositive are logically equivalent. That equivalence (P → Q is the same as ¬Q → ¬P) is the basis for proof by contrapositive, which you'll use extensively.