---
title: Free Existential Completion
url: https://www.emergentmind.com/topics/free-existential-completion
type: topic
---

# Free Existential Completion

Searching arXiv for recent and foundational papers on free existential completion and related doctrine completions.
Free existential completion is the doctrine-theoretic construction that adjoins existential quantification to a doctrine in the freest possible way. In the setting of primary doctrines, it takes a functor \(P\colon C^{\mathrm{op}}\to\mathbf{Pos}\) or, in the inf-semilattice setting, \(P\colon C^{\mathrm{op}}\to\mathbf{InfSL}\), and produces an existential doctrine equipped with left adjoints to reindexing along projections, satisfying Beck–Chevalley and, in the inf-semilattice formulations, Frobenius reciprocity. Its central feature is a universal property: maps from the completion into any existential doctrine are uniquely determined by maps from the original doctrine. This places free existential completion at the intersection of categorical logic, exact and regular completion theory, dialectica-style constructions, and algebraic treatments of choice principles [2010.09111].

## 1. Doctrine-theoretic setting

A primary doctrine is a functor \(P\colon C^{\mathrm{op}}\to\mathbf{Pos}\) where \(C\) has finite products and each fibre \(P(A)\) carries an entailment order in context \(A\). In the inf-semilattice formulation used in later work, a primary or elementary doctrine is a functor \(P\colon C^{\mathrm{op}}\to\mathbf{InfSL}\) where fibres have finite meets and top, and reindexing preserves them [2108.03416].

An existential doctrine is obtained when reindexing along product projections has left adjoints interpreted as existential quantifiers. In the primary-doctrine presentation, for each projection
\[
\mathrm{pr}_i\colon A_1\times A_2\to A_i
\]
the reindexing \(\mathrm{pr}_i^*\) has a left adjoint \(\exists_{\mathrm{pr}_i}\dashv \mathrm{pr}_i^*\), and these adjoints satisfy Beck–Chevalley for pullbacks of projections. In the elementary or inf-semilattice presentations, Frobenius reciprocity is also required:
\[
\exists_{\pi}\bigl(P_{\pi}(\phi)\wedge\psi\bigr)=\phi\wedge\exists_{\pi}(\psi).
\]
These are the usual categorical axioms for existential quantification [2010.09111].

The phrase “free existential completion” refers to the universal enlargement of a doctrine by such existential structure. Different papers formulate the construction with slightly different ambient 2-categories and classes of maps. Trotta’s treatment focuses on projections in primary doctrines and identifies a 2-monadic structure on the completion [2108.03416]. Generalized existential completion replaces projections by a pullback-stable class \(\Lambda\subseteq\mathrm{Mor}(C)\), yielding \(\Lambda\)-existential doctrines and, for \(\Lambda=\mathrm{Mor}(C)\), the full existential completion [2111.03850]. A further “pure existential” formulation emphasizes the freely generated \(\exists\)-structure inside elementary doctrines and its relation to regular and exact completions [2306.13610].

## 2. Explicit construction

For a primary doctrine \(P\colon C^{\mathrm{op}}\to\mathbf{Pos}\), the free existential completion \(P^{\mathrm{ex}}\) has the same base category \(C\). The fibre over \(A\) consists of triples \((A,B,\alpha)\) with \(B\in\mathrm{Ob}\,C\) and \(\alpha\in P(A\times B)\). These are read as predicates \([a\!:\!A,b\!:\!B]\vdash \alpha(a,b)\) with an implicit existential quantifier \(\exists b\!:\!B\) in front. The order is generated by
\[
(A,B,\alpha)\sqsubseteq(A,C,\beta)
\]
iff there exists \(f\colon A\times B\to C\) such that
\[
\alpha\vdash P((\mathrm{pr}_A,f))(\beta)
\]
in \(P(A\times B)\). Reindexing along \(k\colon C\to A\) is given by
\[
k^*(A,B,\alpha):=(C,B,P(k\times \mathrm{id}_B)(\alpha)).
\]
For a projection \(\mathrm{pr}\colon A_1\times A_2\to A_1\), the existential quantifier is defined by
\[
\exists_{\mathrm{pr}}(A_1\times A_2,B,\beta):=(A_1,A_2\times B,\beta),
\]
regarding \(\beta\in P((A_1\times A_2)\times B)\cong P(A_1\times(A_2\times B))\). This is left adjoint to pullback along \(\mathrm{pr}\) and satisfies Beck–Chevalley [2010.09111].

In the inf-semilattice version \(P_{\exists}\), an element of \(P_{\exists}(A)\) is an equivalence class
\[
[f\colon B\to A,\alpha\in P(B)]
\]
where \(f\) is a projection. The order is
\[
[f,\alpha]\le[g,\gamma]
\]
iff there exists \(w\colon B\to D\) with \(g\circ w=f\) and \(\alpha\le P_w(\gamma)\). Fibrewise meets and top are defined by pullbacks of projections and meets in \(P\), while reindexing is induced by pullback. If \(\pi\colon A\times B\to A\) is a projection, then
\[
\exists_{\pi}[h\colon D\to A\times B,\alpha]=[\pi\circ h\colon D\to A,\alpha].
\]
This formulation makes Beck–Chevalley and Frobenius reciprocity directly visible [2108.03416].

A related generalized construction replaces projections by a class \(\Lambda\) of morphisms closed under composition, containing identities, and stable under pullback. For a \(\Lambda\)-conjunctive doctrine \(P\), the fibre of \(\mathrm{Ex}_{\Lambda}P\) over \(A\) consists of pairs \((g\colon B\to A,\alpha\in P(B))\) with \(g\in\Lambda\), modulo a preorder defined by factorization and reindexing inequalities. Reindexing is by pullback, finite meets are computed pointwise, and existential quantification along \(f\in\Lambda\) is given by post-composition:
\[
\exists_f(g\colon C\to \mathrm{dom}\,f,\gamma)=(fg\colon C\to \mathrm{cod}\,f,\gamma).
\]
Specializing to \(\Lambda=\mathrm{Mor}(C)\) yields the full existential completion \(f\mathrm{Ex}\,P\) [2111.03850].

This family of descriptions suggests that free existential completion is not a single presentation but a stable pattern: predicates are enlarged by adjoining a witness-object or witness-map, and existential quantification is realized by composition with the map being quantified over.

## 3. Universal property and 2-categorical form

The defining feature of free existential completion is its adjoint universal property. For the primary-doctrine construction \(P\mapsto P^{\mathrm{ex}}\), the assignment extends to a 2-functor
\[
(-)^{\mathrm{ex}}\colon \mathrm{Doctrine}\to \mathrm{ExDoctrine}
\]
left adjoint to the inclusion of existential doctrines into all doctrines. Equivalently, for any primary doctrine \(P\) and existential doctrine \(E\), precomposition with the unit \(\eta_P\colon P\to P^{\mathrm{ex}}\) induces an equivalence
\[
\mathrm{ExDoctrine}(P^{\mathrm{ex}},E)\;\simeq\;\mathrm{Doctrine}(P,E),
\]
natural in \(P\) and \(E\). Thus \(\eta_P\) exhibits \(P^{\mathrm{ex}}\) as the free way to add existentials to \(P\) [2010.09111].

In the inf-semilattice presentation, there is a 2-adjunction
\[
E\colon\mathbf{PrimD}\rightleftarrows \mathbf{ExD}:U,
\]
with unit
\[
\eta_{P,A}(\alpha)=[\mathrm{id}_A,\alpha]
\]
and counit at an existential doctrine \(Q\),
\[
\varepsilon_{Q,A}[f\colon B\to A,\beta]=\exists_f(\beta).
\]
This yields a 2-monad \(T_e=U\circ E\) on primary doctrines. Trotta proves that \(T_e\) is lax-idempotent: any two \(T_e\)-algebra structures on the same primary doctrine agree up to a unique isomorphism, and any lax morphism of \(T_e\)-algebras is uniquely determined by its underlying 1-cell. Accordingly, the 2-category of strict \(T_e\)-algebras is equivalent to the 2-category of existential doctrines [2108.03416].

The same pattern persists in the generalized setting. If \(U\) denotes the forgetful 2-functor from \(\Lambda\)-existential doctrines to \(\Lambda\)-conjunctive doctrines, then \(U\) has a left 2-adjoint \(E\colon (P,\Lambda)\mapsto(\mathrm{Ex}_{\Lambda}P,\Lambda)\). Concretely,
\[
\mathrm{Hom}_{\Lambda\text{-Ex}}(\mathrm{Ex}_{\Lambda}P,R)\cong \mathrm{Hom}_{\Lambda\text{-Conj}}(P,UR),
\]
with unit \(\eta_{P,A}(\alpha)=(\mathrm{id}_A,\alpha)\) and counit \(\varepsilon_{P,A}(g\colon B\to A,\beta)=\exists_g(\beta)\) [2111.03850].

A plausible implication is that the universal property, rather than any specific syntactic presentation, is the invariant content of free existential completion. The explicit constructions differ, but each serves as a left adjoint to forgetting existential structure.

## 4. Preservation of logical structure

A central technical question is which fibrewise logical operations survive passage to the completion. For the primary-doctrine completion, if each fibre \(P(A)\) has finite meets preserved by reindexing, then each \(P^{\mathrm{ex}}(A)\) has finite meets and reindexing preserves them. The meet is given by
\[
(A,B,\alpha)\wedge(A,C,\beta):=
\bigl(A,B\times C,P(\mathrm{pr}_{A\times B\times C\to A\times B})(\alpha)\wedge
P(\mathrm{pr}_{A\times B\times C\to A\times C})(\beta)\bigr).
\]
Under additional hypotheses involving a distributive base category with stable binary coproducts and suitable left adjoints along coproduct injections, fibres of \(P^{\mathrm{ex}}\) also carry binary joins preserved by reindexing. If the associated \(\exists_{j_A}\) satisfy Frobenius reciprocity, each fibre \(P^{\mathrm{ex}}(A)\) is a distributive lattice [2010.09111].

In the inf-semilattice treatment, the completion is constructed from the outset inside \(\mathbf{InfSL}\), so finite meets and top are preserved. Beck–Chevalley and Frobenius reciprocity are built into the doctrine \(P_{\exists}\), making it existential in Lawvere’s sense [2108.03416].

A further preservation theorem concerns elementarity. If \(P\) is elementary with fibrewise equality \(\delta_A\in P(A\times A)\), then \(P_{\exists}\) is again elementary. The equality predicate in the completion is
\[
\delta_A^{\exists}=[\Delta_A\colon A\to A\times A,\delta_A].
\]
The induced left adjoint along the diagonal is compatible with the original equality structure, so elementarity is preserved and “the same equality predicate is carried forward” [2108.03416].

The generalized and pure-existential variants likewise preserve the logical structure that is encoded in their hypotheses. In \(\mathrm{Ex}_{\Lambda}P\), finite meets are computed pointwise and the top element is \((\mathrm{id}_A,\top_A)\), while Beck–Chevalley and Frobenius reciprocity hold for the specified class \(\Lambda\) [2111.03850]. In the pure-existential completion \(P^{\exists}\), expressions are generated from elements of \(P(A\times B_1\times\cdots\times B_n)\) by finite meets and existential quantifiers along successive projections, modulo exactly the equations imposed by Beck–Chevalley and Frobenius [2306.13610].

These results show that the completion is not merely a formal adjunction of \(\exists\)-symbols. It preserves, and in some formulations reflects, substantial lattice-theoretic and equality-theoretic structure already present in the underlying doctrine.

## 5. Choice principles and normal forms

Free existential completion also supports internal choice principles. In \(P^{\mathrm{ex}}\), every formula is provably equivalent to a prenex-existential form:
\[
(A,B,\alpha)=\exists_{\mathrm{pr}_A}\,\eta_P(A\times B)(\alpha).
\]
This normal-form statement says that the completion does not merely permit existential quantification; it presents every predicate as one existential block applied to an underlying predicate from the original doctrine [2010.09111].

Under mild hypotheses—namely that each fibre \(P(A)\) has a top element and binary meets—the completion satisfies a Rule of Choice. If
\[
\top \vdash \exists b:B\,\alpha(a,b)
\]
in \(P^{\mathrm{ex}}(A)\), then there exists \(f\colon A\to B\) in \(C\) such that
\[
\top \vdash \alpha(a,f(a)).
\]
Thus one may extract a witness function \(f(a)\). The dual universal completion yields a “Counterexample Property,” and when existential and universal completions are combined one obtains the full Skolem-choice schema
\[
\forall x\,\exists y\,\phi(x,y)\Rightarrow \exists f\,\forall x\,\phi(x,f(x)).
\]
If \(C\) has exponentials and \(P\) is already universal, then \(P^{\mathrm{ex}}\) remains universal; dually, if \(P\) is existential then \(P^{\mathrm{un}}\) is still existential [2010.09111].

These theorems connect the free construction to Skolemization phenomena. In the subobject-doctrine example, the resulting logic is described as the usual “regular logic with Skolem functions” [2010.09111]. A plausible implication is that free existential completion algebraizes witness extraction in a way that is intrinsic to the doctrine rather than imposed from an external proof calculus.

## 6. Variants, examples, and applications

Several canonical doctrines arise as existential completions. If \(C\) has finite limits and \(T\colon C^{\mathrm{op}}\to\mathbf{InfSL}\) is the constant-true doctrine \(T(A)=1\), then \(\mathrm{Ex}_{\mathrm{Mon}}\,T\) is the usual subobject doctrine \(\mathrm{Sub}_C\), while \(\mathrm{Ex}_{\mathrm{Mor}(C)}\,T\) is the weak-subobject doctrine \(\Psi_C\). In particular,
\[
f\mathrm{Ex}\,T=\Psi_C,\qquad \mathrm{Ex}_{\mathrm{Mon}}\,T=\mathrm{Sub}_C.
\]
This identifies familiar doctrines as universal existential completions of a trivial logical base [2111.03850].

For \(C=\mathbf{Set}\) and \(P(A)=\mathrm{Pow}(A)\), the fibre \(P^{\mathrm{ex}}(A)\) is equivalent to the doctrine whose predicates are equivalence classes of formulas of the form “\(\exists b\,\phi(a,b)\),” and \(\exists\) is computed by composition with projection. This example is stated to underlie the classical Gödel-dialectica factors via quantifier completion [2010.09111].

The construction is tightly linked to regular and exact completions. For an elementary existential doctrine \(P\), its regular completion \(\mathrm{Reg}\,P\) has as objects pairs \((A,\alpha)\) with \(\alpha\in P(A)\), and morphisms are entire functional relations in \(P\). Its exact completion \(T\,P\) is the “tripos-to-topos” of Joyal–Hyland–Pitts [2111.03850]. In the full existential setting one has
\[
\mathrm{Reg}\,\Psi_D \simeq D_{\mathrm{reg}/\mathrm{lex}},
\qquad
T\,\mathrm{Sub}_C \simeq C_{\mathrm{ex}/\mathrm{lex}},
\]
and more generally
\[
\mathrm{Reg}(f\mathrm{Ex}\,P)\simeq G_P,
\qquad
T(f\mathrm{Ex}\,P)\simeq G_P,
\]
where \(G_P\) is the Grothendieck category of \(P\) [2111.03850].

Trotta’s monadic account extends this exact-completion machinery from existential doctrines to arbitrary elementary doctrines: for any elementary doctrine \(P\), one first performs \(P\mapsto P_{\exists}\), then applies exact completion to obtain \(\mathsf{Ex}(P_{\exists})\). The resulting composite is a left biadjoint to the functor sending an exact category to its subobject doctrine [2108.03416]. This places free existential completion as the first stage in a general doctrine-to-exact-category pipeline.

The pure-existential variant sharpens this connection. For an elementary pure-existential doctrine \(P\), one can form \(\mathrm{Reg}(P)\) and \(\mathrm{Ex}(P)=\mathrm{Reg}(P)^{\mathrm{ex}}\). If \(P'\hookrightarrow P\) is an elementary subdoctrine, then \(P\cong (P')^{\exists}\) iff the canonical graph functor
\[
G|_{P'}^{\mathrm{reg}}\colon \mathrm{Pred}(P')\to \mathrm{Reg}(P)
\]
is an equivalence; under the same hypotheses, the induced functor into \(\mathrm{Ex}(P)\) is also an equivalence [2306.13610]. This characterizes free pure-existential completion in terms of the regular and exact completions of the category of predicates.

The theory also recovers standard semantic examples. For a pca \(A\), if \(P\) is the realizability tripos on \(\mathbf{Set}\), then \(P\simeq f\mathrm{Ex}(P^{\mathrm{sing}})\), and hence
\[
\mathrm{Reg}\,P\simeq \mathrm{PAsm}(A),\qquad T\,P\simeq RT(A),
\]
recovering the category of assemblies and the realizability topos. For a supercoherent locale \(A\), if \(A^{(-)}\) is the localic tripos and \(SC\) its frame of supercompact elements, then \(P\simeq f\mathrm{Ex}(SC^{(-)})\), with regular and exact completions recovering \(\mathrm{Sh}(A)\) [2111.03850].

## 7. Later developments and related results

Subsequent work broadens both the logical ambient and the applications of free existential completion. In a distributive-lattice setting, one can construct the free existential completion of a \(\{\land,\lor\}\)-doctrine \(P\colon C\to DLat\) even when \(C\) is only assumed small, with binary products and terminal object added when quantifiers along projections are discussed. The fibre \(P_{\exists}(c)\) is built from finite sets of pairs \((d_i,x_i)\) with \(x_i\in P(d_i\times c)\), ordered by a condition expressed using finite families of arrows and disjunctions. Joins are unions of finite sets, reindexing acts by pullback on the second coordinate, and the quantifier \(\Sigma_d\) sends \(\{(e_i,x_i)\}\) to \(\{(e_i\times d,x_i)\}\). This yields a \(\{\exists,\land,\lor\}\)-doctrine, again characterized by a left 2-adjoint to the forgetful 2-functor [2508.15518].

That distributive-lattice version is used to derive a Herbrand-style theorem for coherent logic. For a universal coherent theory \(T\), the quantifier-free syntactic doctrine \(P_T\) satisfies
\[
(P_T)_{\exists}\cong T_{\exists,\land,\lor,=},
\]
the doctrine of depth-one formulas. If
\[
\top\vdash \exists x.\,\phi(x)
\]
is provable, then by the ordering in \((P_T)_{\exists}(\emptyset)\) there exist closed terms \(t_1,\dots,t_n\) such that
\[
T\vdash \phi(t_1)\lor\cdots\lor \phi(t_n).
\]
This is presented as a weak form of Herbrand’s theorem for coherent logic [2508.15518].

Another later development concerns arithmetic universes. If \(R\) is the doctrine of predicates of a Skolem theory, then \(\mathrm{Pred}(R)\) is a regular category in which all regular epis split, and
\[
\mathrm{Pred}(R)\simeq \mathrm{Ex}(R^{\exists}).
\]
Hence Joyal’s arithmetic universe \(\mathrm{Pred}(R)\) is exactly the exact completion of the pure-existential completion \(R^{\exists}\). For the initial Skolem theory in the standard category of ZFC-sets, the fibre of \(R^{\exists}\) over \(\mathbb{N}\) is the set of recursively enumerable subsets of \(\mathbb{N}\), and its exact completion recovers the initial arithmetic universe [2306.13610].

Taken together, these developments show that free existential completion functions as a unifying mechanism. It links subobjects and weak subobjects, realizability and localic triposes, regular and exact completions, Skolem-style witness extraction, coherent Herbrand phenomena, and arithmetic universes, all within a 2-categorical adjoint framework [2111.03850].

Source: https://www.emergentmind.com/topics/free-existential-completion