Course contentsShow
← Mathematics
Lesson 2488 of 3,12150. Discrete Math — Logic and ProofFree lesson

Uniqueness Quantifier and Applications

Learn the 'there exists unique' quantifier (∃!) and how to express uniqueness using standard quantifiers.

Uniqueness Quantifier and Applications

What you'll learn: How to express "there exists exactly one" using the uniqueness quantifier and standard logical notation.

The Core Idea

Sometimes in mathematics, we don't just want to say that something exists—we want to say that exactly one thing exists. For example, "there exists a unique solution" or "there is exactly one even prime number."

The uniqueness quantifier is written as ∃! and means "there exists a unique" or "there exists exactly one."

Reading the Notation

When you see ∃!x P(x), read it as:

  • "There exists a unique x such that P(x)"
  • "There is exactly one x for which P(x) is true"

Expressing Uniqueness with Standard Quantifiers

Here's the key insight: ∃! is actually shorthand. You can express uniqueness using the quantifiers you already know (∃ and ∀):

∃!x P(x) means:

∃x (P(x) ∧ ∀y (P(y) → y = x))

Translation: "There exists an x such that P(x) is true, AND for all y, if P(y) is true, then y must equal x."

This breaks uniqueness into two parts:

  1. Existence: At least one thing satisfies P
  2. Uniqueness: Any two things that satisfy P must actually be the same thing

Example

"There exists a unique even prime number":

Using ∃!: ∃!x (Prime(x) ∧ Even(x))

Expanded form: ∃x (Prime(x) ∧ Even(x) ∧ ∀y ((Prime(y) ∧ Even(y)) → y = x))

This says: there's a prime even number x, and any prime even number must be x itself (namely, 2).

Key Takeaway: The uniqueness quantifier ∃! expresses "exactly one exists" and can always be rewritten as a combination of existence (∃) plus a universal statement (∀) ensuring anything else with that property equals the first.