---
title: Univalent Object Classifier
url: https://www.emergentmind.com/topics/univalent-object-classifier
type: topic
---

# Univalent Object Classifier

Searching arXiv for the specified paper and closely related context.
arxiv_search.query({"search_query":"id:1803.10113 OR ti:\"Univalent polymorphism\"","max_results":5,"sort_by":"relevance","sort_order":"descending"})
A univalent object classifier, in the sense of "Univalent polymorphism," is a univalent universe $p:E\to U$ that classifies a specified class $C$ of fibrations, or families. The central result is not the existence of a single universe for all discrete fibrations, but a pair of restricted realizability-style classifiers: one for an impredicative class of discrete propositional fibrations in the path category $\mathbb{EFF}$, and one for an impredicative class of discrete set fibrations in the richer path category $\mathbb{EFF}_1$. The same work also shows that a univalent classifier for the full class of discrete fibrations cannot exist in these settings [1803.10113].

## 1. Path categories and the effective topos

A path category is a category $C$ equipped with fibrations and equivalences, satisfying Brown’s axioms for a category of fibrant objects together with two additional properties. In the formulation used here, the structure includes: closure of fibrations under composition; a terminal object $1$ with every map $X\to 1$ a fibration; pullbacks of fibrations along arbitrary maps; the $6$-for-$2$ property for equivalences; path objects factoring the diagonal $X\to X\times X$ as $X\to PX\to X\times X$ with the first map an equivalence and the second a fibration; pullback stability of trivial fibrations; and sections for trivial fibrations [1803.10113].

Homotopy is defined by path objects: maps $f,g:Y\to X$ are homotopic if there exists $H:Y\to PX$ with $(s,t)H=(f,g)$. The homotopy relation is a congruence, and a map becomes an isomorphism in the homotopy category $\mathrm{Ho}(C)$ if and only if it is an equivalence in $C$. Consequently, $\mathrm{Ho}(C)$ is obtained by quotienting maps by homotopy.

The path category $\mathbb{EFF}$ is built from “locally codiscrete bigroupoids” on a set $A$ equipped with a realizer map $\alpha:A\to\mathbb{N}$, sets of $1$-cells $\mathcal{A}(a,a')\subseteq\mathbb{N}$, and effective operations for identities, inverses, and composition of $1$-cells. Morphisms carry effective action on $0$- and $1$-cells, fibrations are given by an effective lifting property for $1$-cells together with a second lifting clause for parallel $1$-cells, and equivalences are homotopy equivalences. The resulting homotopy category recovers realizability semantics: there is a functor $P:\mathbb{EFF}\to \mathbf{Eff}$ that is full, essentially surjective, and inverts homotopy, so that $\mathrm{Ho}(\mathbb{EFF})\simeq \mathbf{Eff}$ [1803.10113].

This setting is essential for the notion of univalent object classifier used here. The classifier is not introduced in an arbitrary higher topos, but inside a path category whose objects and morphisms carry explicit realizability data.

## 2. Discrete fibrations, impredicativity, and resizing

In $\mathbb{EFF}$, a fibration $f:(B,\beta,\mathcal{B})\to (A,\alpha,\mathcal{A})$ is standard discrete if, for all $b,b'\in B$, the conditions $f(b)=f(b')$ and $\beta(b)=\beta(b')$ imply $b=b'$. A fibration is discrete if it is equivalent, by pre- or post-composition with an equivalence, to a standard discrete fibration [1803.10113].

A key characterization, stated in Freyd-style form, identifies discreteness with an orthogonality condition: for a fibration $f:B\to A$, discreteness is equivalent to the diagonal square with the object $J$ being a homotopy pullback, and equivalently to the existence of a computable function producing, from $b_0,b_1$ with the same image in $A$ and the same realizer, a $1$-cell $b_0\to b_1$ lifting $1_{f(b_0)}$. This makes the discrete class computationally rigid in a way compatible with the realizability structure.

The class $S$ of discrete fibrations in $\mathbb{EFF}$ is impredicative. It is closed under pullback, under composition, and under pushforward along arbitrary fibrations in the sense of right adjoints $\Pi_f$ to pullback. More precisely, for every fibration $f:Y\to X$, the pullback functor on the homotopy category has a homotopy right adjoint $\Pi_f$, constructed as homotopy $\Pi$-types, and $\Pi_f$ preserves discreteness. This is the paper’s sense of polymorphism: closure under impredicative quantification [1803.10113].

The same framework supports resizing statements. A class $S$ satisfies propositional resizing if every propositional fibration lies in $S$. In $\mathbb{EFF}$, assuming the axiom of choice in the metatheory, every propositional fibration is discrete, so discrete propositional fibrations satisfy resizing. The paper also records stability under $\Pi_f$ of h-levels: $\Pi_f$ preserves $n$-types, in particular $(-1)$-types and $0$-types.

## 3. Univalent representation as object classification

For a class $C$ of fibrations in a path category, a univalent representation consists of a fibration $p:E\to U$ satisfying two conditions. The first is classification: for any $q:X\to B$ in $C$, there exists a classifying map $c:B\to U$ such that $q$ is equivalent, in the slice over $B$, to the pullback $c^*p$, and $c$ is unique up to homotopy. The second is univalence: for $u,v:U$, if $E_u$ and $E_v$ denote the fibers of $p$, then the canonical map
$$
\theta_{u,v}:(u =_U v)\to \mathrm{Equiv}(E_u,E_v)
$$
is an equivalence [1803.10113].

Here $(u =_U v)$ is the homotopy class of paths $u\to v$ in a path object $PU$, and $\mathrm{Equiv}(E_u,E_v)$ is the space of equivalences between fibers, equivalently isomorphisms in the homotopy category between those fibers. Operationally, univalence asserts that every fiberwise equivalence arises uniquely up to homotopy by transport along a path in $U$.

A common misunderstanding is to identify a univalent object classifier with a universe for all objects in the ambient category. In this setting, the classifier is always relative to a chosen class of fibrations. The positive results concern discrete propositional fibrations in $\mathbb{EFF}$ and discrete set fibrations in $\mathbb{EFF}_1$, not the full class of discrete fibrations [1803.10113].

## 4. The classifier for discrete propositional fibrations in $\mathbb{EFF}$

The positive result in $\mathbb{EFF}$ concerns discrete fibrations whose fibers are propositions in the sense of Homotopy Type Theory. The universe $U_{\mathrm{Prop}}$ has as $0$-cells subsets $X\subseteq \mathbb{N}$, realizer $0$ for all $X$, and as $1$-cells $X\to Y$ pairs of realizers $r:X\to Y$ and $s:Y\to X$, given by partial recursive functions total on $X$ and $Y$ respectively. The total space $E_{\mathrm{Prop}}$ has as $0$-cells pairs $(X,x)$ with $X\subseteq\mathbb{N}$ and $x\in X$, realizer $x$, and the same $1$-cell data as $U_{\mathrm{Prop}}$. The map
$$
p_{\mathrm{Prop}}:E_{\mathrm{Prop}}\to U_{\mathrm{Prop}}
$$
is projection $(X,x)\mapsto X$ [1803.10113].

This $p_{\mathrm{Prop}}$ is a discrete propositional fibration. Classification is explicit. If $q:B\to A$ is a discrete propositional fibration, then using propositional truncation one may assume $B\subseteq A\times \mathbb{N}$ with $q(a,n)=a$, $\beta(a,n)=n$, and $\mathcal{B}(b,b')=\mathcal{A}(fb,fb')$. The classifying map is
$$
c(a):=B_a=\{\,n\in\mathbb{N}\mid (a,n)\in B\,\}.
$$
For $\pi\in\mathcal{A}(a,a')$, transport $\Gamma^B_\pi:B_a\to B_{a'}$ gives the action of $c$ on $1$-cells, and by construction $c^*p_{\mathrm{Prop}}\simeq q$ in the slice over $A$.

Univalence is equally concrete. For $u=X$ and $v=Y$ in $U_{\mathrm{Prop}}$, a path $u=_U v$ is represented by mutually inverse realizers $r:X\to Y$ and $s:Y\to X$. Transport along such a path induces an equivalence between fibers $E_{\mathrm{Prop},u}\cong X$ and $E_{\mathrm{Prop},v}\cong Y$. Conversely, any equivalence between fibers yields such a pair $(r,s)$, so $\theta_{u,v}$ is an equivalence. Under the axiom of choice in the metatheory, every propositional fibration is discrete, so all propositional fibrations are small with respect to $p_{\mathrm{Prop}}$. Modulo the usual coherence problems, this gives a model of the Calculus of Constructions with a univalent type of propositions [1803.10113].

## 5. The classifier for discrete set fibrations in $\mathbb{EFF}_1$

The path category $\mathbb{EFF}_1$ extends $\mathbb{EFF}$ by adding a level of $2$-cells. For each pair of parallel $1$-cells there is a set of $2$-cells and effective data for identities, inverses, and compositions; morphisms act on $0$-, $1$-, and $2$-cells with coherent computational data; and fibrations satisfy an additional lifting clause for $2$-cells. This yields a path category with homotopy exponentials and $\Pi$-types in which every fibration is a fibration of groupoids, or $1$-types [1803.10113].

Discrete fibrations in $\mathbb{EFF}_1$ are defined as in $\mathbb{EFF}$ and remain impredicative. The setting also has $0$-truncation: every fibration factors, up to universal property, through a fibration of sets. The small path category $\mathrm{DISC}$ consists of discrete objects, essentially the subcategory of $0$-types with computable structure. Its objects are sets $A\subseteq\mathbb{N}$ equipped with hom-sets $\mathcal{A}(a,a')\subseteq\mathbb{N}$ and effective identity, inverse, and composition operations; morphisms are computable homomorphisms with tracking on hom-sets.

The universe $U_{\mathrm{Set}}$ has as $0$-cells objects $(A,\mathcal{A})$ of $\mathrm{DISC}$, realizer $0$, $1$-cells given by coded homotopy equivalences $(f,g,H,K)$ in $\mathrm{DISC}$, and $2$-cells given by homotopies $U:f\simeq f'$. The total space $E_{\mathrm{Set}}$ has as $0$-cells triples $(A,\mathcal{A},a)$ with $(A,\mathcal{A})\in \mathrm{DISC}$ and $a\in A$, realizer $a$, and $1$-cells consisting of a coded equivalence $(f,g,H,K):(A,\mathcal{A})\to (B,\mathcal{B})$ together with a $1$-cell $\mathcal{B}(fa,b)$. The projection
$$
p_{\mathrm{Set}}:E_{\mathrm{Set}}\to U_{\mathrm{Set}}
$$
is a fibration of discrete sets [1803.10113].

For a discrete set fibration $q:B\to A$, one may arrange $B\subseteq A\times\mathbb{N}$, take $\beta$ to be second projection, and impose $\mathcal{B}(\pi,\pi')=\mathcal{A}(q\pi,q\pi')$. Then each fiber $B_a$ is an object of $\mathrm{DISC}$, because between parallel $1$-cells in $B$ there is a unique $2$-cell. The classifying map sends $a$ to $B_a$, sends $\pi:a\to a'$ to transport $\Gamma^B_\pi:B_a\to B_{a'}$, and uses the induced homotopy $\Gamma_n$ on $2$-cells. By construction, $c^*p_{\mathrm{Set}}\simeq q$.

Univalence takes the same conceptual form as in the propositional case but at one higher truncation level. If $f,g:A\to U_{\mathrm{Set}}$ and $w:f^*p_{\mathrm{Set}}\to g^*p_{\mathrm{Set}}$ is an equivalence over $A$, then the corresponding fiberwise equivalences assemble, using the path object $PU_{\mathrm{Set}}$ in $\mathbb{EFF}_1$, into a homotopy $H:f\simeq g$, and $w$ is fiberwise homotopic to the transport induced by $H$. Hence $\theta_{u,v}$ is an equivalence. Modulo coherence, this yields a model of the Calculus of Constructions with a univalent type of sets, also containing objects like $\mathbb{N}$ and $\mathbb{N}\to\mathbb{N}$ [1803.10113].

## 6. Obstructions, semantic consequences, and open directions

The paper proves that univalence fails for the full class of discrete fibrations in both ambient categories. In $\mathbb{EFF}$, every fibration is a fibration of sets, so any putative universe classifying all discrete fibrations would itself be a set. But univalence would then force each small object to have, up to homotopy, a unique self-equivalence, which fails already for the discrete object $2$, whose identity and swap give distinct self-equivalences. Therefore the class of all discrete fibrations in $\mathbb{EFF}$ does not admit a univalent representation [1803.10113].

In $\mathbb{EFF}_1$, every fibration is a fibration of groupoids. If a class had a univalent classifier with base $U$ a groupoid, then for every small object $A$ and self-equivalence $w:A\simeq A$, any two homotopies $H,K:1\simeq w$ would have to be equal. The paper gives a discrete object with a nontrivial self-equivalence and distinct such homotopies, so a univalent classifier for all discrete fibrations cannot exist in $\mathbb{EFF}_1$ either.

The distinction between the positive and negative results can be summarized as follows.

| Setting | Classified class | Result |
|---|---|---|
| $\mathbb{EFF}$ | discrete propositional fibrations | impredicative and univalent |
| $\mathbb{EFF}$ | all discrete fibrations | no univalent representation |
| $\mathbb{EFF}_1$ | discrete set fibrations | impredicative and univalent |
| $\mathbb{EFF}_1$ | all discrete fibrations | no univalent representation |

These results have direct semantic consequences for impredicative type theory. In $\mathbb{EFF}$, with small fibrations taken to be discrete propositional fibrations, one obtains, modulo the usual coherence problems, a model of an impredicative Calculus of Constructions with a univalent type of propositions. In $\mathbb{EFF}_1$, with small fibrations taken to be discrete set fibrations, one obtains, again modulo coherence, a model of an impredicative Calculus of Constructions with a univalent type of sets. The qualifier about coherence is essential: the semantics are formulated using path categories and homotopy universal properties, so computational rules are propositional rather than definitional equalities. A fully coherent model would require recasting the semantics in a categories-with-families style framework.

The broader conceptual point is that the work realizes the paradigm of a univalent object classifier inside realizability-oriented path categories, but only for carefully chosen impredicative subclasses. It also leaves open whether the class of discrete fibrations, in the local or internal sense, has a non-univalent representation in $\mathbf{Eff}$ or in $\mathbb{EFF}_1$. The authors further sketch a program toward path categories $\mathbb{EFF}_n$ and ultimately $\mathbb{EFF}_\infty$ intended to classify broader classes, such as discrete groupoids, impredicatively with univalent classifiers [1803.10113].

Source: https://www.emergentmind.com/topics/univalent-object-classifier