Contraposition

Short description: Mathematical logic concept

For contraposition in the field of traditional logic, see Contraposition (traditional logic). For contraposition in the field of symbolic logic, see Transposition (logic).

In logic and mathematics, contraposition refers to the inference of going from a conditional statement into its logically equivalent contrapositive, and an associated proof method known as proof by contraposition. The contrapositive of a statement has its antecedent and consequent inverted and flipped.

Conditional statement [math]\displaystyle{ P \rightarrow Q }[/math]. In formulas: the contrapositive of [math]\displaystyle{ P \rightarrow Q }[/math] is [math]\displaystyle{ \neg Q \rightarrow \neg P }[/math].

If P, Then Q. — If not Q, Then not P. "If it is raining, then I wear my coat" — "If I don't wear my coat, then it isn't raining."

The law of contraposition says that a conditional statement is true if, and only if, its contrapositive is true.

The contrapositive ([math]\displaystyle{ \neg Q \rightarrow \neg P }[/math]) can be compared with three other statements:

Inversion (the inverse), [math]\displaystyle{ \neg P \rightarrow \neg Q }[/math]

"If it is not raining, then I don't wear my coat." Unlike the contrapositive, the inverse's truth value is not at all dependent on whether or not the original proposition was true, as evidenced here.

Conversion (the converse), [math]\displaystyle{ Q \rightarrow P }[/math]

"If I wear my coat, then it is raining." The converse is actually the contrapositive of the inverse, and so always has the same truth value as the inverse (which as stated earlier does not always share the same truth value as that of the original proposition).

Negation (the logical complement), [math]\displaystyle{ \neg (P \rightarrow Q) }[/math]

"It is not the case that if it is raining then I wear my coat.", or equivalently, "Sometimes, when it is raining, I don't wear my coat. " If the negation is true, then the original proposition (and by extension the contrapositive) is false.

Note that if [math]\displaystyle{ P \rightarrow Q }[/math] is true and one is given that [math]\displaystyle{ Q }[/math] is false (i.e., [math]\displaystyle{ \neg Q }[/math]), then it can logically be concluded that [math]\displaystyle{ P }[/math] must be also false (i.e., [math]\displaystyle{ \neg P }[/math]). This is often called the law of contrapositive, or the modus tollens rule of inference.

Intuitive explanation

In the Euler diagram shown, if something is in A, it must be in B as well. So we can interpret "all of A is in B" as:

[math]\displaystyle{ A \to B }[/math]

It is also clear that anything that is not within B (the blue region) cannot be within A, either. This statement, which can be expressed as:

[math]\displaystyle{ \neg B \to \neg A }[/math]

is the contrapositive of the above statement. Therefore, one can say that

[math]\displaystyle{ (A \to B) \leftrightarrow (\neg B \to \neg A) }[/math].

In practice, this equivalence can be used to make proving a statement easier. For example, if one wishes to prove that every girl in the United States (A) has brown hair (B), one can either try to directly prove [math]\displaystyle{ A \to B }[/math] by checking that all girls in the United States do indeed have brown hair, or try to prove [math]\displaystyle{ \neg B \to \neg A }[/math] by checking that all girls without brown hair are indeed all outside the US. In particular, if one were to find at least one girl without brown hair within the US, then one would have disproved [math]\displaystyle{ \neg B \to \neg A }[/math], and equivalently [math]\displaystyle{ A \to B }[/math].

In general, for any statement where A implies B, not B always implies not A. As a result, proving or disproving either one of these statements automatically proves or disproves the other, as they are logically equivalent to each other.

Formal definition

A proposition Q is implicated by a proposition P when the following relationship holds:

[math]\displaystyle{ (P \to Q) }[/math]

This states that, "if [math]\displaystyle{ P }[/math], then [math]\displaystyle{ Q }[/math]", or, "if Socrates is a man, then Socrates is human." In a conditional such as this, [math]\displaystyle{ P }[/math] is the antecedent, and [math]\displaystyle{ Q }[/math] is the consequent. One statement is the contrapositive of the other only when its antecedent is the negated consequent of the other, and vice versa. Thus a contrapositive generally takes the form of:

[math]\displaystyle{ (\neg Q \to \neg P) }[/math].

That is, "If not-[math]\displaystyle{ Q }[/math], then not-[math]\displaystyle{ P }[/math]", or, more clearly, "If [math]\displaystyle{ Q }[/math] is not the case, then P is not the case." Using our example, this is rendered as "If Socrates is not human, then Socrates is not a man." This statement is said to be contraposed to the original and is logically equivalent to it. Due to their logical equivalence, stating one effectively states the other; when one is true, the other is also true, and when one is false, the other is also false.

Strictly speaking, a contraposition can only exist in two simple conditionals. However, a contraposition may also exist in two complex, universal conditionals, if they are similar. Thus, [math]\displaystyle{ \forall{x}(P{x} \to Q{x}) }[/math], or "All [math]\displaystyle{ P }[/math]s are [math]\displaystyle{ Q }[/math]s," is contraposed to [math]\displaystyle{ \forall{x}(\neg Q{x} \to \neg P{x}) }[/math], or "All non-[math]\displaystyle{ Q }[/math]s are non-[math]\displaystyle{ P }[/math]s."

Simple proof by definition of a conditional

In first-order logic, the conditional is defined as:

[math]\displaystyle{ A \to B \, \leftrightarrow \, \neg A \lor B }[/math]

which can be made equivalent to its contrapositive, as follows:

[math]\displaystyle{ \begin{align} \neg A \lor B \,& \, \leftrightarrow B \lor \neg A \\ \, & \, \leftrightarrow \neg B \to \neg A \end{align} }[/math]

Simple proof by contradiction

Let:

[math]\displaystyle{ (A \to B)\land \neg B }[/math]

It is given that, if A is true, then B is true, and it is also given that B is not true. We can then show that A must not be true by contradiction. For if A were true, then B would have to also be true (by Modus Ponens). However, it is given that B is not true, so we have a contradiction. Therefore, A is not true (assuming that we are dealing with bivalent statements that are either true or false):

[math]\displaystyle{ (A \to B) \to (\neg B \to \neg A) }[/math]

We can apply the same process the other way round, starting with the assumptions that:

[math]\displaystyle{ (\neg B \to \neg A)\land A }[/math]

Here, we also know that B is either true or not true. If B is not true, then A is also not true. However, it is given that A is true, so the assumption that B is not true leads to a contradiction, which means that it is not the case that B is not true. Therefore, B must be true:

[math]\displaystyle{ (\neg B \to \neg A) \to (A \to B) }[/math]

Combining the two proved statements together, we obtain the sought-after logical equivalence between a conditional and its contrapositive:

[math]\displaystyle{ (A \to B) \equiv (\neg B \to \neg A) }[/math]

More rigorous proof of the equivalence of contrapositives

Logical equivalence between two propositions means that they are true together or false together. To prove that contrapositives are logically equivalent, we need to understand when material implication is true or false.

[math]\displaystyle{ P \to Q }[/math]

This is only false when [math]\displaystyle{ P }[/math] is true and [math]\displaystyle{ Q }[/math] is false. Therefore, we can reduce this proposition to the statement "False when [math]\displaystyle{ P }[/math] and not-[math]\displaystyle{ Q }[/math]" (i.e. "True when it is not the case that [math]\displaystyle{ P }[/math] and not-[math]\displaystyle{ Q }[/math]"):

[math]\displaystyle{ \neg(P \land \neg Q) }[/math]

The elements of a conjunction can be reversed with no effect (by commutativity):

[math]\displaystyle{ \neg(\neg Q \land P) }[/math]

We define [math]\displaystyle{ R }[/math] as equal to "[math]\displaystyle{ \neg Q }[/math]", and [math]\displaystyle{ S }[/math] as equal to [math]\displaystyle{ \neg P }[/math] (from this, [math]\displaystyle{ \neg S }[/math] is equal to [math]\displaystyle{ \neg\neg P }[/math], which is equal to just [math]\displaystyle{ P }[/math]):

[math]\displaystyle{ \neg(R \land \neg S) }[/math]

This reads "It is not the case that (R is true and S is false)", which is the definition of a material conditional. We can then make this substitution:

[math]\displaystyle{ R \to S }[/math]

By reverting R and S back into [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math], we then obtain the desired contrapositive:

[math]\displaystyle{ \neg Q \to \neg P }[/math]

Comparisons

name	form	description
implication	if P then Q	first statement implies truth of second
inverse	if not P then not Q	negation of both statements
converse	if Q then P	reversal of both statements
contrapositive	if not Q then not P	reversal and negation of both statements
negation	P and not Q	contradicts the implication

Examples

Take the statement "All red objects have color." This can be equivalently expressed as "If an object is red, then it has color."

• The contrapositive is "If an object does not have color, then it is not red." This follows logically from our initial statement and, like it, it is evidently true.
• The inverse is "If an object is not red, then it does not have color." An object which is blue is not red, and still has color. Therefore, in this case the inverse is false.
• The converse is "If an object has color, then it is red." Objects can have other colors, so the converse of our statement is false.
• The negation is "There exists a red object that does not have color." This statement is false because the initial statement which it negates is true.

In other words, the contrapositive is logically equivalent to a given conditional statement, though not sufficient for a biconditional.

Similarly, take the statement "All quadrilaterals have four sides," or equivalently expressed "If a polygon is a quadrilateral, then it has four sides."

• The contrapositive is "If a polygon does not have four sides, then it is not a quadrilateral." This follows logically, and as a rule, contrapositives share the truth value of their conditional.
• The inverse is "If a polygon is not a quadrilateral, then it does not have four sides." In this case, unlike the last example, the inverse of the statement is true.
• The converse is "If a polygon has four sides, then it is a quadrilateral." Again, in this case, unlike the last example, the converse of the statement is true.
• The negation is "There is at least one quadrilateral that does not have four sides." This statement is clearly false.

Since the statement and the converse are both true, it is called a biconditional, and can be expressed as "A polygon is a quadrilateral if, and only if, it has four sides." (The phrase if and only if is sometimes abbreviated as iff.) That is, having four sides is both necessary to be a quadrilateral, and alone sufficient to deem it a quadrilateral.

Truth

• If a statement is true, then its contrapositive is true (and vice versa).
• If a statement is false, then its contrapositive is false (and vice versa).
• If a statement's inverse is true, then its converse is true (and vice versa).
• If a statement's inverse is false, then its converse is false (and vice versa).
• If a statement's negation is false, then the statement is true (and vice versa).
• If a statement (or its contrapositive) and the inverse (or the converse) are both true or both false, then it is known as a logical biconditional.

Application

Because the contrapositive of a statement always has the same truth value (truth or falsity) as the statement itself, it can be a powerful tool for proving mathematical theorems (especially if the truth of the contrapositive is easier to establish than the truth of the statement itself). A proof by contraposition (contrapositive) is a direct proof of the contrapositive of a statement. However, indirect methods such as proof by contradiction can also be used with contraposition, as, for example, in the proof of the irrationality of the square root of 2. By the definition of a rational number, the statement can be made that "If [math]\displaystyle{ \sqrt{2} }[/math] is rational, then it can be expressed as an irreducible fraction". This statement is true because it is a restatement of a definition. The contrapositive of this statement is "If [math]\displaystyle{ \sqrt{2} }[/math] cannot be expressed as an irreducible fraction, then it is not rational". This contrapositive, like the original statement, is also true. Therefore, if it can be proven that [math]\displaystyle{ \sqrt{2} }[/math] cannot be expressed as an irreducible fraction, then it must be the case that [math]\displaystyle{ \sqrt{2} }[/math] is not a rational number. The latter can be proved by contradiction.

The previous example employed the contrapositive of a definition to prove a theorem. One can also prove a theorem by proving the contrapositive of the theorem's statement. To prove that if a positive integer N is a non-square number, its square root is irrational, we can equivalently prove its contrapositive, that if a positive integer N has a square root that is rational, then N is a square number. This can be shown by setting √N equal to the rational expression a/b with a and b being positive integers with no common prime factor, and squaring to obtain N = a²/b² and noting that since N is a positive integer b=1 so that N = a², a square number.

Correspondence to other mathematical frameworks

Intuitionistic logic

In intuitionistic logic, the statement [math]\displaystyle{ P \to Q }[/math] cannot be proven to be equivalent to [math]\displaystyle{ \lnot Q \to \lnot P }[/math]. We can prove that [math]\displaystyle{ P \to Q }[/math] implies [math]\displaystyle{ \lnot Q \to \lnot P }[/math], but the reverse implication, from [math]\displaystyle{ \lnot Q \to \lnot P }[/math] to [math]\displaystyle{ P \to Q }[/math], requires the law of the excluded middle or an equivalent axiom.

Probability calculus

Contraposition represents an instance of Bayes' theorem which in a specific form can be expressed as:

[math]\displaystyle{ \Pr(\lnot P\mid \lnot Q) = \frac{\Pr(\lnot Q \mid \lnot P)\,a(\lnot P)}{\Pr(\lnot Q\mid \lnot P)\,a(\lnot P)+\Pr(\lnot Q\mid P)\,a(P)} }[/math].

In the equation above the conditional probability [math]\displaystyle{ \Pr(\lnot Q\mid P) }[/math] generalizes the logical statement [math]\displaystyle{ P \to \lnot Q }[/math], i.e. in addition to assigning TRUE or FALSE we can also assign any probability to the statement. The term [math]\displaystyle{ a(P) }[/math] denotes the base rate (aka. the prior probability) of [math]\displaystyle{ P }[/math]. Assume that [math]\displaystyle{ \Pr(\lnot Q \mid P) = 1 }[/math] is equivalent to [math]\displaystyle{ P\to \lnot Q }[/math] being TRUE, and that [math]\displaystyle{ \Pr(\lnot Q \mid P) = 0 }[/math] is equivalent to [math]\displaystyle{ P \to \lnot Q }[/math] being FALSE. It is then easy to see that [math]\displaystyle{ \Pr(\lnot P \mid \lnot Q) = 1 }[/math] when [math]\displaystyle{ \Pr(Q\mid P) = 1 }[/math] i.e. when [math]\displaystyle{ P \to Q }[/math] is TRUE. This is because [math]\displaystyle{ \Pr(\lnot Q\mid P) = 1 - \Pr(Q\mid P) = 0 }[/math] so that the fraction on the right-hand side of the equation above is equal to 1, and hence [math]\displaystyle{ \Pr(\lnot P\mid \lnot Q) = 1 }[/math] which is equivalent to [math]\displaystyle{ \lnot Q \to \lnot P }[/math] being TRUE. Hence, Bayes' theorem represents a generalization of contraposition.

Subjective logic

Contraposition represents an instance of the subjective Bayes' theorem in subjective logic expressed as:

[math]\displaystyle{ (\omega^{A}_{P\tilde{|}Q},\omega^{A}_{P\tilde{|}\lnot Q}) = (\omega^{A}_{Q|P},\omega^{A}_{Q|\lnot P})\,\widetilde{\phi\,}\, a_{P}\, }[/math],

where [math]\displaystyle{ (\omega^{A}_{Q|P},\omega^{A}_{Q|\lnot P}) }[/math] denotes a pair of binomial conditional opinions given by source [math]\displaystyle{ A }[/math]. The parameter [math]\displaystyle{ a_{P} }[/math] denotes the base rate (aka. the prior probability) of [math]\displaystyle{ P }[/math]. The pair of derivative inverted conditional opinions is denoted [math]\displaystyle{ (\omega^{A}_{P\tilde{|}Q},\omega^{A}_{P\tilde{|}\lnot Q}) }[/math]. The conditional opinion [math]\displaystyle{ \omega^{A}_{Q|P} }[/math] generalizes the logical statement [math]\displaystyle{ P \to Q }[/math], i.e. in addition to assigning TRUE or FALSE the source [math]\displaystyle{ A }[/math] can assign any subjective opinion to the statement. The case where [math]\displaystyle{ \omega^{A}_{Q\mid P} }[/math] is an absolute TRUE opinion is equivalent to source [math]\displaystyle{ A }[/math] saying that [math]\displaystyle{ P\to Q }[/math] is TRUE, and the case where [math]\displaystyle{ \omega^{A}_{Q\mid P} }[/math] is an absolute FALSE opinion is equivalent to source [math]\displaystyle{ A }[/math] saying that [math]\displaystyle{ P\to Q }[/math] is FALSE. In the case when the conditional opinion [math]\displaystyle{ \omega^{A}_{Q|P} }[/math] is absolute TRUE the subjective Bayes' theorem operator [math]\displaystyle{ \widetilde{\phi\,} }[/math] of subjective logic produces an absolute FALSE derivative conditional opinion [math]\displaystyle{ \omega^{A}_{P\widetilde{|}\lnot Q} }[/math] and thereby an absolute TRUE derivative conditional opinion [math]\displaystyle{ \omega^{A}_{\lnot P\widetilde{|}\lnot Q} }[/math] which is equivalent to [math]\displaystyle{ \lnot Q \to \lnot P }[/math] being TRUE. Hence, the subjective Bayes' theorem represents a generalization of both contraposition and Bayes' theorem.

See also

• Reductio ad absurdum
• Logical equivalence

Sources

• Audun Jøsang, 2016, Subjective Logic; A formalism for Reasoning Under Uncertainty Springer, Cham, ISBN:978-3-319-42337-1