For All and There Exists

Every case, against merely some case.

For all

A quantifier says how many cases a claim covers. "For all", also read "for every", claims something of every case in a stated set. "For all real numbers n, n² ≥ 0" claims that the square of every real number is at least 0, with no exception. This is the universal quantifier.

One exception destroys a for-all claim. "For all whole numbers n, n is even" is false, because 3 is odd.

The set the claim ranges over is part of the claim. "For all whole numbers n, n² ≥ n" is true: 0² = 0, 1² = 1, and every larger whole number has n² > n. "For all real numbers n, n² ≥ n" is false: n = 1/2 gives n² = 1/4, which is less than 1/2.

There exists

"There exists" claims only that at least one case in the set has the property. This is the existential quantifier. "There exists a whole number n with n² = 49" is true, and n = 7 is enough to show it.

The set matters here too. "There exists a whole number n with n² = 2" is false, since 1² = 1 and 2² = 4 and the squares of larger whole numbers are larger still. "There exists a real number n with n² = 2" is true, with n = √2.

Proved and broken in opposite ways

A for-all claim about the whole numbers covers infinitely many cases, so it is proved only by an argument that reaches every case. Checking a hundred examples is not enough. It is broken by one example that fails.

A there-exists claim works the other way. One example that works proves it. To break it you must show that no case works, which is a claim about every case and needs an argument.

So "every prime is odd" falls to the single prime 2, and "some square ends in 6" is proved by 4 × 4 = 16. "There exists a whole number n with n² = 50" is broken by an argument: 7² = 49 and 8² = 64, so no whole number has a square of exactly 50.

6x₁x₂x₃x₄x₅x₆x₇x₈∀x: x ≤ 6 true∃x: x > 6 false

every x ≤ 6, so ∀x: x ≤ 6 is true and ∃x: x > 6 is false: the two statements are each other's negation and always disagree

Lift x₅ above 6 and read both statements

Eight values and the line at 6. The two claims at the top are for all x, x ≤ 6, and there exists x with x > 6. Lift x₅ above the line: one value is enough to make the first claim false and the second true.

The order of quantifiers

When a statement has two quantifiers, their order changes its meaning. Over the whole numbers, "for all n, there exists m with m > n" says: whatever n you are given, you can find a larger m. It is true, because m = n + 1 works for every n.

"There exists m, for all n, m > n" says something much stronger: one single m is larger than every whole number at once. That would make m larger than itself. Any m you choose fails at n = m, since m > m is false. So the second statement is false.

In the first statement, m is chosen after n and may depend on it. In the second, m must be chosen first and then work for every n. "Every person has a mother" and "there is a person who is the mother of everyone" use the same two quantifiers in opposite orders, and only the first is true.

012345n + 11234563 > nyesyesyesnonono

Each column is a whole number n. The first row gives a larger number for each n, namely n + 1, so for all n there exists a larger m. The second row tries the single number 3 against every n, and it fails from n = 3 on. Any other choice of m fails in the same way at n = m.

The usual mistakes

Proving a for-all claim with examples. n² ≥ n holds for n = 0, 1, 2 and 3, and that says nothing about the whole numbers not tried. The argument has to cover them all.

Breaking a there-exists claim with one example. n = 3 does not have n² = 50, but that leaves every other n untried. The claim is false because no whole number works, as 7² = 49 and 8² = 64 show.

Swapping the order of two quantifiers as if it changed nothing. "For all n, there exists m with m > n" is true of the whole numbers, and "there exists m, for all n, m > n" is false.

Leaving out the set. "Some n has n² = 2" is true for real numbers and false for whole numbers.

Lifeguard trainees

In the application below, four trainees take four assessments. "Some trainee passed every assessment" needs one trainee with every pass, a full row in the grid of passes. "Every assessment was passed by some trainee" needs only a pass in every column, possibly from a different trainee each time, and the two answers differ.

Worked example: Lifeguard Trainees, Four Assessments, and Claims with "Some" and "Every"

Question Four trainees on a lifeguard course take four assessments: swimming, rescue, first aid and a written test. Ana passes swimming, rescue and the written test. Ben passes rescue and first aid. Chen passes swimming, first aid and the written test. Dev passes only the written test. (a) Is "Some trainee passed every assessment" true? Is "Every assessment was passed by some trainee" true? (b) Write the negation of "Every trainee passed some assessment" without "not" at the front, and decide whether the negation is true.

  1. 1.Draw the grid of passes. For "Some trainee passed every assessment", look for a full row. Ana and Chen each passed 3 of the 4, Ben passed 2 and Dev passed 1, so no row is full.

    swimrescuefirst aidwrittentotalAna3Ben2Chen3Dev1
    swimrescueaidwrittentotalAna3Ben2Chen3Dev1
    No row is full: the most any trainee passed is 3 of the 4.
  2. 2.For "Every assessment was passed by some trainee", check each column. Swimming was passed by Ana, rescue by Ana, first aid by Ben and the written test by Ana, so every column holds a pass.

    swimrescuefirst aidwrittentotalAna3Ben2Chen3Dev1
    swimrescueaidwrittentotalAna3Ben2Chen3Dev1
    Each column holds a pass: Ana, Ana, Ben and Ana.
  3. 3.(a) "Some trainee passed every assessment" is false, and "Every assessment was passed by some trainee" is true. The same two quantifiers in the other order make a different claim.

    swimrescuefirst aidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.
    swimrescueaidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.
    (a) "Some trainee passed every assessment" is false; "every assessment was passed by some trainee" is true.
  4. 4.To negate "for every trainee there is some assessment the trainee passed", change "every" to "some" and "some" to "every", and negate what is claimed: "Some trainee failed every assessment."

    swimrescuefirst aidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.Negation: some trainee failed every assessment
    swimrescueaidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.Negation: some trainee failed every assessment
    The negation of "every trainee passed some" is "some trainee failed every".
  5. 5.(b) The negation needs a row with no pass at all. Every trainee passed at least one assessment (Dev passed the written test), so the negation is false. Check: the original statement is then true, and exactly one of a statement and its negation is true.

    swimrescuefirst aidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.Negation: some trainee failed every assessmentEvery row has a pass, so the negation is false
    swimrescueaidwrittentotalAna3Ben2Chen3Dev1A full row: none. A pass in every column: yes.Negation: some trainee failed every assessmentEvery row has a pass, so the negation is false
    (b) No row is empty, so the negation is false.

Answer: (a) "Some trainee passed every assessment" is false (the most any trainee passed is 3 of the 4); "Every assessment was passed by some trainee" is true. (b) "Some trainee failed every assessment"; it is false, because each trainee passed at least 1 assessment.

Common mistakes

  • Treating the two statements in (a) as the same claim. "Some trainee passed every assessment" needs one trainee to pass all four; "Every assessment was passed by some trainee" lets a different trainee pass each one.
  • Negating "Every trainee passed some assessment" as "Every trainee failed some assessment". That changes only the inside, and it is true here (Ana failed first aid) while the original is also true, so it cannot be the negation.

More mathematical statements problems, worked step by step →

Practice For All and There Exists in the app