MATH11121 Chap.4 Quantifiers and Negation
Quantifiers and Negation
Quantifiers and Negation controls how variables are fixed, chosen and allowed to depend on earlier information. Universal claims need arbitrary elements, existential claims need witnesses, and their negations switch quantifier type while negating the predicate. Nested order matters because one witness may or may not depend on another variable.
What this chapter covers
- 01
Universal quantifier
- 02
Existential quantifier
- 03
Witness selection
- 04
Quantifier order
- 05
Negating quantifiers
- 06
Nested dependency
Worked example · free
Negate a nested statement
- 1Switch the outer universal quantifier to an existential quantifier.
- 1Switch the inner existential quantifier to a universal quantifier.
- 2Negate greater than as less than or equal while preserving both integer domains.
Key terms
- Universal quantifier
- The operator asserting that a predicate holds for every element of a domain.
- Existential quantifier
- The operator asserting that at least one domain element satisfies a predicate.
- Witness
- A specific domain element used to establish an existential claim.
Quantifiers and Negation FAQ
Why does quantifier order matter?
A variable chosen later may depend on variables fixed earlier. The claim that every x has some suitable y can allow a different y for each x, while one x working for every y requires a single fixed choice.
How do I negate a universal statement?
Replace the universal quantifier by an existential one and negate the governed predicate. The result asserts that at least one object in the same domain fails the original property.
Can one failed witness disprove an existential claim?
No. An existential claim allows any valid witness, so one unsuccessful choice proves only that the chosen object does not work. To disprove the claim, show that every object in the domain fails.
How do I check whether a witness may depend on x?
Read the quantifiers from left to right. If x is fixed before the witness variable is chosen, that later choice may use x. If one witness is chosen before x varies, the same witness must work for every permitted x.
What happens to an inequality under negation?
The negated relation must include every value excluded by the original one. Thus not less than becomes greater than or equal, while not greater than becomes less than or equal. Testing the equality boundary checks that the two statements partition the possibilities.
How do I keep domains visible in a nested statement?
Write each domain beside its quantifier and carry it unchanged through negation. After transforming the logical symbols, read the result as a sentence and confirm that every variable is introduced before it is used.
Exam move
Annotate quantified statements with the verbs fix, choose and vary. Read nested quantifiers from left to right and record which later choices may depend on earlier variables. Practise proving universal statements by fixing arbitrary elements and existential statements by supplying explicit witnesses with domain checks.
For negation, draw a box around the scope, switch each quantifier in order, and then negate the terminal predicate or implication. Test inequality endpoints so strict and non-strict relations are reversed correctly. Compare pairs whose quantifiers are swapped and find examples showing different truth values.
Keep separate error labels for lost domains, invalid dependency, unchanged quantifiers and partial negation of a compound predicate. When a proposed witness contains another variable, verify that variable was already introduced. After writing a negation, ask whether it describes exactly the failure of the original claim and whether both could ever be true together.
Finish with a complete sentence rather than a string of symbols whose scope the reader must guess. Draw dependency arrows beneath nested variables. An arrow from x to y means the choice of y may use x because x was fixed earlier. Compare this with a statement that chooses x before every possible y and note that no arrow back from y is permitted.
Create pairs of statements by swapping quantifiers over small finite domains, then test them exhaustively to see how order changes truth. For witness practice, give both a valid formula and an invalid formula that depends on a variable introduced too late. Explain the failure in terms of information available at the moment of choice.
Negate statements in layers: first the outer quantifier, then the next, then the connective, and finally the comparison. Write each intermediate line so a scope error can be found. Include inequalities at equality boundaries, membership claims, and implications with quantified conclusions. For each negation, translate the result into a counterexample story.
A negated universal should identify one failure; a negated existential should say every candidate fails. Practise proving and disproving the same quantified form so the different evidence burdens become clear. When checking an answer, restore the original by negating the result again. If the double negation does not return the starting structure, locate the first incorrect scope change.
Use sentences around symbols to show when a variable is fixed, chosen or allowed to vary. This writing makes dependency visible to both the marker and your future self.
Working through Quantifiers and Negation in MATH11121? Sia is AskSia’s AI Mathematics tutor — ask any MATH11121 Quantifiers and Negation question and get a clear, step-by-step explanation grounded in how MATH11121 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.