ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK be a cone over a diagram Γ\Gamma with apex cc, and let Γ⊢t:A\Gamma \vdash t: A be a term of dimension dd. Writing

K≡Γ,c:Ob⁡,Π,K \equiv \Gamma, c: \operatorname{Ob}, \Pi,

assume that σ\sigma, τ\tau, FV⁡\operatorname{FV}, and the operation ∗\ast have the meanings given by the CaTT syntax and the cone construction. Define TtT_t recursively by

Tt=c→tT_t=c\to t

when dim⁡(t)=0\dim(t)=0, and by

Tt=pτ(t)→pσ(t)∗d−1d(1pσ2(t)1∗d−2d(1pσ3(t)2∗d−3d…(1pσd(t)d−1∗0dt)))T_t=p_{\tau(t)}\to p_{\sigma(t)}\mathop{\ast}_{d-1}^{d}\Big(1_{p_{\sigma^2(t)}}^{1}\mathop{\ast}_{d-2}^{d}\Big(1_{p_{\sigma^{3}(t)}}^{2}\mathop{\ast}_{d-3}^{d}\dots\Big(1_{p_{\sigma^{d}(t)}}^{d-1}\mathop{\ast}_{0}^{d}t\Big)\Big)\Big)

when dim⁡(t)>0\dim(t)>0. Then there exists a term ptp_t such that K⊢pt:TtK\vdash p_t:T_t, and

FV⁡(pt:Tt)=⋃pxi∈FV⁡(Π)y∈FV⁡(t:A)y∝τ(pxi)FV⁡(pxi:Txi).\operatorname{FV}(p_t:T_t)=\bigcup_{\substack{p_{x_i}\in\operatorname{FV}(\Pi)\\ y\in\operatorname{FV}(t:A)\\ y\propto\tau(p_{x_i})}}\operatorname{FV}(p_{x_i}:T_{x_i}).

Projection-term conjecture. Under these hypotheses, there exists a term K⊢pt:TtK\vdash p_t:T_t with the recursively specified type TtT_t, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.