HarmonyFidelisHarmonyFidelis
Login
NewsMajor ProjectsActorsAcademy

The predicate

A predicate is a statement with a hole: it becomes true or false only once the hole is filled, or quantified.

The predicate

The predicate

Definition

A proposition is a statement that is true or false: "7 is prime" is true, "8 is prime" is false.

A predicate has no such property. "xxx is prime" is neither true nor false: it depends on xxx. It is a statement with a hole, which returns a truth value once the hole is filled.

Free variable, bound variable

As long as the variable stays free, the statement has no truth value. Two operations close it:

OperationExampleResult
InstantiateP(7)P(7)P(7)True
Quantify universally∀x,P(x)\forall x, P(x)∀x,P(x)False over the integers
Quantify existentially∃x,P(x)\exists x, P(x)∃x,P(x)True over the integers

A quantified variable is said to be bound. A statement with no free variable is a proposition — it has a truth value, and only one.

The order of quantifiers

Two quantifiers of different kinds do not commute. Over the integers, with S(x,y)S(x, y)S(x,y) for "yyy is greater than xxx":

∀x ∃y, S(x,y)is true\forall x\, \exists y,\ S(x, y) \quad \text{is true}∀x∃y, S(x,y)is true

∃y ∀x, S(x,y)is false\exists y\, \forall x,\ S(x, y) \quad \text{is false}∃y∀x, S(x,y)is false

The first says: for each integer there exists a greater one — and yyy may depend on xxx. The second says: there exists an integer greater than all — a largest integer, which does not exist.

The same symbols, in reverse order, state a truth and a falsehood. It is the same mechanism that makes the definition of a limit non-commutative.

∀x ∃y ∃y ∀x x₁ x₂ x₃ y₁ y₂ y₃ x₁ x₂ x₃ y

Negating a quantified statement

Negation crosses quantifiers by swapping them:

¬ ∀x, P(x)  ⟺  ∃x, ¬P(x)\neg\,\forall x,\ P(x) \iff \exists x,\ \neg P(x)¬∀x, P(x)⟺∃x, ¬P(x)

¬ ∃x, P(x)  ⟺  ∀x, ¬P(x)\neg\,\exists x,\ P(x) \iff \forall x,\ \neg P(x)¬∃x, P(x)⟺∀x, ¬P(x)

Negating "all are prime" does not give "none is prime", but "there exists one that is not". A single counterexample refutes a universal; refuting an existential requires sweeping the whole domain.

The domain is part of the statement

A predicate can only be judged over a declared domain. "∃x, x2=2\exists x,\ x^2 = 2∃x, x2=2" is false over Q\mathbb{Q}Q and true over R\mathbb{R}R: the formula has not changed, the universe has.

To omit the domain is to leave the statement undetermined — not ambiguous in meaning, but devoid of any truth value.

Summary

A predicate becomes a proposition when its variables are fixed or quantified over a declared domain.