Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (15), (17) — one- and two-term Tet evaluations

Proved
QuantumSixJ.tet_two_evaluations

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

quantum-groupsrecurrence-relations

For the family Tet⁡sum(u,u,r,s;k,2)\operatorname{Tet}^{\mathrm{sum}}(u,u,r,s;k,2)Tetsum(u,u,r,s;k,2), establish exact one-/two-term reductions of the raw Appendix sum, the resulting factorial-canceled values, and invalid-channel vanishing. The sum retains the Appendix prefactor when reconstructed as the full Tet.

  1. If u,v>0u,v>0u,v>0 and (u,v,k)(u,v,k)(u,v,k) is admissible, put m=(u+v+k)/2m=(u+v+k)/2m=(u+v+k)/2. The raw summand for Tet⁡sum(u,u,v,v;k,2)\operatorname{Tet}^{\mathrm{sum}}(u,u,v,v;k,2)Tetsum(u,u,v,v;k,2) can be nonzero only at m,m+1m,m+1m,m+1, and its full coarse sum equals the sum of those two candidate terms. A candidate term may vanish at a boundary. The full Tet satisfies
[u][v]Tet⁡sum(u,u,v,v;k,2)=θ(u,v,k)Λ(u,v,k).[u][v]\operatorname{Tet}^{\mathrm{sum}}(u,u,v,v;k,2)=\theta(u,v,k)\Lambda(u,v,k).[u][v]Tetsum(u,u,v,v;k,2)=θ(u,v,k)Λ(u,v,k).
  1. If u>0u>0u>0, (u,r,k)(u,r,k)(u,r,k) and (u,s,k)(u,s,k)(u,s,k) are admissible, and r=s+2r=s+2r=s+2 or s=r+2s=r+2s=r+2, put m=(u+min⁡(r,s)+k)/2m=(u+\min(r,s)+k)/2m=(u+min(r,s)+k)/2. The raw summand can be nonzero only at m+1m+1m+1, and its full coarse sum is that single term. In both orientations,
[u]Tet⁡sum(u,u,r,s;k,2)=[(u+k−min⁡(r,s))/2] θ(max⁡(r,s),u,k).[u]\operatorname{Tet}^{\mathrm{sum}}(u,u,r,s;k,2)=[(u+k-\min(r,s))/2]\,\theta(\max(r,s),u,k).[u]Tetsum(u,u,r,s;k,2)=[(u+k−min(r,s))/2]θ(max(r,s),u,k).
  1. For arbitrary integer u,r,s,ku,r,s,ku,r,s,k, the Tet is zero if any of (u,u,2)(u,u,2)(u,u,2), (r,s,2)(r,s,2)(r,s,2), (u,r,k)(u,r,k)(u,r,k) or (u,s,k)(u,s,k)(u,s,k) is inadmissible.

The coarse upper endpoints are respectively 2u+2v+k+22u+2v+k+22u+2v+k+2 and 2u+r+s+k+22u+r+s+k+22u+r+s+k+2. These statements cover the patterns (a,a,b,b;l,2)(a,a,b,b;l,2)(a,a,b,b;l,2), (a,a,j′,j;d,2)(a,a,j',j;d,2)(a,a,j′,j;d,2) and (b,b,j′,j;c,2)(b,b,j',j;c,2)(b,b,j′,j;c,2) used in the rung and matrix calculations. There is no categorical seed assumption in this scalar theorem.

Independent mathematical read-back

Two special tetrahedral evaluations

All labels and summation indices are integers. Work in Q(q)\mathbb Q(q)Q(q), with qqq indeterminate, and write

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

The empty product is one, and division by zero in this field is assigned zero. Thus a negative factorial argument in a denominator kills that term. No numerical specialization of qqq is asserted.

A triple is admissible if its entries are nonnegative integers satisfying all three triangle inequalities and having even sum. For an admissible triple define, with s=(a+b+c)/2s=(a+b+c)/2s=(a+b+c)/2,

θ(a,b,c)=(−1)s[s+1]![s−a]![s−b]![s−c]![a]![b]![c]!,Λ(a,b,c)=[(a−b+c)/2][(−a+b+c)/2]−[(a+b−c)/2][(a+b+c)/2+2][2].\theta(a,b,c)=(-1)^s\frac{[s+1]![s-a]![s-b]![s-c]!}{[a]![b]![c]!}, \quad \Lambda(a,b,c)=\frac{[(a-b+c)/2][(-a+b+c)/2]-[(a+b-c)/2][(a+b+c)/2+2]}{[2]}.θ(a,b,c)=(−1)s[a]![b]![c]![s+1]![s−a]![s−b]![s−c]!​,Λ(a,b,c)=[2][(a−b+c)/2][(−a+b+c)/2]−[(a+b−c)/2][(a+b+c)/2+2]​.

Both functions are zero on inadmissible triples. Integer divisions mean integer division; the admissibility hypotheses make all half-sums used in the evaluations integral.

For six labels let

A=(a+d+j2,b+c+j2,a+b+l2,c+d+l2),B=(b+d+j+l2,a+c+j+l2,a+b+c+d2),A=\left(\frac{a+d+j}{2},\frac{b+c+j}{2},\frac{a+b+l}{2},\frac{c+d+l}{2}\right),\quad B=\left(\frac{b+d+j+l}{2},\frac{a+c+j+l}{2},\frac{a+b+c+d}{2}\right),A=(2a+d+j​,2b+c+j​,2a+b+l​,2c+d+l​),B=(2b+d+j+l​,2a+c+j+l​,2a+b+c+d​), Fabcdjl(z)=(−1)z[z+1]!∏i=03[z−Ai]!∏t=02[Bt−z]!,Pabcdjl=∏i=03∏t=02[Bt−Ai]![a]![b]![c]![d]![j]![l]!.F_{abcdjl}(z)=\frac{(-1)^z[z+1]!}{\prod_{i=0}^3[z-A_i]!\prod_{t=0}^2[B_t-z]!},\qquad P_{abcdjl}=\frac{\prod_{i=0}^3\prod_{t=0}^2[B_t-A_i]!}{[a]![b]![c]![d]![j]![l]!}.Fabcdjl​(z)=∏i=03​[z−Ai​]!∏t=02​[Bt​−z]!(−1)z[z+1]!​,Pabcdjl​=[a]![b]![c]![d]![j]![l]!∏i=03​∏t=02​[Bt​−Ai​]!​.

The full tetrahedral scalar is

T(a,b,c,d,j,l)=Pabcdjl∑z=0a+b+c+d+j+lFabcdjl(z)T(a,b,c,d,j,l)=P_{abcdjl}\sum_{z=0}^{a+b+c+d+j+l}F_{abcdjl}(z)T(a,b,c,d,j,l)=Pabcdjl​z=0∑a+b+c+d+j+l​Fabcdjl​(z)

when all four triples (a,d,j),(b,c,j),(a,b,l),(c,d,l)(a,d,j),(b,c,j),(a,b,l),(c,d,l)(a,d,j),(b,c,j),(a,b,l),(c,d,l) are admissible, and is zero otherwise. Sums are over inclusive integer intervals; an interval with upper endpoint below zero is empty. The raw sum and the full scalar, which includes PPP, must be distinguished.

The assertion has five conjuncts.

1. Diagonal raw-sum reduction

For every u,v,k∈Zu,v,k\in\mathbb Zu,v,k∈Z, assume u>0u>0u>0, v>0v>0v>0, and (u,v,k)(u,v,k)(u,v,k) admissible, and set m=(u+v+k)/2m=(u+v+k)/2m=(u+v+k)/2. For every integer zzz,

Fuuvvk2(z)≠0 ⟹ z=m or z=m+1.F_{uuvvk2}(z)\ne0\ \Longrightarrow\ z=m\text{ or }z=m+1.Fuuvvk2​(z)=0 ⟹ z=m or z=m+1.

Moreover,

∑z=02u+2v+k+2Fuuvvk2(z)=Fuuvvk2(m)+Fuuvvk2(m+1).\sum_{z=0}^{2u+2v+k+2}F_{uuvvk2}(z)=F_{uuvvk2}(m)+F_{uuvvk2}(m+1).z=0∑2u+2v+k+2​Fuuvvk2​(z)=Fuuvvk2​(m)+Fuuvvk2​(m+1).

This reduces the raw sum, not the full TTT. The two indices are candidates: the statement does not assert that both terms are nonzero. Substitution gives A=(m,m,u+1,v+1)A=(m,m,u+1,v+1)A=(m,m,u+1,v+1), B=(m+1,m+1,u+v)B=(m+1,m+1,u+v)B=(m+1,m+1,u+v), and the individual candidate terms are

Fuuvvk2(m)=(−1)m[m+1]![m−u−1]![m−v−1]![u+v−m]!,F_{uuvvk2}(m)=\frac{(-1)^m[m+1]!}{[m-u-1]![m-v-1]![u+v-m]!},Fuuvvk2​(m)=[m−u−1]![m−v−1]![u+v−m]!(−1)m[m+1]!​, Fuuvvk2(m+1)=(−1)m+1[m+2]![m−u]![m−v]![u+v−m−1]!.F_{uuvvk2}(m+1)=\frac{(-1)^{m+1}[m+2]!}{[m-u]![m-v]![u+v-m-1]!}.Fuuvvk2​(m+1)=[m−u]![m−v]![u+v−m−1]!(−1)m+1[m+2]!​.

The same negative-factorial and total-division conventions apply to these expressions, including triangle-equality boundaries.

2. Adjacent raw-sum reduction

For every u,r,s,k∈Zu,r,s,k\in\mathbb Zu,r,s,k∈Z, assume u>0u>0u>0, (u,r,k)(u,r,k)(u,r,k) and (u,s,k)(u,s,k)(u,s,k) admissible, and either r=s+2r=s+2r=s+2 or s=r+2s=r+2s=r+2. Put t=min⁡(r,s)t=\min(r,s)t=min(r,s) and m=(u+t+k)/2m=(u+t+k)/2m=(u+t+k)/2. For every integer zzz,

Fuursk2(z)≠0 ⟹ z=m+1,F_{uursk2}(z)\ne0\ \Longrightarrow\ z=m+1,Fuursk2​(z)=0 ⟹ z=m+1,

and

∑z=02u+r+s+k+2Fuursk2(z)=Fuursk2(m+1).\sum_{z=0}^{2u+r+s+k+2}F_{uursk2}(z)=F_{uursk2}(m+1).z=0∑2u+r+s+k+2​Fuursk2​(z)=Fuursk2​(m+1).

Again this is a statement about the raw sum. Up to ordering, A=(m,m+1,u+1,t+2)A=(m,m+1,u+1,t+2)A=(m,m+1,u+1,t+2) and B=(m+1,m+2,u+t+1)B=(m+1,m+2,u+t+1)B=(m+1,m+2,u+t+1). Consequently the candidate term is

Fuursk2(m+1)=(−1)m+1[m+2]![m−u]![m−t−1]![u+t−m]!.F_{uursk2}(m+1)=\frac{(-1)^{m+1}[m+2]!}{[m-u]![m-t-1]![u+t-m]!}.Fuursk2​(m+1)=[m−u]![m−t−1]![u+t−m]!(−1)m+1[m+2]!​.

The hypotheses do not require r>0r>0r>0 or s>0s>0s>0 separately; their nonnegativity follows from admissibility.

3. Diagonal full-scalar evaluation

For every integer u,v,ku,v,ku,v,k under exactly the hypotheses in part 1,

[u][v]T(u,u,v,v,k,2)=θ(u,v,k)Λ(u,v,k).[u][v]T(u,u,v,v,k,2)=\theta(u,v,k)\Lambda(u,v,k).[u][v]T(u,u,v,v,k,2)=θ(u,v,k)Λ(u,v,k).

Thus the factorial-canceled full scalar is

T(u,u,v,v,k,2)=θ(u,v,k)[u][v][2]([(u−v+k)/2][(−u+v+k)/2]−[(u+v−k)/2][(u+v+k)/2+2]).T(u,u,v,v,k,2)=\frac{\theta(u,v,k)}{[u][v][2]} \left([(u-v+k)/2][(-u+v+k)/2]-[(u+v-k)/2][(u+v+k)/2+2]\right).T(u,u,v,v,k,2)=[u][v][2]θ(u,v,k)​([(u−v+k)/2][(−u+v+k)/2]−[(u+v−k)/2][(u+v+k)/2+2]).

Here [u][u][u] and [v][v][v] are nonzero for positive u,vu,vu,v. This is not an evaluation of the raw sum without its prefactor, and the expression can vanish through cancellation even when the triples are admissible.

4. Adjacent full-scalar evaluation

For every integer u,r,s,ku,r,s,ku,r,s,k under exactly the hypotheses in part 2,

[u]T(u,u,r,s,k,2)=[(u+k−min⁡(r,s))/2] θ(max⁡(r,s),u,k).[u]T(u,u,r,s,k,2)=[(u+k-\min(r,s))/2]\,\theta(\max(r,s),u,k).[u]T(u,u,r,s,k,2)=[(u+k−min(r,s))/2]θ(max(r,s),u,k).

Equivalently, the factorial-canceled full scalar is the right-hand side divided by [u][u][u]. The larger of r,sr,sr,s, not the smaller, is the first theta argument; the bracket uses the smaller. Both orientations of the adjacent pair are included.

5. Inadmissible zero cases

For every u,r,s,k∈Zu,r,s,k\in\mathbb Zu,r,s,k∈Z, without positivity assumptions, if at least one of

(u,u,2),(r,s,2),(u,r,k),(u,s,k)(u,u,2),\quad(r,s,2),\quad(u,r,k),\quad(u,s,k)(u,u,2),(r,s,2),(u,r,k),(u,s,k)

is inadmissible, then T(u,u,r,s,k,2)=0T(u,u,r,s,k,2)=0T(u,u,r,s,k,2)=0. This is a statement about the full scalar, not a claim that every raw summand vanishes for arbitrary inadmissible labels. In particular it covers u≤0u\le0u≤0, negative labels, triangle or parity failures, and pairs r,sr,sr,s that fail the triple condition with 2. It does not assert that every admissible case is nonzero, nor supply a full-scalar evaluation for the other admissible label patterns not covered by parts 3 and 4.

Preamble
import Definitions.Def_QuantumSixJScalar

open scoped BigOperators QuantumSixJ
Formal statement
namespace QuantumSixJ

theorem tet_two_evaluations :
    (∀ u v k : ℤ, 0 < u → 0 < v → Admissible u v k →
      let m := (u + v + k) / 2
      (∀ z : ℤ, tetSummand u u v v k 2 z ≠ 0 → z = m ∨ z = m + 1) ∧
      (∑ z ∈ Finset.Icc 0 (2 * u + 2 * v + k + 2), tetSummand u u v v k 2 z) =
        tetSummand u u v v k 2 m + tetSummand u u v v k 2 (m + 1)) ∧
    (∀ u r s k : ℤ, 0 < u → Admissible u r k → Admissible u s k →
      (r = s + 2 ∨ s = r + 2) →
      let m := (u + min r s + k) / 2
      (∀ z : ℤ, tetSummand u u r s k 2 z ≠ 0 → z = m + 1) ∧
      (∑ z ∈ Finset.Icc 0 (2 * u + r + s + k + 2), tetSummand u u r s k 2 z) =
        tetSummand u u r s k 2 (m + 1)) ∧
    (∀ u v k : ℤ, 0 < u → 0 < v → Admissible u v k →
      ⟬u⟭ * ⟬v⟭ * tetSum u u v v k 2 = θ u v k * Λ u v k) ∧
    (∀ u r s k : ℤ, 0 < u → Admissible u r k → Admissible u s k →
      (r = s + 2 ∨ s = r + 2) →
      ⟬u⟭ * tetSum u u r s k 2 = ⟬(u + k - min r s) / 2⟭ * θ (max r s) u k) ∧
    (∀ u r s k : ℤ,
      (¬ Admissible u u 2 ∨ ¬ Admissible r s 2 ∨
        ¬ Admissible u r k ∨ ¬ Admissible u s k) → tetSum u u r s k 2 = 0) := 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. (15), (17), special last-slot-2 Tet values, derived from the Appendix finite sum.
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