# Uniqueness quantification

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

{{ safesubst:#invoke:Unsubst||$N=Unreferenced |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }} {{#invoke:Hatnote|hatnote}} 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

${\displaystyle \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

Proving uniqueness turns out to be mostly easier than that of existence or expressibility. The most common technique to proving uniqueness is to assume there exists two quantities (say, a and b) that satisfies the condition given, and then logically deducing 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

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

By transitivity of equality,

${\displaystyle a+2=b+2.\,}$

By cancellation,

${\displaystyle 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. We must say, however, that existence/expressibility must be proven before uniqueness, or else we cannot even assume the existence of those two quantities to begin with.

## 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

${\displaystyle \exists xP(x)\wedge \neg \exists x,y\,(P(x)\wedge P(y)\wedge (x\neq y))}$

where an equivalence is:

${\displaystyle \exists xP(x)\wedge \forall y\,(P(y)\to x=y).}$

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

${\displaystyle \exists xP(x)\wedge \forall y\,\forall z\,((P(y)\wedge P(z))\to y=z).}$

Another equivalent definition with the advantage of brevity is

${\displaystyle \exists x\,\forall y\,(P(y)\leftrightarrow x=y).}$

## Generalizations

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.