On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Math · Sets & Logic · Grade 9-12

Negation

The negation ¬P is the statement with the opposite truth value of P: true when P is false, false when P is true.

¬(¬P)⇔P (double negation law)

Quick Answer

The negation ¬P is the statement with the opposite truth value of P: true when P is false, false when P is true. Use it to say exactly 'it is not the case that P': the negation of '9 is prime' is '9 is not prime'. A statement and its negation split every possibility between them, so exactly one of P and ¬P is true. Negating a sentence with 'all' or 'some' needs care: the negation of 'all students passed' is 'at least one student did not pass', not 'no student passed'.

Why This Matters

Negation is what disproof and indirect proof run on. To disprove a claim you show that its negation is true, and a proof by contradiction assumes ¬P and reaches something impossible. Getting the negation exactly right matters: the negation of 'every number in the list is positive' is 'some number in the list is not positive', and attacking the wrong opposite produces arguments that prove nothing.

Intuitive Explanation

Take the statement P: '15 is even.' Its negation ¬P is '15 is not even.' P is false and ¬P is true. Whatever the facts, exactly one of the pair is true, so negation always flips the truth value: T becomes F and F becomes T. Negate twice and you are back where you started, ¬(¬P)⇔P: 'it is not the case that 15 is not even' just says that 15 is even.

The opposite that comes to mind first is often too strong. The negation of 'the soup is hot' is 'the soup is not hot', which covers warm, lukewarm and cold. 'The soup is cold' is a contrary: it can't be true at the same time as 'hot', but both can be false when the soup is lukewarm. A true negation covers every case the original leaves out.

Quantifiers are where this bites hardest. 'All the lights are on' is broken by a single light that is off, so its negation is 'at least one light is off'. 'No lights are on' is far stronger and is not the negation: with 9 lights on and 1 off, the original is false, and 'no lights are on' is false too. In the same way, the negation of 'some light is on' is 'every light is off'.

Think of it like this. Negation is the other side of a bet. If you bet a die shows 6, your opponent holds every other result, 1 through 5, so exactly one of you wins. With a coin the other side is a single outcome, tails, but in general a negation covers all the remaining cases, not just one opposite case.

Core idea. The negation of P is the statement that is true exactly when P is false.


When to Use

Use negation when you need the exact opposite of a claim: to disprove it, to set up a proof by contradiction, or to build a contrapositive. Put 'not' in front, then simplify carefully: 'all ... are' becomes 'at least one ... is not', and 'some ... is' becomes 'none ... is'. If you want an extreme opposite, such as 'cold' for 'hot', that is a contrary, not a negation. For sets, the matching operation is the complement.

Tip. Ask: Is this new statement true in exactly the cases where the original is false?

How to Recognize It

Before writing the opposite of a claim, look at how many cases the original covers and what happens in the cases between the two extremes.

  1. Does the original claim say 'all' or 'every', even if only by implication?

    If yes, the negation needs only one failure: 'every bus was late' becomes 'at least one bus was not late'. Writing 'no bus was late' gives a contrary, which can be false at the same time as the original.

  2. Is there a middle ground between the claim and its 'opposite', the way warm sits between hot and cold?

    If yes, the opposite word is a contrary, not the negation; the negation 'not hot' includes the middle. If no, as with even and odd for whole numbers, the opposite word is the negation.

  3. Is the original made of two parts joined by 'and' or 'or'?

    If yes, De Morgan's laws apply: ¬(P∧Q) is ¬P∨¬Q, and ¬(P∨Q) is ¬P∧¬Q. If no, attach 'not' to the single claim.

  4. Is the claim an if-then rule, like 'if it rains, the game is cancelled'?

    If yes, its negation is not another if-then rule: ¬(P→Q) is P∧¬Q, 'it rains and the game goes ahead'. Swapping the parts gives the converse, which is a different claim, not the negation.

Negation compared with Opposite/contrary statement, Converse, and Complement (sets)

Negation, a contrary, the converse and a set complement all produce some kind of opposite. Ask whether the new version is false exactly when the original is true and covers every remaining case (negation), or only sounds opposite, reverses an if-then, or works on sets.

Negation

Meaning
Use this when you need the exact logical opposite of a statement, true precisely when the original is false.
Key test
Is this new statement true in exactly the cases where the original is false?
Formula
¬(¬P)⇔P (double negation law)
Example
Negate the statement 'The number 9 is prime.'

Opposite/contrary statement

Meaning
An extreme opposite, not the logical complement.
Key test
Negation flips truth; a contrary may both be false.
Example
'hot' vs 'cold' are contraries, not negations

Converse

Meaning
Swaps a conditional's parts, not its truth value.
Key test
Use when reversing 'if P then Q' to 'if Q then P', a different statement.
Formula
Q→P
Example
Converse of P→Q is Q→P

Complement (sets)

Meaning
The NOT of a set, not of a statement.
Key test
Use when negating membership across a universe, not a proposition.
Formula
A′
Example
A′={x∈U:x∉A}

Formula & Notation

¬(¬P)⇔P (double negation law)
¬P⇔(P→⊥); ¬(¬P)⇔P (double negation); ¬(∀x P(x))⇔∃x ¬P(x)

How to read it: ¬P or ∼P or P′

Worked Examples

Example 1 — Negate a statement

Easy

Negate the statement 'The number 9 is prime.'
Show the steps and the answer
  1. Write P: '9 is prime'. Insert 'not': ¬P is '9 is not prime'.

    A negation keeps the subject and the claim and denies it, without adding anything new.

  2. Find the truth value of P: 9=3×3, so 9 has a divisor other than 1 and itself, and P is false.

    Knowing the value of P gives the value of ¬P immediately.

  3. Flip it: ¬P is true.

    In every situation, exactly one of P and ¬P holds.

Answer: ¬P: '9 is not prime' (true)

Takeaway: To negate a statement, deny it word for word; its truth value is the opposite of the original's, so '9 is not prime' is true because '9 is prime' is false.

Example 2 — Negating 'all'

Standard

Negate 'Every student passed the test.'
Show the steps and the answer
  1. Write the claim with a quantifier: for every student s, s passed.

    The word 'every' makes it a universal claim, and negating a universal follows a set rule.

  2. Ask what makes the claim false: one student failing is enough.

    The negation has to be true in exactly the cases where the original is false.

  3. Apply ¬∀s P(s)⇔∃s ¬P(s): 'at least one student did not pass'.

    'For all' becomes 'there exists', and 'passed' becomes 'did not pass'.

  4. Reject 'no student passed': in a class where 24 passed and 1 failed, the original and this sentence are both false.

    A negation must be true whenever the original is false, and 'no student passed' fails that test.

Answer: 'At least one student did not pass'

Takeaway: The negation of 'every ... did' is 'at least one ... did not'; 'none did' is a stronger claim and not the negation.

Example 3 — Find the mistake: the boundary case

Application

Negate the statement 'The temperature today is above 20 °C.' Ali writes: "The temperature today is below 20 °C." Find the mistake and correct it.
Show the steps and the answer
  1. Test a case Ali's sentence misses: a temperature of exactly 20 °C.

    At 20 °C the original is false (20 is not above 20), and Ali's sentence is also false (20 is not below 20).

  2. Compare with the requirement: a negation must be true whenever the original is false.

    Ali's version fails at 20 °C, so it is a contrary, not the negation.

  3. Write the original as t>20 and negate the inequality: t≤20.

    The negation of > is ≤, which keeps the boundary value.

  4. State it in words: 'The temperature today is at most 20 °C.'

    Now every temperature makes exactly one of the two sentences true.

Answer: 'The temperature today is at most 20 °C' (t≤20).

Takeaway: The negation of t>20 is t≤20, not t<20; a negation must include the boundary.

Where You'll See It

  • Excluding a word in a search

    A recipe site that allows 'not nuts' searches returns every recipe the plain 'nuts' search leaves out. If 340 of 2,000 recipes contain nuts, the negated search returns the other 1,660; together the two searches cover all 2,000 recipes, with no recipe in both.

  • Breaking a warranty promise

    A warranty says 'all parts are covered for 2 years'. To show the promise false, a customer needs only the negation: 'at least one part is not covered'. A single excluded battery breaks the promise; nobody has to show that no parts at all are covered.

Common Mistakes

  1. The slip: Negating 'all are' as 'none are'

    Instead: the negation of ∀x P(x) is ∃x ¬P(x), 'at least one is not.'

  2. The slip: Treating an extreme opposite as a negation

    Instead: ¬(tall) is 'not tall', not 'short.'

  3. The slip: Mishandling double negation

    Instead: ¬(¬P) returns to P, not something stronger.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Negate "12 is divisible by 5," and give the truth value of both statements.

    Hint: Divide 12 by 5. Then flip the claim.

  2. Negate the statement "x>7" for a real number x.

    Hint: Which numbers are left over when x is not greater than 7? Include the boundary.

  3. Negate "Some prime numbers are even." Which one, the statement or its negation, is true?

    Hint: Think about the prime number 2.

  4. Negate "Every multiple of 4 is a multiple of 8." Then give a number that shows the negation is true.

    Hint: The negation of "every" needs only one exception.

  5. Is "The water is cold" the negation of "The water is hot", or only an opposite? Use water at 25 degrees to decide.

    Hint: Can both sentences be false at the same time?

  6. Mia negates "All 30 students in the class passed" as "None of the 30 students passed." Correct Mia.

    Hint: How many students would have to fail to make the original false?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Can a statement and its negation both be false?

No. For a genuine statement, exactly one of PP and ¬P\neg P is true; logicians call this the law of excluded middle. If both seem false, the 'negation' you wrote is really a contrary. 'All dogs are brown' and 'No dog is brown' are both false, because brown dogs and black dogs both exist. The true negation, 'some dog is not brown', is true.

What is the negation of x>5?

It is x≤5x \le 5, not x<5x < 5. The value x=5x = 5 makes 'x>5x > 5' false, so it must make the negation true. This boundary slip is common with inequalities: the negation of x≥0x \ge 0 is x<0x < 0. On a number line, a statement about xx and its negation always split the line between them, with no gap and no overlap.

Why does proof by contradiction start with a negation?

To prove PP, you assume ¬P\neg P and reason until you reach something impossible, such as 1=01 = 0. Since ¬P\neg P led to nonsense, it must be false, and so PP is true. The classic example proves that 2\sqrt{2} is irrational: assume 2=ab\sqrt{2} = \frac{a}{b} in lowest terms, then show that aa and bb must both be even. Getting the negation exactly right is the first step.

Does 'not unhappy' mean 'happy'?

Not in logic, and often not in English either. 'Unhappy' is a contrary of 'happy', so 'not unhappy' covers both happy and the middle ground of feeling fine. When both nots are true negations, though, they do cancel: ¬(¬P)\neg(\neg P) is PP, and 'it is not true that 7 is not prime' means exactly '7 is prime'. The difference is whether the inner 'not' is a real negation or a word with an opposite meaning.

Learning Path

← Before

Logical Statement
Negation

You are here

Next →

Nothing after this yet
You need Logical Statement first: a sentence with exactly one truth value. Negation adds the operation that flips that value, plus the rules for negating 'all' and 'some'. With it you can disprove a claim with one counterexample, write contrapositives, apply De Morgan's laws to 'and' and 'or', and set up proofs by contradiction.

See Also