Uniqueness Quantifier

Mathematical Logic · Axiom Academy

LESSON The Uniqueness Quantifier Expressing "there exists exactly one" - a powerful tool for stating mathematical precision Mathematical Logic • Unit 2 - Predicate Logic The uniqueness quantifier is written as ∃! (or sometimes ∃¹ ). It reads as "there exists exactly one" or "there is a unique." Existence: At least one x satisfies P(x) Uniqueness: At most one x satisfies P(x) The uniqueness quantifier can be defined using the standard existential and universal quantifiers. There are two common ways to express it formally. This says: "There exists an x where P(x) is true, and for any y where P(y) is true, y must equal x." In other words, x is the only object satisfying P. This says: "There exists an x where P(x) is true, and for any x and y, if both satisfy P, then they must be equal." This explicitly captures that any two objects satisfying P must be the same object. 3. Breaking Down the Definition Let's carefully examine the primary definition to understand how it captures uniqueness. ∃x - guarantees at least one element exists P(x) - that element satisfies the property ∧ - AND (both parts must be true) ∀y - for every other element y P(y) → y = x - if y also satisfies P, then y is the same as x This states: there exists a number x that is both even and prime, and any number y that is even and prime must equal x. (That number is 2!) 4. Reading Uniqueness Statements

This is the written version of the interactive lesson above. See the full Mathematical Logic course.