Negate-This-Statement Drill — Flip Quantifiers, Swap Words

Every proof by contradiction starts with one move: take the statement you want to prove and write its negation. Skip it, or get it wrong, and the rest of the proof is worthless — you will be attacking a claim that is not the opposite of what you wanted. Yet negation is where beginners stumble most. "All primes are odd" does not become "No primes are odd." "At least one solution exists" does not become "No solutions exist." The rules are simple, but you need reps to make them reflex.

This drill is pure muscle memory. Drag the slider to cycle through statements, and each time read the two panels side by side: the original on the left, its clean negation on the right. Notice which word flipped, which quantifier swapped, and which inequality reversed.

The four rewrite rules

Before the drill, here are the four rules that generate every negation you will ever need.

"For all x, P(x)" becomes "There exists x such that \lnot P(x)." All-statements flip to some-statements, and the inner predicate is negated.
"There exists x such that P(x)" becomes "For all x, \lnot P(x)." Exists-statements flip to all-statements, and again the inner predicate is negated.
Inequalities reverse direction, and strictness flips. \ge becomes <. > becomes \le. "At least k" becomes "fewer than k." "At most k" becomes "more than k."
"P and Q" becomes "\lnot P or \lnot Q"; "P or Q" becomes "\lnot P and \lnot Q." This is De Morgan — the joints swap.

That is the whole toolkit. Every statement you will ever negate in a proof by contradiction is just these four rules applied in sequence.

The drill

Drag the slider through ten statements. For each, the left panel shows the claim and the right panel shows its clean negation — the exact sentence you would write as the opening line of a proof by contradiction.

Example:

Ten paired examples. Each pair shows how a clean negation is produced: which quantifier flipped, which connective swapped, which inequality reversed. These are the only moves. Every proof-by-contradiction opener you will ever write is one of these ten shapes in disguise.

Three traps to watch for

Trap 1 — negating "all" as "none." "All primes are odd" is false because of 2. Its negation is "some prime is not odd" — not "no prime is odd." The negation asserts at least one counterexample, not the impossibility of any example. If you write "none" when you should write "some not," your whole proof becomes too strong — you end up trying to prove something harder than the truth.

Why this matters for contradiction: when you assume the negation and derive consequences, the assumption needs to match the actual opposite. "No prime is odd" would force you to argue every prime is even, which is obviously false before you even start. You get the contradiction instantly — but from your overreach, not from a real flaw in the negation. The proof is worthless.

Trap 2 — leaving quantifiers untouched. "Every continuous function attains its maximum" is \forall f, P(f). Its negation is "there exists a continuous function that does not attain its maximum" — \exists f, \lnot P(f). The \forall becomes \exists on the outside, and the predicate inside gets negated. Forgetting the outer flip is the most common mistake in intro analysis.

Trap 3 — negating an implication wrongly. "P \Rightarrow Q" is logically equivalent to "\lnot P \lor Q," so its negation is "P \land \lnot Q." In English: "if n is even then n^2 is even" negates to "n is even and n^2 is odd" — not "n is odd and n^2 is even." The trap is treating the arrow like an equation and flipping both sides. Only Q gets negated; P stays as it was.

The checklist before you write "Assume for contradiction..."

Every time you open a proof by contradiction, pause and run this two-question check on your negation.

Did the outer quantifier flip? \forall becomes \exists; \exists becomes \forall. If the statement has no explicit quantifier, pretend it has a universal one on the outside (most math claims are implicitly universal) and flip that.
Did the inequality or connective flip inside? \ge \to <, > \to \le, AND \to OR, "at least" \to "fewer than." The inside negates independently of the outside flip.

If both questions have clean "yes" answers, you are safe to write "Assume for contradiction..." If either is unclear, go back and re-parse the original statement. A sloppy negation is the single most wasted half-hour in every proof-writing student's life.

Negate a nested claim

Statement. For every \varepsilon > 0, there exists N \in \mathbb{N} such that for all n \ge N, |a_n - L| < \varepsilon.

Step 1 — identify the quantifier skeleton. \forall \varepsilon \; \exists N \; \forall n (\dots).

Step 2 — flip each quantifier from outside in. \exists \varepsilon \; \forall N \; \exists n (\dots).

Step 3 — negate the inner predicate. |a_n - L| < \varepsilon becomes |a_n - L| \ge \varepsilon.

Negation. There exists \varepsilon > 0 such that for every N \in \mathbb{N}, there exists n \ge N with |a_n - L| \ge \varepsilon.

Read it as English. "There is some error threshold \varepsilon that the sequence keeps violating — no matter how far out you go, you can find a term n that misses the limit by at least \varepsilon."

This is the opening line of every proof by contradiction that a sequence fails to converge. If the opening is wrong, no algebra downstream can save the proof.

The negation step looks cosmetic, but it is the hinge of the whole method. Everything downstream — the algebra, the substitutions, the eventual collision with some known fact — unfolds inside the assumed-negation world. A wrong negation means you are exploring the wrong world. Spend the thirty seconds to write it cleanly.