Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (24): Appendix-sum and categorical Tet recurrences

Proved
QuantumSixJ.recurrences

by igor.kh · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

quantum-groupsrecurrence-relationsspin-networks

The theorem QuantumSixJ.recurrences asserts exactly SumRecurrence ∧ NetworkRecurrence: the conjunction of the two separately defined propositions for equation (24). The graphical Tet is defined in equation (6).

For fixed external labels, L=(Ljk)L=(L_{jk})L=(Ljk​) denotes the symmetric tridiagonal matrix, with Ljk=LkjL_{jk}=L_{kj}Ljk​=Lkj​ and Ljk=0L_{jk}=0Ljk​=0 unless k∈{j−2,j,j+2}k\in\{j-2,j,j+2\}k∈{j−2,j,j+2}. Its entries are indexed on a fixed parity lattice; L00=0L_{00}=0L00​=0. In Lean, QuantumSixJ.L a b c d j k is the two-index matrix entry LjkL_{jk}Ljk​. The off-diagonal formulas give Lj,j+2=Lj+2,jL_{j,j+2}=L_{j+2,j}Lj,j+2​=Lj+2,j​, including zero extensions; symmetry is not an extra hypothesis.

  1. SumRecurrence: Appendix sum. For every a,b,c,d,j,l∈Za,b,c,d,j,l\in\mathbb Za,b,c,d,j,l∈Z, the explicit finite Appendix sum, normalized by hjh_jhj​, satisfies
Lj,j−2Uj−2,l+(Ljj−Λ(a,b,l)hj)Ujl+Lj,j+2Uj+2,l=0.L_{j,j-2} U_{j-2,l}+(L_{jj}-\Lambda(a,b,l)h_j)U_{jl}+L_{j,j+2} U_{j+2,l}=0.Lj,j−2​Uj−2,l​+(Ljj​−Λ(a,b,l)hj​)Ujl​+Lj,j+2​Uj+2,l​=0.

Here Ujl=Tet⁡(a,b,c,d;j,l)/hjU_{jl}=\operatorname{Tet}(a,b,c,d;j,l)/h_jUjl​=Tet(a,b,c,d;j,l)/hj​ in Q(q)\mathbb Q(q)Q(q), with the published zero extensions and no additional hypotheses. Equivalently, LUl=Λ(a,b,l)diag⁡(hj)UlL U_l=\Lambda(a,b,l)\operatorname{diag}(h_j)U_lLUl​=Λ(a,b,l)diag(hj​)Ul​, displaying the symmetric generalized eigenvalue problem.

  1. NetworkRecurrence: categorical network. In every C(q)\mathbb C(q)C(q)-linear preadditive monoidal category with additive, linear tensor product, labeled self-dual objects and trivalent vertices satisfying SuQ2Axioms, VertexNormalized, and the separate initial-data assumption TetSeed, for every a,b,c,d∈Na,b,c,d\in\mathbb Na,b,c,d∈N and j,l∈Zj,l\in\mathbb Zj,l∈Z,
ι(Lj,j−2)ι(hj−2)Tj−2,l+ι(Ljj−Λ(a,b,l)hj)ι(hj)Tjl+ι(Lj,j+2)ι(hj+2)Tj+2,l=0.\frac{\iota(L_{j,j-2})}{\iota(h_{j-2})}T_{j-2,l}+\frac{\iota(L_{jj}-\Lambda(a,b,l)h_j)}{\iota(h_j)}T_{jl}+\frac{\iota(L_{j,j+2})}{\iota(h_{j+2})}T_{j+2,l}=0.ι(hj−2​)ι(Lj,j−2​)​Tj−2,l​+ι(hj​)ι(Ljj​−Λ(a,b,l)hj​)​Tjl​+ι(hj+2​)ι(Lj,j+2​)​Tj+2,l​=0.

The coefficients act on endomorphisms of the tensor unit. The graphical network of equation (6) is T(a,b,c,d;j,l)=X(a,d,c,b;j)≫HR(a,d,c,b;l)T(a,b,c,d;j,l)=X(a,d,c,b;j)\mathbin{\gg}H^R(a,d,c,b;l)T(a,b,c,d;j,l)=X(a,d,c,b;j)≫HR(a,d,c,b;l) when both channels are nonnegative and zero otherwise, with composition read left to right. The last channel is the inner rung.

The category assumptions are scalar endomorphisms of each label object, vanishing morphisms between different labels, the fusion decompositions and loop values. Vertex normalization requires only theta evaluation and cyclicity. The separate assumption TetSeed supplies the last-slot-2 Tet values as initial data for the recurrence solution and as input to its derivation. No second numerical Tet evaluation, general rotation, or all-channel equality between the network and Appendix sum is assumed. In both clauses field division by zero is zero; complex specialization is not part of the statement. The scalar clause is independent of all categorical hypotheses.

The scalar Tet is defined by QuantumSixJ.tetSum, and the graphical Tet by QuantumSixJ.Network.Vertex.tet. Both recurrence assertions are part of the conclusion, not hypotheses.

Preamble
import Definitions.Def_QuantumSixJRecurrences
Formal statement
namespace QuantumSixJ

/-- Equation (24), for the Appendix sum and the graphical network of equation (6). -/
theorem recurrences.{v, u} : SumRecurrence ∧ NetworkRecurrence.{v, u} := by sorry

end QuantumSixJ
Source
I. Khavkine, Recurrence relation for the 6j-symbol of su_q(2) as a symmetric eigenvalue problem, International Journal of Geometric Methods in Modern Physics (2015); https://doi.org/10.1142/S0219887815501170; https://arxiv.org/abs/1009.2261. Eq. (24), both recurrence statements; Eq. (6), graphical Tet. Diagrammatic notation: Kauffman–Lins (1994). Category properties: Etingof–Ostrik, https://arxiv.org/abs/math/0302130, §2; Chen, https://arxiv.org/abs/1502.06845.
Read-back

What the Lean code literally says, in plain math · openai/gpt-6.1-sol

Tetrahedral recurrences

For every pair of universe levels u,vu,vu,v, the assertion is the conjunction of the following scalar identity and categorical identity. The scalar identity has no categorical hypotheses. The categorical identity is universally quantified over categories whose objects belong to universe uuu and whose morphisms belong to universe vvv, and has the three separate hypotheses specified below. Here are the quantities and assumptions in full, followed by the two identities.

Scalar quantities. Work in F=Q(q)F=\mathbb Q(q)F=Q(q), with qqq the indeterminate, and for every integer nnn set

[n]=qn−q−nq−q−1,[n]!={∏k=1n[k],n≥0,0,n<0.[n]=\frac{q^n-q^{-n}}{q-q^{-1}},\qquad [n]!=\begin{cases}\displaystyle\prod_{k=1}^{n}[k],&n\geq0,\\0,&n<0.\end{cases}[n]=q−q−1qn−q−n​,[n]!=⎩⎨⎧​k=1∏n​[k],0,​n≥0,n<0.​

The empty product is 111, so [0]!=1[0]!=1[0]!=1. All divisions are field divisions with 0−1=00^{-1}=00−1=0, hence every quotient with zero denominator is zero. All integer powers, including negative powers, have their field meaning. Every halving expression below denotes integer division (rounding down), not division in FFF. A triple (a,b,c)(a,b,c)(a,b,c) of integers is admissible exactly when all three entries are nonnegative, each is at most the sum of the other two, and a+b+ca+b+ca+b+c is even. Write H(a,b,c,d;j)H(a,b,c,d;j)H(a,b,c,d;j) for admissibility of both (a,d,j)(a,d,j)(a,d,j) and (b,c,j)(b,c,j)(b,c,j), and V(a,b,c,d;l)V(a,b,c,d;l)V(a,b,c,d;l) for admissibility of both (a,b,l)(a,b,l)(a,b,l) and (c,d,l)(c,d,l)(c,d,l). Define

Δj={(−1)j[j+1],j≥0,0,j<0,θ(a,b,c)={(−1)s[s+1]![s−a]![s−b]![s−c]![a]![b]![c]!,s=(a+b+c)/2,(a,b,c) admissible,0,otherwise,\Delta_j=\begin{cases}(-1)^j[j+1],&j\geq0,\\0,&j<0,\end{cases}\qquad \theta(a,b,c)=\begin{cases} \displaystyle\frac{(-1)^s[s+1]![s-a]![s-b]![s-c]!}{[a]![b]![c]!},\quad s=(a+b+c)/2,&(a,b,c)\text{ admissible},\\ 0,&\text{otherwise}, \end{cases}Δj​={(−1)j[j+1],0,​j≥0,j<0,​θ(a,b,c)=⎩⎨⎧​[a]![b]![c]!(−1)s[s+1]![s−a]![s−b]![s−c]!​,s=(a+b+c)/2,0,​(a,b,c) admissible,otherwise,​ hj=h(a,b,c,d;j)={θ(a,d,j)θ(b,c,j)/Δj,H(a,b,c,d;j),0,otherwise,h_j=h(a,b,c,d;j)=\begin{cases}\theta(a,d,j)\theta(b,c,j)/\Delta_j,&H(a,b,c,d;j),\\0,&\text{otherwise},\end{cases}hj​=h(a,b,c,d;j)={θ(a,d,j)θ(b,c,j)/Δj​,0,​H(a,b,c,d;j),otherwise,​

and, for arbitrary integer arguments,

Λ(a,b;l)={[(a−b+l)/2][(−a+b+l)/2]−[(a+b−l)/2][(a+b+l)/2+2][2],(a,b,l) admissible,0,otherwise.\Lambda(a,b;l)=\begin{cases} \displaystyle\frac{[(a-b+l)/2][(-a+b+l)/2]-[(a+b-l)/2][(a+b+l)/2+2]}{[2]},&(a,b,l)\text{ admissible},\\ 0,&\text{otherwise}. \end{cases}Λ(a,b;l)=⎩⎨⎧​[2][(a−b+l)/2][(−a+b+l)/2]−[(a+b−l)/2][(a+b+l)/2+2]​,0,​(a,b,l) admissible,otherwise.​

For fixed integers a,b,c,da,b,c,da,b,c,d, the matrix entries used in the identities are defined for all integers j,kj,kj,k by

Ljk=L(a,b,c,d;j,k)={−hj[2]Λ(a,j;d)Λ(b,j;c)[j][j+2],j=k, H(a,b,c,d;j), j≠0,hn[(a+d−m)/2][(b+c−m)/2],∣j−k∣=2, H(a,b,c,d;m), H(a,b,c,d;n),0,otherwise,m=min⁡(j,k),n=max⁡(j,k).L_{jk}=L(a,b,c,d;j,k)= \begin{cases} \displaystyle-\frac{h_j[2]\Lambda(a,j;d)\Lambda(b,j;c)}{[j][j+2]},&j=k,\ H(a,b,c,d;j),\ j\ne0,\\ \displaystyle h_n[(a+d-m)/2][(b+c-m)/2],&|j-k|=2,\ H(a,b,c,d;m),\ H(a,b,c,d;n),\\ 0,&\text{otherwise}, \end{cases} \qquad m=\min(j,k),\quad n=\max(j,k).Ljk​=L(a,b,c,d;j,k)=⎩⎨⎧​−[j][j+2]hj​[2]Λ(a,j;d)Λ(b,j;c)​,hn​[(a+d−m)/2][(b+c−m)/2],0,​j=k, H(a,b,c,d;j), j=0,∣j−k∣=2, H(a,b,c,d;m), H(a,b,c,d;n),otherwise,​m=min(j,k),n=max(j,k).

In particular L00=0L_{00}=0L00​=0; a diagonal entry is zero at every inadmissible horizontal channel; and an adjacent entry is zero unless both endpoint channels are admissible. All other entries vanish. For six integer labels define

(A1,A2,A3,A4)=((a+d+j)/2,(b+c+j)/2,(a+b+l)/2,(c+d+l)/2),(B1,B2,B3)=((b+d+j+l)/2,(a+c+j+l)/2,(a+b+c+d)/2),tS=(−1)S[S+1]!(∏i=14[S−Ai]!)(∏k=13[Bk−S]!).\begin{aligned} (A_1,A_2,A_3,A_4)&=((a+d+j)/2,(b+c+j)/2,(a+b+l)/2,(c+d+l)/2),\\ (B_1,B_2,B_3)&=((b+d+j+l)/2,(a+c+j+l)/2,(a+b+c+d)/2),\\ t_S&=\frac{(-1)^S[S+1]!}{\left(\prod_{i=1}^4[S-A_i]!\right)\left(\prod_{k=1}^3[B_k-S]!\right)}. \end{aligned}(A1​,A2​,A3​,A4​)(B1​,B2​,B3​)tS​​=((a+d+j)/2,(b+c+j)/2,(a+b+l)/2,(c+d+l)/2),=((b+d+j+l)/2,(a+c+j+l)/2,(a+b+c+d)/2),=(∏i=14​[S−Ai​]!)(∏k=13​[Bk​−S]!)(−1)S[S+1]!​.​

The scalar tetrahedral value and its normalization are

T(a,b,c,d;j,l)={∏i=14∏k=13[Bk−Ai]![a]![b]![c]![d]![j]![l]!∑S=0a+b+c+d+j+ltS,H(a,b,c,d;j) and V(a,b,c,d;l),0,otherwise,Ujl=T(a,b,c,d;j,l)hj.T(a,b,c,d;j,l)=\begin{cases} \displaystyle\frac{\prod_{i=1}^4\prod_{k=1}^3[B_k-A_i]!}{[a]![b]![c]![d]![j]![l]!} \sum_{S=0}^{a+b+c+d+j+l}t_S,&H(a,b,c,d;j)\text{ and }V(a,b,c,d;l),\\ 0,&\text{otherwise}, \end{cases} \qquad U_{jl}=\frac{T(a,b,c,d;j,l)}{h_j}.T(a,b,c,d;j,l)=⎩⎨⎧​[a]![b]![c]![d]![j]![l]!∏i=14​∏k=13​[Bk​−Ai​]!​S=0∑a+b+c+d+j+l​tS​,0,​H(a,b,c,d;j) and V(a,b,c,d;l),otherwise,​Ujl​=hj​T(a,b,c,d;j,l)​.

The sum is over integers in the displayed inclusive interval and is empty if its upper endpoint is negative. There are no additional summand support guards: a negative factorial argument is zero, and a resulting zero denominator makes that summand zero under the stated field convention. In particular the normalization is zero when hj=0h_j=0hj​=0, including the case T=hj=0T=h_j=0T=hj​=0.

Categorical data and the three separate assumptions. Let K=C(q)K=\mathbb C(q)K=C(q), and let ι:F→K\iota:F\to Kι:F→K be the coefficient embedding induced by Q↪C\mathbb Q\hookrightarrow\mathbb CQ↪C, fixing the indeterminate. Quantify over every category C\mathcal CC with the universe sizes above, equipped with a preadditive structure, a KKK-linear structure, a monoidal structure, and compatibility of tensor product with addition and with the KKK-scalar actions on morphisms. No braiding or symmetry is assumed. Write 1\mathbf11 for its tensor unit. Quantify over every family of objects VaV_aVa​, indexed by a∈Na\in\mathbb Na∈N, with a chosen isomorphism V0≅1V_0\cong\mathbf1V0​≅1, and for each aaa a chosen exact self-pairing, that is, a cup ηa:1→Va⊗Va\eta_a:\mathbf1\to V_a\otimes V_aηa​:1→Va​⊗Va​ and cap ϵa:Va⊗Va→1\epsilon_a:V_a\otimes V_a\to\mathbf1ϵa​:Va​⊗Va​→1 satisfying both snake identities. Quantify also over every family of chosen covectors wabc:Va⊗Vb⊗Vc→1w_{abc}:V_a\otimes V_b\otimes V_c\to\mathbf1wabc​:Va​⊗Vb​⊗Vc​→1, for all natural a,b,ca,b,ca,b,c. In the formulas defining their contractions, composition f;gf;gf;g means first fff, then ggg; tensor identities, canonical associators and unitors are inserted as necessary, without any interchange of tensor factors. Define the rotation of any f:Va⊗Vb⊗Vc→1f:V_a\otimes V_b\otimes V_c\to\mathbf1f:Va​⊗Vb​⊗Vc​→1, its all-output counterpart, its split and fuse by

R(f)=(ηa⊗id⁡Vb⊗Vc⊗Va);(id⁡Va⊗f⊗id⁡Va);ϵa,wabc=ηc;(id⁡Vc⊗ηb⊗id⁡Vc);(id⁡Vc⊗Vb⊗ηa⊗id⁡Vb⊗Vc);(wcba⊗id⁡Va⊗Vb⊗Vc),srab=(ηa⊗id⁡Vr);(id⁡Va⊗ηb⊗id⁡Va⊗Vr);(id⁡Va⊗Vb⊗wbar),fabr=(id⁡Va⊗Vb⊗ηr);(wabr⊗id⁡Vr).\begin{aligned} R(f)&=(\eta_a\otimes\operatorname{id}_{V_b\otimes V_c\otimes V_a}); (\operatorname{id}_{V_a}\otimes f\otimes\operatorname{id}_{V_a});\epsilon_a,\\ w^{abc}&=\eta_c; (\operatorname{id}_{V_c}\otimes\eta_b\otimes\operatorname{id}_{V_c}); (\operatorname{id}_{V_c\otimes V_b}\otimes\eta_a\otimes\operatorname{id}_{V_b\otimes V_c}); (w_{cba}\otimes\operatorname{id}_{V_a\otimes V_b\otimes V_c}),\\ s_r^{ab}&=(\eta_a\otimes\operatorname{id}_{V_r}); (\operatorname{id}_{V_a}\otimes\eta_b\otimes\operatorname{id}_{V_a\otimes V_r}); (\operatorname{id}_{V_a\otimes V_b}\otimes w_{bar}),\\ f_{ab}^{r}&=(\operatorname{id}_{V_a\otimes V_b}\otimes\eta_r); (w_{abr}\otimes\operatorname{id}_{V_r}). \end{aligned}R(f)wabcsrab​fabr​​=(ηa​⊗idVb​⊗Vc​⊗Va​​);(idVa​​⊗f⊗idVa​​);ϵa​,=ηc​;(idVc​​⊗ηb​⊗idVc​​);(idVc​⊗Vb​​⊗ηa​⊗idVb​⊗Vc​​);(wcba​⊗idVa​⊗Vb​⊗Vc​​),=(ηa​⊗idVr​​);(idVa​​⊗ηb​⊗idVa​⊗Vr​​);(idVa​⊗Vb​​⊗wbar​),=(idVa​⊗Vb​​⊗ηr​);(wabr​⊗idVr​​).​

Thus srab:Vr→Va⊗Vbs_r^{ab}:V_r\to V_a\otimes V_bsrab​:Vr​→Va​⊗Vb​ and fabr:Va⊗Vb→Vrf_{ab}^{r}:V_a\otimes V_b\to V_rfabr​:Va​⊗Vb​→Vr​; in wbarw_{bar}wbar​ the ordered labels are (b,a,r)(b,a,r)(b,a,r). Define the state and covector

X(a,b,c,d;r)=ηr;(srab⊗srcd),H∗(a,b,c,d;t)=(id⁡Va⊗fbct⊗id⁡Vd);watd.X(a,b,c,d;r)=\eta_r;(s_r^{ab}\otimes s_r^{cd}),\qquad H^*(a,b,c,d;t)=(\operatorname{id}_{V_a}\otimes f_{bc}^{t}\otimes\operatorname{id}_{V_d});w_{atd}.X(a,b,c,d;r)=ηr​;(srab​⊗srcd​),H∗(a,b,c,d;t)=(idVa​​⊗fbct​⊗idVd​​);watd​.

For natural external labels and signed integer channels set

T(a,b,c,d;j,l)={X(a,d,c,b;j);H∗(a,d,c,b;l),j≥0 and l≥0,0,otherwise,\mathcal T(a,b,c,d;j,l)=\begin{cases} X(a,d,c,b;j);H^*(a,d,c,b;l),&j\geq0\text{ and }l\geq0,\\ 0,&\text{otherwise}, \end{cases}T(a,b,c,d;j,l)={X(a,d,c,b;j);H∗(a,d,c,b;l),0,​j≥0 and l≥0,otherwise,​

where nonnegative integer channels in the first branch are regarded as natural numbers. This is an endomorphism of 1\mathbf11; the ordered external tensor factors in the closure are (a,d,c,b)(a,d,c,b)(a,d,c,b), and the inner channel is lll. The star here denotes the displayed covector construction, not complex conjugation. Impose the following three hypotheses separately. First, the category axioms require: for every natural aaa and endomorphism ggg of VaV_aVa​, there is exactly one z∈Kz\in Kz∈K with g=zid⁡Vag=z\operatorname{id}_{V_a}g=zidVa​​; for every pair of distinct natural labels a,ba,ba,b, every morphism Va→VbV_a\to V_bVa​→Vb​ is zero; for every natural a,ba,ba,b, there exist families ir:Vr→Va⊗Vbi_r:V_r\to V_a\otimes V_bir​:Vr​→Va​⊗Vb​ and pr:Va⊗Vb→Vrp_r:V_a\otimes V_b\to V_rpr​:Va​⊗Vb​→Vr​, defined for all natural rrr, such that

ir;pr=id⁡Vr(r∈Fab),∑r∈Fabpr;ir=id⁡Va⊗Vb,Fab={r∈N:r≤a+b, (a,b,r) admissible};i_r;p_r=\operatorname{id}_{V_r}\quad(r\in F_{ab}),\qquad \sum_{r\in F_{ab}}p_r;i_r=\operatorname{id}_{V_a\otimes V_b},\qquad F_{ab}=\{r\in\mathbb N: r\leq a+b,\ (a,b,r)\text{ admissible}\};ir​;pr​=idVr​​(r∈Fab​),r∈Fab​∑​pr​;ir​=idVa​⊗Vb​​,Fab​={r∈N:r≤a+b, (a,b,r) admissible};

and, for every natural aaa, ηa;ϵa=ι(Δa)id⁡1\eta_a;\epsilon_a=\iota(\Delta_a)\operatorname{id}_{\mathbf1}ηa​;ϵa​=ι(Δa​)id1​. The fusion families have no further required equations outside FabF_{ab}Fab​, and are not assumed to equal the chosen splits and fuses. Second, vertex normalization requires, for all natural a,b,ca,b,ca,b,c,

wabc;wabc=ι(θ(a,b,c))id⁡1,R(wabc)=wbca.w^{abc};w_{abc}=\iota(\theta(a,b,c))\operatorname{id}_{\mathbf1},\qquad R(w_{abc})=w_{bca}.wabc;wabc​=ι(θ(a,b,c))id1​,R(wabc​)=wbca​.

Third, independently of that normalization, tetrahedral seed data require, for every natural a,b,c,d,ja,b,c,d,ja,b,c,d,j,

T(a,b,c,d;j,2)=ι(T(a,b,c,d;j,2))id⁡1.\mathcal T(a,b,c,d;j,2)=\iota\bigl(T(a,b,c,d;j,2)\bigr)\operatorname{id}_{\mathbf1}.T(a,b,c,d;j,2)=ι(T(a,b,c,d;j,2))id1​.

This seed hypothesis quantifies over all natural labels, including inadmissible choices, for which its scalar right side is zero. It does not assume a tetrahedral evaluation at arbitrary inner channel lll. The categorical conclusion is conditional on all three hypotheses; no existence of such data or of a category satisfying them is asserted.

The two conclusions. The first conjunct asserts, for every six integers a,b,c,d,j,la,b,c,d,j,la,b,c,d,j,l, with no admissibility, positivity, boundary, or nonvanishing hypotheses,

Lj,j−2Uj−2,l+(Ljj−Λ(a,b;l)hj)Ujl+Lj,j+2Uj+2,l=0in F.L_{j,j-2}U_{j-2,l} +\bigl(L_{jj}-\Lambda(a,b;l)h_j\bigr)U_{jl} +L_{j,j+2}U_{j+2,l}=0\quad\text{in }F.Lj,j−2​Uj−2,l​+(Ljj​−Λ(a,b;l)hj​)Ujl​+Lj,j+2​Uj+2,l​=0in F.

The second conjunct asserts, for every category and every set of data just quantified over, assuming separately the category axioms, vertex normalization, and tetrahedral seed data above, and then for every a,b,c,d∈Na,b,c,d\in\mathbb Na,b,c,d∈N and j,l∈Zj,l\in\mathbb Zj,l∈Z,

ι(Lj,j−2)ι(hj−2) T(a,b,c,d;j−2,l)+ι(Ljj−Λ(a,b;l)hj)ι(hj) T(a,b,c,d;j,l)+ι(Lj,j+2)ι(hj+2) T(a,b,c,d;j+2,l)=0in End⁡C(1).\frac{\iota(L_{j,j-2})}{\iota(h_{j-2})}\,\mathcal T(a,b,c,d;j-2,l) +\frac{\iota\bigl(L_{jj}-\Lambda(a,b;l)h_j\bigr)}{\iota(h_j)}\,\mathcal T(a,b,c,d;j,l) +\frac{\iota(L_{j,j+2})}{\iota(h_{j+2})}\,\mathcal T(a,b,c,d;j+2,l)=0 \quad\text{in }\operatorname{End}_{\mathcal C}(\mathbf1).ι(hj−2​)ι(Lj,j−2​)​T(a,b,c,d;j−2,l)+ι(hj​)ι(Ljj​−Λ(a,b;l)hj​)​T(a,b,c,d;j,l)+ι(hj+2​)ι(Lj,j+2​)​T(a,b,c,d;j+2,l)=0in EndC​(1).

Here multiplication of a morphism by a coefficient means its KKK-scalar action; all scalar definitions use the natural external labels cast to integers. The zero on the right is the zero morphism. Divisions in KKK, too, have zero inverse equal to zero: a term with zero norm denominator is zero regardless of its tetrahedral factor. Both conclusions include j=0j=0j=0, negative channels, absent neighbors, zero external labels, and all inadmissible channels under precisely the conventions above; the categorical tetrahedral definition itself has only the negative-channel guard, not an additional admissibility guard. The scalar identity is not a hypothesis of the categorical identity, nor is an all-channel equality between the scalar and categorical tetrahedral values assumed.

Human review
  • Endorsed by Shuze Chen · Nov 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by igor.kh · Nov 19, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me