Universal quantification

Universal quantification

Type	Quantifier
Field	Mathematical logic
Statement	${\displaystyle \forall xP(x)}$ is true when ${\displaystyle P(x)}$ is true for all values of ${\displaystyle x}$.
Symbolic statement	${\displaystyle \forall xP(x)}$

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

It is usually denoted by the turned A (∀) logical operator symbol, which, when used together with a predicate variable, is called a universal quantifier ("∀x", "∀(x)", or sometimes by "(x)" alone). Universal quantification is distinct from existential quantification ("there exists"), which only asserts that the property or relation holds for at least one member of the domain.

Quantification in general is covered in the article on quantification (logic). The universal quantifier is encoded as U+2200 ∀ FOR ALL in Unicode, and as \forall in LaTeX and related formula editors.

Suppose it is given that

2·0 = 0 + 0, and 2·1 = 1 + 1, and 2·2 = 2 + 2, ..., and 2 · 100 = 100 + 100, and ..., etc.

This would seem to be an infinite logical conjunction because of the repeated use of "and". However, the "etc." cannot be interpreted as a conjunction in formal logic, Instead, the statement must be rephrased:

For all natural numbers n, one has 2·n = n + n.

This is a single statement using universal quantification.

This statement can be said to be more precise than the original one. While the "etc." informally includes natural numbers, and nothing more, this was not rigorously given. In the universal quantification, on the other hand, the natural numbers are mentioned explicitly.

This particular example is true, because any natural number could be substituted for n and the statement "2·n = n + n" would be true. In contrast,

For all natural numbers n, one has 2·n > 2 + n

is false, because if n is substituted with, for instance, 1, the statement "2·1 > 2 + 1" is false. It is immaterial that "2·n > 2 + n" is true for most natural numbers n: even the existence of a single counterexample is enough to prove the universal quantification false.

On the other hand, for all composite numbers n, one has 2·n > 2 + n is true, because none of the counterexamples are composite numbers. This indicates the importance of the domain of discourse, which specifies which values n can take.^{[note 1]} In particular, note that if the domain of discourse is restricted to consist only of those objects that satisfy a certain predicate, then for universal quantification this requires a logical conditional. For example,

For all composite numbers n, one has 2·n > 2 + n

is logically equivalent to

For all natural numbers n, if n is composite, then 2·n > 2 + n.

Here the "if ... then" construction indicates the logical conditional.

In symbolic logic, the universal quantifier symbol ${\displaystyle \forall }$ (a turned "A" in a sans-serif font, Unicode U+2200) is used to indicate universal quantification. It was first used in this way by Gerhard Gentzen in 1935, by analogy with Giuseppe Peano's ${\displaystyle \exists }$ (turned E) notation for existential quantification and the later use of Peano's notation by Bertrand Russell.^[1]

For example, if P(n) is the predicate "2·n > 2 + n" and N is the set of natural numbers, then

${\displaystyle \forall n\!\in \!\mathbb {N} \;P(n)}$

is the (false) statement

"for all natural numbers n, one has 2·n > 2 + n".

Similarly, if Q(n) is the predicate "n is composite", then

${\displaystyle \forall n\!\in \!\mathbb {N} \;{\bigl (}Q(n)\rightarrow P(n){\bigr )}}$

is the (true) statement

"for all natural numbers n, if n is composite, then 2·n > 2 + n".

Several variations in the notation for quantification (which apply to all forms) can be found in the Quantifier article.

The negation of a universally quantified function is obtained by changing the universal quantifier into an existential quantifier and negating the quantified formula. That is,

${\displaystyle \lnot \forall x\;P(x)\quad {\text{is equivalent to}}\quad \exists x\;\lnot P(x)}$

where ${\displaystyle \lnot }$ denotes negation.

For example, if P(x) is the propositional function "x is married", then, for the set X of all living human beings, the universal quantification

Given any living person x, that person is married

is written

${\displaystyle \forall x\in X\,P(x)}$

This statement is false. Truthfully, it is stated that

It is not the case that, given any living person x, that person is married

or, symbolically:

${\displaystyle \lnot \ \forall x\in X\,P(x)}$.

If the function P(x) is not true for every element of X, then there must be at least one element for which the statement is false. That is, the negation of ${\displaystyle \forall x\in X\,P(x)}$ is logically equivalent to "There exists a living person x who is not married", or:

${\displaystyle \exists x\in X\,\lnot P(x)}$

It is erroneous to confuse "all persons are not married" (i.e. "there exists no person who is married") with "not all persons are married" (i.e. "there exists a person who is not married"):

${\displaystyle \lnot \ \exists x\in X\,P(x)\equiv \ \forall x\in X\,\lnot P(x)\not \equiv \ \lnot \ \forall x\in X\,P(x)\equiv \ \exists x\in X\,\lnot P(x)}$

The universal (and existential) quantifier moves unchanged across the logical connectives ∧, ∨, →, and ↚, as long as the other operand is not affected;^[2] that is:

${\displaystyle {\begin{aligned}P(x)\land (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\land Q(y))\\P(x)\lor (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\lor Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\to (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\to Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\nleftarrow (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\nleftarrow Q(y))\\P(x)\land (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\land Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\lor (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\lor Q(y))\\P(x)\to (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\to Q(y))\\P(x)\nleftarrow (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\nleftarrow Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \end{aligned}}}$

Conversely, for the logical connectives ↑, ↓, ↛, and ←, the quantifiers flip:

${\displaystyle {\begin{aligned}P(x)\uparrow (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\uparrow Q(y))\\P(x)\downarrow (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\downarrow Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\nrightarrow (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\nrightarrow Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\gets (\exists {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \forall {y}{\in }\mathbf {Y} \,(P(x)\gets Q(y))\\P(x)\uparrow (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\uparrow Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\P(x)\downarrow (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\downarrow Q(y))\\P(x)\nrightarrow (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\nrightarrow Q(y))\\P(x)\gets (\forall {y}{\in }\mathbf {Y} \,Q(y))&\equiv \ \exists {y}{\in }\mathbf {Y} \,(P(x)\gets Q(y)),&{\text{provided that }}\mathbf {Y} \neq \emptyset \\\end{aligned}}}$

A rule of inference is a rule justifying a logical step from hypothesis to conclusion. There are several rules of inference which utilize the universal quantifier.

Universal instantiation concludes that, if the propositional function is known to be universally true, then it must be true for any arbitrary element of the universe of discourse. Symbolically, this is represented as

${\displaystyle \forall {x}{\in }\mathbf {X} \,P(x)\to P(c)}$

where c is a completely arbitrary element of the universe of discourse.

Universal generalization concludes the propositional function must be universally true if it is true for any arbitrary element of the universe of discourse. Symbolically, for an arbitrary c,

${\displaystyle P(c)\to \ \forall {x}{\in }\mathbf {X} \,P(x).}$

The element c must be completely arbitrary; else, the logic does not follow: if c is not arbitrary, and is instead a specific element of the universe of discourse, then P(c) only implies an existential quantification of the propositional function.

By convention, the formula ${\displaystyle \forall {x}{\in }\emptyset \,P(x)}$ is always true, regardless of the formula P(x); see vacuous truth.

The universal closure of a formula φ is the formula with no free variables obtained by adding a universal quantifier for every free variable in φ. For example, the universal closure of

${\displaystyle P(y)\land \exists xQ(x,z)}$

is

${\displaystyle \forall y\forall z(P(y)\land \exists xQ(x,z))}$.

In category theory and the theory of elementary topoi, the universal quantifier can be understood as the right adjoint of a functor between power sets, the inverse image functor of a function between sets; likewise, the existential quantifier is the left adjoint.^[3]

For a set ${\displaystyle X}$, let ${\displaystyle {\mathcal {P}}X}$ denote its powerset. For any function ${\displaystyle f:X\to Y}$ between sets ${\displaystyle X}$ and ${\displaystyle Y}$, there is an inverse image functor ${\displaystyle f^{*}:{\mathcal {P}}Y\to {\mathcal {P}}X}$ between powersets, that takes subsets of the codomain of f back to subsets of its domain. The left adjoint of this functor is the existential quantifier ${\displaystyle \exists _{f}}$ and the right adjoint is the universal quantifier ${\displaystyle \forall _{f}}$.

That is, ${\displaystyle \exists _{f}\colon {\mathcal {P}}X\to {\mathcal {P}}Y}$ is a functor that, for each subset ${\displaystyle S\subset X}$, gives the subset ${\displaystyle \exists _{f}S\subset Y}$ given by

${\displaystyle \exists _{f}S=\{y\in Y\;|\;\exists x\in X.\ f(x)=y\quad \land \quad x\in S\},}$

those ${\displaystyle y}$ in the image of ${\displaystyle S}$ under ${\displaystyle f}$. Similarly, the universal quantifier ${\displaystyle \forall _{f}\colon {\mathcal {P}}X\to {\mathcal {P}}Y}$ is a functor that, for each subset ${\displaystyle S\subset X}$, gives the subset ${\displaystyle \forall _{f}S\subset Y}$ given by

${\displaystyle \forall _{f}S=\{y\in Y\;|\;\forall x\in X.\ f(x)=y\quad \implies \quad x\in S\},}$

those ${\displaystyle y}$ whose preimage under ${\displaystyle f}$ is contained in ${\displaystyle S}$.

The more familiar form of the quantifiers as used in first-order logic is obtained by taking the function f to be the unique function ${\displaystyle !:X\to 1}$ so that ${\displaystyle {\mathcal {P}}(1)=\{T,F\}}$ is the two-element set holding the values true and false, a subset S is that subset for which the predicate ${\displaystyle S(x)}$ holds, and

${\displaystyle {\begin{array}{rl}{\mathcal {P}}(!)\colon {\mathcal {P}}(1)&\to {\mathcal {P}}(X)\\T&\mapsto X\\F&\mapsto \{\}\end{array}}}$

${\displaystyle \exists _{!}S=\exists x.S(x),}$

which is true if ${\displaystyle S}$ is not empty, and

${\displaystyle \forall _{!}S=\forall x.S(x),}$

which is false if S is not X.

The universal and existential quantifiers given above generalize to the presheaf category.

• Existential quantification
• First-order logic
• List of logic symbols—for the Unicode symbol ∀

• Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-56881-262-0.
• Franklin, J. and Daoud, A. (2011). Proof in Mathematics: An Introduction. Kew Books. ISBN 978-0-646-54509-7.{{cite book}}: CS1 maint: multiple names: authors list (link) (ch. 2)

• The dictionary definition of every at Wiktionary