Converse, Inverse, and Contrapositive

Conditional statements connect a condition with a result. Changing the order or negating one part changes the claim. Given “if P, then Q,” the converse swaps P and Q, the inverse negates both without swapping them, and the contrapositive swaps and negates both. These names are easier to remember when you write each transformation in symbols before translating it back into words.

Start with the original conditional

A conditional has the form “If P, then Q,” written P → Q. P is the hypothesis or antecedent; Q is the conclusion or consequent. For example, let P mean “a whole number ends in 0” and Q mean “the number is even.” The original claim is: If a whole number ends in 0, then it is even. The condition is the ending digit; the result is evenness.

The words “if” and “then” establish a direction. The original statement says that P is enough to guarantee Q. It does not automatically say that Q guarantees P. A number can be even without ending in zero, so reversing the statement would make a different claim.

The converse swaps the two parts

The converse of P → Q is Q → P. It reverses the hypothesis and conclusion without negating either one. For the example, the converse is: If a whole number is even, then it ends in 0. This is false; 14 is even but does not end in 0. A true original conditional can therefore have a false converse.

A common reasoning error is to assume the converse. If a statement says that passing a test earns a certificate, it does not follow that every certificate holder passed that particular test. Other paths may exist. Before accepting the converse, look for a counterexample or additional premise that rules out alternatives.

The inverse negates both parts

The inverse of P → Q is ¬P → ¬Q, read “if not P, then not Q.” For the number example: If a whole number does not end in 0, then it is not even. This is also false: 14 is even and does not end in 0. Negate the entire condition and result, not just one word that happens to sound opposite.

The inverse is logically equivalent to the converse. Starting from Q → P, negating both parts gives ¬Q → ¬P, the contrapositive of the converse; in standard conditional logic, the converse and inverse have the same truth value. They are not generally equivalent to the original conditional.

The contrapositive swaps and negates

The contrapositive of P → Q is ¬Q → ¬P: reverse the order and negate each part. For the number example: If a whole number is not even, then it does not end in 0. This statement is true, and it is logically equivalent to the original. If a number ends in 0, it must be even; equivalently, if it is not even, it cannot end in 0.

A conditional and its contrapositive always share a truth value. This is why proving the contrapositive is a valid way to establish a conditional. The converse does not have that guarantee. To prove “if P then Q,” it is not enough to show “if Q then P.”

A transformation table

Necessary and sufficient language

In “if P, then Q,” P is a sufficient condition for Q: whenever P is true, Q follows. Q is a necessary condition for P: P cannot be true while Q is false. This is another way to guard against reversing the implication. “P is sufficient for Q” means P → Q, while “P is necessary for Q” means Q → P.

For example, being a square is sufficient for being a rectangle, because every square is a rectangle. Being a rectangle is necessary for being a square, but it is not sufficient: not every rectangle is a square. The converse—every rectangle is a square—is false. Precise necessary-and-sufficient wording helps identify the direction of the conditional.

How to negate a compound statement

Negating a statement means stating that the whole proposition is false. For “a figure has four equal sides,” the negation is “it is not true that the figure has four equal sides,” or more simply “the figure does not have four equal sides.” It does not necessarily mean all sides differ; three sides could be equal while one is different. Avoid replacing a logical negation with a stronger claim.

Some sentences contain “and” or “or,” which require care. The negation of “P and Q” is “not P or not Q”; the negation of “P or Q” is “not P and not Q” when “or” is inclusive. This follows De Morgan’s laws. If a question asks only for a conditional’s inverse or contrapositive, first isolate its hypothesis and conclusion before negating.

A reliable rewriting process

1. Name the hypothesis P and the conclusion Q in the original sentence.
2. Write the symbolic original P → Q.
3. For the converse, swap: Q → P.
4. For the inverse, negate but keep order: ¬P → ¬Q.
5. For the contrapositive, swap and negate: ¬Q → ¬P.
6. Test equivalence: the original pairs with its contrapositive; the converse pairs with the inverse.
7. Check the meaning in plain language and use a counterexample to test a statement that may be false.

Common mistakes

• Calling the converse and contrapositive the same statement. The converse only swaps; the contrapositive swaps and negates.
• Assuming a true conditional makes its converse true. The original and converse can have different truth values.
• Negating only the result or only the condition when forming the inverse or contrapositive.
• Confusing necessary with sufficient. “P is sufficient for Q” means P → Q, not Q → P.
• Turning ‘not P’ into a more specific condition that does not cover every way P can be false.
• Using an example that supports a conditional without checking whether it proves the general rule.

When these terms appear in a question, translate the original conditional into P → Q first. Then use the transformation pattern rather than relying on the sound of the sentence. Remember the equivalence pairs: conditional with contrapositive, and converse with inverse. Test truth separately from form; changing a statement does not preserve truth automatically.