Negations: How to Deny a Statement Correctly

In the earlier posts in this series, we looked at simple statements and sets, then moved into variables and quantifiers, operations on sets and statements, and conditional statements and converses. The next important idea is negation.

Negation is one of the most basic tools in logic, but it is also one of the easiest to mishandle. A negation is not just a matter of dropping the word “not” into a sentence somewhere. To negate a statement properly, you must reverse its meaning in a logically complete way.

That becomes especially important once statements involve words like and, or, if...then, some, and all.

What is a negation?

A negation is the denial of a statement.

For example, consider the statement:

4 + 5 = 8

This statement is false. Its negation is any statement that correctly denies it, such as:

• It is false that 4 + 5 = 8.

• It is not the case that 4 + 5 = 8.

• 4 + 5 ≠ 8.

These all express the same idea. They are all negations of the original statement.

If we call a statement p, then its negation is written as not p. The truth value flips:

• if p is true, then not p is false

• if p is false, then not p is true

For a simple statement, the negation is often easy to identify. For a compound statement, however, you have to pay close attention to how the statement is built.

Negating a statement joined by “or”

Consider the statement:

a = 0 or b = 0

This means that at least one of the two parts is true. It could be the first one, the second one, or both.

To negate this statement, we must deny every one of those possibilities. That means neither statement can be true.

So the negation is:

a ≠ 0 and b ≠ 0

This gives us an important rule:

The negation of “p or q” is “not p and not q.”

In ordinary language, this is often stated as:

Neither p nor q

That is often the most natural wording.

Negating a statement joined by “and”

Now consider:

John is tall and Tom is short

This statement claims that both parts are true at the same time.

To negate it, we do not need to say that both parts are false. We only need to say that the original claim fails. Since the original statement requires both parts to be true, its negation is that at least one of them is false.

So the negation is:

John is not tall or Tom is not short

This gives us another key rule:

The negation of “p and q” is “not p or not q.”

This is a very common source of mistakes. Students often try to negate “and” with another “and,” but that does not fully reverse the meaning. When a conjunction is negated, and becomes or.

Negating an “if...then...” statement

Now consider a conditional statement:

If he is a citizen, then he may vote.

This says that whenever the first part is true, the second part must also be true.

A conditional statement fails only in one case: when the first part is true and the second part is false.

So the negation is:

He is a citizen and he may not vote.

This gives the general rule:

The negation of “if p, then q” is “p and not q.”

This idea is extremely important in mathematics. To show that a conditional statement is false, you must produce exactly that kind of situation: one where the hypothesis is true but the conclusion is false.

Negations involving quantifiers

Logical statements in mathematics often use quantifiers such as some, all, there exists, and for every. Negating these statements requires a different kind of shift.

Negating “some”

Consider the statement:

Some people are men.

This says that there exists at least one person who is a man.

To negate it, we must say that no such example exists.

So the negation is:

No people are men.

An equivalent way to say this is:

For every person, that person is not a man.

So in general:

The negation of “for some, p” is “for all, not p.”

Negating “all”

Now consider:

For all numbers x, x² + 1 ≠ 0

This says that every number satisfies the condition.

To negate it, we must say that there is at least one value of x for which the condition fails.

So the negation is:

For some number x, x² + 1 = 0

This gives another fundamental rule:

The negation of “for all, p” is “for some, not p.”

This switch between some and all is one of the most important patterns in logic.

A note about mathematical wording

When negating mathematical statements, it is important to write the opposite carefully.

For example:

• the negation of x > 3 is x ≤ 3

• the negation of x < 10 is x ≥ 10

• the negation of x = 4 is x ≠ 4

• the negation of x ≠ 7 is x = 7

A common mistake is to write the negation of x > 3 as x < 3. That is not correct, because it leaves out the possibility that x = 3. A correct negation must include every case in which the original statement fails.

Summary of the main negation rules

Here are the main patterns to remember:

• not (p or q) becomes not p and not q

• not (p and q) becomes not p or not q

• not (if p, then q) becomes p and not q

• not (for some, p) becomes for all, not p

• not (for all, p) becomes for some, not p

These rules appear again and again in logic, set theory, algebra, proof writing, and beyond. Once you understand them well, many later topics become much easier to follow.

Mini Practice

Try writing the negation of each statement before checking the answers.

1.

a > 2 or b < 5

2.

m = 0 and n ≠ 1

3.

If a number is divisible by 6, then it is even

4.

Some triangle is equilateral

5.

For all integers n, n² ≥ 0

6.

x < 7 and x ≠ 3

Mini Practice Answers

1.

a ≤ 2 and b ≥ 5

Because the negation of an or statement is an and statement, and each part must be negated.

2.

m ≠ 0 or n = 1

Because the negation of an and statement is an or statement.

3.

There exists a number that is divisible by 6 and not even

Because the negation of “if p, then q” is “p and not q.”

4.

No triangle is equilateral

Equivalent form: For every triangle, it is not equilateral.

Because the negation of some is for all ... not.

5.

For some integer n, n² < 0

Because the negation of for all is for some, and the negation of n² ≥ 0 is n² < 0.

6.

x ≥ 7 or x = 3

Because the negation of and becomes or, and each part must be reversed correctly.

Final thought

Negation may seem like a small idea at first, but it sits at the heart of clear mathematical thinking. Whether you are working with equations, conditions, or quantifiers, being able to negate a statement correctly helps you understand what a claim is really saying and what it would mean for that claim to fail.

That skill becomes especially valuable in proof-based mathematics, where a single badly written negation can derail an entire argument.

---

Need help with negations? If you’re in Winnipeg and looking for a tutor, Tutor Advance provides expert one-on-one support!

---