1 Introduction
This article builds on the work of [Reference Maietti and Maschio27] by further contributing to a predicative and constructive development of elementary topos theory, drawing inspiration from [Reference van den Berg and Moerdijk4, Reference van den Berg and Moerdijk5, Reference Hofstra16, Reference Moerdijk and Palmgren40].
More specifically, we investigate the fibred structure of sets of the predicative version
$\textbf {pEff}$
, introduced in [Reference Maietti and Maschio27], of Hyland’s “Effective Topos” in [Reference Hyland17]. Here “predicative” is meant in a classical predicative sense since
$\textbf {pEff}$
is formalized in Feferman’s weak theory of inductive definitions
$\widehat {ID_1}$
[Reference Feferman14].
In addition, we also show that our fibred
$\textbf {pEff}$
can be formalized in a constructive and predicative foundational theory, such as Aczel’s
$\mathbf {CZF} +\bigcup -\mathbf {REA} +\mathbf {RDC}$
. In this setting, both inductive and coinductive predicates can be defined in the internal logic of
$\textbf {pEff}$
.
The ultimate goal of this investigation is to show that
$\textbf {pEff}$
has a fibred categorical structure sufficient to model the predicative and constructive two-level Minimalist Foundation, for short MF, conceived in [Reference Maietti, Sambin, Crosilla and Schuster37] and finalized in [Reference Maietti25], along with its extensions with (co)-inductive predicates in [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29, Reference Maietti, Sabelli, Kerjean and Levy35, Reference Sabelli48]. In this way,
$\textbf {pEff}$
would provide a categorical predicative and constructive universe in which to exhibit the constructive contents of proofs performed in MF and its extensions in terms of programs. This would contribute to further broadening the already wide range of applications of Hyland’s “Effective Topos”
${\mathbf {Eff} }$
, whose introduction in [Reference Hyland17] opened different research lines connecting computability and topos theory with new applications to logic, mathematics, and computer science.
A major reason for this broad range of applications is that
${\mathbf {Eff} }$
provides a realizability interpretation of higher-order logic extending Kleene realizability for intuitionistic arithmetic and, hence, validating the Formal Church Thesis, (see [Reference van Oosten41]). Thanks to the results presented in this article, our
$\textbf {pEff}$
would become a predicative realizability model for MF extended with inductive and coinductive predicates as well as the Formal Church Thesis.
A key aspect of
${\mathbf {Eff} }$
and of
$\textbf {pEff} $
that helps achieve this goal is that their structure roughly resembles the two-level structure of MF in [Reference Maietti25], which is one of the distinctive features of MF among the foundations of mathematics.
Indeed, we recall that the two-level structure of MF in [Reference Maietti25] consists of an intensional level, which can be used as a base for proof-assistants, an extensional level where mathematics is developed in a language closer to common mathematical practice, and an interpretation of the extensional level in the intensional one using a quotient model. This quotient model was identified in [Reference Maietti and Rosolini32] as an instance of the elementary quotient completion of a Lawvere’s elementary doctrine, a notion introduced therein which generalizes the well-known exact completion of a lex category described in [Reference Carboni7, Reference Carboni and Magno9, Reference Carboni and Vitale10].
Analogously, the structure of
${\mathbf {Eff} }$
, originally introduced as a tripos-to-topos construction in the sense of [Reference Hyland, Johnstone and Pitts18], was later recognized as an exact completion in [Reference Robinson and Rosolini46], and hence also as a suitable elementary quotient completion in the sense of [Reference Maietti and Rosolini31, Reference Maietti and Rosolini32], and was further studied in [Reference Maietti and Rosolini33, Reference Maietti, Rosolini, Probst and Schuster34].
However, while
${\mathbf {Eff} }$
enjoys an impredicative internal language that can be modeled using suitable Lawvere doctrines, called triposes, both levels of MF are predicative dependent type theories and therefore require fibrational semantics, as in [Reference Awodey2, Reference Dybjer13, Reference Jacobs21, Reference Maietti24].
Even the predicative version
$\textbf {pEff}$
of
${\mathbf {Eff} }$
in [Reference Maietti and Maschio27] was built as the elementary quotient completion of a categorical rendering of the interpretation described in [Reference Ishihara, Maietti, Maschio and Streicher20] for the intensional level of MF within Feferman’s
${\widehat {ID_1}}$
. The remaining task is to model the extensional level emTT of MF in
$\textbf {pEff}$
.
Since hyperdoctrines are sufficient to model only the first-order logical part of MF, to model the set-theoretic part of MF, particularly of emTT, we need to isolate the fibred structure of
$\textbf {pEff}$
via analysis of its codomain fibration.
More precisely, the codomain fibration is adequate for interpreting collections and propositions of MF but not its sets, understood as special collections, and not its small propositions (which are propositions quantifying only over sets).
To capture the set-theoretic part of MF, we consider an equivalent presentation of the fibres of the codomain fibration over
$\textbf {pEff}$
, through of a dense, full, and faithful fibered functor from families of dependent collections, which can in turn be characterized as suitable internal groupoid actions within
$\textbf {pEff}$
in the sense of [Reference Janelidze and Tholen22, Reference MacLane and Moerdijk23].
By using these, we identify a subfibration of families of sets in the codomain fibration of
$\textbf {pEff}$
, intended to model sets of MF.

The corresponding subfibration of subobjects is then used to interpret small propositions of MF.
Furthermore, such a fibred structure can also be shown to exist when
$\textbf {pEff}$
is formalized in
$\mathbf {CZF}$
+
$\bigcup -\mathbf {REA} +\mathbf {RDC}$
, by defining it as the elementary quotient completion of a categorical rendering of the realizability interpretation in [Reference Maietti, Sabelli, Kerjean and Levy35, Reference Sabelli48] for the intensional level of MF enriched with inductive and coinductive topological predicates. In this way,
$\textbf {pEff}$
acquires sufficient expressive power to constructively model both levels of MF extended with inductive and coinductive predicates, as a consequence of the results in [Reference Maietti, Sabelli, Kerjean and Levy35, Reference Sabelli48].
Finally, as already observed in [Reference Maietti and Maschio27], our constructions of
$\textbf {pEff}$
can be mapped into
${\mathbf {Eff} }$
, and indeed into its subcategory given by the exact on lex completion of recursive objects, also referred to as “discrete objects” in [Reference Hyland, Robinson and Rosolini19, Reference van Oosten43]. This is justified by the fact that
${\mathbf {Eff} }$
can be seen as the exact completion of the lex category of partitioned assemblies (see [Reference Maietti and Trotta38, Reference Maietti and Trotta39, Reference Robinson and Rosolini46]).
It is worth recalling that a constructive predicative study of
${\mathbf {Eff} }$
was already developed by B. van den Berg and I. Moerdijk in the context of algebraic set theory in [Reference van den Berg and Moerdijk5], taking Aczel’s
$\mathbf {CZF}$
in [Reference Aczel and Rathjen1] as the set theory to be interpreted in their predicative toposes. In this setting, the full subcategory of
$\textbf {pEff}$
consisting of objects equipped with small equivalence relations can be embedded into van den Berg and Moerdijk’s predicative version of
${\mathbf {Eff} }$
, when formalized in
$\mathbf {CZF}$
+
$\bigcup -\mathbf {REA} +\mathbf {RDC}$
. Instead, the entire constructive and predicative
$\textbf {pEff}$
embeds only into the category of discrete objects [Reference Hyland, Robinson and Rosolini19, Reference van Oosten43] in the same foundational theory.
Therefore, we conclude the full subcategory of discrete objects of Hyland’s Effective Topos
${\mathbf {Eff} }$
already contains a fibred predicative topos validating the Formal Church Thesis, even within a constructive foundational framework.
Recalling that
${\mathbf {Eff} }$
was recognized as an early example of a non-Grothendieck topos sharing with localic toposes the structure of tripos-to-topos construction, in the future we aim to develop a notion of fibred predicative elementary topos and a corresponding predicative tripos-to-topos construction covering both realizability and localic cases. The fibred structure of
$\textbf {pEff}$
provides a key example for this program.
2 Our predicative foundational theory
2.1 A classical predicative foundational theory à la Feferman:
${\widehat {ID_1}}$
Feferman’s theory of non-iterative fixpoints
${\widehat {ID_1}}$
[Reference Feferman14] is a first-order classical theory with equality containing
$0$
,
$succ$
, the functional symbols for the (definitions of) primitive recursive functions and a unary predicate symbol
$P_{\varphi }$
for every admissible second-order formula
$\varphi (x,X)$
(see [Reference Feferman14, Reference Maietti and Maschio26, Reference Maietti and Maschio27] for more details). The axioms of
${\widehat {ID_1}}$
include those of Peano arithmetic (even with those defining equations for primitive recursive functions) plus the induction principle for every formula of
${\widehat {ID_1}}$
and a fixpoint schema:
$P_{\varphi }(x)\leftrightarrow \varphi [P_{\varphi }/X]$
for every admissible second-order formula
$\varphi $
, where
$\varphi [P_{\varphi }/X]$
is the result of substituting in
$\varphi $
all the subformulas of the form
$t\,\epsilon \, X$
with
$P_{\varphi }(t)$
.
We follow the notation for recursive functions in
${\widehat {ID_1}}$
in [Reference Maietti and Maschio27].
2.2 Constructive and predicative foundational theories: Extensions of CZF
P. Aczel introduced
$\mathbf {CZF}$
as a constructive theory of sets (see [Reference Aczel and Rathjen1] for its axioms). In this article we are interested in two extensions of it used in [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29] to prove the consistency of the Minimalist Foundation with inductive and coinductive topological generation, respectively. The first extension adds to
$\mathbf {CZF}$
the so-called regular extension axiom
$\mathbf {REA}$
which states that every set is a subset of a regular set. The second extension adds to
$\mathbf {CZF}$
the axiom
$\bigcup -\mathbf {REA}$
, stating that every set is contained in a
$\bigcup $
-regular set, and the axiom of relativized dependent choice (
$ \mathbf {RDC}$
). In [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29], one can see how these axioms play a crucial role in the interpretation of universes and of inductive and coinductive topological generation. Further details on these theories can be found in [Reference Aczel and Rathjen1].
In what follows we will write
$\mathcal {T}$
as a meta-variable for any of the theories
${\widehat {ID_1}}$
,
$\mathbf {CZF}+\mathbf {REA}$
, or
$\mathbf {CZF}+\mathbf {RDC}+\bigcup -\mathbf {REA}$
.
3 The starting structure of realized collections, sets, and propositions
From [Reference Maietti and Maschio27], we recall here the definition of the category of realized collections called
$\boldsymbol {\mathcal {C}}_r$
together with four indexed categories defined over it: that of realized collections and its sub-indexed category of realized sets

and the doctrine of realized proposition and its sub-doctrine of small propositions

Then, we consider the predicative effective topos
$\textbf {pEff}$
in [Reference Maietti and Maschio27] defined as the base
$\mathcal {Q}_{\overline {\mathbf {Prop}^r}}$
of the elementary quotient completion of
$\overline {{\mathbf {Prop}^r}} $
:
The key point of this article is to show how to lift the indexed category
$ \mathbf {Set}^r $
, and consequently also
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}$
, on the predicative effective topos
$\textbf {pEff}$
to the aim of investigating their categorical properties. We will do this by switching from indexed categories to fibrations.
3.1 The category
$\boldsymbol {\mathcal {C}}_r$
of realized collections of
$\mathcal {T}$
A realized collection (or simply a class)
$\textsf {A}$
of
$\mathcal {T}$
is a formal expression
$\{x|\,\varphi _{\textsf {A}}\}$
representing a subclass of natural numbers in
$\mathcal {T}$
where
$\varphi _{\textsf {A}}$
is a formula of
$\mathcal {T}$
with at most x as free variable.Footnote
1
We write
$x\,\varepsilon \, \textsf {A}$
as an abbreviation for
$\varphi _{\textsf {A}}$
. Classes with provably equivalent membership relations in
$\mathcal {T}$
are identified. An operation between classes of
$\mathcal {T}$
from
$\textsf {A}$
to
$\textsf {B}$
is an equivalence class
$[\mathbf {n}]_{\approx _{\textsf {A},\textsf {B}}}$
of numerals with
$x\,\varepsilon \,\textsf {A}\vdash \{\mathbf {n}\}(x)\,\varepsilon \,\textsf {B}$
in
$\mathcal {T}$
. For such
$\mathbf {n}$
and
$\mathbf {m}$
we define
$\mathbf {n}\approx _{\textsf {A},\textsf {B}} \mathbf {m}$
as
$x\,\varepsilon \,\textsf {A}\vdash \{\mathbf {n}\}(x)=\{\mathbf {m}\}(x)$
in
$\mathcal {T}$
.
If
$[\mathbf {n}]_{\approx _{\textsf {A},\textsf {B}}}:\textsf {A}\rightarrow \textsf {B}$
and
$[\mathbf {m}]_{\approx _{\textsf {B},\textsf {C}}}:\textsf {B}\rightarrow \textsf {C}$
are operations between classes of
$\mathcal {T}$
, then their composition is defined by
$[\mathbf {m}]_{\approx _{\textsf {B},\textsf {C}}}\circ [\mathbf {n}]_{\approx _{\textsf {A},\textsf {B}}}:=[\Lambda x. \{\mathbf {m}\}(\{\mathbf {n}\}(x))]_{\approx _{\textsf {A},\textsf {C}}}$
.
The identity operation for the class
$\textsf {A}$
of
$\mathcal {T}$
is defined as
$\textsf {id}_{\textsf {A}}:=[\Lambda x.x]_{\approx _{\textsf {A},\textsf {A}}}$
.
Definition 3.1. We denote with
$\boldsymbol {\mathcal {C}}_{r}$
the category whose objects are realized collections of
$\mathcal {T}$
and arrows are operations in
$\mathcal {T}$
between them with their composition and identity operations.
The following result appears in [Reference Maietti and Maschio27, Theorem 4.3].
Theorem 3.2.
$\boldsymbol {\mathcal {C}}_{r}$
is a finitely complete category with disjoint stable finite coproducts, parameterized list objects, and weak exponentials. Moreover, finite coproducts in
$\boldsymbol {\mathcal {C}}_{r}$
are disjoint and stable.
3.2 Families of realized collections of
$\mathcal {T}$
Here, we provide a functorial account of the slice pseudofunctor over the category of collections
$\boldsymbol {\mathcal {C}}_{r}$
by defining an indexed category
as follows.
Suppose
$\textsf {A}$
is an object of
$\boldsymbol {\mathcal {C}}_{r}$
. A family of realized collections
$\textsf {C}$
on
$\textsf {A}$
is a formal expression
$\{x'|\,\varphi _{\textsf {C}}\}$
representing a subclass of natural numbers depending on natural numbers in
$\mathcal {T}$
where
$\varphi _{\textsf {C}}$
is a formula of
$\mathcal {T}$
with at most x and
$x'$
as free variablesFootnote
2
(we write
$x'\,\varepsilon \, \textsf {C}$
as an abbreviation for
$\varphi _{\textsf {C}}$
) for which
$x'\,\varepsilon \,\textsf {C}\,\vdash \,x\,\varepsilon \, \textsf {A}$
in
$\mathcal {T}$
. Families of realized collections on
$\textsf {A}$
with provably (in
$\mathcal {T}$
) equivalent membership relations are identified.
An operation from a family of realized collections
$\textsf {C}$
on
$\textsf {A}$
to another
$\textsf {D}$
is given by an equivalence class
$[\mathbf {n}]_{\approx _{\textsf {C},\textsf {D}}}$
of numerals such that in
$\mathcal {T}$
we have
$x'\,\varepsilon \,\textsf {C}\,\vdash \,\{\mathbf {n}\}(x,x')\,\varepsilon \,\textsf {D}$
with respect to the equivalence relation defined as follows:
$\mathbf {n}\approx _{\textsf {C},\textsf {D}} \mathbf {m}$
if and only if
$x'\,\varepsilon \, \textsf {C}\,\vdash _{\mathcal {T}}\,\{\mathbf {n}\}(x,x')=\{\mathbf {m}\}(x,x')$
.
If
$\textsf {f}=[\mathbf {n}]_{\approx _{\textsf {C},\textsf {D}}}:\textsf {C}\rightarrow \textsf {D}$
and
$\textsf {g}=[\mathbf {m}]_{\approx _{\textsf {D},\textsf {E}}}:\textsf {D}\rightarrow \textsf {E}$
are operations between families of realized collection on
$\textsf {A}$
, then their composition is defined as
IfFootnote
3
$\textsf {C}$
is a family of realized collections on
$\textsf {A}$
, then its identity operation is defined by
$\textsf {id}_{\textsf {C}}:=[\Lambda x.\Lambda x'.x']_{\approx _{\textsf {C},\textsf {C}}}: \textsf {C}\rightarrow \textsf {C}$
.
As discussed in [Reference Maietti and Maschio27, Theorem 4.6], for every object
$\textsf {A}$
of
$\boldsymbol {\mathcal {C}}_{r}$
, families of realized collections on
$\textsf {A}$
and operations between them together with their composition and identity operations define a category denoted with
$\mathbf {Col}^{r}(\textsf {A})$
.
If
$\textsf {f}:=[\mathbf {n}]_{\approx }:\textsf {A}\rightarrow \textsf {B}$
, then the following assignments give rise to a functor
$\mathbf {Col}^{r}_{\textsf {f}}$
from
$\mathbf {Col}^{r}(\textsf {B})$
to
$\mathbf {Col}^{r}(\textsf {A})$
:
-
1. for every object $\textsf {C}$
of
$\mathbf {Col}^{r}(\textsf {B})$
,
$\mathbf {Col}^{r}_{\textsf {f}}(\textsf {C}):=\{x'|\,x\,\varepsilon \, \textsf {A}\ \wedge \ x'\,\varepsilon \, \textsf {C}[\{\mathbf {n}\}(x)/x] \}$
; -
2. for every arrow $\textsf {g}:=[\mathbf {k}]_{\approx }:\textsf {C}\rightarrow \textsf {D}$
of
$\mathbf {Col}^{r}(\textsf {B})$
, $$ \begin{align*}\mathbf{Col}^{r}_{\textsf{f}}(\textsf{g}):=[\Lambda x.\Lambda x'. \{\mathbf{k}\}(\{\mathbf{n}\}(x),x')]_{\approx}:{\mathbf{Col}^{r}_{\textsf{f}}(\textsf{C})\rightarrow \mathbf{Col}^{r}_{\textsf{f}}(\textsf{D})}.\end{align*} $$
Moreover, the assignments
$\textsf {A}\mapsto \mathbf {Col}^{r}(\textsf {A})$
and
$\textsf {f}\mapsto \mathbf {Col}^{r}_{\textsf {f}}$
define an indexed category
The functors
$\mathbf {Col}^{r}_{\textsf {f}}$
are also called substitution functors and, as proven in [Reference Maietti and Maschio27, Theorem 4.8], these functors have left adjoints
which sends an object
$\textsf {C}\in \mathbf {Col}^r(\textsf {A})$
to
and an arrow
$\textsf {g}:=[\mathbf {m}]_{\approx }:\textsf {C}\to \textsf {D}$
to
Furthermore, in [Reference Maietti and Maschio27, Theorem 4.9] the authors provide also a weak versions of right adjoints
Now we recall an equivalent presentation of families of realized collections. We start by reminding the following result which appears as [Reference Maietti and Maschio27, Theorem 4.12].
Theorem 3.3. For every
$\textsf {A}$
in
$\boldsymbol {\mathcal {C}}_{r}$
,
$\boldsymbol {\mathcal {C}}_{r}/\textsf {A}$
and
$\mathbf {Col}^{r}(\textsf {A})$
are equivalent.
Therefore
$\mathbf {Col}^{r}$
is a functorial account of the slice pseudofunctor on
$\boldsymbol {\mathcal {C}}_{r}$
and hence it provides a split fibration
3.3 Families of realized sets
We recall from [Reference Maietti and Maschio27, Section 4.3] that internally in
$\boldsymbol {\mathcal {C}}_{r}$
it is possible to define a universe of sets as a fixpoint of a suitable admissible formula of
$\mathcal {T}$
. The universe of sets in
$\boldsymbol {\mathcal {C}}_{r}$
is defined as
$\textsf {U}_{\textsf {S}}:=\{x|\;\textsf {Set}(x) \}$
following [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29] when the foundational theory
$\mathcal {T}$
is an extension of
$\mathbf {CZF}$
. Instead, when
$\mathcal {T}$
is
${\widehat {ID_1}}$
, following [Reference Ishihara, Maietti, Maschio and Streicher20], the universe of sets is defined in a more complex way as
$\textsf {U}_{\textsf {S}}:=\{x|\;\textsf {Set}(x)\,\wedge \,\forall t\,(t\,\overline {\varepsilon }\,x\leftrightarrow \neg \, t {\not {\overline {\varepsilon }}} x)\}$
with the help of a membership relation
$t \,\overline {\varepsilon }\,x$
(which is defined also in the extensions of
$\mathbf {CZF}$
) and its negation
$ t {\not {\overline {\varepsilon }}} \ x$
defined simultaneously all together (recall that
${\widehat {ID_1}} $
is an arithmetical theory).
Definition 3.4. Let
$\textsf {A}$
be an object of
$\boldsymbol {\mathcal {C}}_{r}$
. The category
$\mathbf {Set}^{r}(\textsf {A})$
is the full subcategory of
$\mathbf {Col}^{r}(\textsf {A})$
whose objects, called families of realized sets on
$\textsf {A}$
, are families of realized collections on
$\textsf {A}$
of the form
for a numeral
$\mathbf {n}$
defining an operation
$[\mathbf {n}]_{\approx }:\textsf {A}\rightarrow \textsf {U}_{\textsf {S}}$
in
$\boldsymbol {\mathcal {C}}_{r}$
.
Applying the Grothendieck construction, we obtain the diagram

3.4 Categorical properties of realized collections and sets
We recall the properties of the categories of families of realized collections
$\mathbf {Col}^r(\textsf {A})$
. The following result appears as [Reference Maietti and Maschio27, Theorem 4.7].
Theorem 3.5. For every object
$\textsf {A}$
of
$\boldsymbol {\mathcal {C}}_{r}$
, the fibre
$\mathbf {Col}^{r}(\textsf {A})$
is a finitely complete category with parameterized list objects, finite coproducts, and weak exponentials. Moreover for every arrow
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
, the functor
$\mathbf {Col}^{r}_{\textsf {f}}$
preserves this structure.
We recall the main ingredients of the proof of Theorem 3.3 which will be used in the rest of the article. The proof of the above result relies on the definition of the following functors. The first one is
defined by the assignments
The second is the functor
defined by the assignments
where
$\Sigma (\textsf {A},\textsf {B})$
is the object defined as
The above theorem implies the following result which appears as [Reference Maietti and Maschio27, Corollary 4.13].
Corollary 3.6.
$\boldsymbol {\mathcal {C}}_r$
is weakly locally cartesian closed.
Observe that, since every arrow in
$\boldsymbol {\mathcal {C}}_r$
can be represented by many different numerals, the category
$\boldsymbol {\mathcal {C}}_r$
is weakly locally cartesian closed but not cartesian closed.
Now we recall the properties of the category of families of realized sets.
Definition 3.7. An arrow
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
is set-fibred if there exists an object
$\textsf {C}$
in
$\mathbf {Set}^{r}(\textsf {B})$
for which
$\textsf {f}$
is isomorphic in
$\boldsymbol {\mathcal {C}}_{r}/\textsf {B}$
to
$\mathbf {I}_{\textsf {B}}(\textsf {C})$
.
Lemma 3.8. If
$\textsf {f}:\textsf {B}\rightarrow \textsf {C}$
is an arrow in
$ \mathbf {Set}^r(\textsf {A})$
, then
$\mathbf {I}_{\textsf {A}}(\textsf {f})$
is a set-fibred arrow.
Proof. Let
$\mathbf {n}_{\textsf {f}}$
a numeral associated with
$\textsf {f}$
and take the object
$\textsf {D}$
in
$\mathbf {Col}^r( \Sigma (\textsf {A},\textsf {C}))$
defined as
which is in fact in
$\mathbf {Set}^r(\Sigma (\textsf {A},\textsf {C}))$
since it is defined by means of operations on which the universe
$\textsf {U}_{\textsf {S}}$
of sets is closed. Then
$\mathbf {I}_{\textsf {A}}(\textsf {f})$
, seen as an object in
$\boldsymbol {\mathcal {C}}_r/(\Sigma (\textsf {A},\textsf {C})$
, is isomorphic to
$\mathbf {I}_{\Sigma (\textsf {A},\textsf {C})}(\textsf {D})$
.
Using the encodings of
$\Sigma $
and
$\Pi $
, we obtain the following properties for substitution along set-fibred maps.
Lemma 3.9. If
$\textsf {f}:\textsf {A}\to \textsf {B}$
is set-fibred then
$\mathbf {Set}^r_{\textsf {f}}$
has a left adjoint.
Proof. Since
${\textsf {f}}$
is set-fibred, we can assume
for some numeral
$\mathbf {n}$
defining an operation
$[\mathbf {n}]_{\approx }:\textsf {A}\rightarrow \textsf {U}_{\textsf {S}}$
in
$\boldsymbol {\mathcal {C}}_{r}$
.
If
$[\mathbf {m}]_{\approx }:\Sigma (\textsf {B},\tau _{\textsf {B}}(\mathbf {n}))\rightarrow \textsf {U}_{\textsf {S}}$
in
$\boldsymbol {\mathcal {C}}_{r}$
, then
where
$\boldsymbol {\sigma }$
is a numeral representing the construction of codes of
$\Sigma $
-types in the universe of realized sets [Reference Ishihara, Maietti, Maschio and Streicher20].
Lemma 3.10. If
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
is set-fibred, for every object
$\textsf {C}$
in
$\mathbf {Set}^{r}(\textsf {A})$
the object
$\Pi ^{r}_{\textsf {f}}(\textsf {C})$
is isomorphic in
$\mathbf {Col}^{r}(\textsf {B})$
to an object of
$\mathbf {Set}^{r}(\textsf {B})$
.
Proof. Since
$\textsf {f}$
is set-fibred, we can assume
for some numeral
$\mathbf {n}$
defining an operation
$[\mathbf {n}]_{\approx }:\textsf {A}\rightarrow \textsf {U}_{\textsf {S}}$
in
$\boldsymbol {\mathcal {C}}_{r}$
.
If
$[\mathbf {m}]_{\approx }:\Sigma (\textsf {B},\tau _{\textsf {B}}(\mathbf {n}))\rightarrow \textsf {U}_{\textsf {S}}$
in
$\boldsymbol {\mathcal {C}}_{r}$
, then, considering the definition of
$\Pi ^r_{\textsf {f}}$
in [Reference Maietti and Maschio27, Theorem 4.9], we get that
where
$\boldsymbol {\pi }$
is a numeral representing the construction of codes of
$\Pi $
-types in the universe of realized sets [Reference Ishihara, Maietti, Maschio and Streicher20].
Using set-fibred arrows, we obtain the following extension of [Reference Maietti and Maschio27, Theorem 4.24].
Theorem 3.11. For every
$\textsf {A}$
in
$\boldsymbol {\mathcal {C}}_{r}$
,
$\mathbf {Set}^{r}(\textsf {A})$
is a finitely complete category with disjoint stable finite coproducts, parameterized list objects, and weak exponentials. Moreover, if
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
is set-fibred, then
$\mathbf {Set}^{r}_{\textsf {f}}$
has a left adjoint and for every object
$\textsf {C}$
in
$\mathbf {Set}^{r}(\textsf {A})$
the object
$\Pi ^{r}_{\textsf {f}}(\textsf {C})$
is isomorphic in
$\mathbf {Col}^{r}(\textsf {B})$
to an object of
$\mathbf {Set}^{r}(\textsf {B})$
.
The embedding of
$\mathbf {Set}^{r}$
in
$\mathbf {Col}^{r}$
preserves finite limits, finite coproducts, parameterized list objects, and weak exponentials.
3.5 Realized propositions
Now we recall the notion of realized propositions on
$\boldsymbol {\mathcal {C}}_{r}$
.
Definition 3.12. The indexed category
$\overline {{\mathbf {Prop}^r}}:\boldsymbol {\mathcal {C}}_{r}^{\mathrm{op}}\rightarrow \mathbf {Pos}$
is defined as the posetal reflection of
$\mathbf {Col}^{r}$
. In this case we write
$x'\Vdash \textsf {P}$
instead of
$x'\,\varepsilon \, \textsf {P}$
for an object
$\textsf {P}$
in
$\mathbf {Col}^{r}(\textsf {A})$
seen as a representative of an object
$[\textsf {P}]$
of
$\overline {{\mathbf {Prop}^r}}(\textsf {A})$
.
We recall the following definition.
Definition 3.13. If
$\boldsymbol {\mathcal {C}}$
is a finitely complete category, the doctrine of its weak subobjects
$\mathbf {wSub}_{\boldsymbol {\mathcal {C}}}$
is the posetal reflection of the slice pseudofunctor associated with
$\boldsymbol {\mathcal {C}}$
.
As proved in [Reference Maietti and Maschio27, Theorem 4.19], realized propositions correspond to weak subobjects.
Theorem 3.14. The functor
$\overline {{\mathbf {Prop}^r}}$
is a first-order hyperdoctrine naturally isomorphic to the doctrine of weak subobjects
$\mathbf {wSub}_{\boldsymbol {\mathcal {C}}_r}$
of
$\boldsymbol {\mathcal {C}}_r$
.
If
$\textsf {f}:\textsf {A}\to \textsf {B}$
is an arrow in
$\boldsymbol {\mathcal {C}}_r$
, the left and right adjoint to
$\overline {{\mathbf {Prop}^r}}_{\textsf {f}}$
will be denoted with
$\exists _{\textsf {f}}$
and
$\forall _{\textsf {f}}$
, respectively.
3.6 Realized small propositions
Definition 3.15. The functor
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}:\boldsymbol {\mathcal {C}}_{r}^{\mathrm{op}}\rightarrow \mathbf {Pos}$
is defined as the posetal reflection of the indexed category
$\mathbf {Set}^{r}$
. Then, fibre objects of
$\overline {{{\mathbf {Prop}^r_{\mathbf {s}}}}}$
are called small realized propositions.Footnote
4
We now obtain the following theorem which is a straightforward extension of [Reference Maietti and Maschio27, Theorem 4.27].
Theorem 3.16. For every object
$\textsf {A}$
in
$\boldsymbol {\mathcal {C}}_{r}$
,
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A})$
is a Heyting algebra and for every arrow
$\textsf {f}$
in
$\boldsymbol {\mathcal {C}}_{r}$
,
$(\overline {{\mathbf {Prop}^r_{\mathbf {s}}}})_{\textsf {f}}$
is a homomorphism of Heyting algebras.
Moreover, if
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
is set-fibred, then
$(\overline {{\mathbf {Prop}^r_{\mathbf {s}}}})_{\textsf {f}}$
has left
$\exists _{\textsf {f}}$
and right
$\forall _{\textsf {f}}$
adjoints satisfying Beck–Chevalley conditions.
3.7 Further notation
For every
$\textsf {f}:=[\mathbf {n}]_{\approx }:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
and every
$\textsf {C}$
in
$\mathbf {Col}^{r}(\textsf {B})$
, we denote with
$\Sigma (\textsf {f},\textsf {C})$
the arrow
$[\Lambda x. \{\mathbf {pair}\}(\{\mathbf {n}\}(\{\mathbf {p}_{1}\}(x)),\{\mathbf {p}_{2}\}(x))\, ]_{\approx }$
from
$\Sigma (\textsf {A},\mathbf {Col}_{\textsf {f}}^r(\textsf {C}))$
to
$\Sigma (\textsf {B},\textsf {C})$
. This arrow makes the following diagram a pullback in
$\boldsymbol {\mathcal {C}}_{r}$
:

(for details see [Reference Maietti and Maschio27, Lemma 4.11].
Now let
$\textsf {A}$
be an object in
$\boldsymbol {\mathcal {C}}_r$
and let
$\textsf {B}$
be an object of
$\mathbf {Col}^r(\textsf {A})$
. If
$\textsf {C}$
is an object in
$\mathbf {Col}^r(\Sigma (\textsf {A}, \textsf {B}))$
, then we define
$\Sigma ^{\textsf {A}}(\textsf {B},\textsf {C})$
as the object in
$\mathbf {Col}^r(\textsf {A})$
given by
$\Sigma _{\textsf {p}^\Sigma _1}(\textsf {C})$
.
Moreover, for every arrow
$\textsf {f}: \textsf {B}'\to \textsf {B}$
in
$\textbf {Col}^r(\textsf {A})$
, we define
$\Sigma ^{\textsf {A}}(\textsf {f}, \textsf {C})$
as the arrow
which makes the following diagram a pullback in
$\mathbf {Col}^r(\textsf {A})$
:

where
$\textsf {p}_1^{\textsf {A},\Sigma }:=[\Lambda x.\Lambda x'. \{\mathbf {p_2}\}(\{\mathbf {p_1}\}(x'))]_\approx $
.
We now define a currying isomorphism in
$\boldsymbol {\mathcal {C}}_r$
for every object
$\textsf {A}\in \boldsymbol {\mathcal {C}}_r$
,
$\textsf {B}\in \mathbf {Col}^r(\textsf {A})$
and
$\textsf {C}\in \mathbf {Col}^r(\Sigma (\textsf {A}, \textsf {B}))$
:
given by
4 An internal language for
${\mathbf {Prop}^r}$
and
$\mathbf {Col}^r$
As done in [Reference van Oosten42], we consider the internal language of the functors
${\mathbf {Prop}^r}$
and
$\mathbf {Col}^r$
. The former is in the form of a first-order typed language with equality, and the latter is in the form of one with dependent types.
A context
$\Gamma $
stands for an expression of the form
$[x_0:\textsf {A}_0, \dots , x_n:\textsf {A}_n(x_1,\dots , x_{n-1})]$
. A context substitution
$\bar {t}:\Gamma \to \Delta $
, where
$\Delta :=[y_0:\textsf {B}_0, \dots , y_m:\textsf {B}_m(y_0,\dots ,y_{m-1})]$
is a list of terms
$\bar {t}:=[t_0, \dots , t_m]$
such that
$t_i:\textsf {B}_i(t_0,\dots ,t_{i-1})$
is in context
$[\Gamma ]$
for
$0\le i\le m$
.
We will adopt the notation
$\textsf {C}_x(y)$
for a type in context
$x:\textsf {A}, y:\textsf {B}(x)$
and
$\textsf {f}_x:\textsf {B}(x)\to \textsf {B}'(x)$
for a term of type
$\textsf {B}'(x)$
in context
$x:\textsf {A}, y:\textsf {B}(x)$
.
Recall from [Reference Maietti and Maschio27], that contexts
$\Gamma $
are interpreted as objects
$\|\Gamma \|$
of the category
$\boldsymbol {\mathcal {C}}_r$
and substitutions of contexts as arrows of
$\boldsymbol {\mathcal {C}}_r$
. A formula
$\psi [\Gamma ]$
in context
$\Gamma $
is interpreted as an element of
${\mathbf {Prop}^r}(\|\Gamma \|)$
, while a dependent type
$\textsf {A}[\Gamma ]$
in context
$\Gamma $
is interpreted as an object of
$\mathbf {Col}^r(\|\Gamma \|)$
. Given the interpretations
$\|\bar {t}\|:\|\Gamma \|\to \|\Delta \|$
and
$\|\psi [\Delta ]\|\in {\mathbf {Prop}^r}(\|\Delta \|)$
, or
$\|\textsf {A}[\Delta ]\|\in \mathbf {Col}^r(\|\Delta \|)$
, then the interpretation of
$\psi (\bar {t})[\Gamma ]$
, or
$\textsf {A}(\bar {t})[\Gamma ]$
, is, respectively, given by
${\mathbf {Prop}^r}_{\|t\|}(\|\psi \|)$
, or
$\mathbf {Col}^r_{\|t\|}(\|\textsf {A}\|)$
.
Furthermore, we assume that given an interpretation of
$\textsf {A}[\Gamma ]$
as an object
$\|\textsf {A}\|\in \mathbf {Col}^r(\|\Gamma \|)$
, then the interpretation of the context
$[\Gamma , x:\textsf {A}]$
is given by the object
$\Sigma (\|\Gamma \|,\|\textsf {A}\|)$
of
$\boldsymbol {\mathcal {C}}_r$
. In particular, given a substitution
$\bar {t}:\Gamma \to \Delta $
and a type in context
$\textsf {A}[\Delta ]$
, then the substitution
$[\bar {t},y]:[\Gamma ,y:\textsf {A}(\bar {t})]\to [\Delta , z:\textsf {A}]$
is interpreted as the arrow
If
$\textsf {A}[\Gamma ]$
and
$\textsf {B}[\Gamma ]$
are types in the same context and
$f: \textsf {B}$
is a term in context
$[\Gamma , x:\textsf {A}]$
, then f is interpreted as an arrow
$\|f\|:\|\textsf {A}\|\to \|\textsf {B}\|$
in
$\mathbf {Col}^r(\|\Gamma \|)$
and the substitution
$[id_\Gamma ,f]:[\Gamma ,x:\textsf {A}]\to [\Gamma ,y:\textsf {B}]$
is interpreted as the arrow
If
$\psi [\Gamma ]$
is a formula in context, we define its validity
${\mathbf {Prop}^r}\vdash \psi [\Gamma ]$
if and only if
$\top _{\|\Gamma \|}\le _{\|\Gamma \|}\|\psi [\Gamma ]\|$
. Similarly, for a type
$\textsf {A}[\Gamma ]$
in context, we define
$\mathbf {Col}^r\vdash \textsf {A}[\Gamma ] $
if and only if there exists an arrow
$1_{\|\Gamma \|}\to \|\textsf {A}[\Gamma ]\|$
.
Since, the interpretation of the internal language of
${\mathbf {Prop}^r}$
extends Kleene realizability interpretation
$\Vdash $
of
$\textsf {HA}$
(see [Reference Maietti and Maschio27, Lemma 4.32]), and the elements of
${\mathbf {Prop}^r}(\|\Gamma \|)$
are equivalence classes of those in
$\mathbf {Col}^r(\|\Gamma \|)$
, we shall adopt the notation
$t\Vdash \textsf {A}$
for a term
$t:\textsf {A}$
in context
$\Gamma $
of a representative
$\textsf {A}$
of some proposition in
${\mathbf {Prop}^r}(\|\Gamma \|)$
, while we shall adopt the notation
$t\varepsilon \textsf {A}$
for a term
$t:\textsf {A}$
in context
$\Gamma $
when we see
$\textsf {A}$
as a collection.
5 The predicative effective topos
$\textbf {pEff}$
In [Reference Maietti and Maschio27], the predicative effective topos
$\textbf {pEff}$
is defined as the base category
$\mathcal {Q}_{\overline {\mathbf {Prop}^r}}$
of the elementary quotient completion of the elementary doctrine
$\overline {\mathbf {Prop}^r}$
. It is the category whose objects are the pairs
$(\textsf {A},[\textsf {R}])$
where
$\textsf {A}$
is an object of the category
$\boldsymbol {\mathcal {C}}_{r}$
and
$[\textsf {R}]$
is an object of
$\overline {\mathbf {Prop}^{r}}(\textsf {A}\times \textsf {A})$
such that
-
1. $\top _{\textsf {A}}\le _{\textsf {A}}\overline {\mathbf {Prop}^{r}}_{\Delta _{\textsf {A}}}([\textsf {R}])$
; -
2. $[\textsf {R}]\le _{\textsf {A}\times \textsf {A}}\overline {\mathbf {Prop}^{r}}_{\langle p_2,p_1\rangle }([\textsf {R}])$
, where
$p_1,p_2:\textsf {A}\times \textsf {A}\to \textsf {A}$
are the projections; -
3. $\overline {\mathbf {Prop}^{r}}_{\langle p_1,p_2\rangle }([\textsf {R}]) \wedge \overline {\mathbf {Prop}^{r}}_{\langle p_2,p_3\rangle }([\textsf {R}])\le _{\textsf {A}\times \textsf {A}\times \textsf {A}}\overline {\mathbf {Prop}^{r}}_{\langle p_1,p_3\rangle }([\textsf {R}])$
, where
$p_1,p_2, p_3:\textsf {A}\times \textsf {A}\times \textsf {A}\to \textsf {A}$
are the corresponding projections.
Equivalently, the above conditions state that
$[\textsf {R}]$
is an equivalence relation for the internal logic of the doctrine
$\overline {\mathbf {Prop}^{r}}$
(see [Reference Maietti and Maschio27, Definition 5.1]).
An arrow from
$(\textsf {A},[\textsf {R}])$
to
$(\textsf {B},[\textsf {S}])$
is an equivalence class
$[\textsf {f}]$
of arrows
$\textsf {f}:\textsf {A}\rightarrow \textsf {B}$
in
$\boldsymbol {\mathcal {C}}_{r}$
such that
$[\textsf {R}]\le _{\textsf {A}\times \textsf {A}}\overline {\mathbf {Prop}^{r}}_{\textsf {f}\times \textsf {f}}([\textsf {S}])$
, where
$\textsf {f}\sim \textsf {g}$
if and only if
$\top _{\textsf {A}}\le _{\textsf {A}}\overline {\mathbf {Prop}^{r}}_{\langle \textsf {f},\textsf {g}\rangle } ([\textsf {S}])$
.
Moreover, we recall from [Reference Maietti and Maschio27, Theorem 5.2] that
$\textbf {pEff}$
is equivalent to the exact completion
$(\boldsymbol {\mathcal {C}}_r)_{ex/lex}$
of the left exact category
$\boldsymbol {\mathcal {C}}_r$
. Indeed, this follows from Theorem 3.14 and the fact that the elementary quotient completion of a weak subobject doctrine on a lex category
${C}$
is equivalent to the exact on lex completion of
${C}$
(see [Reference Maietti and Rosolini31, Reference Maietti and Rosolini32]).
The following appears as [Reference Maietti and Maschio27, Theorem 5.5].
Theorem 5.1. The category
$\textbf {pEff}$
is a locally cartesian closed list arithmetic pretopos.
6 Families of collections and sets over
$\textbf {pEff}$
In this section, we define suitable categories for every object
$(\textsf {A},[\textsf {R}]) \in \textbf {pEff}$
that are apt to interpret the notions of families of collections and sets in
$\textbf {pEff}$
. Slice categories provide a natural account of the notion of families of collections over an object
$(\textsf {A},[\textsf {R}]) \in \textbf {pEff}$
; however, families of sets require additional considerations to be defined. To do that, by analogy with [Reference Maietti25], we define for every representative of
$[\textsf {R}]$
a category of extensional dependent collections
$Dep_{\textbf {pEff}}(\textsf {A},{\textsf {R}})$
and show that it is equivalent to the category of suitable internal groupoid actions
$\mathcal {Des}(p,{\textsf {R}})$
. Since the objects of
$Dep_{\textbf {pEff}}(\textsf {A},{\textsf {R}})$
are defined through the indexed categories
$\mathbf {Col}^r$
and
${\mathbf {Prop}^r}$
, we can easily define a notion of extensional dependent sets and equivalently obtain a subcategory of
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
, independently of the representative
${\textsf {R}}$
.
The intuitive idea behind the definition of a family of collections over
$(\textsf {A},\textsf {R})$
is the following:
-
• first we take a family of realized collections $\textsf {B}(a)$
over
$\textsf {A}$
in
$\boldsymbol {\mathcal {C}}_{r}$
; -
• then, we take an equivalence relation $\textsf {S}_{a}(b,b')$
on each
$\textsf {B}(a)$
(depending on
$\textsf {A}$
); -
• furthermore, we take a family of transport maps $b\mapsto \sigma _{a,a'}(r,b)$
for
$a,a'\,\varepsilon \, \textsf {A}$
,
$b\,\varepsilon \, B(a)$
, and
$r\Vdash \textsf {R}(a,a')$
such that
$\sigma _{a,a'}(r,b)\,\varepsilon \, \textsf {B}(a')$
; -
• finally, we ask $\sigma $
to satisfy the following conditions, which make it a sort of action:-
1. if $S_{a}(b,b')$
and
$r\Vdash \textsf {R}(a,a')$
, then
$\textsf {S}_{a'}(\sigma _{a,a'}(r,b),\sigma _{a,a'}(r,b'))$
, that is,
$\sigma $
respects
$\textsf {S}$
; -
2. if $r\Vdash \textsf {R}(a,a)$
and
$b\,\varepsilon \, \textsf {B}(a)$
, then
$\textsf {S}_{a}(b,\sigma _{a,a}(r,b)))$
, that is,
$\sigma $
is well-behaved with respect to identities; -
3. if $r\Vdash \textsf {R}(a,a")$
,
$r'\Vdash \textsf {R}(a,a')$
,
$r"\Vdash \textsf {R}(a',a")$
, and
$b\,\varepsilon \, \textsf {B}(a)$
, then $$ \begin{align*}\textsf{S}_{a"}(\ \sigma_{a,a"}(r,b)\ ,\ \sigma_{a',a"}(r", \sigma_{a,a'}(r',b))\ ),\end{align*} $$
that is, $\sigma $
is well-behaved with respect to composition.
Observe that, taking $a'=a"$
and a witness for the reflexivity of
$\textsf {R}$
, conditions 2. and 3. above imply the following condition stating that
$\sigma $
, once we fix two related objects
$a,a'$
, does not depend on the particular realizer of
$\textsf {R}(a,a')$
:-
4. ${\textsf {S}}_{a'}(\sigma _{a,a'}(r,b),\sigma _{a,a'}(r',b))$
for every
$b\,\varepsilon \, \textsf {B}(a)$
,
$a,a'\varepsilon \textsf {A}$
,
$r,r'\Vdash \textsf {R}(a,a')$
;
-
To formulate in a precise way this idea we need first to introduce the notion of fibered
${\overline {\textbf {Prop}^r}}$
-equivalence relation.
Definition 6.1. Let
$\textsf {A}$
be an object of
$\boldsymbol {\mathcal {C}}_r$
and let
$\textsf {B}$
be an object of
$\textbf {Col}^r(\textsf {A})$
. A fibered
${\overline {\mathbf {Prop}}^r}$
-equivalence relation on
$\textsf {B}$
, or simply a fibered equivalence relation on
$\textsf {B}$
, is an object
$[\textsf {S}]$
in
${\overline {\textbf {Prop}^r}}(\Sigma (\textsf {A},\textsf {B}\times \textsf {B}))$
such that
-
1. $\top _{\Sigma (\textsf {A},\textsf {B})}\le _{\Sigma (\textsf {A},\textsf {B})}{\overline {\textbf {Prop}^r}}_{\textbf {I}_{\textsf {A}}(\Delta _{\textsf {B}})}([\textsf {S}])$
; -
2. $[\textsf {S}]\le _{\Sigma (\textsf {A},\textsf {B}\times \textsf {B})}{\overline {\textbf {Prop}^r}}_{\textbf {I}_{\textsf {A}}(\langle p_2,p_1\rangle )}([\textsf {S}])$
; -
3. ${\overline {\textbf {Prop}^r}}_{\textbf {I}_{\textsf {A}}(\langle p_1,p_2\rangle )}([\textsf {S}])\wedge {\overline {\textbf {Prop}^r}}_{\textbf {I}_{\textsf {A}}(\langle p_2,p_3\rangle )}([\textsf {S}])\le _{\Sigma (\textsf {A},\textsf {B}\times \textsf {B} \times \textsf {B})} {\overline {\textbf {Prop}^r}}_{\textbf {I}_{\textsf {A}}(\langle p_1,p_3\rangle )}([\textsf {S}])$
.
Definition 6.2. Let
$(\textsf {{A},[{R}]})$
be an object of
$\textbf {pEff}$
. An extensional dependent collection on
$(\textsf {{A} , [ {R}]})$
, with respect to
${\textsf {R}}$
, is a triple
$(\textsf {B},[\textsf {S}],\sigma )$
where
$\textsf {B}\in \textbf {Col}^r(\textsf {A})$
,
$[\textsf {S}]$
is a dependent
${\overline {\textbf {Prop}^r}}$
-equivalence relation on
$\textsf {B}$
and
is an arrow in
$\textbf {Col}^r(\textsf {A}\times \textsf {A})$
satisfying
-
1. $\sigma $
preserves
$[\textsf {S}]$
, that is, for the arrow 
it holds
$$ \begin{align*}\overline{\textbf{Prop}^r}_{{\Sigma(p_1,\textsf{B}\times\textsf{B})\circ\textbf{I}(p_1)}}[\textsf{S}]\le \overline{\textbf{Prop}^r}_{\Sigma(p_2,\textsf{B}\times\textsf{B})\circ {\textbf{I}((\sigma\circ \langle p_1, p_2\rangle)\times (\sigma\circ\langle p_1,p_3\rangle))}}[\textsf{S}],\end{align*} $$
where $\Sigma (p_i,\textsf {B}\times \textsf {B}):\Sigma (\textsf {A}\times \textsf {A},\textbf {Col}^r_{p_1}(\textsf {B}\times \textsf {B}) )\to {\Sigma (\textsf {A},\textsf {B}\times \textsf {B})}$
, for
$i=1,2$
assuming that
$\textbf {Col}^r_{p_1}(\textsf {B}\times \textsf {B}) $
is exactly
$\textbf {Col}^r_{p_1}(\textsf {B})\times \textbf {Col}^r_{p_1}(\textsf {B})$
. -
2. $\sigma $
preserves the identities, that is, for the unique arrow
$\rho $
making the following diagram commute: 
then $\top \le {\overline {\textbf {Prop}^r}}_{\rho }([\textsf {S}])$
. -
3. $\sigma $
preserves the composition, that is, for the unique arrow
$\tau $
Footnote
5

such that
-
• $\mathbf {I}(p_1)\circ \tau = \mathbf {I}(\mathbf {Col}^r_{\langle p_1,p_3\rangle }(\sigma )\circ \langle p_1,p_4\rangle )$
; -
• $\mathbf {I}(p_2)\circ \tau =\mathbf {I}(p_1)\circ \mathbf {I}( id \times ( \mathbf {Col}^r_{\langle p_2,p_3\rangle }(\sigma )\circ ( id\times \mathbf {Col}^r_{\langle p_1,p_2\rangle }(\sigma )) ))$
;
it holds that $\top \le {\overline {\textbf {Prop}^r}}_{\Sigma (p_3, \textsf {B}\times \textsf {B})\circ \tau }([\textsf {S}])$
. -
Definition 6.3. Let
$(\textsf {A},[\textsf {R}])$
be an object in
$\textbf {pEff}$
. A morphism between extensional dependent collections over
$(\textsf {A},[\textsf {R}])$
w.r.t.
${\textsf {R}}$
from
$(\textsf {B},[\textsf {S}],\sigma )$
to
$(\textsf {C},[\textsf {H}],\nu )$
is an equivalence class
${[\textsf {f}]}_{\cong } $
of arrows
$\textsf {f}:\textsf {B}\to \textsf {C}$
in
$\textbf {Col}^r(\textsf {A})$
such that
-
1. $\textsf {f}$
respects the equivalence relations: $$ \begin{align*}[\textsf{S}]\le\overline{\textbf{Prop}^r}_{\textbf{I}(\textsf{f}\times \textsf{f})}([\textsf{H}]);\end{align*} $$
-
2. $\textsf {f}$
commutes with the transport maps, that is, in the internal language it satisfies
$\textsf {H}(\nu _{a,a'}(r,\textsf {f}(b)), \textsf {f}(\sigma _{a,a'}(r,b)))$
and formally: $$ \begin{align*}\top\le \overline{\textbf{Prop}^r}_{\Sigma(p_2,\textsf{C}\times\textsf{C})\circ\textsf{squ}}([\textsf{H}]),\end{align*} $$
where $\textsf {squ}:= \textbf {I}(\langle \nu \circ (1_{\textsf {R}}\times \textbf {Col}^r_{p_1}(\textsf {f})) , \textbf {Col}^r_{p_2}(\textsf {f})\circ \sigma \rangle )$
is the unique arrow making the following diagram commute: 
and
$\textsf {f}\sim \textsf {g}$
if and only if
$[\textsf {S}]\le \overline {\textbf {Prop}^r}_{\textbf {I}(\textsf {f}\times \textsf {g})}([\textsf {H}])$
.
Remark 6.4. The above notion was inspired by that of extensional dependent collection in the context of dependent type theory in [Reference Maietti25].
Definition 6.5. Let
$(\textsf { {A},[ {R}]})$
be an object of
$\textbf {pEff}$
. An extensional dependent set on
$(\textsf {{A} , [{R}]})$
w.r.t
${\textsf {R}}$
is an extensional dependent collection
$(\textsf {B},[\textsf {S}],\sigma )$
on
$(\textsf {{A} , [{R}]})$
w.r.t
${\textsf {R}}$
such that
$\textsf {B}\in \textbf {Set}^r(\textsf {A})$
and
$[\textsf {S}]\in {\overline {\textbf {Prop}_s^r}}(\Sigma (\textsf {A},\textsf {B}\times \textsf {B}))$
.
Definition 6.6. Given
$(\textsf {A},[\textsf {R}])\in \textbf {pEff}$
, we denote with
$Dep_{\textbf {pEff}}(\textsf {A},{\textsf {R}})$
the category of extensional dependent collections on
$(\textsf {{A} , [ {R}]})$
w.r.t
${\textsf {R}}$
and arrows between them. Furthermore, we denote with
$Dep_{\textbf {pEff}_{set}}(\textsf {A},{\textsf {R}})$
its full subcategory on extensional dependent sets.
Lemma 6.7. Let
$(\textsf {A},[\textsf {R}])$
be an object in
$\mathbf {pEff}$
and let
$\textsf {R},\textsf {R}'$
be two representatives of
$[\textsf {R}]$
. The categories
$Dep_{\mathbf {pEff}}(\textsf {A},{\textsf {R}})$
and
$Dep_{\mathbf {pEff}}(\textsf {A},{\textsf {R}}')$
are equivalent. The same holds for extensional dependent sets.
Proof. The fact that
$\textsf {R}$
and
$\textsf {R}'$
are in
$[\textsf {R}]\in \overline {{\mathbf {Prop}^r}}(\textsf {A}\times \textsf {A})$
imply that there exist two arrows
$h:\textsf {R}\to \textsf {R}'$
and
$k:\textsf {R}'\to \textsf {R}$
in
$\mathbf {Col}^r(\textsf {A}\times \textsf {A})$
. We can construct the functor
that sends an extensional dependent collection
$(\textsf {B},[\textsf {S}],\sigma )$
to
$(\textsf {B},[\textsf {S}],\sigma \circ (id \times k))$
and every arrow into itself. It is straightforward to prove this functor is an equivalence considering the similar functor
In the following proposition, we show directly that extensional dependent collections induce objects in the slice categories of
$\textbf {pEff}$
.
Proposition 6.8. Let
$(\textsf {A},[\textsf {R}])$
be an object in
$\mathbf {pEff}$
. There exists a full and faithful essentially surjective functor
Proof. For every object
$(\textsf {B},\textsf {S},\sigma )$
we define
for the commutative diagram

Where k is the isomorphism given by
$\langle \Sigma (p_1, \textsf {B})\circ \mathbf {I}(p_1),\Sigma (p_2, \textsf {B})\circ \mathbf {I}(p_2)\rangle $
.
Informally, the domain of the arrow above has pairs
$(a,b)$
with
$a\in \textsf {A}$
and
$b\in \textsf {B}(a)$
as elements. A realizer for an equivalence of two such pairs
$(a,b)$
and
$(a',b')$
is a pair
$(r,s)$
such that
$r\Vdash \textsf {R}(a,a')$
and
$s\Vdash \textsf {S}_{a'}(\sigma _{a,a'}(r,b),b')$
.
For
$[\textsf {f}]:(\textsf {B},[\textsf {S}],\sigma )\rightarrow (\textsf {C},[\textsf {H}],\eta )$
we define
$\mathbf {K}([\textsf {f}])$
as
$[\mathbf {I}(\textsf {f})]$
. Such arrow preserves the equalities of the domains of
$\mathbf {K}((\textsf {B},[\textsf {S}],\sigma ) )$
and
$ \mathbf {K} ( (\textsf {C},[\textsf {H}],\eta ) )$
. Indeed, if there exists
$r \Vdash \textsf {R}(a,a')$
such that
$\textsf {S}_{a'}(\sigma _{a,a'}(r,b), b')$
, then one obtains that
$\textsf {H}_{a'}(\textsf {f}(\sigma _{a,a'}(r,b)),\textsf {f}(b'))$
because
$\textsf {f}$
preserves
$\textsf {S}$
and
$\textsf {H}$
. Now, since
$\textsf {f}$
commutes with transport maps, then
$\textsf {H}_{a'}(\textsf {f}(\sigma _{a,a'}(r,b)),\eta _{a,a'}(r,\textsf {f}(b)))$
. Hence, transitivity of
$\textsf {H}$
implies
$\textsf {H}_{a'}( \textsf {f}(b')\, ,\, \eta _{a,a'}(r,\textsf {f}(b)) )$
. Thus,
$[\mathbf {I}(\textsf {f})]$
is well defined and the assignments define a functor.
To prove fullness we need to show that every arrow h in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
between objects in the image of
$\mathbf {K}$
has the form
$[\mathbf {I}(\widetilde {h})]$
. Assume now two objects
$(\textsf {B},[\textsf {S}],\sigma )$
and
$(\textsf {C},[\textsf {H}],\eta )$
in
$Dep_{\textbf {pEff}}(\textsf {A}, {\textsf {R}})$
. Any arrow from
$\mathbf {K}((\textsf {B},[\textsf {S}],\sigma ) )$
to
$ \mathbf {K} ( (\textsf {C},[\textsf {H}],\eta ) )$
is given by an arrow h in
$\boldsymbol {\mathcal {C}}_r$
from
$\Sigma (\textsf {A},\textsf {B})$
to
$\Sigma (\textsf {A},\textsf {C})$
such that
$\textsf {p}_1^{\Sigma }\circ h=\textsf {p}_1^{\Sigma }$
in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
. To see how this h induces an arrow
$\widetilde {h}: \textsf {B}\rightarrow \textsf {C}$
in
$\mathbf {Col}^r(\textsf {A})$
for which
$\mathbf {I}(\widetilde {h})=h$
in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
, assume that
$r\Vdash \textsf {R}((p_1\circ h)(a,b), a)$
for
$a\in A$
and
$b\in \textsf {B}(a)$
. Then, denoting
$(p_1\circ h)(a,b)$
by
$a_p$
we can define
$\widetilde {h} (b)$
as
$\eta _{a_p,a} ( r,(p_2 \circ h) (a,b))$
which is an element of
$\textsf {C}(a)$
. Such an arrow
$\widetilde {h}$
determines in fact an arrow in
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
from
$(\textsf {B},[\textsf {S}],\sigma )$
and
$(\textsf {C},[\textsf {H}],\eta )$
using the properties of the original arrow h. Indeed, informally, if there is a realizer of
$\textsf {S}_a(b,b')$
, then
$(a,b)$
and
$(a,b')$
are equivalent in the domain of
$\mathbf {K}((\textsf {B},[\textsf {S}],\sigma ) ))$
. Hence
$h(a,b)$
and
$ h(a,b')$
are equivalent in the domain of
$ \mathbf {K} (( \textsf {C},[\textsf {H}],\eta )) $
, namely there exists a realizer s satisfying
$s\Vdash \textsf {R}( \, (p_1 \circ h) (a,b),(p_1 \circ h) (a,b'))$
and
$\textsf {H}(\eta _{a_1,a_2}( s, (p_2 \circ h) (a,b)), (p_2 \circ h) (a,b') )$
after denoting
$(p_1 \circ h) (a,b)$
by
$a_1$
and
$(p_1 \circ h) (a,b')$
by
$a_2$
. Now, since there exist
$r_1\Vdash \textsf {R} ((p_1 \circ h) (a,b),\, a) $
and
$r_2\Vdash \textsf {R} ((p_1 \circ h) (a,b'),\, a)$
we get
$\textsf {H} (\eta _{a_1,a}( \textsf {tra}(s,r_2), (p_2 \circ h) (a,b)), \, \eta _{a_2,a}( r_2, (p_2 \circ h) (a,b'))) $
because
$\eta $
is well-behaved with respect to composition of realizers. Then, by the independence of realizers
$\textsf {H}( \eta _{a_1,a}( \textsf {tra}(s,r_2),\, (p_2 \circ h) (a,b)),\,\,\eta _{a_1,a} ( r_1, (p_2 \circ h) (a,b) ))$
holds, from which by transitivity of
$\textsf {H}$
we conclude
$\textsf {H}(\widetilde {h}(b),\widetilde {h}(b'))$
and hence,
$\widetilde {h}$
is well defined. To prove that
$\widetilde {h}$
commutes with the transport maps, we have to show that for every
$a,a'\in \textsf {A}$
and
$s\Vdash \textsf {R}(a,a')$
and
$b\in \textsf {B}(a)$
, then
$\widetilde {h}(\sigma _{a,a'}(s,b))$
is equal to
$\eta _{a,a'}(s, \widetilde {h}(b))$
. The former term is equal to
$\eta _{a_2,a'} (r_2,(p_2\circ h)(a',\sigma _{a,a'}(s,b)))$
for
$r_2\Vdash \textsf {R}(a_2,a')$
, where
$a_2:=(p_1\circ h)(a',\sigma _{a,a'}(s,b))$
.
While the latter is equal to
$\eta _{ a,a'}(s,\eta _{a_1,a}(r_1,(p_2\circ h)(a,b)))$
, for
$r_1\Vdash \textsf {R}(a_1,a)$
with
$a_1:=(p_1\circ h)(a,b)$
. Since h preserves equality and
$(a,b)$
is equal to
$(a',\sigma _{a,a'}(s,b))$
in the domain of
$ \mathbf {K} (( \textsf {B},[\textsf {S}],\sigma )) $
, then there exists a term u for which
$u\Vdash \textsf {R} ((p_1\circ h)(a,b),(p_1\circ h)(a',\sigma _{a,a'}(s,b)))$
for which we get the validity of
$\textsf {H}_{a_1}(\eta _{a_2,a_1} (u, (p_2\circ h)(a,b)), (p_2\circ h)(a', \sigma _{a,a'}(s,b)))$
. Hence, the statement follows since
$\eta $
preserve equalities and is well-behaved with respect to composition.
Faithfulness is immediate once one notices that the equivalence of arrows h’s in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
in the image of
$\mathbf {K}$
corresponds exactly to the equivalence of the corresponding
$\widetilde {h}$
’s in
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
.
Now given an object
$[\textsf {f}]_{\cong }:(\textsf {A}', [\textsf {R}']) \to (\textsf {A},[\textsf {R}])$
in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
, we build a triple
$(\textsf {B}^{\textsf {f}}, [\textsf {S}]^{\textsf {f}}, \sigma ^{\textsf {f}})$
in
$Dep_{\textbf {pEff}}(\textsf {A},{\textsf {R}})$
. In order to do that, we consider the arrow
$p_1:\textsf {A}\times \textsf {A}'\to \textsf {A}$
and define
$\textsf {B}^{\textsf {f}}:=\Sigma _{p_1}(\mathbf {Col}^r_{ (\textsf {id}_{\textsf {A}}\times \textsf {f})}(\textsf {R}))$
. Intuitively,
$\textsf {B}^{\textsf {f}}(a)$
is given by pairs
$(a', k)$
where
$a'\in \textsf {A}'$
and
$k \Vdash \textsf {R}(a, \textsf {f}(a')) $
. Then we define
to be the relation
$\textsf {R'}$
on the
$\textsf {A}'$
components of
$\textsf {B}^{\textsf {f}}$
where
and
$\mathbf {I}_{\textsf {A}}(p_i):\Sigma (\textsf {A},\Sigma _{p_1}(\mathbf {Col}^r_{ (\textsf {id}_{\textsf {A}}\times \textsf {f})}(\textsf {R})\times \mathbf {Col}^r_{ (\textsf {id}_{\textsf {A}}\times \textsf {f})}(\textsf {R})))\to \Sigma (\textsf {A},\Sigma _{p_1}(\mathbf {Col}^r_{ (\textsf {id}_{\textsf {A}}\times \textsf {f})}(\textsf {R})))$
, for
$i=1,2$
.
Finally, we can define
$\sigma ^{\textsf {f}}$
as the arrow which sends a triple
$(r,(a', k))$
with
$(a', k)\in \textsf {B}^{\textsf {f}}(a_1)$
and
$r \Vdash \textsf {R}(a_1, a_2)$
to the pair
$(a', \textsf {tr}(\textsf {sym}(r), k))\in \textsf {B}^{\textsf {f}}(a_2)$
where
$\textsf {tr}(\textsf {sym}(r), k)\Vdash \textsf {R}(a_2, \textsf {f}(a'))$
and
$\textsf {refl, sym}$
, and
$\textsf {tr}$
are some chosen witnesses of the reflexivity, symmetry, and transitivity of
$\textsf {R}$
. We leave this to the reader.
Now we can observe that
$\mathbf {K}(\textsf {B}^{\textsf {f}}, [\textsf {S}]^{\textsf {f}}, \sigma ^{\textsf {f}})\cong [\textsf {f}]_{\cong }$
. Indeed, there is an obvious arrow from
$\Sigma (\textsf {A},\textsf {B}^{\textsf {f}})$
to
$\textsf {A}'$
which takes the
$\textsf {A}'$
component of
$\textsf {B}^{\textsf {f}}$
to itself. Vice versa, given an element
$a'\in \textsf {A}'$
, we can consider the triple
$(\textsf {f}(a'), (a', \textsf {refl}))\in \Sigma (\textsf {A},\textsf {B})$
. These arrows are inverse thanks to the relations
$[\textsf {R}']$
and
$\exists _{d_{{\textsf {R}}}}(\overline {\mathbf {Prop}^r}_{t_\sigma }([\textsf {S}]^{\textsf {f}}))$
.
Remark 6.9. The above functor
$\mathbf K$
can be part of an adjoint-equivalence between the categories
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
and
$ \textbf {pEff} /(\textsf {A},[\textsf {R}])$
provided that we assume the axiom of choice for subsets of natural numbers in the meta-theory, which is of course derivable in a classical meta-theory. However, for our applications involving
$\textbf {pEff}$
, we will not need the existence of an adjoint-equivalence out of
$\mathbf K$
. We just need to know that
$\mathbf {K}:Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})\rightarrow \textbf {pEff}/(\textsf {A},[\textsf {R}])$
preserves and reflects all limits, colimits, and exponentials, which follows from Proposition 6.8.
Remark 6.10. If
$(\textsf {A},[\textsf {R}])$
is an object in
$\textbf {pEff}$
and
$\textsf {R},\textsf {R}'$
are two representatives of
$[\textsf {R}]$
as in Lemma 6.7, then the image through
$\mathbf {K}$
of the categories
$Dep_{\textbf {pEff}}(\textsf {A}, {\textsf {R}})$
and
$Dep_{\textbf {pEff}}(\textsf {A}, {\textsf {R}}')$
is the same, that is, the following diagram commutes:
![Commutative diagram. D e p sub p E f f (A, R) maps to D e p sub p E f f (A, R prime) via minus circle k and back via minus circle h with isomorphism symbol. Both map down to p E f f / (A, [R]) via bold K.](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20260929004022291-0509:S0022481226102497:S0022481226102497_eqnu41.png?pub-status=live)
We conclude this section by providing a direct correspondence between extensional dependent collections and internal groupoid action (see [Reference Janelidze and Tholen22, Reference MacLane and Moerdijk23] for a precise definition) in
$\textbf {pEff}$
. Indeed, for every object
$(\textsf {A},[\textsf {R}])\in \textbf {pEff}$
, consider the object
$(\textsf {A},[=_{\textsf {A}}])$
where
$=_{\textsf {A}}$
is the equality of the
$\boldsymbol {\mathcal {C}}_r$
-object
$\textsf {A}$
in the first-order hyperdoctrine
$\overline {{\mathbf {Prop}^r}}$
in Theorem 3.14. Then, the kernel pair of the quotient arrow
induces an internal groupoid
$\textsf {Ker}(p, {\textsf {R}})$
obtained through the kernel pair of p.
![Ellipsis and three right arrows to (Sigma(A times A, R), [= sub A times A]) followed by three arrows, two right with labels [pi sub 1] and [pi sub 2] and one left, to (A, [= sub A]).](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20260929004022291-0509:S0022481226102497:S0022481226102497_eqnu43.png?pub-status=live)
and for any other representative
${\textsf {R}}'\in [\textsf {R}]$
the two internal groupoids are isomorphic in the category of internal groupoids of
$\textbf {pEff}$
.
Indeed, denoting with
$\mathcal {Des}(p, {\textsf {R}})$
the category of the actions of
$\textsf {Ker}(p, {\textsf {R}})$
in
$\textbf {pEff}$
, we obtain the following result.
Proposition 6.11. Let
$(\textsf {A},[\textsf {R}])$
be an object in
$\mathbf {pEff}$
and
the above mentioned quotient map. There exists a full and faithful essentially surjective functor
Proof. By general descent theory, there exists a canonical comparison functor (see [Reference Janelidze and Tholen22, Section 2.2])
Since p is a regular epimorphism and
$\textbf {pEff}$
is exact, then we obtain that p is an effective descent morphism, that is, the functor
$\Phi ^{p, {\textsf {R}}}$
is full, faithful, and essentially surjective (see [Reference Janelidze and Tholen22, Section 2.4]). The functor F is defined as the composition of
$\mathbf {K}$
and
$\Phi ^{p,\textsf {R}}$
.
7 The structure of fibred extensional sets on
$\textbf {pEff}$
We study the categorical structure of extensional dependent sets, introduced in Definition 6.6, as a subfibration of the codomain fibration of
$\textbf {pEff}$
denoted with
Fibrations are needed because families of collections and sets lose functoriality under substitution when lifted to extensional objects over
$\textbf {pEff}$
. Since slice categories naturally represent families of collections over an object of
$\textbf {pEff}$
, we work inside the codomain fibration over
$\textbf {pEff}$
.
To this end, we exploit the functor
$\mathbf {K}$
of Proposition 6.8 and first prove the following result.
Lemma 7.1. Let
$[p]:(\textsf {A}',[\textsf {R}'])\to (\textsf {A},[\textsf {R}]),$
be an arrow in
$\mathbf {pEff}$
. If
$[f]\in \mathbf {pEff}/(\textsf {A},[\textsf {R}])$
is isomorphic to the image through
$\mathbf {K}$
of an extensional dependent set
$(\textsf {B},[\textsf {S}],\sigma )\in Dep_{\mathbf {pEff}_{set}}(\textsf {A}, {\textsf {R}}) $
, then
$[p]^*[f]$
is isomorphic to the image through
$\mathbf {K}$
of an element in
$Dep_{\mathbf {pEff}_{set}}(\textsf {A}, {\textsf {R}'}) $
.
Proof. We assume that
$[f]$
is isomorphic to
$\mathbf {K}((\textsf {B},[\textsf {S}],\sigma ))$
, then we can choose two representatives
$f:\textsf {A}'\to \textsf {A}$
in
$\boldsymbol {\mathcal {C}}_r$
and
$g:\textsf {R}'\to \mathbf {Prop}^r_f(\textsf {R})$
in
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A}\times \textsf {A})$
(recall that
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A}\times \textsf {A})$
is the poset reflection of
$\mathbf {Set}^r(\textsf {A}\times \textsf {A})$
) for
$[f]$
and consider the extensional dependent set
in
$Dep_{\textbf {pEff}_{set}}(\textsf {A}, {\textsf {R}'}) $
and observe that its image through
$\mathbf {K}$
is isomorphic to the pullback
$[p]^*[f]$
.
Definition 7.2. We denote by
$\textbf {pEff}_{set}^\to $
the full subcategory of
$\textbf {pEff}^\to $
whose objects are arrows isomorphic to arrows in
$\mathbf {K}(Dep_{\textbf {pEff}_{set}}(\textsf {A}, {\textsf {R}}))$
for (any) representative
$\textsf {R}$
of
$[\textsf {R}]$
.
We denote with
$\textsf {cod}_{set}$
the restriction of the codomain functor obtaining the following commutative diagram:

Lemma 7.1 implies the following result.
Corollary 7.3. The functor
$\textsf {cod}_{set}:\mathbf {pEff}^\to _{set}\to \mathbf {pEff}$
is a fibration.
In the following,
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
denotes the fiber of
$\textsf {cod}_{set}$
over the object
$(\textsf {A},[\textsf {R}])$
.
Remark 7.4. Similar to Lemma 3.8, any arrow
$[\textsf {h}]$
in
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
between two arrows isomorphic to the image through
$\mathbf {K}$
of two objects
$(\textsf {B},\textsf {S},\sigma )$
and
$(\textsf {C},\textsf {H},\eta )$
in
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
is itself in
$\mathrm {cod}_{set}^{-1}(\textsf {dom}(\mathbf {K}(\textsf {C},\textsf {H},\eta ))$
.
We now study the categorical property of these fibrations.
To do that, instead of working with slice categories over
$(\textsf {A},[\textsf {R}])\in \textbf {pEff}$
, we exploit the categories of extensional dependent collections and sets and prove their properties. This is enough thanks to Proposition 6.8 and Remark 6.9. Furthermore, the following results do not depend on the chosen representative of
$[\textsf {R}]$
thanks to Lemma 6.7 and Remark 6.10.
Before moving to the main theorem of the section, we provide a characterization of monomorphisms for families of collections, which will be instrumental in proving part of the theorem.
To this end, we recall [Reference Maietti and Maschio27, Definition 5.6].
Definition 7.5. Let
$\textbf {pEff}_{prop}:\textbf {pEff}^{\mathrm{op}}\to \mathbf {Pos}$
denote the elementary quotient completion of
$\overline {{\mathbf {Prop}^r}}:\boldsymbol {\mathcal {C}}_r^{\mathrm {op}}\to \mathbf {Pos}$
whose value on an object
$(\textsf {A},[\textsf {R}])$
is given by the descent data of
$\overline {{\mathbf {Prop}^r}}(\textsf {A})$
, that is, it is the sub partial order
$\textbf {pEff}_{prop}(\textsf {A},[\textsf {R}])$
of
$\overline {{\mathbf {Prop}^r}} (\textsf {A})$
whose objects are those in
where
$p_i:\textsf {A}\times \textsf {A}\to \textsf {A}$
are the projections for
$i=1,2$
, and whose action on arrows is given by that of
$\overline {{\mathbf {Prop}^r}}$
.
From [Reference Maietti and Maschio27] we recall the following result, which appears there as Theorem 5.7.
Theorem 7.6. The functor
$\mathbf {pEff}_{prop}$
is a first-order hyperdoctrine equivalent to the subobjects doctrine
$\mathbf {pEff}_{prop}\cong \mathbf {Sub}_{\mathbf {pEff}}$
.
Now we are ready to provide a characterization of monomorphisms as a consequence of the general characterization established in [Reference Maietti, Pasquali and Rosolini30, Proposition 2.33], refining [Reference Maietti and Rosolini32, Corollary 4.8].
Lemma 7.7. Let
$(\textsf {A},[\textsf {R}])$
be an object of
$\mathbf {pEff}$
. An arrow
$[\textsf {m}]:(\textsf {B},[\textsf {S}],\sigma )\rightarrow (\textsf {C},[\textsf {H}],\nu )$
in
$Dep_{\mathbf {pEff}}(\textsf {A},{\textsf {R}})$
is a monomorphism if and only if
Proof. Let us consider the functor
which “forgets” the
$\sigma $
-component faithfully and is defined by composing the functor
$\mathbf {K}$
with the domain functor
$\textbf {pEff}/(\textsf {A},[\textsf {R}])\to \textbf {pEff}$
. Since U is faithful, it reflects monomorphisms. Hence, using [Reference Maietti, Pasquali and Rosolini30, Proposition 2.33] applied to the doctrine
$\textbf {pEff}_{prop}$
, which has the necessary hypothesis thanks to Theorem 7.6, we obtain that the arrow
is a monomorphism in
$\textbf {pEff}$
if and only if
which is equivalent to
by definition of the arrows
$d_{\textsf {R}}$
and
$t_\sigma $
in the proof of Proposition 6.8 and the properties of
$[\textsf{S}]$
and
$[\textsf{H}]$
.
Remark 7.8. The same result can be obtained in this alternative way. Consider to lift the doctrine
$\overline {{\mathbf {Prop}^r}}$
over the slice of
$\boldsymbol {\mathcal {C}}_r$
over
$\textsf {A}\in \boldsymbol {\mathcal {C}}_r$
as done in [Reference Cioffo11]:
the action on an object
$\textsf {f}:\textsf {X}\to \textsf {A}$
of
$\boldsymbol {\mathcal {C}}_r$
is given by
${\mathbf {Prop}^r}(\textsf {X})$
, and the action on an arrow from
$\textsf {f}$
to
$\textsf {g}:\textsf {Y}\to \textsf {A}$
(which is an arrow
$\textsf {h}:\textsf {X}\to \textsf {Y}$
such that
$\textsf {g}\circ \textsf {h}=\textsf {f}$
) is given by
${\mathbf {Prop}^r}_{\textsf {f}}$
. Then, consider the elementary quotient completion of
${(\overline {{\mathbf {Prop}^r}})_{/\textsf {A}}}$
and observe that there exists a forgetful functor
which “forgets” the
$\sigma $
-component in a faithful way: it sends an object
$(\textsf {B},\textsf {S},\sigma )$
to the pair
$(\textsf {p}_1^\Sigma , \textsf {S})$
in
$\mathcal {Q}_{(\overline {{\mathbf {Prop}^r}})_{/A}}$
, where
$\textsf {p}_1^\Sigma :\Sigma (\textsf {A},\textsf {B})\to \textsf {A}$
. Since, as shown in [Reference Cioffo11], the elementary quotient completion of
${(\overline {{\mathbf {Prop}^r}})_{/A}}$
inherits some properties from
$\overline {{\mathbf {Prop}^r}}$
, and in particular it has full strict comprehensions and comprehensive diagonals, [Reference Maietti and Rosolini32, Corollary 4.8] applied to it and faithfulness of U imply the same monomorphism characterization of Lemma 7.7.
Theorem 7.9. Let
$(\textsf {A},[\textsf {R}])$
be an object of
$\mathbf {pEff}$
. The categories
$Dep_{\mathbf {pEff}}(\textsf {A},\textsf {R})$
and
$Dep_{\mathbf {pEff}_{set}}(\textsf {A},\textsf {R})$
are locally cartesian closed list-arithmetic pretoposes.
Proof. Since,
$\textbf {pEff}$
is equivalent to an exact completion of a lex category (see [Reference Maietti and Maschio27]) and
$\mathbf {K}:Dep_{\textbf {pEff}}(\textsf {A}, {\textsf {R}})\rightarrow \textbf {pEff}/(\textsf {A},[\textsf {R}])$
preserves and reflects all limits, colimits, and exponentials, in the case of families of collection Theorem 7.9 follows from the properties of the exact completion. Indeed, exactness and local cartesian closure are preserved under slicing, such as extensivity (see [Reference Carboni, Lack and Walters8]) and parametrized list objects (see [Reference Maietti24]). However, when restricting to
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
we must check that the above properties restrict to a proper subcategory of
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
. Hence, we provide directly a proof of the result for
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
to be able to restrict to
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
and hence to
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
.
Finite limits.
-
1. A terminal object in $Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
is given by
$(1,\top ,!)$
. This is a terminal object also in
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
. -
2. A binary product of $(\textsf {B},[\textsf {S}],\sigma ) $
and
$(\textsf {C},[\textsf {H}], \nu )$
is given by $$\begin{align*}(\textsf{B}\times \textsf{C}, \overline{\textbf{Prop}^r}_{\textbf{I}( p_1 \times p_1)}([\textsf{S}]) \wedge \overline{\textbf{Prop}^r}_{\textbf{I}( p_2 \times p_2)}([\textsf{H}]),\langle \sigma \circ (\textsf{id}_{\textsf{R}} \times p_1), \nu \circ(\textsf{id}_{\textsf{R}}\times p_2\rangle) \end{align*}$$
with projections inherited by those of $\textsf {B}\times \textsf {C}$
. Since the product of two sets is a set and the conjunction of small propositions is a small proposition, the above construction restricts to
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
. -
3. An equalizer of two arrows $[\textsf {f}],[\textsf {g}]: (\textsf {B},[\textsf {S}],\sigma )\rightarrow (\textsf {C},[\textsf {H}],\nu )$
is given by $$\begin{align*}(\Sigma^{\textsf{A}}(\textsf{B}, \mathbf{Col}^r_{\mathbf{I}(\langle {\textsf{f}},\textsf{g} \rangle) }(\textsf{H})\, ), \overline{\textbf{Prop}^r}_{\textbf{I}(\textsf{p}_1^{\textsf{A},\Sigma}\times \textsf{p}_1^{\textsf{A},\Sigma})}([\textsf{S}]),\eta),\end{align*}$$
where $\eta _{a,a'}$
acts as
$\sigma _{a,a'}(r,b)$
on a realizer
$r\Vdash \textsf {R}(a,a')$
, a term
$b:\textsf {B}(a)$
and a realizer
$q:\textsf {H}_a(\textsf {f}(a),\textsf {g}(a))$
since a realizer
$q':\textsf {H}_{a'}(\textsf {f}(\sigma _{a,a'}(r,b)),\textsf {g}(\sigma _{a,a'}(r,b)))$
can be found by transitivity from the terms
$q_\nu :\textsf {H}_{a'}(\nu _{a,a'}(r,\textsf {f}(b)),\nu _{a,a'}(r,\textsf {g}(b)))$
(from condition 1 of Definition 6.2 for
$\nu $
) and
$u:\textsf {H}_{a'}(\textsf {f}(\sigma _{a,a'}(r,b)),\nu _{a,a'}(r,\textsf {f}(b)))$
, and
$v:\textsf {H}_{a'}(\nu _{a,a'}(r,\textsf {g}(b)),\textsf {g}(\sigma _{a,a'}(r,b)))$
(from condition 2 of Definition 6.3 for
$\textsf {f}$
and
$\textsf {g}$
and symmetry). The same construction provides equalizers in
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
.
Stable finite coproducts. An initial object is given by
$(0,\top , \sigma )$
where
$\sigma $
is the unique possible one. A coproduct for
$(\textsf {B},[\textsf {S}],\sigma )$
and
$(\textsf {C},[\textsf {H}],\nu )$
is given by
where
-
1. $[\textsf {S}]{+}[\textsf {H}]=\exists _{\mathbf {I}(i_1\times i_1)}([\textsf {S}])\vee \exists _{\mathbf {I}(i_2\times i_2)}([\textsf {H}])$
; -
2. j is the canonical isomorphism from the object ${\textsf {R}}\times (\mathbf {Col}^r_{p_1}(\textsf {B})+\mathbf {Col}^r_{p_1}(\textsf {C}))$
to
$ ({\textsf {R}}\times \mathbf {Col}^r_{p_1}(\textsf {B}))+({\textsf {R}}\times \mathbf {Col}^r_{p_1}(\textsf {B}))$
which exists since
$\mathbf {Col}^{r}(\textsf {A}\times \textsf {A})$
is extensive.
Their injections are
$[i_1]$
and
$[i_2]$
for
$i_1$
and
$i_2$
injections of
$\textsf {B}+\textsf {C} $
and they are monic thanks to [Reference Maietti, Pasquali and Rosolini30, Proposition 6.35]. One can check that coproducts are stable under pullbacks using pullbacks constructed through the finite limits of
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
and
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
described above. Initial objects are trivially stable, since they are stable in
$\mathbf {Col}^{r}(\textsf {A})$
.
These constructions provide stable finite coproducts also in
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
using the same arguments together with Theorem 3.16 and Lemma 3.8.
List objects. A list object for
$(\textsf {B},[\textsf {S}],\sigma _{\textsf {B}})$
is given by
$(\textsf {List}(\textsf {B}),[\textsf {S}_{list}],\sigma _{list})$
where
-
1. the relation $\textsf {S}_{list}$
holds on two lists
$x,y$
if they have the same length
$l(x)=_{\textsf {N}}l(y)$
and they have the same components:$\exists u'\varepsilon \ 1 \ \exists v'\varepsilon \ 1 \ (i_2(u')=_{B(a)+1}\textsf {comp}(x,n)\wedge i_2(v')=_{B(a)+1}\textsf {comp}(y,n)) )\ \vee \ \\ \forall n\ \varepsilon \ \textsf {N}(\exists u\ \varepsilon \ \textsf {B}(a) \ \exists v\ \varepsilon \ \textsf {B}(a)(\textsf {S}_a(u,v)\wedge i_1(u)=_{\textsf {B}(a)+1}\textsf {comp}(x,n)\wedge i_1(v)=_{\textsf {B}(a)+1}\textsf {comp}(y,n)) $
, thatis, $$ \begin{align*}\textsf{S}_{list}=\overline{{\mathbf{Prop}^r}}_{\mathbf{I}(\ell\times \ell)}(\exists_{\mathbf{I}(\Delta_{\textsf{N}})}(\top))\wedge\qquad\qquad\qquad\qquad\qquad\qquad\qquad\end{align*} $$
$$ \begin{align*}\forall_{\mathbf{I}(p_1)}(\overline{{\mathbf{Prop}^r}}_{\mathbf{I}((\langle\textsf{comp}\circ (p_1\times \textsf{id}_{\textsf{N}}))\times (\langle\textsf{comp}\circ (p_2\times \textsf{id}_{\textsf{N}})))}(\exists_{\mathbf{I}(i_1\times i_1)}([\textsf{S}])\vee \exists_{\mathbf{I}(i_2\times i_2)}(\top) ))\end{align*} $$
where $\ell $
is the length arrow from
$\textsf {List}(\textsf {B})\rightarrow \textsf {N}$
in
$\mathbf {Col}^r(\textsf {A})$
and
$\textsf {comp}:\textsf {List}(\textsf {B})\times \textsf {N}\rightarrow \textsf {B}+1$
is the component arrow in
$\mathbf {Col}^r(\textsf {A})$
which selects the n-component of a list. -
2. $\sigma _{list}$
is the unique arrow in
$\mathbf {Col}^r(\textsf {A})$
making the following diagram commute: 
These constructions can also be performed in
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
thanks to Theorem 3.16 and Lemma 3.8.
Exactness. Recall that
$\textbf {pEff}$
is exact and that the slice categories of an exact category are also exact. Hence, exactness of
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
follows from the fact that
$\mathbf {K}:Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})\to \textbf {pEff}/(\textsf {A},[\textsf {R}])$
is a fully and faithful essentially surjective functor. To prove that
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
is also exact, observe that the coequalizer of an equivalence relation on
$(\textsf {B},[\textsf {S}], \sigma )\in Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
,
is given by
where
supposed
$[\textsf {c}_1]=p_1\circ [\textsf {c}]$
and
$[\textsf {c}_2]=p_2\circ [\textsf {c}]$
.
Applying the functor
$\mathbf {K}$
defined in Proposition 6.8 to
$[\textsf {id}_{\textsf {B}}]$
we get
which is a coequalizer in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
of
$\mathbf {K}([\textsf {c}])$
and hence in
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
by Remark 7.4. Stability and effectiveness follow from the pullback property in Lemma 7.1.
Local cartesian closure. For two objects
$(\textsf {B},[\textsf {S}],\sigma )$
and
$(\textsf {C},[\textsf {H}],\nu )$
in
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
consider the triple
$( \textsf {C}^{\textsf {B}}, [\textsf {H}]^{[\textsf {S}]}, {\nu }^{\sigma })$
defined as follows. First, the object
$\textsf {C}^{\textsf {B}}$
is defined as
$\Sigma ^{\textsf {A}}(\textsf {B}\Rightarrow \textsf {C},\Pi _{p_1}({\mathbf {Col}^r}_{\mathbf {I}(p_2)}(\textsf {S})\to {\mathbf {Col}^r}_{\mathbf {I}(\langle \textsf {ev}\circ (\textsf {id}\times p_1),\textsf {ev}\circ (\textsf {id}\times p_2) \rangle )}(\textsf {H}))$
where
$\textsf {B}\Rightarrow \textsf {C}$
and
$\textsf {ev}$
denote the weak exponential and the corresponding evaluation in
$\mathbf {Col}^r(\textsf {A})$
. Intuitively, we restrict to those arrows
$f_a\in \textsf {B}(a) \Rightarrow \textsf {C}(a)$
whose evaluation preserves
$\textsf {S}$
and
$\textsf {H}$
, that is, there exists a realizer s for which we have
$s\Vdash (\forall b,b'\in \textsf {B}(a))\ (\textsf {S}_a(b,b')\to \textsf {H}_a(f_a(b),f_a(b')))$
.
The relation
$[\textsf {H}]^{[\textsf {S}]}$
is given by
$\forall _{\mathbf {I}({p_1})}({\overline {{\mathbf {Prop}^r}}}_{\mathbf {I}(\langle \textsf {ev}\circ (p_1\times \textsf {id}),\textsf {ev}\circ (p_2\times \textsf {id}) \rangle )}([\textsf {H}]))$
. Intuitively, we relate two arrows
$f_a, g_a\in \textsf {B}(a) \Rightarrow \textsf {C}(a)$
when there exists a realizer r for which we have
$r\Vdash (\forall b\in \textsf {B}(a))\ \textsf {H}_a(f_a(b),g_a(b))$
.
The action
$\sigma ^{\nu }_{a_1,a_2}$
is defined on a triple
$(r,(f_{a_1}, s))$
, where
$r\Vdash \textsf {R}(a_1, a_2)$
, as the pair
with
and
is obtained through s and compatibility of
$\sigma $
and
$\nu $
with the corresponding equalities in condition (1) of Definition 6.2, and a witness
$\textsf {sym}$
of the symmetry of
$\textsf {R}$
.
We now observe that the evaluation arrow
$\textsf {ev}: (\textsf {B}\Rightarrow \textsf {C})\times \textsf {B}\to \textsf {C}$
preserves
$[\textsf {H}]^{[\textsf {S}]}$
,
$[\textsf {H}]$
, and
$[\textsf {S}]$
. In the sense that, if
$((f_a,s),b)$
and
$((f^{\prime }_a, s'),b')$
are such that
$r\Vdash \textsf {H}_a(f_a(b),f^{\prime }_a(b))$
and
$u\Vdash \textsf {S}(b, b')$
, then using
$s'$
(applied to u), r, and the transitivity of
$[\textsf {H}]$
we obtain a
$q\Vdash \textsf {H}_a(f_a(b),f^{\prime }_a(b'))$
.
Hence, the evaluation arrow of
$( \textsf {C}^{\textsf {B}}, [\textsf {H}]^{[\textsf {S}]}, {\nu }^{\sigma })$
is given by
$[\textsf {ev}]$
and we get an exponential object instead of a weak exponential as it happened in
$\mathbf {Col}^r$
.
Since weak exponentials of two sets are sets and small propositions are closed under connectives and quantification over sets, we obtain that the above construction restricts to
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
.
The local cartesian closure of
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
follows by observing that
$\mathbf {K}:Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})\rightarrow \textbf {pEff}/(\textsf {A},[\textsf {R}])$
induces a fully faithful and essentially surjective functor between the slice categories
for every object
$(\textsf {B}, [\textsf {S}], \sigma )\in Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
. Moreover, we have the isomorphism
which, together with the fact that
$\textbf {pEff}$
is locally cartesian closed, implies that
$Dep_{\textbf {pEff}}(\textsf {A},\textsf {R})$
is locally cartesian closed by reflection of exponentials. To show that
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
is also locally cartesian closed, we observe that for every object
$(\textsf {B}, [\textsf {S}], \sigma )\in Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
, the functor
$\mathbf {K}$
induces a fully faithful and essentially surjective functor
By Remark 7.4 we also have the isomorphism
Moreover, the functor
$\mathbf {K}$
also induces a fully faithful essentially surjective functor
Hence, by preservation and reflection of exponentials we conclude that
$Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
is also locally cartesian closed.
8 The “small subobjects” classifier
Let
$\textbf {pEff}_{props}:\textbf {pEff}^{\mathrm {op}}\to \mathbf {Pos}$
denote the restriction of
$\textbf {pEff}_{prop}$
on the fibers of
$\overline {{\mathbf {Prop}^r_{\mathbf {s}}}}:\boldsymbol {\mathcal {C}}_r^{\mathrm {op}}\to \mathbf {Pos}$
. We now provide a similar correspondence for it to Theorem 7.6 regarding suitable subobjects.
Definition 8.1. We denote by
$\mathbf {Sub}_{\textbf {pEff}}^{\mathbf {s}}$
the doctrine sending an object
$(\textsf {A},[\textsf {R}])\in \textbf {pEff}$
to the poset of subobjects of
$\textbf {pEff}$
over
$(\textsf {A},[\textsf {R}])$
that have a representative in
$\textbf {pEff}_{set}^\to $
. We will refer to these objects as small subobjects.
Note that the above is a well-defined functor thanks to Lemma 7.1.
Lemma 8.2. Let
$(\textsf {A},[\textsf {R}])$
be an object of
$\mathbf {pEff}$
. Given an element
$(\textsf {B}, [\textsf {S}],\sigma )\in Dep_{\mathbf {pEff}}(\textsf {A},[\textsf {R}])$
,
$\mathbf {K}(\textsf {B}, [\textsf {S}],\sigma )$
is a monomorphism in
$\mathbf {pEff}$
if and only if
$[\textsf {S}]=\top $
.
Proof. This follows from Lemma 7.7, and the fact that an arrow m in
$\textbf {pEff}$
with codomain
$(\textsf {A},[\textsf {R}])$
is a monomorphism if and only if it is a monomorphism in
$\textbf {pEff}/(\textsf {A},[\textsf {R}])$
seen as an arrow from m to
$id_{(\textsf {A},[\textsf {R}])}$
. Indeed,
$id_{(\textsf {A},[\textsf {R}])}$
is isomorphic to
$\mathbf {K}(1,\top , !)$
.
Proposition 8.3. The functor
$\mathbf {pEff}_{props}$
is equivalent to the small subobjects doctrine
$\mathbf {Sub}_{\mathbf {pEff}}^{\mathbf {s}}$
.
Proof. Given an object
$(\textsf {A},[\textsf {R}])\in \textbf {pEff}$
, consider a subobject over it which has a representative of the form
$\mathbf {K}(\textsf {B}, [\textsf {S}],\sigma )$
where
$(\textsf {B}, [\textsf {S}],\sigma )\in Dep_{\textbf {pEff}_{set}}(\textsf {A},\textsf {R})$
. We can associate to it the element
$[\textsf {B}]\in \overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A})$
. Thanks to
$\sigma $
, it follows that
$[\textsf {B}]\in \textbf {pEff}_{props}(\textsf {A}, [\textsf {R}])$
. Moreover, for two monomorphisms of this form, it holds that
$\mathbf {K}(\textsf {B}, [\textsf {S}],\sigma )\le \mathbf {K}(\textsf {B}', [\textsf {S}'],\sigma ')$
if and only if
$[\textsf {B}]\le [\textsf {B}']$
in
$ \textbf {pEff}_{props}(\textsf {A}, [\textsf {R}])$
. Conversely, given a
$[\textsf {P}]\in \textbf {pEff}_{props}(\textsf {A}, [\textsf {R}])$
and a representative
$\sigma : \textsf {R}\times \mathbf {Col}^r_{p_1}(\textsf {P}) \to \mathbf {Col}^r_{p_2}(\textsf {P})$
(whose existence is guaranteed by (10)), we associate the equivalence class of
$\mathbf {K}(\textsf {P},\top ,\sigma )$
which is a monomorphism thanks to Lemma 8.2. This provides the desired equivalence.
Applying the same argument in [Reference Maietti and Maschio27, Theorem 5.12], and combining it with the previous proposition, we obtain a classifier for small subobjects.
Theorem 8.4. There exists an object
$\Omega $
which represents
$\mathbf {Sub}_{\mathbf {pEff}}^{\mathbf {s}}$
, that is, there exists a natural isomorphism between the functors
$\mathbf {Sub}_{\mathbf {pEff}}^{\mathbf {s}}(-)$
and
$\mathbf {pEff}(-,\Omega )$
.
9 The fibred predicative topos structure of
$\textbf {pEff}$
with its sets
We now summarize the main results obtained in this work.
Theorem 9.1. The category
$\mathbf {pEff}$
is equipped with two fibrations

satisfying the following properties:
-
1. $\mathbf {pEff}$
is a locally cartesian closed list arithmetic pretopos; -
2. for each $(\textsf {A},[\textsf {R}])\in \mathbf {pEff}$
the fiber
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
is a locally cartesian closed list arithmetic pretopos;
-
3. for every arrow $[f]:(\textsf {A},[\textsf {R}])\to (\textsf {A}',[\textsf {R}'])$
in
$\mathbf {pEff}$
, the functor $$ \begin{align*}[f]^*:\textsf{cod}_{set}^{-1}(\textsf{A}',[\textsf{R}'])\to \textsf{cod}_{set}^{-1}(\textsf{A},[\textsf{R}])\end{align*} $$
preserves the locally cartesian closed list-arithmetics pretopos structure;
-
4. for each $(\textsf {A},[\textsf {R}])\in \mathbf {pEff}$
the inclusion
$\textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])\to \mathbf {pEff}/(\textsf {A},[\textsf {R}])$
preserves the locally cartesian closed list-arithmetics pretopos structure; -
5. there exists an object $\Omega $
classifying
$\mathbf {Sub}_{\mathbf {pEff}}^{\mathbf {s}}$
; -
6. for every $[f]\in \textsf {cod}_{set}^{-1}(\textsf {A},[\textsf {R}])$
there exists an exponential object
$(\pi _\Omega )^{[f]}$
in
$\mathbf {pEff}/(\textsf {A},[\textsf {R}])$
where
$\pi _{\Omega }:(\textsf {A},[\textsf {R}])\times \Omega \to (\textsf {A},[\textsf {R}])$
is the first projection; -
7. $\mathbf {pEff}$
satisfies the formal Church’s thesis (see [Reference Maietti and Maschio27, Theorem 5.8]).
Proof. 1. follows from Theorem 5.1 while 2. follows from Theorem 7.9 since
$\textsf {cod}_{set}^{-1}(\textsf {A}',[\textsf {R}'])$
coincides with the replete image of
$\mathbf {K}(Dep_{\textbf {pEff}_{set}}((\textsf {A}',[\textsf {R}']))$
. Then, 3. and 4. follow by the constructions in the proof of Theorem 7.9. Finally, 5. and 6. follows from Theorem 8.4 and Proposition 6.8.
The above properties testify that
$\textbf {pEff}$
is a fibred predicative variant of Hyland’s Effective Topos. Indeed, the above properties are validated after substituting
$\textbf {pEff}$
with
${\mathbf {Eff} }$
and identified fibred sets with all the objects of a slice category of
${\mathbf {Eff} }$
.
10 Towards a direct interpretation of
$\mathbf {emTT}$
into
$\textbf {pEff}$
The realizability interpretation for the intensional level of the Minimalist Foundation in [Reference Ishihara, Maietti, Maschio and Streicher20, Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29] can be turned into a morphism of doctrines from the syntactical doctrine
$G^{{\mathbf {mTT}}}$
, arising from
${\mathbf {mTT}}$
(as introduced in [Reference Maietti and Rosolini32, Section 7.2]), to the doctrine
$\overline {{\mathbf {Prop}^r}}$
, as illustrated on the left-hand side of the following diagram:

Such a morphism lifts to a morphism between the corresponding elementary quotient completions, as illustrated on the right-hand side of the diagram above. Now, observe that in the category
$\mathcal {Q}_{G^{\mathbf {mTT}}}$
one can define an adequate notion of canonical isomorphisms, as done in [Reference Maietti25], thereby obtaining a model for
$\mathbf {emTT}$
. Using this model together with the morphism on the right-hand side, and exploiting the fibered structure of
$\textbf {pEff}$
developed in this article, we can construct a direct interpretation of
$\mathbf {emTT}$
, also extended with inductive and coinductive predicates [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29, Reference Maietti, Sabelli, Kerjean and Levy35, Reference Sabelli48], within
$\textbf {pEff}$
.
11 Comparison with related works
In [Reference van den Berg and Moerdijk5], van den Berg and Moerdijk propose a construction of a predicative rendering of Hyland’s Effective Topos in the wider context of algebraic set theory. Starting from a category with small maps
$(\mathcal {E},\mathcal {S})$
they first construct a category of assemblies
$\mathcal {A}sm_{\mathcal {E}}$
endowed with a family of maps induced by
$\mathcal {S}$
. Then, they identified its exact completion
$(\mathcal {Eff}_{\mathcal {E}}, \mathcal {S}_{\mathcal {E}})$
as their notion of predicative realizability category, where
$\mathcal {Eff}_{\mathcal {E}}$
is a suitable subcategory of the exact on regular completion of
$\mathcal {A}sm_{\mathcal {E}}$
.
Our construction can be compared with theirs, as soon as we take for
$\mathcal {E}$
, the category
$\mathcal {E}[\mathbf {T}]$
of definable classes in an extension
$\mathbf {T}$
of
$\mathbf {CZF}$
having the numerical existence property, endowed with the collection
$\mathcal {S}[\mathbf {T}]$
of set-fibered functional relations between them (see Section 8 of [Reference van den Berg and Moerdijk4]). Examples of such a theory
$\mathbf {T}$
include
$\mathbf {CZF}$
itself,
$\mathbf {CZF}+\mathbf {REA}$
as proven in [Reference Rathjen44], and also
$\mathbf {CZF}+\mathbf {RDC}+\bigcup -\mathbf {REA}$
(by adequately modifying the proof of Theorem 7.2 in [Reference Rathjen44] and combining it with Theorem 7.4 in [Reference Rathjen45]).
In such a category, assemblies are pairs
$(A,\alpha )$
in which A is a definable class of
$\mathbf {T}$
and
$\alpha $
is a definable relation between elements of A and of the set of natural numbers
$\mathbb {N}$
such that
$\mathbf {T}\vdash \forall x\in A\, \exists y\in \mathbb {N} \ \alpha (x,y)$
. Arrows between assemblies
$(A,\alpha )$
and
$(B,\beta )$
are equivalence classes of functional relations F from A to B such that
The assemblies category is denoted by
$\mathcal {Asm}_{\mathcal {E}[\mathbf {T}]}$
in [Reference van den Berg and Moerdijk5].
Now, consider our category
$\boldsymbol {\mathcal {C}}_r$
of realized collections in Section 3.1 formalized in
$ \mathbf {T}$
. Every object
$\{x|\,\varphi (x)\}$
(for which
$\mathbf {T}\vdash \forall x\,( \varphi (x)\rightarrow x\in \mathbb {N})$
always holds) can be mapped to the assembly
$\mathbf {i}(\{x|\,\varphi (x)\}):=(\{x|\varphi (x)\},=_\varphi )$
where
Arrows
$[\mathbf {n}]_\approx $
in
$\boldsymbol {\mathcal {C}}_{r}$
can be sent to the functional relations representing their graph, thus defining a functor
$\mathbf {i}$
from
$\boldsymbol {\mathcal {C}}_r$
to
$\mathcal {Asm}_{\mathcal {E}[\mathbf {T}]}$
. Since the numerical existence property holds for
$\mathbf {T}$
, the functor
$\mathbf {i}$
is full and faithful, thus
$\boldsymbol {\mathcal {C}}_r$
can be identified as a full subcategory of
$\mathcal {Asm}_{\mathcal {E}[\mathbf {T}]}$
.
Now, let us call recursive objects those assemblies where A is a subclass of natural numbers satisfying
Let
$\mathcal {Rec}_{\mathcal {E}[\mathbf {T}]}$
denote the full subcategory of assemblies with recursive objects. Then,
$\boldsymbol {\mathcal {C}}_r$
can be seen as a full subcategory of
$\mathcal {Rec}_{\mathcal {E}[\mathbf {T}]}$
:
![Commutative diagram where C sub r maps via i to A s m sub E [T]. C sub r also maps down to R e c sub E [T], which in turn maps via incl to A s m sub E [T].](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20260929004022291-0509:S0022481226102497:S0022481226102497_eqnu79.png?pub-status=live)
Moreover, recalling that the ex/lex completion of the category of recursive objects turns out to be that of discrete objects in [Reference Hyland, Robinson and Rosolini19, Reference van Oosten43], we denote the ex/lex completion of
$\mathcal {Rec}_{\mathcal {E}[\mathbf {T}]}$
by
$\mathcal {Disc}_{\mathcal {E}[\mathbf {T}]}$
. Since
$\boldsymbol {\mathcal {C}}_r$
is a full subcategory of recursive objects and
$\textbf {pEff}$
is the ex/lex completion of
$\boldsymbol {\mathcal {C}}_r$
we have an embedding of
$\textbf {pEff}$
in
$\mathcal {Disc}_{\mathcal {E}[\mathbf {T}]}$
that extends to fibers, trivially.
![Commutative diagram where p Eff sub set with right arrow maps to p Eff with right arrow and then to script D i s c sub E [ T ] with right arrow. Diagonal arrows from these terms point down to p Eff and script D i s c sub E [ T ].](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20260929004022291-0509:S0022481226102497:S0022481226102497_eqnu80.png?pub-status=live)
Additionally, recalling that
$\mathcal {Disc}_{\mathcal {E}[\mathbf {T}]}$
is the ex/reg completion of the category of modest sets (see [Reference Rosolini47]), that is, the category of assemblies which satisfy
and denoting by
$\mathcal {Mod}_{\mathcal {E}[\mathbf {T}]}$
such a category within
$\mathcal {Eff}_{\mathcal {E}[\mathbf {T}]}$
, we obtain the following result.
Proposition 11.1. Let
$\mathbf {pEff}$
be the predicative effective topos built on an extension
$\mathbf {T}$
of
$\mathbf {CZF}$
having the numerical existence property; and let
$\mathbf {pEff}_{sm.\Delta }$
be the full subcategory of
$\mathbf {pEff}$
given by objects
$(\textsf {A},[\textsf {R}])$
where
$[\textsf {R}]\in \overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A} \times \textsf {A})$
. Then,
$\mathbf {pEff}_{sm.\Delta }$
is a full subcategory of the predicative realizability category
$\mathcal {Eff}_{\mathcal {E}[\mathbf {T}]}$
defined as in [Reference van den Berg and Moerdijk5] from the syntactic category
$\mathcal {E}[\mathbf {T}]$
of definable classes of
$\mathbf {T}$
endowed with the family
$\mathcal {S}[\mathbf {T}]$
cof arrows whose fibers are sets in
$\mathbf {T}$
.
![Commutative diagram. Top row: p E f f sub s m dot Delta maps to E f f sub E [ T ]. Bottom row: p E f f is isomorphic to (C sub r) sub e x / l e x maps to D i s c sub E [ T ] equals (M o d sub E [ T ]) sub e x / r e g maps to (A s m sub E [ T ]) sub e x / r e g.](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20260929004022291-0509:S0022481226102497:S0022481226102497_eqnu82.png?pub-status=live)
Proof. The category
$\mathcal {Eff}_{\mathcal {E}[\mathbf {T}]}$
proposed in [Reference van den Berg and Moerdijk5] as a predicative version of Hyland’s Effective Topos
${\mathbf {Eff} }$
is the full subcategory of the ex/reg completion of
$\mathcal {Asm}_{\mathcal {E}[\mathbf {T}]}$
, whose objects are separated in the sense of [Reference van den Berg and Moerdijk4, p. 141]. The statement follows observing that objects
$(\textsf {A},[\textsf {R}])$
of
$\textbf {pEff}_{sm.\Delta }$
, seen as objects in
$(\mathcal {Asm}_{\mathcal {E[\mathbf {T}]}})_{ex/reg}$
, are separated in the above sense since
$[\textsf {R}]\in \overline {{\mathbf {Prop}^r_{\mathbf {s}}}}(\textsf {A}\times \textsf {A})$
.
Note that, when we take
$\mathbf {T}$
to be
$\mathbf {ZFC}$
, although it does not satisfy the numerical existence property, we can still define a functor from
$\textbf {pEff}$
to a version
${\mathbf {Eff} }_{def}$
of Hyland’s Effective Topos, constructed as the ex/reg completion of the full subcategory of
$\mathcal {Asm}_{\mathcal {E}[\mathbf {ZFC}]}$
consisting of assemblies whose underlying classes are definable sets. Indeed, in
$\mathbf {ZFC}$
all definable subclasses of
$\mathbb {N}$
are in fact sets. In the same framework, one can see that this
${\mathbf {Eff} }_{def}$
is a full subcategory of
$\mathcal {Eff}_{\mathcal {E}[\mathbf {ZFC}]}$
.
A comparison between
$\textbf {pEff}$
formalized in
${\widehat {ID_1}}$
, and the usual Hyland’s Effective Topos
${\mathbf {Eff} }$
, viewed as an internal large category within ZFC, is induced by the standard interpretation of
${\widehat {ID_1}}$
in the ZFC set theory, as shown in [Reference Maietti and Maschio27].
All these observations concern only the base category
$\textbf {pEff}$
. A comparison between their fibered structures is left to future work. Just observe that, while maps in van den Berg and Moerdijk’s approach are built on the notion of set in axiomatic set theory, in our approach the fibration of sets is defined mimicking the structure of sets within the language of dependent type theory, as that used in both levels of the Minimalist Foundation [Reference Maietti25].
Furthermore, we note a possible connection with [Reference van den Berg3, Reference Frey15], where the Effective Topos is characterised as the homotopy category of a suitable category. Since
$\textbf {pEff}$
admits an equivalent presentation as an exact completion, which can itself be obtained as a homotopy category [Reference van den Berg and Moerdijk6], it is natural to consider, as future research, the application of similar techniques in our setting.
Nevertheless, our comparisons are sufficient to conclude that the full subcategory of discrete objects within Hyland’s Effective Topos, as well as within van den Berg and Moerdijk’s constructive setting, already contains a predicative version of
$\mathbf {Eff}$
. In short, this confirms the claim made on p. 1140 of [Reference van Oosten43]: the discrete objects of
$\mathbf {Eff}$
can be considered the realm of constructive predicative mathematics.
12 Conclusions
We have shown here that the full subcategory of discrete objects of Hyland’s Effective Topos
$\mathbf {Eff}$
already contains a fibred predicative topos validating the formal Church’s thesis, even when both are formalized in a constructive foundational theory. We did so by enucleating a fibred structure for
$\textbf {pEff}$
introduced in [Reference Maietti and Maschio27], which is sufficient to model both levels of MF and its extensions with inductive and conductive predicates in [Reference Maietti, Maschio and Rathjen28, Reference Maietti, Maschio and Rathjen29, Reference Maietti, Sabelli, Kerjean and Levy35, Reference Sabelli48].
Furthermore, thanks to the equiconsistency of both levels of MF with their classical version shown in [Reference Maietti and Sabelli36], we could use
$\textbf {pEff}$
as a computational model for the classical version of MF, too. Moreover, since both levels of MF can be interpreted in
$\mathbf {HoTT}$
in a compatible way as shown in [Reference Contente and Maietti12], it would be interesting to investigate whether
$\textbf {pEff}$
is in some way related to computational models of Homotopy Type theory, for example, to that in [Reference Sterling and Angiuli49].
In the future, we intend to investigate abstract notions of fibred predicative topos and of predicative tripos-to-topos construction, of which the fibred structure of
$\textbf {pEff}$
enucleated here would provide a key example.
Acknowledgments
The authors would like to acknowledge Michael Rathjen, Pino Rosolini, Pietro Sabelli, Thomas Streicher, and Davide Trotta for fruitful discussions. The first and second authors are affiliated with the INdAM national research group GNSAGA.
Funding statement
The first and second authors would like to thank the Hausdorff Research Institute for Mathematics for the financial support received to attend part of the trimester program ‘Prospects of Formal Mathematics’ when significant progress was made for this work.















