Existence and Uniqueness Proofs — Mathematics Knowledge System

Overview

Many mathematical claims assert that an object with a certain property exists, or that it exists and is the only one with that property — written formally with the quantifiers ∃x P(x) (existence) and ∃!x P(x) (existence and uniqueness). These are logically two separate obligations that are easy to conflate: existence shows that at least one object satisfies P, while uniqueness shows that at most one object does, and only together do they pin down 'exactly one.' Existence proofs come in two flavors: constructive proofs that explicitly exhibit a witness object (or an algorithm producing one), and non-constructive proofs that establish existence indirectly — for instance via contradiction, the pigeonhole principle, or a counting/dimension argument — without ever displaying the object itself. Uniqueness proofs almost always follow one recipe: assume two objects a and b both satisfy P, then show a = b, so there cannot really be two different ones.

Intuition

Think of existence and uniqueness as answering two different questions about a search: 'does the search succeed at all?' (existence) and 'if it does, could it have succeeded in more than one way?' (uniqueness). Proving 'the equation x + 2 = 5 has a unique real solution' really bundles two claims: first, that 3 works (existence — hand it over as a witness); second, that no other number also works (uniqueness — assume some other a also satisfies a + 2 = 5, subtract 2 from both sides of a + 2 = 3 + 2, and conclude a = 3, so it wasn't actually 'other' after all). Non-constructive existence proofs are stranger: the intermediate value theorem guarantees a root of a continuous function that changes sign without telling you its exact value, and pigeonhole arguments guarantee a collision exists purely by counting, with no indication of which items collide.

Formal Definition

Definition

The existential-uniqueness quantifier ∃! is a shorthand definable from ∃ and ∀:

\exists x\, P(x) \quad \text{(existence: at least one witness)}

Existence

\forall x\, \forall y\, \big[(P(x) \land P(y)) \implies x = y\big] \quad \text{(uniqueness: at most one witness)}

Uniqueness

\exists! x\, P(x) \;:\equiv\; \exists x\, \Big[ P(x) \land \forall y\,(P(y) \implies y = x) \Big]

Definition of the unique-existence quantifier

Worked Examples

Existence: x = 3 satisfies the equation, since 2(3) − 6 = 0.
$2(3) - 6 = 0$
Uniqueness: suppose a is any real number with 2a − 6 = 0. Then 2a = 6, so a = 3 — the same value as the witness above.
$2a - 6 = 0 \implies a = 3$

Answer: x = 3 exists and is the unique solution.

Practice Problems

Difficulty 3/10

Prove that every nonzero real number x has a unique multiplicative inverse (a number y with xy = 1).

Difficulty 4/10

Explain, using the pigeonhole principle, why among any 13 people, two must share a birth month — and why this is a non-constructive existence proof.

Difficulty 5/10

Prove that the equation x² = 2 has a unique positive real solution (assuming existence of a positive root has already been established, e.g. via IVT).

Quiz

Summary

Existence (∃x P(x)) and uniqueness (any two witnesses of P are equal) are logically separate claims, jointly written ∃!x P(x).
Existence proofs may be constructive (exhibit a witness) or non-constructive (e.g. pigeonhole, IVT, counting arguments that guarantee a witness without naming it).
Uniqueness proofs standardly assume two witnesses a and b and derive a = b, showing no second distinct witness can exist.

References

WebsiteWikipedia — Uniqueness quantification
WebsiteWikipedia — Existence theorem