The projection-term conjecture for lax cones in CaTT
The projection-term conjecture for lax cones in CaTT
Let be a cone over a diagram with apex , and let be a term of dimension . Writing
assume that , , , and the operation have the meanings given by the CaTT syntax and the cone construction. Define recursively by
when , and by
when . Then there exists a term such that , and
Projection-term conjecture. Under these hypotheses, there exists a term with the recursively specified type , and its free variables satisfy the displayed union formula.
This conjecture predicts a uniform construction of projection terms for arbitrary terms, including coherence terms, in the weak higher-categorical setting. The supplied text reports only low-dimensional evidence and gives no resolution status.
Sources & referencesView supporting material
Primary source
Thomas Jan Mikhail, “A type-theoretic definition of lax (,)-limits”, arXiv:2412.13310 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.