Turn a claim inside out without breaking it.
Every claim has a shadow — the claim that it is wrong. Saying “that's not true” is a precise mathematical move called negation, written ¬p, and it does exactly one thing: it flips the truth value. If p is true, ¬p is false; if p is false, ¬p is true. The art is saying the opposite correctly. The opposite of “all my socks are clean” is not “all my socks are dirty” — it is “some sock is dirty.” One dirty sock is enough to make the original false, so the honest negation needs only an ∃. In this lesson we negate plain statements, then statements with ∀ and ∃, and we corner the trap that bites everyone: flipping the quantifier but forgetting to negate what's inside.
Take any statement — a sentence with a definite truth value — and put the word not in front of it. You get its negation, written ¬p (read “not p”). The whole content of negation is one rule:
¬p is true exactly when p is false, and ¬p is false exactly when p is true.
So p and ¬p always disagree. There is no in-between: a statement is true or false, so its negation is the other one. Negate twice and you come home — ¬(¬p) has the same truth as p.
Negation is a truth-value flip, not a change of subject. “7 is prime” is true, so “7 is not prime” is false. “9 is prime” is false, so “9 is not prime” is true. You don't have to like the negation — you just flip the verdict.
Let p = “the number 6 is even.” That's true, so ¬p = “6 is not even,” i.e. “6 is odd,” is false. Notice the careful wording: the negation of “even” is “odd” (the two split every integer). If a property and its opposite did not split the world cleanly, we'd write the negation as a plain “not …” and leave it there.
Now bring in the quantifiers. A universal claim ∀x∈M, p(x) says every x in the domain M has the property. How could that be wrong? Exactly when at least one x fails it — a single counterexample. So:
¬(∀x p(x)) ≡ ∃x ¬p(x)
Read it aloud: “it is not the case that every x works” means “there exists an x that doesn't work.” Two things changed at once — the quantifier flipped ∀ → ∃, and the inside got negated p(x) → ¬p(x). That second change is the one people drop.
A universal is fragile: one counterexample fells it. So its negation is an existential — “there is one that fails” — and finding that one example is exactly how you'd prove the negation true.
The mirror case. An existential ∃x∈M, p(x) says at least one x has the property. It is wrong only when no x has it — that is, when every x lacks it. So:
¬(∃x p(x)) ≡ ∀x ¬p(x)
“There isn't a single x that works” means “every x fails.” Again both pieces move: ∃ → ∀ and p(x) → ¬p(x). The two rules are a matched pair — negation walks through a quantifier, swapping it for the other and negating the predicate it guards.
Over M = {1, 2, 3, 4, 5}, consider ∃x, x > 4 — “some x exceeds 4.” Its witness is x = 5, so it is true. Its negation ∀x, x ≤ 4 says “every x is at most 4” — false, because 5 breaks it. True original, false negation: opposite, as they must be. Note the predicate flipped from “> 4” to “≤ 4,” not to “< 4.”
Here are the misreadings that cost the most marks. Both come from doing half the negation.
The negation of ∀x, x > 0 (“all of them are positive”) is not ∀x, x < 0 (“all of them are negative”). To break “all positive,” you don't need them all negative — you need just one that isn't positive, i.e. one that is ≤ 0. So the honest negation is ∃x, x ≤ 0. Watch a value like x = 0: it makes the original false (0 is not greater than 0), the right negation catches it (0 ≤ 0), and the wrong “∀x < 0” misses it entirely (0 is not less than 0).
The negation of “x > 3” is “x ≤ 3,” not “x < 3.” Why? “Not greater than 3” leaves two possibilities open: less than 3, or equal to 3. Dropping the “equal to” case loses the boundary point x = 3, where the original is already false. The matched flips are > ↔ ≤ and < ↔ ≥ — each negation closes the dot the original left open.
The classic error is flipping the quantifier but keeping the predicate — turning ∀x p(x) into ∃x p(x) instead of ∃x ¬p(x). Negation moves through a quantifier and negates the inside. And when the predicate is an inequality, negate it to its closed twin: “>” → “≤”, “<” → “≥”, never to the strict opposite.
The same “walk through and flip” rhythm governs and / or. To deny “p and q both hold,” you only need one of them to fail: ¬(p ∧ q) ≡ ¬p ∨ ¬q. To deny “p or q holds,” you need both to fail: ¬(p ∨ q) ≡ ¬p ∧ ¬q. These are De Morgan's laws — the same pattern as the quantifiers, since “∀” is a long “and” and “∃” is a long “or.”
Negation flips the verdict, and across a quantifier it flips the quantifier and negates the inside. Keep this table on hand:
| Statement | Its negation ¬ | In words |
|---|---|---|
| p | ¬p (opposite truth) | flip the verdict |
| ∀x, p(x) | ∃x, ¬p(x) | some x fails |
| ∃x, p(x) | ∀x, ¬p(x) | every x fails |
| x > a | x ≤ a | > negates to ≤ |
| x < a | x ≥ a | < negates to ≥ |
| p ∧ q | ¬p ∨ ¬q | De Morgan (one fails) |
| p ∨ q | ¬p ∧ ¬q | De Morgan (both fail) |
The big one to never forget: the negation of “all are > 0” is “some is ≤ 0,” never “all are < 0.” Next, in 35.5 Simple Logical Reasoning, negation powers the contrapositive and proof by contradiction.
State the negation of: “The number 13 is prime.” Is the original true or false? Is the negation?
Negation: “13 is not prime.” The original is true (13 has no divisors but 1 and 13), so the negation is false. They disagree, as a statement and its negation must.
Negate “∀x∈ℝ, x² ≥ 0.” Which is true — the statement or its negation?
Flip ∀→∃ and negate the inside: ∃x∈ℝ, x² < 0. The original is true (a square is never negative), so its negation is false — there is no real x with a negative square.
Write the negation of “∃x∈ℕ, x + 5 = 2.”
Flip ∃→∀ and negate the inside: ∀x∈ℕ, x + 5 ≠ 2 — “for every natural number x, x + 5 is not 2.” The original is false (no natural number solves x + 5 = 2), so its negation is true.
A student says the negation of “∀x, x > 0” is “∀x, x < 0.” Give the correct negation and a value that exposes the mistake.
The correct negation is ∃x, x ≤ 0 — “some x is at most 0.” Take x = 0: it makes the original false (0 is not greater than 0) and the right negation catches it (0 ≤ 0), but the student's “∀x < 0” misses it (0 is not less than 0) — and would also wrongly demand every x be negative.
Negate the inequality statement “x ≥ 7” and explain the boundary.
The negation of “x ≥ 7” is “x < 7.” Since the original includes the point 7 (≥), the negation must exclude it — strict <, not ≤. The boundary point flips its open/closed status: ≥ (closed) negates to < (open).
Use De Morgan to negate “n is even and n > 10.”
¬(p ∧ q) ≡ ¬p ∨ ¬q, so: “n is odd or n ≤ 10.” To break “both,” only one part must fail — that's why “and” becomes “or,” and each piece is negated (“even”→“odd,” “> 10”→“≤ 10”).
Six questions to lock it in. Tap the answer you think is right.
This lesson develops negation and the quantifier-negation rules ¬(∀x p) ≡ ∃x ¬p and ¬(∃x p) ≡ ∀x ¬p, with a brief look at De Morgan's laws. It directly serves the Standards for Mathematical Practice MP3 (construct viable arguments and critique the reasoning of others — here, spotting a flawed negation) and MP6 (attend to precision — the “> negates to ≤, not <” boundary care). Correct negation is the backbone of proof writing under HSG-CO.C.9 and is the engine behind the contrapositive and proof by contradiction in the next lesson. The recurring takeaway worth reinforcing at home: the opposite of “all are positive” is “some is not positive,” never “all are negative.”