Signal: 'If Not-X, Then Not-Y' Statements Are Secretly Asking for Contrapositive of 'If Y Then X'

Open almost any number theory textbook and you will spot statements with this awkward shape:

"If n is not divisible by 3, then n^2 is not divisible by 3."
"If p does not divide a, then p does not divide a^k (for p prime)."
"If x \neq 0, then x^2 \neq 0."

Every one of these is an implication from a negative hypothesis to a negative conclusion. Reading them directly, you think: "Okay, assume a not, derive a not." That is uncomfortable — you are starting from the absence of something, which does not give you concrete material to compute with.

Here is the recognition pattern: any statement of the form "if not-X, then not-Y" is secretly the contrapositive of "if Y, then X." Prove the positive version, and the negative version follows for free.

This article explains how to spot the pattern, why it is always the right move when you see it, and how to mechanically translate between the two forms.

The pattern, stated mechanically

You see: "If \lnot X, then \lnot Y."

Its contrapositive is: "If Y, then X." (Double-negation cancels on both sides.)

The two statements are logically equivalent. But the second version — positive on both ends — is almost always easier to prove because you have concrete material (the positive hypothesis Y) instead of absence (the negative hypothesis \lnot X).

So: when you see a double-negative implication, translate it to the positive contrapositive form first, and prove that one.

Why this pattern is so common in textbooks

Textbooks often state theorems in whichever form is most useful for subsequent application, not whichever form is easiest to prove. A result like "if p \nmid a, then p \nmid a^k" is useful downstream because later proofs want to use the double-negative form — "I know p \nmid a, so I conclude p \nmid a^k." The textbook has optimised for how the result will be applied, not for how it will be proved.

As a prover, your job is to flip this. The form the textbook states is the application form. The form you prove is the positive form — the contrapositive. Then you have proved both (since they are equivalent) and can quote either version in future arguments.

Why textbooks present the negative form even though it is harder to prove: the negative form often matches how a reader will encounter the hypothesis later. If you have already established "p does not divide a" in an earlier step, you want a theorem that lets you conclude "p does not divide a^k" without extra work. Stating the theorem in negative-to-negative form makes it directly applicable. But the proof works better in the positive-to-positive direction.

The translation table

Here are three statements in double-negative form with their contrapositives in positive-to-positive form.

Textbook statement (double negative)	Contrapositive (positive)
If 3 \nmid n, then 3 \nmid n^2	If 3 \mid n^2, then 3 \mid n
If p is prime and p \nmid a, then p \nmid a^k	If p is prime and p \mid a^k, then p \mid a
If x \neq 0, then x^2 \neq 0	If x^2 = 0, then x = 0
If f is not injective, then f is not a bijection	If f is a bijection, then f is injective
If A \not\subseteq B, then A \cap B \neq A	If A \cap B = A, then A \subseteq B

In each case, the right column — the positive version — is the one you actually prove. The left column is what the textbook states, and what a problem set might literally ask you to prove. Recognising that they are the same statement is the whole trick.

A worked example of the pattern

Problem. Prove: "If 3 does not divide n, then 3 does not divide n^2."

Step 1: spot the pattern. Both hypothesis and conclusion are negative statements (3 \nmid something). Flip to positive form.

Step 2: translate. Contrapositive is "if 3 \mid n^2, then 3 \mid n." Both ends are now positive.

Step 3: audit. The positive hypothesis "3 \mid n^2" means n^2 = 3k. Hmm — extracting n requires a cube root... wait, that is square root, which does not land in integer form cleanly. Let me audit more carefully.

Actually, the problem is standard: "if 3 \mid n^2 then 3 \mid n." This is usually proved by yet another contrapositive — flipping it back again — because the hypothesis 3 \mid n^2 is still a bit awkward. Let me try both.

Option A: prove "if 3 \mid n^2 then 3 \mid n" directly.

Suppose 3 \mid n^2. Write n = 3q + r where r \in \{0, 1, 2\}. Then n^2 = 9q^2 + 6qr + r^2 = 3(3q^2 + 2qr) + r^2. For 3 \mid n^2, need 3 \mid r^2. Checking: r = 0: r^2 = 0, divisible. r = 1: r^2 = 1, not divisible. r = 2: r^2 = 4, not divisible. So r = 0, meaning n = 3q. Hence 3 \mid n.

Alternatively, Option B: contrapositive-again. The contrapositive of "if 3 \mid n^2 then 3 \mid n" is "if 3 \nmid n, then 3 \nmid n^2" — which is the original problem! So flipping twice brings us back.

The right move here is Option A — a direct proof of the positive form via case analysis on n \bmod 3. The double-negative original form is strictly harder because you would have to argue from "n is not a multiple of 3" abstractly.

Step 4: conclude. Having proved "if 3 \mid n^2 then 3 \mid n" directly, the contrapositive "if 3 \nmid n then 3 \nmid n^2" — the original problem — holds. \square

The signal's reliability

The "double negative → positive" signal fires reliably because:

Positive hypotheses give you concrete algebraic material. "3 \mid n^2" lets you write n^2 = 3k. "3 \nmid n" lets you write... nothing concrete, just that n \neq 3k for any k.
Positive conclusions give you a specific target. "3 \mid n" means you must produce a specific q with n = 3q. "3 \nmid n^2" means you must prove the absence of any k with n^2 = 3k — a negative existence claim, which is harder.
Contrapositive of contrapositive is the original. Flipping a double-negative statement is a single well-defined operation, not an infinite cascade. You flip once, and you land on the positive form. Done.

A visual: flipping the double-negative

View:

Slide between the double-negative view (left) and the positive contrapositive (right). Both describe the same implication, but the positive form gives you concrete material to manipulate rather than arguing from absences.

Special case: statements with "only"

Statements with the word "only" often hide a double negative too. "X holds only if Y" means "if not-Y, then not-X." So "only if" is the contrapositive direction of "if": "X only if Y" is X \Rightarrow Y in disguise, stated from the reverse direction.

When you see "only if" in a theorem statement, you are already looking at the double-negative form. Flipping to the positive "if X then Y" often clarifies the proof strategy.

Applying the signal to a JEE-style divisibility problem

Problem. Prove: "If n is not a multiple of 5, then n^4 - 1 is a multiple of 5."

Step 1: spot the pattern. "Not a multiple of 5" is a negative hypothesis. Translating, though — the conclusion is positive ("is a multiple of 5"). So this is "negative \Rightarrow positive," not "negative \Rightarrow negative." It is actually close to the simple-negation pattern in the other direction.

Hmm. Let me reread. The hypothesis is "5 \nmid n" (negative), the conclusion is "5 \mid n^4 - 1" (positive). Contrapositive would be "if 5 \nmid n^4 - 1, then 5 \mid n" — which is less helpful, because the new hypothesis is more complex.

Conclusion: the signal does not fire here. Direct proof by checking residues n \equiv 1, 2, 3, 4 \pmod 5 (the four non-zero residues) works cleanly: for each, compute n^4 \pmod 5 and check it equals 1.

Proof. Suppose 5 \nmid n, so n \equiv 1, 2, 3, or 4 \pmod 5. By Fermat's little theorem, n^{5-1} \equiv 1 \pmod 5, so n^4 \equiv 1 \pmod 5, so n^4 - 1 \equiv 0 \pmod 5, so 5 \mid n^4 - 1. \square

Result. If 5 \nmid n, then 5 \mid n^4 - 1.

Lesson. The double-negative signal fires only when both the hypothesis and conclusion are negative. Here the conclusion is already positive, so the signal does not apply and direct proof works.

The rule in one sentence

If you see a statement of the form "if not-X, then not-Y," it is the contrapositive of "if Y, then X" — prove the positive form, and the original follows for free.

This pattern is one of the most reliable recognition signals in the contrapositive toolkit. Whenever you spot double-negation on both sides of an implication, your first move should be to flip it to positive-positive form and prove that. The double-negative version is the statement; the positive version is the proof.