A conditional statement has the form "If P, then Q" (written P → Q), where P is called the hypothesis (or antecedent) and Q is called the conclusion (or consequent). This is the most important connective in logic and mathematics. The statement P → Q claims that whenever P is true, Q must also be true. It makes no claim about what happens when P is false — if the hypothesis does not hold, the conditional is automatically true regardless of Q. This "vacuous truth" is counterintuitive at first but essential for logical consistency.
Start from the informal if-then reasoning students already know from patterns-and-logic. Formalize it: label the hypothesis and conclusion with variables. Emphasize the one case where a conditional is false: P is true but Q is false. Work through "If a number is divisible by 10, then it is divisible by 5" and identify the hypothesis and conclusion. Introduce the arrow notation P → Q. Then confront vacuous truth directly: "If pigs can fly, then 2 + 2 = 5" — is this true or false? Discuss until the logic clicks.
You have already practiced if-then thinking informally: "If it is a weekend, then there is no school" is a rule you can evaluate and apply. Now you are going to formalize this into the precise language of logic, where "If P, then Q" becomes a mathematical object with exact rules for when it is true and when it is false.
A conditional statement P → Q has two parts. The hypothesis P is the condition — the "if" part. The conclusion Q is what follows — the "then" part. The conditional claims that whenever P is true, Q is also true. In "If a number ends in 0, then it is divisible by 5," the hypothesis is "the number ends in 0" and the conclusion is "it is divisible by 5." Every number ending in 0 is indeed divisible by 5, so the conditional is true.
The truth rule for conditionals has one surprising case. P → Q is false in exactly one situation: when P is true and Q is false. If the hypothesis holds but the conclusion fails, the conditional is broken. In all other cases — P true and Q true, P false and Q true, P false and Q false — the conditional is true. The first two make intuitive sense, but "P false, so P → Q is true" feels wrong at first. This is called vacuous truth.
The best way to understand vacuous truth is the promise analogy. Suppose your teacher says, "If you score 100% on the test, I will give you extra credit." On a day when you score 85%, has the teacher broken the promise? No — the condition was never met, so the promise was never activated. It is not a lie; it is simply irrelevant. Logic works the same way: when the hypothesis is false, the conditional has nothing to prove and is therefore true by default.
This convention is not arbitrary — it is the only consistent choice. If we said P → Q is false when P is false, then the statement "If n is divisible by 4, then n is divisible by 2" would be false for n = 3 (since 3 is not divisible by 4), even though the statement is clearly expressing a true mathematical relationship. Vacuous truth keeps conditionals aligned with our mathematical intuition: a general rule is true unless we find a counterexample (a case where the hypothesis holds but the conclusion fails).
The arrow notation P → Q will appear constantly from now on. Every mathematical theorem, every logical rule, and every proof strategy involves conditionals. When you later learn about converses, contrapositives, and biconditionals, you will be manipulating the parts of conditional statements in precise ways — and all of it builds on the foundation you are establishing here.