World Library  
Flag as Inappropriate
Email this Article

Uniqueness quantification

Article Id: WHEBN0000276894
Reproduction Date:

Title: Uniqueness quantification  
Author: World Heritage Encyclopedia
Language: English
Subject: Quantifier (logic), Counting quantification, ! (disambiguation), Binary function, Description logic
Collection: 1 (Number), Mathematical Terminology, Quantification
Publisher: World Heritage Encyclopedia

Uniqueness quantification

In mathematics and logic, the phrase "there is one and only one" is used to indicate that exactly one object with a certain property exists. In mathematical logic, this sort of quantification is known as uniqueness quantification or unique existential quantification.

Uniqueness quantification is often denoted with the symbols "∃!" or ∃=1". For example, the formal statement

\exists! n \in \mathbb{N}\,(n - 2 = 4)

may be read aloud as "there is exactly one natural number n such that n - 2 = 4".


  • Proving uniqueness 1
  • Reduction to ordinary existential and universal quantification 2
  • Generalizations 3
  • See also 4
  • References 5

Proving uniqueness

The most common technique to proving uniqueness is to first prove existence of entity with the desired condition; then, to assume there exist two entities (say, a and b) that should both satisfy the condition, and logically deduce their equality, i.e. a = b.

As a simple high school example, to show x + 2 = 5 has only one solution, we assume there are two solutions first, namely, a and b, satisfying x + 2 = 5. Thus

a + 2 = 5\text{ and }b + 2 = 5. \,

By transitivity of equality,

a + 2 = b + 2. \,

By cancellation,

a = b. \,

This simple example shows how a proof of uniqueness is done, the end result being the equality of the two quantities that satisfy the condition. However, that existence/expressibility must be proven before uniqueness, or else we cannot even assume the existence of those two quantities to begin with our current knowledge to date.

Reduction to ordinary existential and universal quantification

Uniqueness quantification can be expressed in terms of the existential and universal quantifiers of predicate logic by defining the formula ∃!x P(x) to mean literally,

\exists x\,( P(x) \, \wedge \neg \exists y\,(P(y) \wedge y \ne x))

which is the same as

\exists x \, ( P(x) \wedge \forall y\,(P(y) \to y = x)).

An equivalent definition that has the virtue of separating the notions of existence and uniqueness into two clauses, at the expense of brevity, is

\exists x\, P(x) \wedge \forall y\, \forall z\,((P(y) \wedge P(z)) \to y = z).

Another equivalent definition with the advantage of brevity is

\exists x\,\forall y\,(P(y) \leftrightarrow y = x).


One generalization of uniqueness quantification is counting quantification. This includes both quantification of the form "exactly k objects exist such that …" as well as "infinitely many objects exist such that …" and "only finitely many objects exist such that…". The first of these forms is expressible using ordinary quantifiers, but the latter two cannot be expressed in ordinary first-order logic.[1]

Uniqueness depends on a notion of equality. Loosening this to some coarser equivalence relation yields quantification of uniqueness up to that equivalence (under this framework, regular uniqueness is "uniqueness up to equality"). Likewise, many concepts in category theory are defined to be unique up to isomorphism.

See also


  • Kleene, Stephen (1952). Introduction to Metamathematics. Ishi Press International. p. 199. 
  • Andrews, Peter B. (2002). An introduction to mathematical logic and type theory to truth through proof (2. ed.). Dordrecht: Kluwer Acad. Publ. p. 233.  
  1. ^ This is a consequence of the compactness theorem.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.