JC1 H3 Maths Bukit Timah | Quantifiers & Negation

JC1 H3 Mathematics Tutor Bukit Timah | Quantifiers, Negation and Counterexamples. Did you know? Changing two little words in a mathematical sentence can reverse the meaning of an entire theorem. “Every number has a property” is not the same as “some number has that property”, and neither can be disproved in quite the same way.

For JC1 Mathematics students around Bukit Timah, Beauty World and Sixth Avenue, this is a useful introduction to the language of H3 Mathematics: for all, there exists, not, implies, and there exists a unique. These ideas also make everyday H2 functions, inequalities and proof explanations more precise.

This is a learning guide, not a claim that every JC1 student is enrolled in H3 Mathematics. The Singapore–Cambridge H3 Mathematics syllabus 9820 assumes H2 content; students should check their own school’s subject arrangements and selection requirements. We will begin with short questions, build to nested quantifiers and then return to exam-style reasoning habits.

Quick answer: the four logical patterns worth knowing

For all: ∀x∈D, P(x). Every permitted x in the domain D satisfies the property. One valid counterexample disproves the statement.
There exists: ∃x∈D such that P(x). At least one permitted x has the property. A single valid example establishes existence.
There exists a unique: ∃!x∈D such that P(x). Exactly one permitted x works. A complete proof needs both existence and uniqueness.
Not: negation reverses what the statement claims. “Not every” means there is at least one exception; “none” means there are no examples at all.

The domain D is not a footnote. “An integer”, “a positive integer”, “a real number”, “a complex number” and “a number between zero and one” can produce different answers for the same formula. Before checking a quantified statement, circle the domain.

Worked example 1: a claim about all real numbers

Claim: for every real number x, x²≥0. Is this true? Yes. The square of a real number is the product of that real number with itself, so it cannot be negative. In notation, ∀x∈ℝ, x²≥0.

The claim includes negative numbers, zero and positive numbers. Checking x=−3, x=0 and x=5 helps a learner see the pattern, but those three checks are not a proof for every real number. The general property of a real square provides the missing reasoning.

Important distinction: this statement says something about every allowed input, not about how many of those inputs produce equality. Indeed x²=0 occurs only at x=0, even though x²≥0 holds everywhere.

Worked example 2: when one exception is enough

Claim: for every real number x, x²≥x. This sounds plausible because squares look positive, but try x=1/2. Then x²=1/4, which is smaller than x=1/2.

Therefore the universal statement is false. The single valid counterexample x=1/2 is enough. We have not proved that x²<x for every real x—that would be a different and also false statement.

Can we find exactly where the proposed inequality fails? Factor x²−x=x(x−1). The product is negative when 0<x<1, zero at x=0 or x=1, and nonnegative outside the interval. This analysis explains the complete pattern behind the counterexample.

Did you know? Sometimes students spend a page trying to prove a false universal claim. Testing a small fractional input early can save time and turn the problem into an investigation.

Worked example 3: the domain changes the truth value

Now change the previous claim to: for every integer n, n²≥n. This revised statement is true. Why? n²−n=n(n−1). If n≤0, both factors are nonpositive, giving a nonnegative product. If n≥1, both factors are nonnegative.

Every integer falls into one of those two cases. The real counterexample x=1/2 no longer belongs to the domain. This is why a solution that ignores the word “integer” or “real” can reach a conclusion that is logically correct for the wrong question.

The two statements differ only in their input domains, but one is false and the other true. A careful tutor asks students to justify the domain before they choose a proof strategy.

Worked example 4: prove an existential statement

Claim: there exists a positive integer n such that n²−5n+6=0. To establish existence, try n=2. Then 2²−5(2)+6=4−10+6=0. Therefore the claim is true.

We do not need to solve the entire quadratic to prove that at least one suitable positive integer exists. However, solving (n−2)(n−3)=0 gives n=2 or n=3, which shows the witness is not unique.

A valid existential witness should be displayed and verified against every requirement. A negative solution would not prove the stated claim, even if it satisfied the algebraic equation.

Worked example 5: the same expression, two number systems

Claim A: there exists a real number x such that x²=−1. This is false because the square of any real number is nonnegative.

Claim B: there exists a complex number z such that z²=−1. This is true: z=i is one witness, since i²=−1. There is also the witness z=−i.

A claim can become true when its domain expands. That does not mean the original real-number claim was “almost true”; the quantifier and its domain together determine the statement.

Worked example 6: prove that no solution exists

Consider the claim “there exists a positive integer n with 2n+1=0”. We can show it is false: if n≥1, then 2n+1≥3, so the expression cannot be zero.

The negation of “there exists a positive integer n satisfying 2n+1=0” is therefore the universal statement “for every positive integer n, 2n+1≠0”. Notice the change: an existential claim fails only when no permitted value works.

Providing two or three failed guesses is not a proof of non-existence. We need a reason that excludes every eligible value, as the lower bound does here.

How to negate “for all” and “there exists”

The two fundamental logical rules can be read in plain language: the negation of “for every x, P(x)” is “there exists an x for which P(x) is false”. The negation of “there exists an x with P(x)” is “for every x, P(x) is false”.

In symbols, ¬(∀x P(x)) is equivalent to ∃x ¬P(x), while ¬(∃x P(x)) is equivalent to ∀x ¬P(x). These are not equations to memorise in isolation; they state how a counterexample and a non-existence proof work.

If a school notice says “every student submitted a form”, its negation is “at least one student did not submit a form”, not “every student failed to submit”. The same logic operates with mathematical functions and integers.

Worked example 7: negate an inequality

Statement: for every real x, x²≥x. Its precise negation is: there exists a real x with x²<x. The witness x=1/2 verifies this negation.

It would be wrong to negate the claim as “for every real x, x²<x”. That flips the inequality but keeps the universal quantifier. The resulting statement is too strong and false; for x=2, x²=4 is not smaller than 2.

When you negate a quantified statement, change the quantifier and negate the property. Also be precise with signs: the negation of a≥b is a<b, not a≤b.

Worked example 8: negate an existence claim

Statement: there exists a real x such that x²+1=0. Its negation is: for every real x, x²+1≠0. We can prove the negation because x²≥0 implies x²+1≥1.

The statement’s negation is true, so the original existence claim is false. That is a complete non-existence proof. Saying “I tried x=0 and x=1 and got no root” would not provide the same guarantee.

Worked example 9: why the order of quantifiers matters

Consider the real-number statement: for every real x, there exists a real y such that y>x. This is true. Given any x, choose y=x+1. That gives an explicit witness, although the witness depends on x.

Now reverse the order: there exists a real y such that for every real x, y>x. This is false. If a candidate y is proposed, choose x=y+1. Then y is not greater than x.

Did you know? The order decides whether you may choose a new y after seeing x or must commit to one fixed y before x is specified. This distinction appears in definitions involving functions, bounds and limits.

Worked example 10: a fixed zero versus a variable zero

Statement A: for every real x, there exists a real y such that x+y=0. This is true: given x, choose y=−x.

Statement B: there exists a real y such that for every real x, x+y=0. This is false. A fixed y cannot simultaneously make the equations 0+y=0 and 1+y=0 true; the first requires y=0 and the second requires y=−1.

These two statements use the same equation and same domains. Only the quantifier order differs. When explaining this in a tutorial, ask whether the chosen value is allowed to depend on the input.

Worked example 11: what exactly does “there exists a unique” mean?

Claim: there exists a unique nonnegative real x such that x²=16. The value x=4 works, proving existence. If y is nonnegative and y²=16, then y=4 or y=−4; the domain excludes −4. So there is only one.

Compare that with the claim “there exists a unique real x such that x²=16”. This is false because x=4 and x=−4 are distinct real solutions. An existential statement can be true while its uniqueness refinement is false.

Formally, prove ∃!x P(x) by establishing ∃x P(x), and then proving that any a and b satisfying P must obey a=b. Merely showing one possible x does not establish uniqueness.

Worked example 12: uniqueness of a linear solution

For each real t, there exists a unique real x such that 3x−5=t. To show existence, set x=(t+5)/3. Direct substitution gives 3[(t+5)/3]−5=t.

For uniqueness, suppose both a and b satisfy 3x−5=t. Then 3a−5=3b−5, so 3a=3b and a=b. This example combines two quantifiers: “for every real t” comes first, and “there exists a unique x” follows.

The solution x depends on t. It is not one universal x that works for every value of t. That dependency should be stated clearly in a good mathematical explanation.

Worked example 13: how to negate an implication

Let P mean “n is divisible by four” and Q mean “n is even”. The implication P⇒Q is true for integers because 4k=2(2k).

The negation of an implication P⇒Q is P and not Q. To disprove P⇒Q, we would need an integer that is divisible by four and not even. No such integer exists, so the implication holds.

For comparison, “if n is even, then n is divisible by four” is false. The counterexample n=6 has the hypothesis true and the conclusion false. A counterexample must satisfy the beginning of the proposed implication; a value for which P is false does not disprove P⇒Q.

Worked example 14: the subtle difference between converse and negation

Original: if an integer n is divisible by six, then it is divisible by three. Converse: if n is divisible by three, then it is divisible by six. The converse is false, as n=3 shows.

Negation of the original: there exists an integer divisible by six but not by three. That is false, because every multiple of six is a multiple of three. The converse and the negation are different statements, even though students sometimes confuse them.

For an adjacent two-way logic exercise, see necessary and sufficient conditions with worked H2 examples. When a claim includes “if and only if”, you must establish both implications, not the original and its negation.

Worked example 15: finite cases can prove a universal claim

Claim: for every integer n, n² has remainder 0 or 1 upon division by four. Every integer is either even or odd. If n=2k, then n²=4k², so its remainder is zero.

If n=2k+1, then n²=4k(k+1)+1, so its remainder is one. These two cases exhaust all integers, completing a universal proof. We did not check a few integers randomly; we considered an exhaustive classification.

This distinction is worth practising before tackling more advanced mathematical reasoning. A complete classification of cases is a valid general proof, but a collection of examples with no guarantee of completeness is not.

Worked example 16: when a plausible conjecture fails

Look at the expression n²+n+41 for nonnegative integers n. It produces prime values at several small choices, including n=0, which gives 41, and n=1, which gives 43. A tempting conjecture is that the expression is prime for every nonnegative integer n.

But at n=41, the expression is 41²+41+41=41×43, which is composite. That one witness defeats the universal conjecture. The lesson is not that pattern hunting is bad; it is that a conjecture still needs proof.

In H3-style mathematical investigation, students learn to form a conjecture, test it, find exceptions and reformulate the result. A failed claim can become a valuable discovery when the exception explains a hidden assumption.

A fast way for parents to check mathematical explanations

Ask the learner to finish one of these sentences in their own words: “To prove every value works, I would need to…”, “To show that some value works, I would need to…”, and “To show a statement about every number is false, I need one number such that…”.

A good explanation separates three activities: testing a statement, proving it for a whole domain, and disproving it with a valid counterexample. Lengthy algebra does not replace the correct logical task.

Do not worry if a student initially avoids ∀ or ∃ symbols. Correct English is a productive starting point. Introduce the notation after the meaning is secure, and keep both versions side by side.

A three-student tutorial routine that builds confidence

Give each student one statement, for example “all positive integers have a larger positive integer”. Ask one to translate it into quantifiers, another to construct a witness for an arbitrary input, and the third to write its negation. Rotate the tasks in the next question.

Next, change the domain from positive integers to real numbers, or change “for all” to “there exists”. This forces students to attend to meaning instead of reproducing the first solution.

Finally, wait several days and give a fresh, unlabelled question. The independent check is whether the student notices the quantifier before deciding whether to prove, disprove or construct.

Independent practice: eight quick questions

Q1. Negate “every real number x satisfies x²≥0”.
Q2. Decide whether there exists an integer n such that n²=5.
Q3. Negate “there exists a positive integer n with n²=9”.
Q4. Is “for every real x there exists real y with x+y=1” true?
Q5. Is “there exists real y such that for every real x, x+y=1” true?
Q6. Is there a unique nonnegative solution to x²=25?
Q7. Disprove “every real x satisfies x²≥x” with one input.
Q8. To disprove “if n is even then n is divisible by four”, what must your n satisfy?

Answer explanations

A1: there exists a real x with x²<0. That negation is false, matching the truth of the original. A2: false, because 5 is not a perfect square of any integer. A3: every positive integer n satisfies n²≠9; that negation is false because n=3 is a witness for the original.

A4: true. Choose y=1−x after x is specified. A5: false. A fixed y cannot make both x=0 and x=1 satisfy x+y=1. A6: yes, x=5 is the only nonnegative solution.

A7: x=1/2, because 1/4<1/2. A8: choose an even integer not divisible by four, such as n=2 or n=6. Your example must make the hypothesis true and the conclusion false.

Six misconceptions that frequently survive rote practice

Swapping “not all” for “none”: the negation of “all” requires just one exception.
Confusing truth and proof: several correct numerical examples may support a conjecture but do not establish it universally.
Losing the domain: an example outside the stated set is irrelevant, however persuasive it looks.
Reversing nested quantifiers: “each input has an output” does not mean one fixed output works for every input.
Proving existence but claiming uniqueness: a verified witness establishes at least one, not exactly one.
Disproving an implication with a false hypothesis: a counterexample must satisfy P while violating Q.

Frequently asked questions

Are quantifiers and negation officially included in H3 Mathematics?

Yes. The official Singapore–Cambridge 2027 H3 Mathematics 9820 syllabus explicitly lists quantifiers, conditionals, logical connectives, converse, inverse, contrapositive and negation. The syllabus assumes knowledge of H2 Mathematics; these examples are introductory preparation rather than actual examination questions.

Can a graphing calculator prove “for every”?

A calculator is useful for exploring examples but does not generally verify an infinite domain. To prove a statement about all inputs, construct an argument covering all allowed values, such as a property of squares or an exhaustive classification.

What is the difference between a witness and a counterexample?

A witness is a permitted value that establishes an existential claim. A counterexample is a permitted value that defeats a universal claim. The same numerical choice can be described differently depending on the statement under examination.

Does an H3 tutor guarantee selection into H3 Mathematics?

No. A tutor can help with clarity, reasoning and practice, but schools control their own H3 offerings and selection requirements. JC1 learners should secure their current H2 foundations.

The takeaway: identify the claim before starting the algebra

Did you know? The difference between a strong proof and a flawed one can be a single word: “every”, “some”, “unique” or “not”. A student who learns to parse those words accurately can choose the correct kind of argument, spot hidden domains and avoid spending time proving the wrong statement.

For the official examination framework, consult the SEAB 2027 A-Level syllabus directory. For a learning route, see the JC1 H2-to-H3 readiness guide and proof by induction.

The unchanged eduKateSG small-group Mathematics reference describes its established three-student tutorial approach near Sixth Avenue MRT. It does not establish current JC H3 specialist availability. To enquire about appropriate Bukit Timah JC Mathematics support, contact eduKate Singapore and ask about tutor expertise, teaching arrangements, fees and timetable. The Bukit Timah Tuition Hub provides other learning routes.