Conditional Statement
Calculus & Advanced MathA conditional statement is an "if-then" statement of the form "If P, then Q," which asserts that P being true forces Q to be true.
Formula
P \to Q \text{ (if P then Q)}
Definition
A conditional statement has the form "If $P$, then $Q$." $P$ is the hypothesis (the "if" part) and $Q$ is the conclusion (the "then" part). The statement claims that whenever $P$ is true, $Q$ must also be true.
Example
"If it is raining, then the ground is wet." $P$ = "it is raining," $Q$ = "the ground is wet." When it rains, the ground is guaranteed to be wet.
Key Insight
A conditional statement can be false only one way: if $P$ is true but $Q$ is false. If $P$ is false, the statement is considered true regardless of $Q$.
Definition
$P \to Q$ is false only when $P$ is true and $Q$ is false (falsifying case). Truth table: TT = T, TF = F, FT = T, FF = T. In mathematics, theorems are often stated as conditionals: "If $f$ is differentiable, then $f$ is continuous."
Example
"If $n$ is divisible by $4$, then $n$ is divisible by $2$." True for all integers. The hypothesis (div by $4$) is stronger; the conclusion (div by $2$) is weaker. Implication flows from stronger to weaker conditions.
Key Insight
The vacuous truth ($F \to Q$ is always true) can be counterintuitive but is logically necessary for consistency. "If pigs fly, then $2+2=5$" is a true conditional, vacuously.
Definition
In propositional logic, $P \to Q$ is equivalent to $\neg P \vee Q$. In predicate logic, universal statements $\forall x\, P(x) \to Q(x)$ are the standard form of mathematical theorems. The material conditional captures implication in classical logic but not in modal or intuitionistic logics, where "if $P$ then $Q$" has stronger meanings.
Example
In intuitionistic logic (constructive math), $P \to Q$ requires a constructive proof that converts any proof of $P$ into a proof of $Q$. This differs from classical logic where truth-table definitions suffice.
Key Insight
The choice of conditional semantics (classical vs. intuitionistic vs. modal) fundamentally affects what theorems are provable, linking logic to the foundations of mathematics and computer science (type theory).