Uniqueness quantification

"Unique (mathematics)" redirects here. For other uses, see Unique (disambiguation).

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

The most common technique to proving unique existence is to first prove existence of entity with the desired condition; then, to assume there exist two entities (say, a and b) that 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 exactly one solution, we first show by demonstration that at least one solution exists, namely 3; the proof of this part is simply the calculation

${\displaystyle 3+2=5.\,}$

We now assume that there are two solutions, 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.

Both existence and uniqueness must be proven, in order to conclude that there exists exactly one solution.

An alternative way to prove uniqueness is to prove there exists a value ${\displaystyle a}$ satisfying the condition, and then proving that, for all ${\displaystyle x}$, the condition for ${\displaystyle x}$ implies ${\displaystyle x=a}$.

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,

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

which is the same as

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

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

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

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.[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"). For example, many concepts in category theory are defined to be unique up to isomorphism.