Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix — scalar foundations and support identities

Proved
QuantumSixJ.scalar_foundations

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

quantum-groupsrecurrence-relations

Over Q(q)\mathbb Q(q)Q(q), with qqq an indeterminate, establish the scalar foundations for the Appendix formulas. The nonzero quantities are qqq, q−q−1q-q^{-1}q−q−1, [n][n][n] for every nonzero integer nnn, [n]![n]![n]! for every nonnegative integer nnn, Δj\Delta_jΔj​ for j≥0j\ge0j≥0, θ(a,b,c)\theta(a,b,c)θ(a,b,c) on admissible triples, and the norms hj,xlh_j,x_lhj​,xl​ on their respective admissible channels.

Under both horizontal and vertical admissibility, let Ai,BkA_i,B_kAi​,Bk​ be the Appendix half-sums, m=max⁡iAim=\max_i A_im=maxi​Ai​, and M=min⁡kBkM=\min_k B_kM=mink​Bk​. For every integer summation index SSS, the raw factorial summand is nonzero exactly when m≤S≤Mm\le S\le Mm≤S≤M, and

0≤m≤M≤a+b+c+d+j+l.0\le m\le M\le a+b+c+d+j+l.0≤m≤M≤a+b+c+d+j+l.

Thus its effective Appendix support lies inside the coarse defining finite interval.

In addition, the explicitly defined two-index matrix satisfies Ljk=LkjL_{jk}=L_{kj}Ljk​=Lkj​, is zero unless k∈{j−2,j,j+2}k\in\{j-2,j,j+2\}k∈{j−2,j,j+2}, and has L00=0L_{00}=0L00​=0, for all integer labels, including zero-extended cases. No recurrence or categorical assumptions occur in this statement.

Independent mathematical read-back

Scalar foundations

All labels below are integers. Scalars belong to the rational-function field Q(q)\mathbb Q(q)Q(q), with qqq an indeterminate. Write

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

In particular, [0]!=1[0]!=1[0]!=1. Integer powers, including negative powers, are interpreted in this field. Division is total: division by zero is zero. These conventions concern rational functions and integer labels, not specialization of qqq at numerical poles.

A triple (a,b,c)(a,b,c)(a,b,c) is admissible precisely 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. Put

H(a,b,c,d;j)  ⟺  (a,d,j),(b,c,j) are admissible,H(a,b,c,d;j)\iff(a,d,j),(b,c,j)\text{ are admissible},H(a,b,c,d;j)⟺(a,d,j),(b,c,j) are admissible, V(a,b,c,d;l)  ⟺  (a,b,l),(c,d,l) are admissible.V(a,b,c,d;l)\iff(a,b,l),(c,d,l)\text{ are admissible}.V(a,b,c,d;l)⟺(a,b,l),(c,d,l) are admissible.

Define Δj=(−1)j[j+1]\Delta_j=(-1)^j[j+1]Δj​=(−1)j[j+1] for j≥0j\ge0j≥0, and zero otherwise. For an admissible triple, with s=(a+b+c)/2s=(a+b+c)/2s=(a+b+c)/2, define

θ(a,b,c)=(−1)s[s+1]![s−a]![s−b]![s−c]![a]![b]![c]!;\theta(a,b,c)=(-1)^s\frac{[s+1]![s-a]![s-b]![s-c]!}{[a]![b]![c]!};θ(a,b,c)=(−1)s[a]![b]![c]![s+1]![s−a]![s−b]![s−c]!​;

set θ=0\theta=0θ=0 for an inadmissible triple. The norms are

h(a,b,c,d;j)=θ(a,d,j)θ(b,c,j)Δjwhen H(a,b,c,d;j),h(a,b,c,d;j)=\frac{\theta(a,d,j)\theta(b,c,j)}{\Delta_j} \quad\text{when }H(a,b,c,d;j),h(a,b,c,d;j)=Δj​θ(a,d,j)θ(b,c,j)​when H(a,b,c,d;j), x(a,b,c,d;l)=θ(a,b,l)θ(c,d,l)Δlwhen V(a,b,c,d;l),x(a,b,c,d;l)=\frac{\theta(a,b,l)\theta(c,d,l)}{\Delta_l} \quad\text{when }V(a,b,c,d;l),x(a,b,c,d;l)=Δl​θ(a,b,l)θ(c,d,l)​when V(a,b,c,d;l),

and zero outside their respective admissible domains.

For six labels define the four entries of AAA and the three entries of BBB, in order, by

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),\qquad 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​).

All divisions producing integer labels mean integer division; on the admissible domain the displayed half-sums are integral. The raw summand is

Fabcdjl(S)=(−1)S[S+1]!∏i=03[S−Ai]!∏t=02[Bt−S]!.F_{abcdjl}(S)=\frac{(-1)^S[S+1]!}{\prod_{i=0}^3[S-A_i]!\prod_{t=0}^2[B_t-S]!}.Fabcdjl​(S)=∏i=03​[S−Ai​]!∏t=02​[Bt​−S]!(−1)S[S+1]!​.

There is no separate support guard in this expression: a negative denominator-factorial argument makes the denominator zero and hence the quotient zero.

The scalar-foundations assertion is the conjunction of the following thirteen clauses:

  1. q≠0q\ne0q=0.
  2. q−q−1≠0q-q^{-1}\ne0q−q−1=0.
  3. For every integer n≠0n\ne0n=0, [n]≠0[n]\ne0[n]=0.
  4. For every integer n≥0n\ge0n≥0, [n]!≠0[n]!\ne0[n]!=0.
  5. For every integer j≥0j\ge0j≥0, Δj≠0\Delta_j\ne0Δj​=0.
  6. For every admissible integer triple (a,b,c)(a,b,c)(a,b,c), θ(a,b,c)≠0\theta(a,b,c)\ne0θ(a,b,c)=0.
  7. For every five integers a,b,c,d,ja,b,c,d,ja,b,c,d,j satisfying H(a,b,c,d;j)H(a,b,c,d;j)H(a,b,c,d;j), h(a,b,c,d;j)≠0h(a,b,c,d;j)\ne0h(a,b,c,d;j)=0.
  8. For every five integers a,b,c,d,la,b,c,d,la,b,c,d,l satisfying V(a,b,c,d;l)V(a,b,c,d;l)V(a,b,c,d;l), x(a,b,c,d;l)≠0x(a,b,c,d;l)\ne0x(a,b,c,d;l)=0.
  9. For every seven integers a,b,c,d,j,l,Sa,b,c,d,j,l,Sa,b,c,d,j,l,S, assuming both H(a,b,c,d;j)H(a,b,c,d;j)H(a,b,c,d;j) and V(a,b,c,d;l)V(a,b,c,d;l)V(a,b,c,d;l), set
m=max⁡(A0,A1,A2,A3),M=min⁡(B0,B1,B2).m=\max(A_0,A_1,A_2,A_3),\qquad M=\min(B_0,B_1,B_2).m=max(A0​,A1​,A2​,A3​),M=min(B0​,B1​,B2​).

Then Fabcdjl(S)≠0F_{abcdjl}(S)\ne0Fabcdjl​(S)=0 if and only if m≤S≤Mm\le S\le Mm≤S≤M. This quantifies over every integer SSS, not merely over a defining finite summation range. 10. For every six integers a,b,c,d,j,la,b,c,d,j,la,b,c,d,j,l satisfying the same two admissibility hypotheses,

0≤m≤M≤a+b+c+d+j+l.0\le m\le M\le a+b+c+d+j+l.0≤m≤M≤a+b+c+d+j+l.
  1. For every six integers a,b,c,d,j,ka,b,c,d,j,ka,b,c,d,j,k, without admissibility hypotheses, L(a,b,c,d;j,k)=L(a,b,c,d;k,j)L(a,b,c,d;j,k)=L(a,b,c,d;k,j)L(a,b,c,d;j,k)=L(a,b,c,d;k,j).
  2. For every six integers a,b,c,d,j,ka,b,c,d,j,ka,b,c,d,j,k, if k≠jk\ne jk=j, k≠j−2k\ne j-2k=j−2, and k≠j+2k\ne j+2k=j+2, then L(a,b,c,d;j,k)=0L(a,b,c,d;j,k)=0L(a,b,c,d;j,k)=0.
  3. For every four integers a,b,c,da,b,c,da,b,c,d, L(a,b,c,d;0,0)=0L(a,b,c,d;0,0)=0L(a,b,c,d;0,0)=0.

The matrix used here is specified independently as follows. Set

Λ(a,b,l)=[(a−b+l)/2][(−a+b+l)/2]−[(a+b−l)/2][(a+b+l)/2+2][2]\Lambda(a,b,l)=\frac{[(a-b+l)/2][(-a+b+l)/2]-[(a+b-l)/2][(a+b+l)/2+2]}{[2]}Λ(a,b,l)=[2][(a−b+l)/2][(−a+b+l)/2]−[(a+b−l)/2][(a+b+l)/2+2]​

on admissible triples, and zero otherwise. On the diagonal,

L(a,b,c,d;j,j)=−h(a,b,c,d;j)[2]Λ(a,j,d)Λ(b,j,c)[j][j+2]L(a,b,c,d;j,j)=-\frac{h(a,b,c,d;j)[2]\Lambda(a,j,d)\Lambda(b,j,c)}{[j][j+2]}L(a,b,c,d;j,j)=−[j][j+2]h(a,b,c,d;j)[2]Λ(a,j,d)Λ(b,j,c)​

if H(a,b,c,d;j)H(a,b,c,d;j)H(a,b,c,d;j) and j≠0j\ne0j=0, and zero otherwise. If ∣j−k∣=2|j-k|=2∣j−k∣=2, let p=min⁡(j,k)p=\min(j,k)p=min(j,k), r=max⁡(j,k)r=\max(j,k)r=max(j,k). When both horizontal channels p,rp,rp,r are admissible,

L(a,b,c,d;j,k)=h(a,b,c,d;r)[(a+d−p)/2][(b+c−p)/2];L(a,b,c,d;j,k)=h(a,b,c,d;r)[(a+d-p)/2][(b+c-p)/2];L(a,b,c,d;j,k)=h(a,b,c,d;r)[(a+d−p)/2][(b+c−p)/2];

otherwise it is zero. All remaining entries are zero. In particular, the (0,0)(0,0)(0,0) value is an explicit zero branch, not a cancellation across a vanishing denominator.

Preamble
import Definitions.Def_QuantumSixJScalar

open scoped BigOperators QuantumSixJ
Formal statement
namespace QuantumSixJ

theorem scalar_foundations :
    (q ≠ 0) ∧
    (q - q⁻¹ ≠ 0) ∧
    (∀ n : ℤ, n ≠ 0 → ⟬n⟭ ≠ 0) ∧
    (∀ n : ℤ, 0 ≤ n → ⟬n⟭! ≠ 0) ∧
    (∀ j : ℤ, 0 ≤ j → Δ j ≠ 0) ∧
    (∀ a b c : ℤ, Admissible a b c → θ a b c ≠ 0) ∧
    (∀ a b c d j : ℤ, hAdmissible a b c d j → h a b c d j ≠ 0) ∧
    (∀ a b c d l : ℤ, vAdmissible a b c d l → x a b c d l ≠ 0) ∧
    (∀ a b c d j l S : ℤ, hAdmissible a b c d j → vAdmissible a b c d l →
      let A := tetA a b c d j l
      let B := tetB a b c d j l
      let m := max (max (A 0) (A 1)) (max (A 2) (A 3))
      let M := min (B 0) (min (B 1) (B 2))
      tetSummand a b c d j l S ≠ 0 ↔ m ≤ S ∧ S ≤ M) ∧
    (∀ a b c d j l : ℤ, hAdmissible a b c d j → vAdmissible a b c d l →
      let A := tetA a b c d j l
      let B := tetB a b c d j l
      let m := max (max (A 0) (A 1)) (max (A 2) (A 3))
      let M := min (B 0) (min (B 1) (B 2))
      0 ≤ m ∧ m ≤ M ∧ M ≤ a + b + c + d + j + l) ∧
    (∀ a b c d j k : ℤ, L a b c d j k = L a b c d k j) ∧
    (∀ a b c d j k : ℤ, k ≠ j → k ≠ j - 2 → k ≠ j + 2 → L a b c d j k = 0) ∧
    (∀ a b c d : ℤ, L a b c d 0 0 = 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. Appendix quantum integers, factorials, admissibility, loop/theta/norm formulas and finite Tet formula; Eqs. (19), (20), symmetric matrix coefficients.
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