Contraposition is a logical transformation that takes an implication “if , then ” to “if not , then not .” The resulting statement is called the contrapositive. In classical logic, an implication and its contrapositive are logically equivalent:
This equivalence underlies proof by contraposition, a standard method of mathematical proof. Its unrestricted use depends on the underlying logic: in intuitionistic logic, the original implication entails its contrapositive, but the reverse direction is not generally valid.
Logical form and meaning
For an implication , the proposition is the antecedent and is the consequent. Contraposition performs two operations together:
- It reverses the order of the antecedent and consequent.
- It negates both.
For example:
If an integer is divisible by , then it is even.
Its contrapositive is:
If an integer is not even, then it is not divisible by .
These statements exclude exactly the same possibility: an integer that is divisible by but not even. More generally, both and exclude the case in which is true and is false.
In classical propositional logic, the arrow is ordinarily interpreted as material implication. The equivalence can be checked by a truth table:
| True | True | True | True |
| True | False | False | False |
| False | True | True | True |
| False | False | True | True |
It can also be derived algebraically:
Here denotes logical equivalence. The last step uses the classical equivalence between and .
Contrapositive, converse, and inverse
Several transformations of an implication have similar names but different logical properties.
| Statement | Form |
|---|---|
| Original implication | |
| Converse | |
| Inverse | |
| Contrapositive |
Classically, the original implication is equivalent to its contrapositive, while the converse is equivalent to the inverse. The original implication does not, in general, imply either its converse or its inverse.
For example, “if an integer is divisible by , then it is even” is true. Its converse, “if an integer is even, then it is divisible by ,” is false, as the integer shows. Its inverse, “if an integer is not divisible by , then it is not even,” is also false.
The distinction can be expressed through necessary and sufficient conditions. Saying makes sufficient for , and necessary for . Contraposition states that failure of the necessary condition rules out the sufficient condition.
Proof by contraposition
To prove by contraposition, one proves . In classical mathematics, their equivalence establishes the desired implication.
For example, consider the statement:
For every integer , if is even, then is even.
Its contrapositive is:
If is odd, then is odd.
If is odd, there is an integer such that . Consequently,
so is odd. The contrapositive is proved, and therefore so is the original statement. The familiar dichotomy between even and odd integers justifies the wording of the negations in this example.
Contraposition is especially useful when the negation of the conclusion supplies a concrete form, witness, or useful restriction that is difficult to obtain from the original hypothesis.
Relation to proof by contradiction
Contraposition and proof by contradiction are closely related but are not identical proof structures.
- A proof by contraposition establishes , typically by assuming and deriving .
- A proof by contradiction of may assume both and , then derive a contradiction.
A proof of the contrapositive can itself use contradiction: under the assumption , an additional assumption may yield an impossibility, establishing . Thus the methods can overlap rather than forming mutually exclusive categories.
Relation to modus tollens
Modus tollens is the rule of inference
The symbol indicates derivability from the premises.
Contraposition transforms one conditional into another; modus tollens draws a conclusion from a conditional together with the negation of its consequent. In a system permitting contraposition, modus tollens can be presented as first obtaining , then applying modus ponens to .
In natural deduction, modus tollens also has a direct derivation: assume ; the premise gives , contradicting . Discharging the assumption establishes .
Quantified statements and compound conditions
In first-order logic, contraposition applies to implications within quantified formulas. For example,
is classically equivalent to
The domain of quantification and any background assumptions remain unchanged.
For compound antecedents and consequents, the whole expression must be negated before simplifying. For instance, the contrapositive of
is
which, by classical De Morgan’s laws, is equivalent to
It is not generally equivalent to .
Likewise, when quantified expressions are negated, the quantifiers must be handled correctly. Classically,
These transformations can make the contrapositive substantially different in form from the original statement.
Constructive validity and limitations
In intuitionistic logic, the implication
is valid. Given and , any assumption of produces a contradiction, proving .
The reverse implication,
is not generally intuitionistically valid. From and , one can derive , but obtaining requires double-negation elimination or some additional property of . Consequently, proving a contrapositive does not automatically establish the original implication constructively. It does suffice when is stable, meaning that is available.
Contraposition also requires care outside formal deductive settings. Ordinary-language conditionals may express causation, temporal order, hypothetical dependence, or exceptions rather than material implication. In particular, a statement such as “if , then usually ” does not license the deduction “if not , then not .” Contraposition preserves a strict logical implication; it does not by itself reverse causal explanations or turn a probabilistic tendency into a deductive guarantee.