Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (23), (24) — graphical-network recurrence

Proved
QuantumSixJ.network_recurrence

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

monoidal-categoriesquantum-groupsspin-networks

Let C\mathcal CC be a KKK-linear preadditive monoidal category, K=C(q)K=\mathbb C(q)K=C(q), with additive and KKK-linear tensor product. The chosen objects VnV_nVn​ for natural labels satisfy V0≅1V_0\cong\mathbb1V0​≅1 and have exact self-pairings. Assume SuQ2Axioms: unique scalar endomorphisms of each VnV_nVn​, zero morphisms between different labels, the admissible SL(2)\mathrm{SL}(2)SL(2) fusion decompositions, and the loop values Δn\Delta_nΔn​. Choose trivalent vertices WWW, and assume VertexNormalized W: theta normalization and cyclicity. Scalars act through ι:Q(q)↪K\iota:\mathbb Q(q)\hookrightarrow Kι:Q(q)↪K, fixing qqq. Composition f;gf;gf;g means first fff, then ggg.

Also assume the separate initial data TetSeed W: for every natural a,b,c,d,ja,b,c,d,ja,b,c,d,j, T(a,b,c,d;j,2)=ι(Tet⁡sum(a,b,c,d;j,2)) id1T(a,b,c,d;j,2)=\iota(\operatorname{Tet}^{\mathrm{sum}}(a,b,c,d;j,2))\,\mathrm{id}_{\mathbb1}T(a,b,c,d;j,2)=ι(Tetsum(a,b,c,d;j,2))id1​. These are seed values, not an all-channel network-to-sum identity.

Prove QuantumSixJ.NetworkRecurrence. For every a,b,c,d∈Na,b,c,d\in\mathbb Na,b,c,d∈N and every signed channels j,l∈Zj,l\in\mathbb Zj,l∈Z, the graphical Tet of equation (6), extended by zero when a channel is negative, satisfies

ι(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 graphical network 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);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) on nonnegative channels. Scalar coefficients act on endomorphisms of the tensor unit. No eigenvector equation, matrix-entry evaluation, general tetrahedral symmetry, or all-channel network-to-sum equality is assumed beyond the stated category, normalization and seed data. Total field division includes the boundary and inadmissible cases. The pure scalar recurrence is not an assumption of this statement.

Independent mathematical read-back

Graphical tetrahedral recurrence

Statement and universe scope

Let u,vu,vu,v be arbitrary universe levels. The assertion quantifies over every category C\mathcal CC whose objects have size uuu and whose morphisms have size vvv, equipped with a preadditive structure, a KKK-linear structure, a monoidal structure, and compatible monoidal-preadditive and monoidal-linear structures, where K=C(q)K=\mathbb C(q)K=C(q). Thus morphism sets are additive groups and KKK-modules; composition and tensoring satisfy the indicated additivity and linearity requirements. No ordering between uuu and vvv is imposed by the assertion.

For every choice of labelled self-duality data SSS and trivalent vertices WWW described below, assume all the category axioms, the two vertex-normalization conditions, and the separate tetrahedral seed condition below. 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) Tj−2,l+ι(Lj,j−Λ(a,b,l)hj)ι(hj) Tj,l+ι(Lj,j+2)ι(hj+2) Tj+2,l=0in End⁡C(1).\frac{\iota(L_{j,j-2})}{\iota(h_{j-2})}\,\mathcal T_{j-2,l} +\frac{\iota(L_{j,j}-\Lambda(a,b,l)h_j)}{\iota(h_j)}\,\mathcal T_{j,l} +\frac{\iota(L_{j,j+2})}{\iota(h_{j+2})}\,\mathcal T_{j+2,l}=0 \quad\text{in }\operatorname{End}_{\mathcal C}(\mathbf1).ι(hj−2​)ι(Lj,j−2​)​Tj−2,l​+ι(hj​)ι(Lj,j​−Λ(a,b,l)hj​)​Tj,l​+ι(hj+2​)ι(Lj,j+2​)​Tj+2,l​=0in EndC​(1).

Products of a field coefficient and a morphism here mean the KKK-scalar action, and zero is the zero morphism. Set hr=h(a,b,c,d,r)h_r=h(a,b,c,d,r)hr​=h(a,b,c,d,r), Lr,s=L(a,b,c,d,r,s)L_{r,s}=L(a,b,c,d,r,s)Lr,s​=L(a,b,c,d,r,s), and Tr,l=W.tet⁡(a,b,c,d,r,l)\mathcal T_{r,l}=W.\operatorname{tet}(a,b,c,d,r,l)Tr,l​=W.tet(a,b,c,d,r,l). Natural labels in scalar expressions are coerced to integers. The map ι:Q(q)→C(q)\iota:\mathbb Q(q)\to\mathbb C(q)ι:Q(q)→C(q) is the coefficient embedding induced by Q↪C\mathbb Q\hookrightarrow\mathbb CQ↪C, fixing the indeterminate qqq.

The three denominators are respectively the norms at j−2,j,j+2j-2,j,j+2j−2,j,j+2, not a common denominator hjh_jhj​. There are no admissibility or nonzero-denominator hypotheses on the displayed indices. This assertion does not assume the scalar recurrence or an all-channel equality between the graphical tetrahedron and the explicit sum.

Scalar definitions used in the assertion and seed

In F=Q(q)F=\mathbb Q(q)F=Q(q), define for integers nnn

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

The empty product is one. All divisions in FFF and KKK are total field division, so z/0=0z/0=0z/0=0, including 0/0=00/0=00/0=0. All divisions of integer indices by two mean Euclidean integer division, i.e. floor division for divisor two. Integer powers are used in expressions such as (−1)S(-1)^S(−1)S.

Write A(a,b,c)A(a,b,c)A(a,b,c) for

a,b,c≥0,a≤b+c,b≤c+a,c≤a+b,a+b+c≡0(mod2).a,b,c\ge0,\quad a\le b+c,\quad b\le c+a,\quad c\le a+b, \quad a+b+c\equiv0\pmod2.a,b,c≥0,a≤b+c,b≤c+a,c≤a+b,a+b+c≡0(mod2).

Write HrH_rHr​ for A(a,d,r)∧A(b,c,r)A(a,d,r)\land A(b,c,r)A(a,d,r)∧A(b,c,r), and VlV_lVl​ for A(a,b,l)∧A(c,d,l)A(a,b,l)\land A(c,d,l)A(a,b,l)∧A(c,d,l). These predicates do not denote objects of C\mathcal CC. Define

Δ(r)={(−1)r[r+1]r≥0,0r<0,\Delta(r)=\begin{cases}(-1)^r[r+1]&r\ge0,\\0&r<0,\end{cases}Δ(r)={(−1)r[r+1]0​r≥0,r<0,​ θ(a,b,c)={(−1)s[s+1]![s−a]![s−b]![s−c]![a]![b]![c]!,A(a,b,c),s=(a+b+c)div2,0,otherwise,hr={θ(a,d,r)θ(b,c,r)/Δ(r)Hr,0otherwise.\theta(a,b,c)=\begin{cases} \displaystyle\frac{(-1)^s[s+1]![s-a]![s-b]![s-c]!}{[a]![b]![c]!}, &A(a,b,c),\quad s=(a+b+c)\mathbin{\mathrm{div}}2,\\ 0,&\text{otherwise}, \end{cases} \qquad h_r=\begin{cases}\theta(a,d,r)\theta(b,c,r)/\Delta(r)&H_r,\\0&\text{otherwise}.\end{cases}θ(a,b,c)=⎩⎨⎧​[a]![b]![c]!(−1)s[s+1]![s−a]![s−b]![s−c]!​,0,​A(a,b,c),s=(a+b+c)div2,otherwise,​hr​={θ(a,d,r)θ(b,c,r)/Δ(r)0​Hr​,otherwise.​

For every integer triple,

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

The +2+2+2 in the last bracket is outside the integer division.

The matrix is defined first on its diagonal by

Lr,r={−hr[2]Λ(a,r,d)Λ(b,r,c)[r][r+2],Hr∧r≠0,0,otherwise.L_{r,r}=\begin{cases} \displaystyle-\frac{h_r[2]\Lambda(a,r,d)\Lambda(b,r,c)}{[r][r+2]},&H_r\land r\ne0,\\ 0,&\text{otherwise}. \end{cases}Lr,r​=⎩⎨⎧​−[r][r+2]hr​[2]Λ(a,r,d)Λ(b,r,c)​,0,​Hr​∧r=0,otherwise.​

For r≠sr\ne sr=s with s=r+2s=r+2s=r+2 or r=s+2r=s+2r=s+2, set m=min⁡(r,s)m=\min(r,s)m=min(r,s), n=max⁡(r,s)n=\max(r,s)n=max(r,s), and define

Lr,s={hn[(a+d−m)div2][(b+c−m)div2],Hm∧Hn,0,otherwise.L_{r,s}=\begin{cases} h_n[(a+d-m)\mathbin{\mathrm{div}}2][(b+c-m)\mathbin{\mathrm{div}}2],&H_m\land H_n,\\ 0,&\text{otherwise}. \end{cases}Lr,s​={hn​[(a+d−m)div2][(b+c−m)div2],0,​Hm​∧Hn​,otherwise.​

All other entries vanish. Thus Lr,s=Ls,rL_{r,s}=L_{s,r}Lr,s​=Ls,r​, with only the diagonal and step-two neighboring diagonals possibly nonzero. In particular L0,0=0L_{0,0}=0L0,0​=0 by an explicit branch. The lower neighbor uses hj[(a+d−j+2)div2][(b+c−j+2)div2]h_j[(a+d-j+2)\mathbin{\mathrm{div}}2][(b+c-j+2)\mathbin{\mathrm{div}}2]hj​[(a+d−j+2)div2][(b+c−j+2)div2] when Hj−2∧HjH_{j-2}\land H_jHj−2​∧Hj​; the upper neighbor uses hj+2[(a+d−j)div2][(b+c−j)div2]h_{j+2}[(a+d-j)\mathbin{\mathrm{div}}2][(b+c-j)\mathbin{\mathrm{div}}2]hj+2​[(a+d−j)div2][(b+c−j)div2] when Hj∧Hj+2H_j\land H_{j+2}Hj​∧Hj+2​. Otherwise those entries are zero.

The seed uses an independently defined explicit sum T(a,b,c,d,j,l)T(a,b,c,d,j,l)T(a,b,c,d,j,l). Define

(A1,A2,A3,A4)=((a+d+j)div2,(b+c+j)div2,(a+b+l)div2,(c+d+l)div2),(A_1,A_2,A_3,A_4)=\bigl((a+d+j)\mathbin{\mathrm{div}}2, (b+c+j)\mathbin{\mathrm{div}}2,(a+b+l)\mathbin{\mathrm{div}}2, (c+d+l)\mathbin{\mathrm{div}}2\bigr),(A1​,A2​,A3​,A4​)=((a+d+j)div2,(b+c+j)div2,(a+b+l)div2,(c+d+l)div2), (B1,B2,B3)=((b+d+j+l)div2,(a+c+j+l)div2,(a+b+c+d)div2).(B_1,B_2,B_3)=\bigl((b+d+j+l)\mathbin{\mathrm{div}}2, (a+c+j+l)\mathbin{\mathrm{div}}2,(a+b+c+d)\mathbin{\mathrm{div}}2\bigr).(B1​,B2​,B3​)=((b+d+j+l)div2,(a+c+j+l)div2,(a+b+c+d)div2).

When Hj∧VlH_j\land V_lHj​∧Vl​, let

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+l(−1)S[S+1]!(∏i=14[S−Ai]!)(∏k=13[Bk−S]!);T(a,b,c,d,j,l)= \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} \frac{(-1)^S[S+1]!}{\left(\prod_{i=1}^4[S-A_i]!\right) \left(\prod_{k=1}^3[B_k-S]!\right)};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​(∏i=14​[S−Ai​]!)(∏k=13​[Bk​−S]!)(−1)S[S+1]!​;

otherwise T=0T=0T=0. This is an inclusive sum over integer indices, empty when the upper bound is negative. No separate support guard is present. Negative factorial arguments yield zero, and a zero factorial denominator makes the corresponding quotient zero by total division. Admissibility makes the relevant half-sums integral without rounding.

Labelled self-duality data

For every a∈Na\in\mathbb Na∈N, choose an object VaV_aVa​, with an isomorphism V0≅1V_0\cong\mathbf1V0​≅1, and an exact self-pairing. Write its coevaluation and evaluation as

ua:1⟶Va⊗Va,ea:Va⊗Va⟶1.u_a:\mathbf1\longrightarrow V_a\otimes V_a, \qquad e_a:V_a\otimes V_a\longrightarrow\mathbf1.ua​:1⟶Va​⊗Va​,ea​:Va​⊗Va​⟶1.

Both snake identities hold: the composites (ua⊗1a);(1a⊗ea)(u_a\otimes1_a);(1_a\otimes e_a)(ua​⊗1a​);(1a​⊗ea​) and (1a⊗ua);(ea⊗1a)(1_a\otimes u_a);(e_a\otimes1_a)(1a​⊗ua​);(ea​⊗1a​), with their canonical unitors and associators, are each 1a1_a1a​. Here and below f;gf;gf;g means first fff, then ggg. These are chosen pairings, not Hermitian inner products.

All category axioms

  1. Scalar endomorphisms, uniquely: for every a∈Na\in\mathbb Na∈N and f:Va→Vaf:V_a\to V_af:Va​→Va​, there exists exactly one s∈Ks\in Ks∈K with f=s 1af=s\,1_af=s1a​.
  2. Disjoint labels: for all a,b∈Na,b\in\mathbb Na,b∈N with a≠ba\ne ba=b, every morphism Va→VbV_a\to V_bVa​→Vb​ is zero.
  3. Fusion: for every a,b∈Na,b\in\mathbb Na,b∈N, let R(a,b)={c∈N:0≤c≤a+b, A(a,b,c)}R(a,b)=\{c\in\mathbb N:0\le c\le a+b,\ A(a,b,c)\}R(a,b)={c∈N:0≤c≤a+b, A(a,b,c)}. There exist families of morphisms, defined for all natural ccc, ic:Vc→Va⊗Vbi_c:V_c\to V_a\otimes V_bic​:Vc​→Va​⊗Vb​ and pc:Va⊗Vb→Vcp_c:V_a\otimes V_b\to V_cpc​:Va​⊗Vb​→Vc​, such that
ic;pc=1c(c∈R(a,b)),∑c∈R(a,b)pc;ic=1Va⊗Vb.i_c;p_c=1_c\quad(c\in R(a,b)),\qquad \sum_{c\in R(a,b)}p_c;i_c=1_{V_a\otimes V_b}.ic​;pc​=1c​(c∈R(a,b)),c∈R(a,b)∑​pc​;ic​=1Va​⊗Vb​​.

No condition on these families outside R(a,b)R(a,b)R(a,b) is included, nor is a chosen identification with the vertex maps assumed. 4. Loops: for every natural aaa, ua;ea=ι(Δ(a)) 11u_a;e_a=\iota(\Delta(a))\,1_{\mathbf1}ua​;ea​=ι(Δ(a))11​.

No braiding, symmetry, dagger, positivity, specified concrete representation category, or general pivotal-compatibility law is an additional hypothesis.

Vertices, their bends, and the precise tetrahedron

Choose for every natural triple a morphism wabc:Va⊗Vb⊗Vc→1w_{abc}:V_a\otimes V_b\otimes V_c\to\mathbf1wabc​:Va​⊗Vb​⊗Vc​→1. To specify all bends without suppressing their order, write 1a1_a1a​ for 1Va1_{V_a}1Va​​, 111 for an identity on the object determined by the surrounding expression, and f⋆gf\star gf⋆g for successive composition with only canonical monoidal associators and unitors inserted between the displayed morphisms. Multiple tensor factors retain their displayed order; no permutation or crossing is inserted.

For f:Va⊗Vb⊗Vc→1f:V_a\otimes V_b\otimes V_c\to\mathbf1f:Va​⊗Vb​⊗Vc​→1, its cyclic bend is

rot⁡(f)=1⋆(ua⊗1Vb⊗Vc⊗Va)⋆(1a⊗(f⊗1a))⋆ea.\operatorname{rot}(f)= 1\star(u_a\otimes1_{V_b\otimes V_c\otimes V_a}) \star\bigl(1_a\otimes(f\otimes1_a)\bigr)\star e_a.rot(f)=1⋆(ua​⊗1Vb​⊗Vc​⊗Va​​)⋆(1a​⊗(f⊗1a​))⋆ea​.

It is a morphism Vb⊗Vc⊗Va→1V_b\otimes V_c\otimes V_a\to\mathbf1Vb​⊗Vc​⊗Va​→1.

The all-up vertex, splitting map, and fusing map are defined, not independently chosen, by

wabc=uc⋆(1c⊗(ub⊗1c))⋆(1c⊗((1b⊗(ua⊗1b))⊗1c))⋆(wcba⊗1Va⊗Vb⊗Vc)⋆1,w^{abc}= u_c\star\bigl(1_c\otimes(u_b\otimes1_c)\bigr) \star\bigl(1_c\otimes((1_b\otimes(u_a\otimes1_b))\otimes1_c)\bigr) \star\bigl(w_{cba}\otimes1_{V_a\otimes V_b\otimes V_c}\bigr)\star1,wabc=uc​⋆(1c​⊗(ub​⊗1c​))⋆(1c​⊗((1b​⊗(ua​⊗1b​))⊗1c​))⋆(wcba​⊗1Va​⊗Vb​⊗Vc​​)⋆1, slab=1⋆(ua⊗1l)⋆(1a⊗((ub⊗1a)⊗1l))⋆(1a⊗1b⊗wbal)⋆1,s_l^{ab}= 1\star(u_a\otimes1_l) \star\bigl(1_a\otimes((u_b\otimes1_a)\otimes1_l)\bigr) \star(1_a\otimes1_b\otimes w_{bal})\star1,slab​=1⋆(ua​⊗1l​)⋆(1a​⊗((ub​⊗1a​)⊗1l​))⋆(1a​⊗1b​⊗wbal​)⋆1, fabl=1⋆(1Va⊗Vb⊗ul)⋆(wabl⊗1l)⋆1.f_{ab}^{l}= 1\star(1_{V_a\otimes V_b}\otimes u_l) \star(w_{abl}\otimes1_l)\star1.fabl​=1⋆(1Va​⊗Vb​​⊗ul​)⋆(wabl​⊗1l​)⋆1.

Their respective types are 1→Va⊗Vb⊗Vc\mathbf1\to V_a\otimes V_b\otimes V_c1→Va​⊗Vb​⊗Vc​, Vl→Va⊗VbV_l\to V_a\otimes V_bVl​→Va​⊗Vb​, and Va⊗Vb→VlV_a\otimes V_b\to V_lVa​⊗Vb​→Vl​. These formulas specify nested cups and the reversed vertex order in wabcw^{abc}wabc and slabs_l^{ab}slab​; they are linear categorical constructions, not complex conjugations.

For natural channels, define

X(a,b,c,d,r)=ur⋆(srab⊗srcd)⋆1,X(a,b,c,d,r)=u_r\star(s_r^{ab}\otimes s_r^{cd})\star1,X(a,b,c,d,r)=ur​⋆(srab​⊗srcd​)⋆1, Hcov(a,b,c,d,t)=1⋆(1a⊗(fbct⊗1d))⋆watd.H^{\mathrm{cov}}(a,b,c,d,t)= 1\star\bigl(1_a\otimes(f_{bc}^{t}\otimes1_d)\bigr)\star w_{atd}.Hcov(a,b,c,d,t)=1⋆(1a​⊗(fbct​⊗1d​))⋆watd​.

Their types are respectively 1→Va⊗Vb⊗Vc⊗Vd\mathbf1\to V_a\otimes V_b\otimes V_c\otimes V_d1→Va​⊗Vb​⊗Vc​⊗Vd​ and the reverse. For signed channels the graphical tetrahedron is exactly

T(a,b,c,d,j,l)={X(a,d,c,b,j);Hcov(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^{\mathrm{cov}}(a,d,c,b,l),&j\ge0\text{ and }l\ge0,\\ 0,&\text{otherwise}. \end{cases}T(a,b,c,d,j,l)={X(a,d,c,b,j);Hcov(a,d,c,b,l),0,​j≥0 and l≥0,otherwise.​

Only in the first branch are the nonnegative integers converted to natural channels. The boundary order is a,d,c,ba,d,c,ba,d,c,b, the channel in XXX is jjj, and the inner rung in the covector is lll. This is not a definition using Hj;XlcovH_j;X_l^{\mathrm{cov}}Hj​;Xlcov​, nor a definition of a tetrahedron by the recurrence. The definition has no separate admissibility guard for nonnegative channels.

Exactly two vertex-normalization conditions

For all natural a,b,ca,b,ca,b,c, assume

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

These are theta normalization and cyclicity, including inadmissible triples. There is no tetrahedral evaluation in this normalization package.

Separate tetrahedral seed data

Independently assume, for every natural a,b,c,d,ra,b,c,d,ra,b,c,d,r,

T(a,b,c,d,r,2)=ι(T(a,b,c,d,r,2)) 11.\mathcal T(a,b,c,d,r,2) =\iota\bigl(T(a,b,c,d,r,2)\bigr)\,1_{\mathbf1}.T(a,b,c,d,r,2)=ι(T(a,b,c,d,r,2))11​.

The scalar arguments are a,b,c,d,r,2a,b,c,d,r,2a,b,c,d,r,2, while the network's boundary presentation is a,d,c,ba,d,c,ba,d,c,b. This is an assumed last-slot-two evaluation, including zero values of the explicit sum on inadmissible labels. It is seed data used as an input to the assertion, not a conclusion or a consequence declared as part of vertex normalization. It does not separately assume penultimate-slot-two values or equality to the explicit sum at every inner channel.

Degenerate cases and meaning

All signed channels are included, with no boundary-index restrictions. A negative channel makes its graphical tetrahedron zero by definition. An inadmissible horizontal channel has zero scalar norm; every coefficient with that norm as denominator is zero by total field division. Adjacent entries require both horizontal channels to be admissible, and the diagonal at zero is separately set to zero. Thus no cancellation or division by a nonzero norm is tacitly required to interpret the equation.

The conclusion is a morphism-valued recurrence with independently specified scalar coefficients. No scalar-to-network bridge beyond the stated last-slot-two seed, no eigenvector equation, and no numerical matrix-entry evaluation is an extra assumption. Neither the scalar formulas nor the category assertion specialize qqq to a complex number; total division here is not a prescription for values at meromorphic poles. This testimony specifies the mathematical claim and its hypotheses, not a certification of a proof.

Preamble
import Definitions.Def_QuantumSixJRecurrences

universe v u
Formal statement
namespace QuantumSixJ

theorem network_recurrence : 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. Eqs. (23), (24), graphical-network recurrence.
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