Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Write the Converse, Inverse and Contrapositive

Every conditional P→QP \to Q has three relatives. The converse swaps the parts, the inverse negates both, and the contrapositive does both. Only the contrapositive is equivalent to the original.

Recognize the task

The question asks for the converse, inverse or contrapositive of a statement, asks which of them are true, or calls for a proof by contrapositive: "if a number is divisible by 4, then it is even", ¬P→Q\neg P \to Q, P→¬QP \to \neg Q. Test: the statement is a single if-then; first find which part is the condition.
The three related forms are defined in converse, inverse and contrapositive.

Steps

StepOn ¬P→Q\neg P \to Q
1Write the statement as an arrow. Find the condition (after "if") and the conclusion (after "then"). "QQ if PP" and "PP only if QQ" both mean P→QP \to Q.antecedent ¬P\neg P, consequent QQ
2Swap the parts for the converse. The converse reverses the arrow.converse: Q→¬PQ \to \neg P
3Negate both parts for the inverse. The inverse keeps the order and negates each part.inverse: ¬¬P→¬Q\neg\neg P \to \neg Q
4Swap and negate for the contrapositive. The contrapositive reverses the arrow and negates both parts. It is equivalent to the original by contrapositive equivalence.contrapositive: ¬Q→¬¬P\neg Q \to \neg\neg P
5Cancel the double negations. Write ¬¬P\neg\neg P as PP so each form is easy to read. Then judge truth: the contrapositive matches the original, and the converse matches the inverse.Double negation law ↗inverse P→¬QP \to \neg Q; contrapositive ¬Q→P\neg Q \to P

Worked examples

Example 1 · a negated conclusion

symbols
converse of P→¬QP \to \neg Q: ¬Q→P\neg Q \to P
swap the parts
inverse: ¬P→¬¬Q≡¬P→Q\neg P \to \neg\neg Q \equiv \neg P \to Q
negate both, then cancel
contrapositive: ¬¬Q→¬P≡Q→¬P\neg\neg Q \to \neg P \equiv Q \to \neg P
swap and negate, then cancel

Example 2 · divisible by 4

in words
PP: nn is divisible by 4; QQ: nn is even
the original is true
converse: if nn is even, it is divisible by 4
false: take n=6n = 6
inverse: if nn is not divisible by 4, it is not even
false: take n=6n = 6
contrapositive: if nn is not even, it is not divisible by 4
true, like the original

Example 3 · compare the tables

check
P→QP \to Q and ¬Q→¬P\neg Q \to \neg P: T, F, T, T
the same column
Q→PQ \to P and ¬P→¬Q\neg P \to \neg Q: T, T, F, T
the same column
P→Q≡¬Q→¬PP \to Q \equiv \neg Q \to \neg P and Q→P≡¬P→¬QQ \to P \equiv \neg P \to \neg Q
two equivalent pairs
Test any pair, for example P→QP \to Q against Q→PQ \to P, in the equivalence validator.

See it happen

The original P→QP \to Q rules out one row: PP true and QQ false. The contrapositive ¬Q→¬P\neg Q \to \neg P rules out the row where ¬Q\neg Q is true and ¬P\neg P is false, which is the same row, so the two say the same thing. The converse rules out a different row, QQ true and PP false, and so does the inverse. That is why the four forms pair up.

Common mistakes

Taking the inverse for the contrapositive

✗ the contrapositive of P→QP \to Q is ¬P→¬Q\neg P \to \neg Q
✓ it is ¬Q→¬P\neg Q \to \neg P: swap as well as negate

Assuming the converse is true

✗ "if divisible by 4, then even" is true, so "if even, then divisible by 4" is true
✓ n=6n = 6 is even but not divisible by 4
This is the fallacy of affirming the consequent.

Negating only one part

✗ the contrapositive of P→QP \to Q is ¬Q→P\neg Q \to P
✓ negate both parts: ¬Q→¬P\neg Q \to \neg P