Table of Contents
Fetching ...

A Toolkit for Structured Lifts

Chris Kapulkin, Yufeng Li

TL;DR

The paper develops a theory of structured lifts to model uniform solutions to lifting problems in categorical models of dependent type theory without the heavy algebraic weak factorization framework. It introduces lifting structures including uniform lifts, left/right restrictions, base-change rebasing, structured pushout-product approximations, and structured Leibniz transposes, proving closure, stability, and uniqueness properties. The framework is developed in locally cartesian closed categories and CwRs, with slice- and universe-based formulations to support axiomatization of computation rules in cubical type theory. By enabling restriction, composition, base-change, and relational comparison of lifts under minimal assumptions, it provides a robust toolkit for modeling pattern matching and interactions of dependent sums and path types in type-theoretic semantics.

Abstract

We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type theory.

A Toolkit for Structured Lifts

TL;DR

The paper develops a theory of structured lifts to model uniform solutions to lifting problems in categorical models of dependent type theory without the heavy algebraic weak factorization framework. It introduces lifting structures including uniform lifts, left/right restrictions, base-change rebasing, structured pushout-product approximations, and structured Leibniz transposes, proving closure, stability, and uniqueness properties. The framework is developed in locally cartesian closed categories and CwRs, with slice- and universe-based formulations to support axiomatization of computation rules in cubical type theory. By enabling restriction, composition, base-change, and relational comparison of lifts under minimal assumptions, it provides a robust toolkit for modeling pattern matching and interactions of dependent sums and path types in type-theoretic semantics.

Abstract

We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type theory.

Paper Structure

This paper contains 6 sections, 25 theorems, 67 equations.

Key Result

lemma 1

Suppose one has maps $U \to V$ and $E \to B$ and $V \to V'$ between exponential objects. Then, one has representability of:

Theorems & Definitions (65)

  • definition 1
  • definition 2
  • definition 3
  • definition 4
  • remark 1
  • lemma 1
  • proof
  • corollary 1
  • proof
  • lemma 2
  • ...and 55 more