Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Factorial-prefactor matching for the finite Tet sum

Proved
QuantumSixJ.sum_prefactor_match

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

Let a,b,c,d,j,la,b,c,d,j,la,b,c,d,j,l be integers satisfying horizontal and vertical admissibility, with j>0j>0j>0. Write RRR for the three-term residual of the normalized Appendix Tet sum, PPP for its Appendix factorial prefactor, Dj=[2][j][j+1][j+2]D_j=[2][j][j+1][j+2]Dj​=[2][j][j+1][j+2], and R\mathcal RR for the sum of cleared raw neighboring residuals defined by the certificate bundle. Then

R=PDj R.R=\frac{P}{D_j}\,\mathcal R.R=Dj​P​R.

This identity relates independently defined finite sums, including absent-neighbor cases; it does not assert that either residual vanishes.

Independent mathematical read-back

Read-back: QuantumSixJ.sum_prefactor_match

For every six integers a,b,c,d,j,la,b,c,d,j,la,b,c,d,j,l, assume that each of the four triples (a,d,j)(a,d,j)(a,d,j), (b,c,j)(b,c,j)(b,c,j), (a,b,l)(a,b,l)(a,b,l), (c,d,l)(c,d,l)(c,d,l) consists of nonnegative integers, satisfies all three triangle inequalities, and has even total, and additionally assume j>0j>0j>0. The theorem asserts the rational-function identity

m−Uj−2,l+(m0−E(a,b,l)Nj)Uj,l+m+Uj+2,l=Pj,l[2][j][j+1][j+2]∑S=0n−1R(S),m_-U_{j-2,l}+\big(m_0-E(a,b,l)N_j\big)U_{j,l}+m_+U_{j+2,l} =\frac{P_{j,l}}{[2][j][j+1][j+2]}\sum_{S=0}^{n-1}R(S),m−​Uj−2,l​+(m0​−E(a,b,l)Nj​)Uj,l​+m+​Uj+2,l​=[2][j][j+1][j+2]Pj,l​​S=0∑n−1​R(S),

with every quantity specified as follows within this paragraph. All scalars belong to K=Q(q)K=\mathbb Q(q)K=Q(q), where qqq is the image of the polynomial indeterminate, and [u]=(qu−q−u)/(q−q−1)[u]=(q^u-q^{-u})/(q-q^{-1})[u]=(qu−q−u)/(q−q−1) for every integer uuu; write F(u)=0F(u)=0F(u)=0 for u<0u<0u<0 and F(u)=∏v=1u[v]F(u)=\prod_{v=1}^{u}[v]F(u)=∏v=1u​[v] otherwise, so F(0)=1F(0)=1F(0)=1. All inverses and divisions are total field operations, with 0−1=00^{-1}=00−1=0 and x/0=0x/0=0x/0=0; integer powers are field powers, every label subtraction is integer subtraction, and every half-sum below uses Euclidean integer division by 222. Let T(u,v,w)T(u,v,w)T(u,v,w) denote exactly the nonnegativity, three triangle inequalities, and even-total condition just stated, and put Hr=T(a,d,r)∧T(b,c,r)H_r=T(a,d,r)\land T(b,c,r)Hr​=T(a,d,r)∧T(b,c,r) and Vs=T(a,b,s)∧T(c,d,s)V_s=T(a,b,s)\land T(c,d,s)Vs​=T(a,b,s)∧T(c,d,s). Define

δ(r)={(−1)r[r+1]r≥0,0r<0,ϑ(u,v,w)={(−1)zF(z+1)F(z−u)F(z−v)F(z−w)F(u)F(v)F(w), z=(u+v+w)/2T(u,v,w),0otherwise,\delta(r)=\begin{cases}(-1)^r[r+1]&r\geq0,\\0&r<0,\end{cases}\qquad \vartheta(u,v,w)=\begin{cases} \displaystyle\frac{(-1)^zF(z+1)F(z-u)F(z-v)F(z-w)}{F(u)F(v)F(w)},\ z=(u+v+w)/2&T(u,v,w),\\0&\text{otherwise}, \end{cases}δ(r)={(−1)r[r+1]0​r≥0,r<0,​ϑ(u,v,w)=⎩⎨⎧​F(u)F(v)F(w)(−1)zF(z+1)F(z−u)F(z−v)F(z−w)​, z=(u+v+w)/20​T(u,v,w),otherwise,​ Nr={ϑ(a,d,r)ϑ(b,c,r)/δ(r)Hr,0otherwise,E(u,v,w)={[(u−v+w)/2][(−u+v+w)/2]−[(u+v−w)/2][(u+v+w)/2+2][2]T(u,v,w),0otherwise.N_r=\begin{cases}\vartheta(a,d,r)\vartheta(b,c,r)/\delta(r)&H_r,\\0&\text{otherwise},\end{cases}\qquad E(u,v,w)=\begin{cases} \displaystyle\frac{[(u-v+w)/2][(-u+v+w)/2]-[(u+v-w)/2][(u+v+w)/2+2]}{[2]}&T(u,v,w),\\0&\text{otherwise}. \end{cases}Nr​={ϑ(a,d,r)ϑ(b,c,r)/δ(r)0​Hr​,otherwise,​E(u,v,w)=⎩⎨⎧​[2][(u−v+w)/2][(−u+v+w)/2]−[(u+v−w)/2][(u+v+w)/2+2]​0​T(u,v,w),otherwise.​

The three coefficients on the left are exactly

m−={Nj[(a+d−j+2)/2][(b+c−j+2)/2]Hj∧Hj−2,0otherwise,m0={−Nj[2]E(a,j,d)E(b,j,c)/([j][j+2])Hj∧j≠0,0otherwise,m+={Nj+2[(a+d−j)/2][(b+c−j)/2]Hj∧Hj+2,0otherwise.\begin{aligned} m_-&=\begin{cases}N_j[(a+d-j+2)/2][(b+c-j+2)/2]&H_j\land H_{j-2},\\0&\text{otherwise},\end{cases}\\ m_0&=\begin{cases}-N_j[2]E(a,j,d)E(b,j,c)/([j][j+2])&H_j\land j\ne0,\\0&\text{otherwise},\end{cases}\\ m_+&=\begin{cases}N_{j+2}[(a+d-j)/2][(b+c-j)/2]&H_j\land H_{j+2},\\0&\text{otherwise}.\end{cases} \end{aligned}m−​m0​m+​​={Nj​[(a+d−j+2)/2][(b+c−j+2)/2]0​Hj​∧Hj−2​,otherwise,​={−Nj​[2]E(a,j,d)E(b,j,c)/([j][j+2])0​Hj​∧j=0,otherwise,​={Nj+2​[(a+d−j)/2][(b+c−j)/2]0​Hj​∧Hj+2​,otherwise.​​

For arbitrary integer channels r,sr,sr,s, use zero-based lists

αr,s=((a+d+r)/2,(b+c+r)/2,(a+b+s)/2,(c+d+s)/2),βr,s=((b+d+r+s)/2,(a+c+r+s)/2,(a+b+c+d)/2),\alpha^{r,s}=\big((a+d+r)/2,(b+c+r)/2,(a+b+s)/2,(c+d+s)/2\big),\qquad \beta^{r,s}=\big((b+d+r+s)/2,(a+c+r+s)/2,(a+b+c+d)/2\big),αr,s=((a+d+r)/2,(b+c+r)/2,(a+b+s)/2,(c+d+s)/2),βr,s=((b+d+r+s)/2,(a+c+r+s)/2,(a+b+c+d)/2),

and set

Pr,s=∏i=03∏k=02F(βkr,s−αir,s)F(a)F(b)F(c)F(d)F(r)F(s),Ur,s=1Nr{Pr,s∑z=0a+b+c+d+r+s(−1)zF(z+1)(∏i=03F(z−αir,s))(∏k=02F(βkr,s−z))Hr∧Vs,0otherwise.P_{r,s}=\frac{\prod_{i=0}^{3}\prod_{k=0}^{2}F(\beta_k^{r,s}-\alpha_i^{r,s})}{F(a)F(b)F(c)F(d)F(r)F(s)},\qquad U_{r,s}=\frac{1}{N_r}\begin{cases} \displaystyle P_{r,s}\sum_{z=0}^{a+b+c+d+r+s} \frac{(-1)^zF(z+1)}{\big(\prod_{i=0}^{3}F(z-\alpha_i^{r,s})\big)\big(\prod_{k=0}^{2}F(\beta_k^{r,s}-z)\big)}&H_r\land V_s,\\0&\text{otherwise}. \end{cases}Pr,s​=F(a)F(b)F(c)F(d)F(r)F(s)∏i=03​∏k=02​F(βkr,s​−αir,s​)​,Ur,s​=Nr​1​⎩⎨⎧​Pr,s​z=0∑a+b+c+d+r+s​(∏i=03​F(z−αir,s​))(∏k=02​F(βkr,s​−z))(−1)zF(z+1)​0​Hr​∧Vs​,otherwise.​

An integer-indexed sum with upper endpoint below 000 is empty and equals zero. For the right side of the asserted identity set

A=(a+d+j)/2,B=(b+c+j)/2,C=(a+b+l)/2,E=(b+d+j+l)/2,F=(a+c+j+l)/2,A=(a+d+j)/2,\quad B=(b+c+j)/2,\quad C=(a+b+l)/2,\quad E=(b+d+j+l)/2,\quad F=(a+c+j+l)/2,A=(a+d+j)/2,B=(b+c+j)/2,C=(a+b+l)/2,E=(b+d+j+l)/2,F=(a+c+j+l)/2, D=E+F−C−j,G=A+B−j,n=max⁡(a+b+c+d+j+l,0)+3.D=E+F-C-j,\qquad G=A+B-j,\qquad n=\max(a+b+c+d+j+l,0)+3.D=E+F−C−j,G=A+B−j,n=max(a+b+c+d+j+l,0)+3.

Here the bare symbol FFF is an integer parameter and F(⋅)F(\cdot)F(⋅) continues to mean the signed-index factorial; the maximum is converted to a natural number before adding 333. Set

p−=[A−j+1][B−j+1][A+1][B+1][2][j+2],p0=−(([A−j][E−C]−[F−D][A+2])([B−j][F−C]−[E−D][B+2])+([F−B][E−A]−[G−D][C+2])[j][j+2])[j+1],p+=[E−C+1][F−D+1][F−C+1][E−D+1][2][j],\begin{aligned} p_-&=[A-j+1][B-j+1][A+1][B+1][2][j+2],\\ p_0&=-\Big(([A-j][E-C]-[F-D][A+2])([B-j][F-C]-[E-D][B+2])\\ &\hspace{18mm}+([F-B][E-A]-[G-D][C+2])[j][j+2]\Big)[j+1],\\ p_+&=[E-C+1][F-D+1][F-C+1][E-D+1][2][j], \end{aligned}p−​p0​p+​​=[A−j+1][B−j+1][A+1][B+1][2][j+2],=−(([A−j][E−C]−[F−D][A+2])([B−j][F−C]−[E−D][B+2])+([F−B][E−A]−[G−D][C+2])[j][j+2])[j+1],=[E−C+1][F−D+1][F−C+1][E−D+1][2][j],​

and define the summand on the right by the fully specified three-term expression

R(S)=p−(−1)SF(S+1)F(S−A+1)F(S−B+1)F(S−C)F(S−D)F(E−1−S)F(F−1−S)F(G−S)+p0(−1)SF(S+1)F(S−A)F(S−B)F(S−C)F(S−D)F(E−S)F(F−S)F(G−S)+p+(−1)SF(S+1)F(S−A−1)F(S−B−1)F(S−C)F(S−D)F(E+1−S)F(F+1−S)F(G−S).\begin{aligned} R(S)={}&p_-\frac{(-1)^S F(S+1)}{F(S-A+1)F(S-B+1)F(S-C)F(S-D)F(E-1-S)F(F-1-S)F(G-S)}\\ &+p_0\frac{(-1)^S F(S+1)}{F(S-A)F(S-B)F(S-C)F(S-D)F(E-S)F(F-S)F(G-S)}\\ &+p_+\frac{(-1)^S F(S+1)}{F(S-A-1)F(S-B-1)F(S-C)F(S-D)F(E+1-S)F(F+1-S)F(G-S)}. \end{aligned}R(S)=​p−​F(S−A+1)F(S−B+1)F(S−C)F(S−D)F(E−1−S)F(F−1−S)F(G−S)(−1)SF(S+1)​+p0​F(S−A)F(S−B)F(S−C)F(S−D)F(E−S)F(F−S)F(G−S)(−1)SF(S+1)​+p+​F(S−A−1)F(S−B−1)F(S−C)F(S−D)F(E+1−S)F(F+1−S)F(G−S)(−1)SF(S+1)​.​

The sum over SSS consists of the natural numbers 0,…,n−10,\ldots,n-10,…,n−1 cast to integers; the stated hypotheses imply that the total defining nnn is positive, but the underlying length expression truncates a negative total to zero before adding 333. There is no hypothesis that j−2j-2j−2 or j+2j+2j+2 is admissible, that either neighbor exists, or that any of the displayed summands or their denominator factorials are nonzero. In particular j=1j=1j=1 is included, with negative lower channel and hence m−=Uj−2,l=0m_-=U_{j-2,l}=0m−​=Uj−2,l​=0; inadmissible upper or lower channels use the displayed zero branches. The assumption j>0j>0j>0 excludes j=0j=0j=0, but permits the external labels or lll to be zero whenever the four triple conditions hold. No complex specialization, numerical parameter, typeclass assumption, or additional existentially chosen object is part of the statement.

Preamble
import Definitions.Def_QuantumSixJSumCertificate

open scoped BigOperators QuantumSixJ
open QuantumSixJ.Certificate
Formal statement
namespace QuantumSixJ

theorem sum_prefactor_match (a b c d j l : ℤ)
    (hj : hAdmissible a b c d j) (hl : vAdmissible a b c d l) (hpos : 0 < j) :
    mainResidual a b c d j l =
      (prefactor a b c d j l / clearingFactor j) * totalResidual a b c d j l
 := by sorry

end QuantumSixJ
Source
I. Khavkine, Recurrence relation for the 6j-symbol of su_q(2) as a symmetric eigenvalue problem, https://arxiv.org/abs/1009.2261, Appendix finite Tet formula and Eq. (24); auxiliary factorial-shift and telescoping-certificate calculation for those formulas.

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