Implication, converse, inverse and contrapositive
The statement “if p, then q” is an implication, written p ⇒ q; here p is a sufficient condition and q a necessary condition. An implication is false in exactly one case: p true and q false; if p is false the implication is true whatever q is. The statement q ⇒ p is the converse, ¬p ⇒ ¬q the inverse and ¬q ⇒ ¬p the contrapositive. The tables show that the contrapositive is equivalent to the original implication and the inverse is equivalent to the converse; but an implication and its converse are not equivalent. The statement (p ⇒ q) ∧ (q ⇒ p) is the equivalence p ⇔ q: it is true only when p and q have the same value, and reads “p is necessary and sufficient for q”.
| p | q | p ⇒ q | q ⇒ p | ¬p ⇒ ¬q | ¬q ⇒ ¬p |
|---|---|---|---|---|---|
| T | T | T | T | T | T |
| T | F | F | T | T | F |
| F | T | T | F | F | T |
| F | F | T | T | T | T |
A museum rule says: “Holders of a yearly ticket enter free.” Someone who entered free need not hold the ticket: small children might also enter free, so the converse is not always true. The one safe conclusion is this: a person who did not enter free has no yearly ticket.
Lawyers read “if … then” clauses in a contract carefully, doctors do not jump from a symptom to a diagnosis, and programmers check the reverse reasoning in their “if” conditions.
Write one school rule in the form “if …, then …”. Form its converse and find one case in which the converse is false.
| p | q | p ⇒ q | q ⇒ p | p ⇔ q |
|---|---|---|---|---|
| T | T | T | T | T |
| T | F | F | T | F |
| F | T | T | F | F |
| F | F | T | T | T |
“Reverse it” game: the teacher says an “if …, then …” sentence from life (for example “If it rains, the street gets wet”). Groups write the converse, inverse and contrapositive and justify which one is always true.