The projection-term conjecture for lax cones in CaTT
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.