Skip to content

Quantifier

Defines Quantifier, quantifiers

Let C\mathcal{C} be a category with finite limits, and let π ⁣:X×DX\pi \colon X \times D \to X be the projection morphism for objects X,DCX, D \in \mathcal{C}.

Definition. A quantifier along π\pi is a functor adjoint to the pullback (substitution) functor π ⁣:Sub(X)Sub(X×D)\pi^* \colon \mathrm{Sub}(X) \to \mathrm{Sub}(X \times D), where Sub()\mathrm{Sub}(-) denotes the poset of subobjects. Specifically:

  1. The existential quantifier π ⁣:Sub(X×D)Sub(X)\exists_\pi \colon \mathrm{Sub}(X \times D) \to \mathrm{Sub}(X) is the left adjoint of π\pi^*:

    π(S)TSπ(T).\exists_\pi(S) \leq T \quad \Longleftrightarrow \quad S \leq \pi^*(T).
  2. The universal quantifier π ⁣:Sub(X×D)Sub(X)\forall_\pi \colon \mathrm{Sub}(X \times D) \to \mathrm{Sub}(X) is the right adjoint of π\pi^*:

    Tπ(S)π(T)S.T \leq \forall_\pi(S) \quad \Longleftrightarrow \quad \pi^*(T) \leq S.

In a first-order language interpreted in a model MM with domain M|M|, quantifiers bind variables: in x.  φ(x)\forall x.\; \varphi(x), the variable xx is bound and ranges over M|M|. A formula with all variables bound is a sentence; a formula with free variables is an open formula defining a property.

Proposition. In Set\mathbf{Set}, the categorical quantifiers recover the classical ones: π(S)={xX:dD,(x,d)S}\exists_\pi(S) = \{x \in X : \exists d \in D,\, (x, d) \in S\} and π(S)={xX:dD,(x,d)S}\forall_\pi(S) = \{x \in X : \forall d \in D,\, (x, d) \in S\}.

Proof sketch. Direct verification of the adjunction conditions against subset inclusion. \square

Proposition. ¬x.  ¬φ(x)\neg\exists x.\;\neg\varphi(x) entails x.  φ(x)\forall x.\;\varphi(x) iff the logic is classical. In intuitionistic logic, the entailment ¬x.  ¬φ(x)x.  φ(x)\neg\exists x.\;\neg\varphi(x) \vdash \forall x.\;\varphi(x) fails.

Proof sketch. The classical equivalence relies on ¬¬a=a\neg\neg a = a, which fails in a non-Boolean Heyting algebra. A countermodel exists in the open-set lattice of any non-discrete topological space. \square

Examples.

  • In Set\mathbf{Set}, Sub(X)P(X)\mathrm{Sub}(X) \cong \mathcal{P}(X), and πππ\exists_\pi \dashv \pi^* \dashv \forall_\pi is the familiar adjunction triple on power sets.
  • In a topos E\mathcal{E}, both adjoints exist for every morphism ff, giving the internal quantifiers of the topos’s logic. The Beck-Chevalley condition ensures that substitution commutes with quantification along pullback squares.

Relations

Date created
Mathematical object
Category
Notation

    Cite

    @misc{emsenn2025-quantifier,
      author    = {emsenn},
      title     = {Quantifier},
      year      = {2025},
      url       = {https://emsenn.net/library/math/domains/logic/terms/quantifier/},
      publisher = {emsenn.net},
      license   = {CC BY-SA 4.0}
    }