THU · JUL 16 · 14:30 · KRIEGER 170

A Functorial Weak Factorisation System from Path Types

Noah D. Ortiz

Joint work with: Yiming Xu

We show that the path types structure proposed by Awodey and Hua [2] gives rise to a functorial weak factorisation system (WFS). Our work draws on path object factorisations as in [7, 3, 1] and from Gambino and Garner’s identity type weak factorisation system on the syntactic category of dependent type theory [4]. In analogy to the latter, we define our left maps as the maps that left-lift against a single map 𝗍, representing a universe. Our right maps are then the saturation of 𝗍 (i.e. the right-lifts against the left maps). We arrive at the same characterisation of left maps as [4, 7]: The left maps are exactly the strong deformation retracts. In contrast, however, to both, our construction of the factorisation is functorial.

Awodey and Hua [2] give a very general setting in which we can interpret intensional identity types of Martin-Löf type theory: The setting is a category with finite limits, an exponentiable interval 1I, and a universe 𝗍:𝖳˙𝖳 that is a normal Hurewicz fibration admitting a pullback to its own path type 𝖳˙I𝖳˙×𝖳𝖳˙. In such a category, we generate our WFS from the type families (pullbacks of 𝗍), by taking the left maps to be left-lifts against the type families, and restricting to the subcategory of types (those objects whose maps to 1 are type families).

Our construction relies crucially on the fact that each type admits a normal connection XI(XI)I as constructed in [2], regarded as a strong deformation retraction of the path type XI onto the type X. Following [1, p. 82] and [7, Proposition 6.1.4], we give each map Y𝑓X a path object factorisation YPfX. This is a variation on Gambino and Garner’s factorisation in [4] through an “identity context”. Unlike their setting, where the factorisation need not be functorial [4, Remark 12], our factorisation through Pf is functorial.

The history of the path object factorisation can be traced back to van den Berg and Garner [7] in a finite limit category, with an abstract path object on an object X playing the role of XI as in our work. While they assume an internal category structure on the interval, we do not; and while we assume a universe, they do not. Later, van den Berg and Moerdijk [3] show that the factorisation can be performed without requiring the category to have all pullbacks. They do not yield a weak factorisation system because, in their setting, diagonal fillers commute merely up to homotopy. In both our work and in [7], the left maps are the strong deformation retracts. We therefore expect our construction to also be cloven, as in their setting, or even algebraic [6, 5].

  • [1] Steve Awodey. Cartesian cubical model categories. May 2023.
  • [2] Steve Awodey and Joseph Hua. Path types in algebraic type theory. January 2026.
  • [3] Benno van den Berg and Ieke Moerdijk. Exact completion of path categories and algebraic set theory – part i: Exact completion of path categories. March 2016.
  • [4] Nicola Gambino and Richard Garner. The identity type weak factorisation system. Theoretical Computer Science 409 (2008), no. 1, 94–109, 409(1):94–109, December 2008.
  • [5] Richard Garner. Understanding the small object argument. Applied Categorical Structures, 17(3):247–285, April 2008.
  • [6] Marco Grandis and Walter Tholen. Natural weak factorization systems. Archivum Mathematicum, 042(4):397–408, 2006.
  • [7] Benno van den Berg and Richard Garner. Topological and simplicial models of identity types. ACM Transactions on Computational Logic, 13(1):1–44, January 2012.

← Back to program