A conditional P → Q is vacuously true when the hypothesis P is false (the conclusion Q is never reached). A proof is trivial when it follows immediately from definitions or previous results without new reasoning. Both are valid proof strategies, especially for edge cases or boundary conditions.
Recognize vacuous truth in conditionals and understand that it is logically sound. Identify when a claim is trivial because it follows immediately from definitions.
From your study of conditional statements, you know that the implication P → Q is false in exactly one case: when P is true and Q is false. In all other cases — including when P is false — the implication is true. Vacuous truth is simply what happens when P is false: no matter what Q says, the conditional is true because the "promise" encoded by P → Q was never triggered. A false hypothesis makes the whole implication vacuously true.
A concrete example makes this feel less strange. Consider the statement "Every student in this room who scored above 120 on the exam will receive an A." If no student in the room scored above 120, then the statement is vacuously true — no one satisfies the hypothesis, so no counterexample can arise. It would be wrong to call this statement false; it made no commitment about the actual students in the room. This matters in proofs because universal statements ("for all x, if P(x) then Q(x)") are vacuously true when no x satisfies P(x). For example, "every element of the empty set is a prime number" is vacuously true and logically unproblematic.
Trivial proofs are the symmetric situation: rather than having a false hypothesis, you have a conclusion that is always true regardless of the hypothesis. If Q is a tautology or follows immediately from known results without any casework, the proof is called trivial. For example, proving "if n is odd, then n² ≥ 0" is trivial because n² ≥ 0 holds for all real numbers — the hypothesis about oddness is irrelevant.
Both vacuous truth and trivial proofs arise naturally at boundary conditions. In proof by induction, the base case is often trivial (the statement holds for n = 0 by definition or convention). When proving something about a set S, the case S = ∅ is handled by vacuous truth (no element of ∅ violates any property). When cases are exhausted, a trivially true final case closes the proof. The deeper lesson is that mathematical logic is precise about "nothing": a claim about an empty collection is not meaningless, it is vacuously true, and ignoring these edge cases in universal statements is a source of hidden errors in proofs.