Implication and Equivalence

Identify the antecedent and consequent

In $p\Rightarrow q$, p is the antecedent and q is the consequent. The implication rules out the case in which p is true but q is false. It does not assert p, and it does not say that q is true only when p is true.

For integers n, “if n is divisible by 4, then n is even” is a universal conditional claim. To verify it, write $n=4k$ for some integer k. Then $n=2(2k)$, and $2k$ is an integer, so n is even.

The example n=8 illustrates the implication. The arbitrary-integer argument proves it. The integer 6 does not refute it because its antecedent, divisibility by 4, is false.

Converse, inverse and contrapositive

Three related statements are easy to confuse with the original.

The original and contrapositive are logically equivalent. The converse and inverse are equivalent to each other, but generally not to the original. In the example, n=6 refutes both the converse and inverse. The original and contrapositive remain true.

Calling a statement the “inverse” of an implication is a logic convention; it is not the same topic as an Inverse Function.

Necessary and sufficient conditions

When $p\Rightarrow q$, p is sufficient for q, and q is necessary for p. Divisibility by 4 is sufficient to establish evenness. Evenness is necessary for divisibility by 4, but does not establish it by itself.

“p only if q” means $p\Rightarrow q$. “p if q” means $q\Rightarrow p$. Reading these as separate sentences helps:

• “n is divisible by 4 only if n is even” puts divisibility by 4 first.
• “n is even if n is divisible by 4” expresses the same implication with the clauses reversed in English.

For a real equation, a condition such as $x\ne0$ may be necessary for a division step to be legal. Stating that condition does not solve the equation; it identifies where a proposed operation is permitted.

Negate the implication, not just its conclusion

The negation of $p\Rightarrow q$ is $p\land\neg q$. To refute a universal conditional, find a permitted case satisfying the hypothesis and violating the conclusion.

For example, the claim “if an integer is even, then it is divisible by 4” is refuted by n=6: evenness holds and divisibility by 4 fails. An odd integer would not test the relevant condition.

By contrast, $p\Rightarrow\neg q$ is not the negation of the original implication. It is another implication that remains true whenever p is false. Correct negation is essential in Proof by Contradiction.

A biconditional requires both directions

Write $p\Leftrightarrow q$ for “p if and only if q”. Its content is the pair of implications

For integers, “n is odd if and only if $n^2$ is odd” is true. The forward direction follows by writing $n=2k+1$ and expanding:

This has the form of an odd integer. For the reverse direction, use the contrapositive: if n is even, write $n=2k$. Then $n^2=2(2k^2)$ is even. Therefore an odd square cannot come from an even integer, and every integer is either even or odd.

The two directions use different arguments. Combining them establishes the equivalence; proving only the expansion would not have been enough.

Equivalent equations preserve all and only the solutions

For real x, subtracting the same number from both sides or multiplying both sides by a non-zero constant produces an equivalent equation. Squaring both sides gives a forward implication, but may not preserve the reverse direction.

For instance,

but $x^2=9$ also allows $x=-3$. The equivalence is

On the restricted domain $x\ge0$, the simpler equivalence $x^2=9\Leftrightarrow x=3$ is valid. The extra domain condition is doing mathematical work. It must not disappear midway through a derivation.

Another useful equivalence is the zero-product property for real numbers: $ab=0$ is equivalent to $a=0$ or $b=0$. It does not justify declaring a factor zero when the product is some other number.

Chains of implications and conditional conclusions

If $p\Rightarrow q$ and $q\Rightarrow r$, then $p\Rightarrow r$. For example, divisibility by 12 implies divisibility by 4, which implies evenness. That chain proves the forward conclusion, not its converse.

A conclusion can be conditionally established without establishing its assumption. Proving “if this figure is a square, then its diagonals have equal length” does not prove that the figure is a square. In applications, identify which hypotheses have actually been given or verified.

The distinction also separates logical sufficiency from causal explanation. A theorem about number properties describes necessary relationships. It is not claiming that one number property physically causes another.

Related topics

Use Mathematical Proof to turn these logical structures into complete arguments. Direct Proof develops forward reasoning, while Proof by Contradiction and Mathematical Induction address other proof structures.