by igor.kh · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)
quantum-groupsrecurrence-relations
Prove QuantumSixJ.SumRecurrence. For every six integer labels a,b,c,d,j,l, the explicit Appendix sum, normalized as Ujl=Tetsum(a,b,c,d;j,l)/hj, satisfies equation (24):
All coefficients are the explicit rational functions over Q(q), with their zero extensions. There are no additional admissibility, bound, nonvanishing or categorical hypotheses. Division by zero has the specified total-field value zero; no complex specialization is asserted.
Independent mathematical read-back
Explicit tetrahedral-sum recurrence
Statement
Work in the rational-function field F=Q(q), where q is an indeterminate. For every six integers a,b,c,d,j,l, the assertion is
Here the four external labels a,b,c,d are held fixed in
Lr,s=L(a,b,c,d,r,s), hr=h(a,b,c,d,r), and
Ur,l=T(a,b,c,d,r,l)/hr. Everything in this equation is defined explicitly below. There are no hypotheses of admissibility, nonnegativity, nonzero norms, category axioms, vertex normalization, or seed values. In particular, the quantifiers include negative external labels and negative channels.
Quantum arithmetic and admissibility
For an integer n, set
[n]=q−q−1qn−q−n,[n]!={0∏k=1n[k]n<0,n≥0.
The empty product is one, so [0]!=1. Exponents on nonzero field elements are integer powers. Every quotient is field division, with 0−1=0; in particular z/0=0, including 0/0=0.
Write A(a,b,c) for the conjunction
a,b,c≥0,a≤b+c,b≤c+a,c≤a+b,a+b+c≡0(mod2).
Horizontal admissibility is A(a,d,j)∧A(b,c,j); vertical admissibility is A(a,b,l)∧A(c,d,l).
All integer divisions by 2 in what follows are Euclidean integer division (floor division for this positive divisor), not rational division. Under the relevant admissibility conditions, the half-sums are integers without rounding.
All remaining entries are zero. This defines a symmetric matrix, with step-two off-diagonals; it is tridiagonal on each fixed-parity lattice. The larger channel supplies the norm in an adjacent entry. Explicitly,
Lj,j−2=hj[(a+d−j+2)div2][(b+c−j+2)div2]
when both channels j−2,j are horizontally admissible, and zero otherwise; and
Lj,j+2=hj+2[(a+d−j)div2][(b+c−j)div2]
when both channels j,j+2 are horizontally admissible, and zero otherwise. The special value L0,0=0 is imposed by a branch, not by canceling a factor [0].
The explicit finite tetrahedral sum
For any six integer labels define four integers Ai and three integers Bk:
Otherwise set T=0. The sum is over integers in the indicated inclusive finite interval; it is empty if its upper bound is negative. There is no additional summand-support guard and no replacement of the bounds by extrema of the Ai,Bk. A negative factorial argument yields zero; a zero denominator therefore makes that summand zero by total field division.
Finally Uj,l=T(a,b,c,d,j,l)/hj, without a separate guard or nonvanishing witness. Thus a zero norm gives Uj,l=0, even if one views its defining quotient as 0/0. Absent neighbors remain in the displayed equation with their zero-extended coefficients and normalized sums; there are no extra boundary-index assumptions.
Scope
This is a rational-function identity at an indeterminate q, not a statement about evaluating at q=1, roots of unity, or arbitrary complex numbers. Total division is the discrete zero-extension convention here; it is not an assertion that a meromorphic function has value zero at a pole. No universe-polymorphic category is quantified in this scalar assertion. The testimony above specifies the mathematical claim, not a certification of its proof.
Preamble
import Definitions.Def_QuantumSixJRecurrences
universe v u
Formal statement
namespace QuantumSixJ
theorem sum_recurrence : SumRecurrence := 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), applied to the Appendix finite-sum Tet.
Confirmed by the moderator at approval.