Papers
Topics
Authors
Recent
Search
2000 character limit reached

Univalent Object Classifier

Updated 7 July 2026
  • Univalent object classifier is a universe in a path category that classifies a restricted class of fibrations with an inherent univalence property.
  • It features explicit classifiers for discrete propositional and set fibrations within realizability frameworks, supporting impredicative quantification and resizing.
  • The work highlights limitations by showing that full discrete fibrations do not admit a univalent classifier, and it suggests extensions to higher path categories.

Searching arXiv for the specified paper and closely related context. arxiv_search.query({"2search_query2 OR ti:\2"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 PRESERVED_PLACEHOLDER_2search_query2^ that classifies a specified class PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2^ 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 EFF\mathbb{EFF}, and one for an impredicative class of discrete set fibrations in the richer path category EFF1\mathbb{EFF}_1. The same work also shows that a univalent classifier for the full class of discrete fibrations cannot exist in these settings (&&&2search_query2&&&).

A path category is a category CC 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 X1X\to 1 a fibration; pullbacks of fibrations along arbitrary maps; the $6$-for-$2$ property for equivalences; path objects factoring the diagonal XX×XX\to X\times X as PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query2^ with the first map an equivalence and the second a fibration; pullback stability of trivial fibrations; and sections for trivial fibrations (&&&2search_query2&&&).

Homotopy is defined by path objects: maps PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\2^ are homotopic if there exists PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\22^ with PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\23. The homotopy relation is a congruence, and a map becomes an isomorphism in the homotopy category PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\24 if and only if it is an equivalence in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\25. Consequently, PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\26 is obtained by quotienting maps by homotopy.

The path category PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\27 is built from “locally codiscrete bigroupoids” on a set PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\28 equipped with a realizer map PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\29, sets of EFF\mathbb{EFF}2search_query2-cells EFF\mathbb{EFF}2id:(Berg, 2018) OR ti:\2, and effective operations for identities, inverses, and composition of EFF\mathbb{EFF}2-cells. Morphisms carry effective action on EFF\mathbb{EFF}3- and EFF\mathbb{EFF}4-cells, fibrations are given by an effective lifting property for EFF\mathbb{EFF}5-cells together with a second lifting clause for parallel EFF\mathbb{EFF}6-cells, and equivalences are homotopy equivalences. The resulting homotopy category recovers realizability semantics: there is a functor EFF\mathbb{EFF}7 that is full, essentially surjective, and inverts homotopy, so that EFF\mathbb{EFF}8 (&&&2search_query2&&&).

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 EFF\mathbb{EFF}9, a fibration EFF1\mathbb{EFF}_12search_query2^ is standard discrete if, for all EFF1\mathbb{EFF}_12id:(Berg, 2018) OR ti:\2, the conditions EFF1\mathbb{EFF}_12 and EFF1\mathbb{EFF}_13 imply EFF1\mathbb{EFF}_14. A fibration is discrete if it is equivalent, by pre- or post-composition with an equivalence, to a standard discrete fibration (&&&2search_query2&&&).

A key characterization, stated in Freyd-style form, identifies discreteness with an orthogonality condition: for a fibration EFF1\mathbb{EFF}_15, discreteness is equivalent to the diagonal square with the object EFF1\mathbb{EFF}_16 being a homotopy pullback, and equivalently to the existence of a computable function producing, from EFF1\mathbb{EFF}_17 with the same image in EFF1\mathbb{EFF}_18 and the same realizer, a EFF1\mathbb{EFF}_19-cell CC2search_query2^ lifting CC2id:(Berg, 2018) OR ti:\2. This makes the discrete class computationally rigid in a way compatible with the realizability structure.

The class CC2 of discrete fibrations in CC3 is impredicative. It is closed under pullback, under composition, and under pushforward along arbitrary fibrations in the sense of right adjoints CC4 to pullback. More precisely, for every fibration CC5, the pullback functor on the homotopy category has a homotopy right adjoint CC6, constructed as homotopy CC7-types, and CC8 preserves discreteness. This is the paper’s sense of polymorphism: closure under impredicative quantification (&&&2search_query2&&&).

The same framework supports resizing statements. A class CC9 satisfies propositional resizing if every propositional fibration lies in $1$2search_query2. In $1$2id:(Berg, 2018) OR ti:\2, 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 $1$2 of h-levels: $1$3 preserves $1$4-types, in particular $1$5-types and $1$6-types.

3. Univalent representation as object classification

For a class $1$7 of fibrations in a path category, a univalent representation consists of a fibration $1$8 satisfying two conditions. The first is classification: for any $1$9 in X1X\to 12search_query2, there exists a classifying map X1X\to 12id:(Berg, 2018) OR ti:\2^ such that X1X\to 12 is equivalent, in the slice over X1X\to 13, to the pullback X1X\to 14, and X1X\to 15 is unique up to homotopy. The second is univalence: for X1X\to 16, if X1X\to 17 and X1X\to 18 denote the fibers of X1X\to 19, then the canonical map

$6$2search_query2^

is an equivalence (&&&2search_query2&&&).

Here $6$2id:(Berg, 2018) OR ti:\2^ is the homotopy class of paths $6$2 in a path object $6$3, and $6$4 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 $6$5.

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 $6$6 and discrete set fibrations in $6$7, not the full class of discrete fibrations (&&&2search_query2&&&).

4. The classifier for discrete propositional fibrations in $6$8

The positive result in $6$9 concerns discrete fibrations whose fibers are propositions in the sense of Homotopy Type Theory. The universe $2$2search_query2^ has as $2$2id:(Berg, 2018) OR ti:\2-cells subsets $2$2, realizer $2$3 for all $2$4, and as $2$5-cells $2$6 pairs of realizers $2$7 and $2$8, given by partial recursive functions total on $2$9 and XX×XX\to X\times X2search_query2^ respectively. The total space XX×XX\to X\times X2id:(Berg, 2018) OR ti:\2^ has as XX×XX\to X\times X2-cells pairs XX×XX\to X\times X3 with XX×XX\to X\times X4 and XX×XX\to X\times X5, realizer XX×XX\to X\times X6, and the same XX×XX\to X\times X7-cell data as XX×XX\to X\times X8. The map

XX×XX\to X\times X9

is projection PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query2search_query2^ (&&&2search_query2&&&).

This PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query2id:(Berg, 2018) OR ti:\2^ is a discrete propositional fibration. Classification is explicit. If PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query22^ is a discrete propositional fibration, then using propositional truncation one may assume PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query23 with PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query24, PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query25, and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query26. The classifying map is

PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query27

For PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query28, transport PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2search_query29 gives the action of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\2search_query2^ on PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\2-cells, and by construction PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\22^ in the slice over PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\23.

Univalence is equally concrete. For PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\24 and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\25 in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\26, a path PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\27 is represented by mutually inverse realizers PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\28 and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2id:(Berg, 2018) OR ti:\29. Transport along such a path induces an equivalence between fibers PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\22search_query2^ and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\22id:(Berg, 2018) OR ti:\2. Conversely, any equivalence between fibers yields such a pair PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\222, so PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\223 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 PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\224. Modulo the usual coherence problems, this gives a model of the Calculus of Constructions with a univalent type of propositions (&&&2search_query2&&&).

The path category PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\226 extends PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\227 by adding a level of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\228-cells. For each pair of parallel PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\229-cells there is a set of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2max_results2search_query2-cells and effective data for identities, inverses, and compositions; morphisms act on PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2max_results2id:(Berg, 2018) OR ti:\2-, PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\232-, and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\233-cells with coherent computational data; and fibrations satisfy an additional lifting clause for PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\234-cells. This yields a path category with homotopy exponentials and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\235-types in which every fibration is a fibration of groupoids, or PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\236-types (&&&2search_query2&&&).

Discrete fibrations in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\237 are defined as in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\238 and remain impredicative. The setting also has PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\239-truncation: every fibration factors, up to universal property, through a fibration of sets. The small path category PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2sort_by2search_query2^ consists of discrete objects, essentially the subcategory of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2sort_by2id:(Berg, 2018) OR ti:\2-types with computable structure. Its objects are sets PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\242 equipped with hom-sets PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\243 and effective identity, inverse, and composition operations; morphisms are computable homomorphisms with tracking on hom-sets.

The universe PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\244 has as PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\245-cells objects PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\246 of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\247, realizer PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\248, PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\249-cells given by coded homotopy equivalences PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2relevance2search_query2^ in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2relevance2id:(Berg, 2018) OR ti:\2, and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\252-cells given by homotopies PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\253. The total space PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\254 has as PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\255-cells triples PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\256 with PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\257 and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\258, realizer PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\259, and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2sort_order2search_query2-cells consisting of a coded equivalence PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2sort_order2id:(Berg, 2018) OR ti:\2^ together with a PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\262-cell PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\263. The projection

PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\264

is a fibration of discrete sets (&&&2search_query2&&&).

For a discrete set fibration PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\265, one may arrange PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\266, take PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\267 to be second projection, and impose PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\268. Then each fiber PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\269 is an object of PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2descending2search_query2, because between parallel PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2descending2id:(Berg, 2018) OR ti:\2-cells in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\272 there is a unique PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\273-cell. The classifying map sends PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\274 to PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\275, sends PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\276 to transport PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\277, and uses the induced homotopy PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\278 on PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\279-cells. By construction, PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2Univalent polymorphism,2search_query2.

Univalence takes the same conceptual form as in the propositional case but at one higher truncation level. If PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\2Univalent polymorphism,2id:(Berg, 2018) OR ti:\2^ and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\282 is an equivalence over PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\283, then the corresponding fiberwise equivalences assemble, using the path object PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\284 in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\285, into a homotopy PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\286, and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\287 is fiberwise homotopic to the transport induced by PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\288. Hence PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\289 is an equivalence. Modulo coherence, this yields a model of the Calculus of Constructions with a univalent type of sets, also containing objects like PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\292search_query2^ and PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\292id:(Berg, 2018) OR ti:\2^ (&&&2search_query2&&&).

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 PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\292, 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 PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\293, whose identity and swap give distinct self-equivalences. Therefore the class of all discrete fibrations in PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\294 does not admit a univalent representation (&&&2search_query2&&&).

In PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\295, every fibration is a fibration of groupoids. If a class had a univalent classifier with base PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\296 a groupoid, then for every small object PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\297 and self-equivalence PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\298, any two homotopies PRESERVED_PLACEHOLDER_2id:(Berg, 2018) OR ti:\299 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 EFF\mathbb{EFF}2search_query2search_query2^ either.

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

Setting Classified class Result
EFF\mathbb{EFF}2search_query2id:(Berg, 2018) OR ti:\2^ discrete propositional fibrations impredicative and univalent
EFF\mathbb{EFF}2search_query22^ all discrete fibrations no univalent representation
EFF\mathbb{EFF}2search_query23 discrete set fibrations impredicative and univalent
EFF\mathbb{EFF}2search_query24 all discrete fibrations no univalent representation

These results have direct semantic consequences for impredicative type theory. In EFF\mathbb{EFF}2search_query25, 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 EFF\mathbb{EFF}2search_query26, 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 EFF\mathbb{EFF}2search_query27 or in EFF\mathbb{EFF}2search_query28. The authors further sketch a program toward path categories EFF\mathbb{EFF}2search_query29 and ultimately EFF\mathbb{EFF}2id:(Berg, 2018) OR ti:\2search_query2^ intended to classify broader classes, such as discrete groupoids, impredicatively with univalent classifiers (&&&2search_query2&&&).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Univalent Object Classifier.