Conditional Statements

The Big Idea

A large part of mathematics has the form “when this is true, that must follow.” Definitions classify objects by conditions. Theorems connect hypotheses to conclusions. Algorithms perform an action when a test succeeds. Proofs explain why the promised consequence cannot fail.

A conditional statement expresses this structure:

\[ \text{If }p,\text{ then }q. \]

Symbolically, we write \(p\to q\). The conditional does not claim that \(p\) is true. It claims that any case in which \(p\) is true must also be a case in which \(q\) is true.

The Anatomy of a Conditional

Consider the statement:

\[ \text{If an integer is divisible by }4,\text{ then it is even.} \]

If \(p\) names the hypothesis and \(q\) names the conclusion, the complete statement is \(p\to q\). The arrow is commonly read “implies.”

Think of a Conditional as a Promise

The statement \(p\to q\) makes one promise: whenever \(p\) occurs, \(q\) occurs too. The only way to break that promise is to find a case where \(p\) is true and \(q\) is false.

This truth rule can feel unusual because everyday “if” statements often suggest time, cause, or expectation. Formal logic isolates the truth structure: \(p\to q\) is false exactly when \(p\land\neg q\) is true.

Testing a Mathematical Conditional

Consider:

\[ \text{If }n\text{ is divisible by }6,\text{ then }n\text{ is divisible by }3. \]

Any integer divisible by \(6\) can be written \(n=6k\) for some integer \(k\). Since

\[ n=6k=3(2k), \]

the integer \(n\) is also divisible by \(3\). The hypothesis guarantees the conclusion, so the conditional is true.

Now compare:

\[ \text{If }n\text{ is divisible by }3,\text{ then }n\text{ is divisible by }6. \]

This statement is false. The integer \(9\) satisfies the hypothesis because it is divisible by \(3\), but it does not satisfy the conclusion because it is not divisible by \(6\). The value \(9\) is a counterexample.

Many Conditionals Hide a Universal Claim

Mathematical conditionals often describe every object in a domain, even when the word “every” is not written. The statement

\[ \text{If an integer }n\text{ is divisible by }4,\text{ then }n\text{ is even} \]

means

\[ \forall n\in\mathbb{Z},\quad 4\mid n\to 2\mid n. \]

It claims that the implication holds for every integer. To prove it, we must reason about an arbitrary integer satisfying the hypothesis. To disprove it, one allowed integer with a true hypothesis and false conclusion would be enough.

Counterexamples Target the Broken-Promise Case

A counterexample to \(p\to q\) must satisfy both \(p\) and \(\neg q\). An example that fails the hypothesis tells us nothing about whether the conditional is true.

Suppose the claim is:

\[ \text{If }n^2\gt25,\text{ then }n\gt5,\qquad n\in\mathbb{R}. \]

The value \(n=-6\) is a counterexample because \((-6)^2=36\gt25\), so the hypothesis is true, while \(-6\gt5\) is false.

The value \(n=2\) is not a counterexample. It makes the conclusion false, but it also makes the hypothesis false. The conditional never promised anything about that case.

When the Hypothesis Is False

A conditional is true whenever its hypothesis is false. This is called vacuous truth. The name does not mean that the statement is meaningless; it means no case has met the condition and violated the conclusion.

For example, the statement “If an integer is both even and odd, then its square is negative” is true over the ordinary integers because no integer satisfies the hypothesis. There is no counterexample of the required form.

Vacuous truth is useful in definitions, set theory, and proof. If a set contains no objects satisfying a given hypothesis, then every statement of the form “all such objects also satisfy \(q\)” is automatically true. Still, in explanatory writing, it is often worth noting that the hypothesis has no cases so the reader is not misled.

One Conditional, Several Wordings

The same logical direction can appear in many grammatical forms. Each sentence below expresses \(p\to q\):

The words may move around, but the logical arrow does not. Identify the condition that triggers the promise and the consequence that must follow.

“If” and “Only If” Point Differently

These two phrases are easy to confuse:

• “\(p\) if \(q\)” means \(q\to p\).
• “\(p\) only if \(q\)” means \(p\to q\).

For example, “An integer is even if it is divisible by \(4\)” means

\[ \text{divisible by }4\to\text{even}. \]

“An integer is divisible by \(4\) only if it is even” expresses the same direction. In both sentences, divisibility by \(4\) guarantees evenness.

A practical shortcut is to read “only if \(q\)” as “requires \(q\).” If \(p\) requires \(q\), then \(p\to q\).

Necessary and Sufficient Conditions

In \(p\to q\), the hypothesis \(p\) is sufficient for \(q\), while the conclusion \(q\) is necessary for \(p\).

• Sufficient means enough to guarantee the result.
• Necessary means required, though it may not be enough by itself.

Being divisible by \(4\) is sufficient for being even. Being even is necessary for being divisible by \(4\). But being even is not sufficient for divisibility by \(4\), because \(6\) is even and not divisible by \(4\).

A condition can be necessary, sufficient, both, or neither. When \(p\) is both necessary and sufficient for \(q\), we have the biconditional \(p\leftrightarrow q\).

Converse, Inverse, and Contrapositive

Starting from \(p\to q\), we can reverse or negate its components to form three related conditionals.

For “If an integer is divisible by \(4\), then it is even”:

• Converse: If an integer is even, then it is divisible by \(4\).
• Inverse: If an integer is not divisible by \(4\), then it is not even.
• Contrapositive: If an integer is not even, then it is not divisible by \(4\).

The original and contrapositive are true. The converse and inverse are false; \(6\) is a counterexample to both.

Which Related Forms Are Equivalent?

A conditional is logically equivalent to its contrapositive:

\[ p\to q\ \equiv\ \neg q\to\neg p. \]

They have the same truth value under every assignment of \(p\) and \(q\). This is why proving the contrapositive proves the original conditional.

The converse and inverse are also equivalent to each other:

\[ q\to p\ \equiv\ \neg p\to\neg q. \]

But neither is automatically equivalent to the original. Reversing a true statement can produce a false one.

Two Reliable Reasoning Patterns

Conditional statements support two fundamental valid argument forms.

Modus Ponens

\[ p\to q,\qquad p \qquad\therefore\qquad q. \]

If divisibility by \(4\) guarantees evenness and \(20\) is divisible by \(4\), then \(20\) is even.

Modus Tollens

\[ p\to q,\qquad \neg q \qquad\therefore\qquad \neg p. \]

If divisibility by \(4\) guarantees evenness and \(15\) is not even, then \(15\) is not divisible by \(4\). This form applies the contrapositive.

Two Tempting but Invalid Reversals

The following patterns do not follow from \(p\to q\).

Affirming the Consequent

\[ p\to q,\qquad q \qquad\therefore\qquad p. \]

From “If an integer is divisible by \(4\), then it is even” and “\(6\) is even,” we cannot conclude that \(6\) is divisible by \(4\). The conclusion treats the converse as if it were guaranteed.

Denying the Antecedent

\[ p\to q,\qquad \neg p \qquad\therefore\qquad \neg q. \]

From “If an integer is divisible by \(4\), then it is even” and “\(6\) is not divisible by \(4\),” we cannot conclude that \(6\) is not even. The conclusion treats the inverse as if it were guaranteed.

When Both Directions Are True

If both \(p\to q\) and \(q\to p\) are true, the two conditions are equivalent:

\[ (p\to q)\land(q\to p) \quad\equiv\quad p\leftrightarrow q. \]

This is read “\(p\) if and only if \(q\).” For example, an integer is even if and only if it is divisible by \(2\). Either condition guarantees the other.

To prove a biconditional, it is often clearest to prove the two directions separately:

1. Assume \(p\) and prove \(q\).
2. Assume \(q\) and prove \(p\).

Implication Is Not Necessarily Causation

A conditional describes a logical relationship, not always a physical cause. “If an integer is divisible by \(4\), then it is even” does not mean divisibility by \(4\) causes evenness in time. The properties are related by their definitions.

In applied settings, an observed association may support a useful conditional prediction without proving causation. Logic can determine whether a conclusion follows from stated premises, but scientific evidence is needed to decide whether one event actually causes another.

Keeping implication and causation separate prevents a common reasoning error: assuming that because two facts regularly occur together, one must produce the other.

Where Conditional Statements Appear

• Theorems: hypotheses specify when a conclusion is guaranteed.
• Definitions: paired conditionals establish necessary and sufficient conditions.
• Algorithms: if–then rules determine which instruction runs next.
• Functions: piecewise definitions choose formulas according to conditions.
• Probability: conditional probability restricts attention to cases where an event has occurred.
• Geometry: properties of shapes are organized into implication chains.
• Policies and contracts: consequences take effect when stated requirements are met.

Learning to separate the condition from the consequence makes each of these structures easier to read, test, and use.

A Conditional-Checking Routine

1. Identify the domain. Which objects or situations are allowed?
2. Find the hypothesis. What condition activates the claim?
3. Find the conclusion. What does the statement promise?
4. Rewrite it as \(p\to q\). This exposes the direction.
5. Check “if” and “only if.” Do not let the grammar reverse the arrow.
6. Search for the failure pattern \(p\land\neg q\).
7. Decide what is needed. A proof must cover every allowed case; a counterexample needs only one.
8. Do not assume the converse. Reverse implications require their own justification.
9. Distinguish implication from cause. Ask what kind of relationship is actually being claimed.

This routine turns a complicated sentence into a manageable structure: condition, consequence, and the one pattern that could make the statement fail.

Common Confusions

Working Summary

A conditional statement \(p\to q\) promises that every true \(p\)-case is also a true \(q\)-case. The hypothesis \(p\) is sufficient for \(q\), and the conclusion \(q\) is necessary for \(p\). The conditional fails only when \(p\) is true and \(q\) is false.

The original conditional is equivalent to its contrapositive, while its converse is equivalent to its inverse. Counterexamples expose broken promises, valid argument forms apply the implication in the correct direction, and biconditionals arise when both directions have been established.

Check Your Understanding