Misplaced Pages

Existential quantification

Type	Quantifier
Field	Mathematical logic
Statement	${\displaystyle \exists xP(x)}$ is true when ${\displaystyle P(x)}$ is true for at least one value of ${\displaystyle x}$.
Symbolic statement	${\displaystyle \exists xP(x)}$

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier ("∃x" or "∃(x)" or "(∃x)"). Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain. Some sources use the term existentialization to refer to existential quantification.

Quantification in general is covered in the article on quantification (logic). The existential quantifier is encoded as U+2203 ∃ THERE EXISTS in Unicode, and as \exists in LaTeX and related formula editors.

Basics

Consider the formal sentence

For some natural number ${\displaystyle n}$, ${\displaystyle n\times n=25}$.

This is a single statement using existential quantification. It is roughly analogous to the informal sentence "Either ${\displaystyle 0\times 0=25}$, or ${\displaystyle 1\times 1=25}$, or ${\displaystyle 2\times 2=25}$, or... and so on," but more precise, because it doesn't need us to infer the meaning of the phrase "and so on." (In particular, the sentence explicitly specifies its domain of discourse to be the natural numbers, not, for example, the real numbers.)

This particular example is true, because 5 is a natural number, and when we substitute 5 for n, we produce the true statement ${\displaystyle 5\times 5=25}$. It does not matter that "${\displaystyle n\times n=25}$" is true only for that single natural number, 5; the existence of a single solution is enough to prove this existential quantification to be true.

In contrast, "For some even number ${\displaystyle n}$, ${\displaystyle n\times n=25}$" is false, because there are no even solutions. The domain of discourse, which specifies the values the variable n is allowed to take, is therefore critical to a statement's trueness or falseness. Logical conjunctions are used to restrict the domain of discourse to fulfill a given predicate. For example, the sentence

For some positive odd number ${\displaystyle n}$, ${\displaystyle n\times n=25}$

is logically equivalent to the sentence

For some natural number ${\displaystyle n}$, ${\displaystyle n}$ is odd and ${\displaystyle n\times n=25}$.

The mathematical proof of an existential statement about "some" object may be achieved either by a constructive proof, which exhibits an object satisfying the "some" statement, or by a nonconstructive proof, which shows that there must be such an object without concretely exhibiting one.

Notation

In symbolic logic, "∃" (a turned letter "E" in a sans-serif font, Unicode U+2203) is used to indicate existential quantification. For example, the notation ${\displaystyle \exists {n}{\in }\mathbb {N} :n\times n=25}$ represents the (true) statement

There exists some ${\displaystyle n}$ in the set of natural numbers such that ${\displaystyle n\times n=25}$.

The symbol's first usage is thought to be by Giuseppe Peano in Formulario mathematico (1896). Afterwards, Bertrand Russell popularised its use as the existential quantifier. Through his research in set theory, Peano also introduced the symbols ${\displaystyle \cap }$ and ${\displaystyle \cup }$ to respectively denote the intersection and union of sets.

Properties

Negation

A quantified propositional function is a statement; thus, like statements, quantified functions can be negated. The ${\displaystyle \lnot \ }$ symbol is used to denote negation.

For example, if P(x) is the predicate "x is greater than 0 and less than 1", then, for a domain of discourse X of all natural numbers, the existential quantification "There exists a natural number x which is greater than 0 and less than 1" can be symbolically stated as:

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

This can be demonstrated to be false. Truthfully, it must be said, "It is not the case that there is a natural number x that is greater than 0 and less than 1", or, symbolically:

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

If there is no element of the domain of discourse for which the statement is true, then it must be false for all of those elements. That is, the negation of

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

is logically equivalent to "For any natural number x, x is not greater than 0 and less than 1", or:

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

Generally, then, the negation of a propositional function's existential quantification is a universal quantification of that propositional function's negation; symbolically,

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

(This is a generalization of De Morgan's laws to predicate logic.)

A common error is stating "all persons are not married" (i.e., "there exists no person who is married"), when "not all persons are married" (i.e., "there exists a person who is not married") is intended:

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

Negation is also expressible through a statement of "for no", as opposed to "for some":

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

Unlike the universal quantifier, the existential quantifier distributes over logical disjunctions:

${\displaystyle \exists {x}{\in }\mathbf {X} \,P(x)\lor Q(x)\to \ (\exists {x}{\in }\mathbf {X} \,P(x)\lor \exists {x}{\in }\mathbf {X} \,Q(x))}$

Rules of inference

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

Existential introduction (∃I) concludes that, if the propositional function is known to be true for a particular element of the domain of discourse, then it must be true that there exists an element for which the proposition function is true. Symbolically,

${\displaystyle P(a)\to \ \exists {x}{\in }\mathbf {X} \,P(x)}$

Existential instantiation, when conducted in a Fitch style deduction, proceeds by entering a new sub-derivation while substituting an existentially quantified variable for a subject—which does not appear within any active sub-derivation. If a conclusion can be reached within this sub-derivation in which the substituted subject does not appear, then one can exit that sub-derivation with that conclusion. The reasoning behind existential elimination (∃E) is as follows: If it is given that there exists an element for which the proposition function is true, and if a conclusion can be reached by giving that element an arbitrary name, that conclusion is necessarily true, as long as it does not contain the name. Symbolically, for an arbitrary c and for a proposition Q in which c does not appear:

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

${\displaystyle P(c)\to \ Q}$ must be true for all values of c over the same domain X; else, the logic does not follow: If c is not arbitrary, and is instead a specific element of the domain of discourse, then stating P(c) might unjustifiably give more information about that object.

The empty set

The formula ${\displaystyle \exists {x}{\in }\varnothing \,P(x)}$ is always false, regardless of P(x). This is because ${\displaystyle \varnothing }$ denotes the empty set, and no x of any description – let alone an x fulfilling a given predicate P(x) – exist in the empty set. See also Vacuous truth for more information.

As adjoint

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

See also

• Existential clause
• Existence theorem
• First-order logic
• Lindström quantifier
• List of logic symbols – for the unicode symbol ∃
• Quantifier variance
• Uniqueness quantification

Notes

1. Bergmann, Merrie (2014). The Logic Book. McGraw Hill. ISBN 978-0-07-803841-9.
2. "Predicates and Quantifiers". www.csm.ornl.gov. Retrieved 2020-09-04.
3. "1.2 Quantifiers". www.whitman.edu. Retrieved 2020-09-04.
4. Allen, Colin; Hand, Michael (2001). Logic Primer. MIT Press. ISBN 0262303965.
5. Stephen Webb (2018). Clash of Symbols. Springer Cham. pp. 210–211. doi:10.1007/978-3-319-71350-2. ISBN 978-3-319-71349-6.
6. Saunders Mac Lane, Ieke Moerdijk, (1992): Sheaves in Geometry and Logic Springer-Verlag ISBN 0-387-97710-4. See p. 58.

References

• Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-56881-262-0.

v t e Common logical symbols
∧  or  & and ∨ or ¬  or  ~ not → implies ⊃ implies, superset ↔  or  ≡ iff | nand ∀ universal quantification ∃ existential quantification ⊤ true, tautology ⊥ false, contradiction ⊢ entails, proves ⊨ entails, therefore ∴ therefore ∵ because
Philosophy portal Mathematics portal

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Logic symbols
• Quantifier (logic)