Uniqueness quantification
In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition.
≈ 6 min read
Uniqueness quantification. encyclopegia.org, snapshot enwiki-001352045701. /a/uniqueness-quantification
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition.[1] This sort of quantification is known as uniqueness quantification or unique existential quantification, and is often denoted with the symbols "∃!"[2] or "∃=1". It is defined to mean there exists an object with the given property, and all objects with this property are equal.
For example, the formal statement
- ∃!n∈ℕ(n−2=4)
may be read as "there is exactly one natural number n such that n−2=4".
Proving uniqueness
edit edit sourceThe most common technique to prove the unique existence of an object is to first prove the existence of the entity with the desired condition, and then to prove that any two such entities (say, a and b) must be equal to each other (i.e. a=b).
For example, to show that the equation x+2=5 has exactly one solution, one would first start by establishing that at least one solution exists, namely 3; the proof of this part is simply the verification that the equation below holds:
- 3+2=5.
To establish the uniqueness of the solution, one would proceed by assuming that there are two solutions, namely a and b, satisfying x+2=5. That is,
- a+2=5 and b+2=5.
Then since equality is a transitive relation,
- a+2=b+2.
Subtracting 2 from both sides then yields
- a=b,
which completes the proof that 3 is the unique solution of x+2=5.
In general, both existence (there exists at least one object) and uniqueness (there exists at most one object) must be proven, in order to conclude that there exists exactly one object satisfying a said condition.
An alternative way to prove uniqueness is to prove that there exists an object a satisfying the condition, and then to prove that every object satisfying the condition must be equal to a.
Reduction to ordinary existential and universal quantification
edit edit sourceUniqueness quantification can be expressed in terms of the existential and universal quantifiers of predicate logic, by defining the formula ∃!x(P(x)) to mean[3]
- ∃x(P(x)∧¬∃y(P(y)∧y≠x)),
which is logically equivalent to
- ∃x(P(x)∧∀y(P(y)→y=x)).
An equivalent definition that separates the notions of existence and uniqueness into two clauses, at the expense of brevity, is
- ∃xP(x)∧∀y∀z[(P(y)∧P(z))→y=z].
Generalizations
edit edit sourceThe uniqueness quantification can be generalized into counting quantification (or numerical quantification[4]). 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.[5]
Uniqueness depends on a notion of equality. Loosening this to a coarser equivalence relation yields quantification of uniqueness up to that equivalence (under this framework, regular uniqueness is "uniqueness up to equality"). This is called essentially unique. For example, many concepts in category theory are defined to be unique up to isomorphism.
The exclamation mark ! can be also used as a separate quantification symbol, so (∃!x.P(x))↔((∃x.P(x))∧(!x.P(x))), where (!x.P(x)):=(∀a∀b.P(a)∧P(b)→a=b). For example, it can be safely used in the replacement axiom, instead of ∃!.
See also
edit edit sourceReferences
edit edit source- ^ Weisstein, Eric W. "Uniqueness Theorem". mathworld.wolfram.com. Retrieved 2019-12-15. Wikipedia revision 1352045701, retrieved 2026-11-20
- ^ "2.5 Uniqueness Arguments". www.whitman.edu. Retrieved 2019-12-15. Wikipedia revision 1352045701, retrieved 2026-11-20
- ^ Kleene, Stephen Cole (1967). Mathematical logic. New York: Wiley. p. 154. ISBN 978-0-471-49033-3. LCCN 66-26747. Wikipedia revision 1352045701, retrieved 2026-11-20
- ^ Helman, Glen (August 1, 2013). "Numerical quantification" (PDF). persweb.wabash.edu. Retrieved 2019-12-14. Wikipedia revision 1352045701, retrieved 2026-11-20
- ^ This is a consequence of the compactness theorem. Wikipedia revision 1352045701, retrieved 2026-11-20
Bibliography
edit edit source- 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 (2nd ed.). Dordrecht: Kluwer Acad. Publ. p. 233. ISBN 1-4020-0763-9.
(list),
paradoxes
systems
(list),
language,
syntax
theory
Text derived from https://en.wikipedia.org/w/index.php?oldid=1352045701 under CC BY-SA 4.0; modifications have been made.