Skip to main content

Quantifier

Quantifiers are symbols that allow us to talk about parameters in predicates.

Two kinds:

info

Quantifiers allow us to form propositions out of predicates without filling in any specific value for parameters.

Existential Quantification​

The existential quantifier has the symbol ∃\exists and means "there exists".

∃x∈Z (x2=4)\exists x \in \mathbb{Z} \, (x^2 = 4)

The above expression means that "There exists xx from Z\mathbb{Z} such that x2=4x^2 = 4 is true".

tip

We don't get to known which value of xx works, just that some value of xx works.

Examples

Existential Quantifiers Examples:

  • ∃x∈S p(x)\exists x \in S \, p(x) means "There exists an xx in SS such that p(x)p(x) is true".
  • ∃x∈ANIMALS  x is a fish\exists x \in \text{ANIMALS } \, x \text{ is a fish} means that "There exists an xx in ANIMALS\text{ANIMALS} such that xx is a fish is true".
  • ∃x∈R (x∈Z)\exists x \in \mathbb{R} \, (x \in \mathbb{Z}) means that "There exists some real number xx such that xx is an integer".

Universal Quantification​

The universal quantifier has the symbol ∀\forall and means "for all".

∀x∈Z(x2≥0)\forall x \in \mathbb{Z}( x^2 \geq 0)

The above expression means that "For every xx in Z\mathbb{Z}, x2≥0x^2 \geq 0 is always true".

Examples

Universal Quantifiers Examples:

  • ∀x∈S p(x)\forall x \in S \, p(x) means that "For all xx from SS, p(x)p(x) is true".
  • ∀x∈ANIMALS (x is a cat)\forall x \in \text{ANIMALS} \, (x \text{ is a cat}) means that "For all xx in ANIMALS\text{ANIMALS}, xx is a cat".
  • ∀x∈Z (x∈R)\forall x \in \mathbb{Z} \, (x \in \mathbb{R}) mean that "All integers are real numbers".

Free Parameters​

Consider A(y)=∃x p(x,y)A(y) = \exists x \, p(x,y).

  • The parameter xx is quantified over, so we cannot fill it in.
  • The parameter yy is not quantified over, so we can fill it in.
  • yy is called a free parameter.
  • The truth value of A(y)A(y) depends on the value of parameter yy.
info

If there are no free parameters, then the predicate is fully quantified.

Necessary and Sufficient Conditions​

When ∀x (p(x)  ⟹  q(x))\forall x \, (p(x) \implies q(x)) we say:

  • p(x)p(x) is a sufficient condition for q(x)q(x).
  • q(x)q(x) is a necessary condition for p(x)p(x).

When ∀x p(x)  ⟺  q(x)\forall x \, p(x) \iff q(x) we say:

  • p(x)p(x) is necessary and sufficient for q(x)q(x).
  • q(x)q(x) is necessary and sufficient for p(x)p(x).
Example

Statement: "Squareness is a sufficient condition for rectangularity".

We can say that ∀x\forall x, if xx is a square, then x is a rectangle.

References​