Eq. (24): Appendix-sum and categorical Tet recurrences
ProvedQuantumSixJ.recurrencesThe theorem QuantumSixJ.recurrences asserts exactly SumRecurrence ∧ NetworkRecurrence: the conjunction of the two separately defined propositions for equation (24). The graphical Tet is defined in equation (6).
For fixed external labels, denotes the symmetric tridiagonal matrix, with and unless . Its entries are indexed on a fixed parity lattice; . In Lean, QuantumSixJ.L a b c d j k is the two-index matrix entry . The off-diagonal formulas give , including zero extensions; symmetry is not an extra hypothesis.
SumRecurrence: Appendix sum. For every , the explicit finite Appendix sum, normalized by , satisfies
Here in , with the published zero extensions and no additional hypotheses. Equivalently, , displaying the symmetric generalized eigenvalue problem.
NetworkRecurrence: categorical network. In every -linear preadditive monoidal category with additive, linear tensor product, labeled self-dual objects and trivalent vertices satisfyingSuQ2Axioms,VertexNormalized, and the separate initial-data assumptionTetSeed, for every and ,
The coefficients act on endomorphisms of the tensor unit. The graphical network of equation (6) is when both channels are nonnegative and zero otherwise, with composition read left to right. The last channel is the inner rung.
The category assumptions are scalar endomorphisms of each label object, vanishing morphisms between different labels, the fusion decompositions and loop values. Vertex normalization requires only theta evaluation and cyclicity. The separate assumption TetSeed supplies the last-slot-2 Tet values as initial data for the recurrence solution and as input to its derivation. No second numerical Tet evaluation, general rotation, or all-channel equality between the network and Appendix sum is assumed. In both clauses field division by zero is zero; complex specialization is not part of the statement. The scalar clause is independent of all categorical hypotheses.
The scalar Tet is defined by QuantumSixJ.tetSum, and the graphical Tet by QuantumSixJ.Network.Vertex.tet. Both recurrence assertions are part of the conclusion, not hypotheses.
import Definitions.Def_QuantumSixJRecurrences
namespace QuantumSixJ
/-- Equation (24), for the Appendix sum and the graphical network of equation (6). -/
theorem recurrences.{v, u} : SumRecurrence ∧ NetworkRecurrence.{v, u} := by sorry
end QuantumSixJRead-back
What the Lean code literally says, in plain math · openai/gpt-6.1-sol
Tetrahedral recurrences
For every pair of universe levels , the assertion is the conjunction of the following scalar identity and categorical identity. The scalar identity has no categorical hypotheses. The categorical identity is universally quantified over categories whose objects belong to universe and whose morphisms belong to universe , and has the three separate hypotheses specified below. Here are the quantities and assumptions in full, followed by the two identities.
Scalar quantities. Work in , with the indeterminate, and for every integer set
The empty product is , so . All divisions are field divisions with , hence every quotient with zero denominator is zero. All integer powers, including negative powers, have their field meaning. Every halving expression below denotes integer division (rounding down), not division in . A triple of integers is admissible exactly when all three entries are nonnegative, each is at most the sum of the other two, and is even. Write for admissibility of both and , and for admissibility of both and . Define
and, for arbitrary integer arguments,
For fixed integers , the matrix entries used in the identities are defined for all integers by
In particular ; a diagonal entry is zero at every inadmissible horizontal channel; and an adjacent entry is zero unless both endpoint channels are admissible. All other entries vanish. For six integer labels define
The scalar tetrahedral value and its normalization are
The sum is over integers in the displayed inclusive interval and is empty if its upper endpoint is negative. There are no additional summand support guards: a negative factorial argument is zero, and a resulting zero denominator makes that summand zero under the stated field convention. In particular the normalization is zero when , including the case .
Categorical data and the three separate assumptions. Let , and let be the coefficient embedding induced by , fixing the indeterminate. Quantify over every category with the universe sizes above, equipped with a preadditive structure, a -linear structure, a monoidal structure, and compatibility of tensor product with addition and with the -scalar actions on morphisms. No braiding or symmetry is assumed. Write for its tensor unit. Quantify over every family of objects , indexed by , with a chosen isomorphism , and for each a chosen exact self-pairing, that is, a cup and cap satisfying both snake identities. Quantify also over every family of chosen covectors , for all natural . In the formulas defining their contractions, composition means first , then ; tensor identities, canonical associators and unitors are inserted as necessary, without any interchange of tensor factors. Define the rotation of any , its all-output counterpart, its split and fuse by
Thus and ; in the ordered labels are . Define the state and covector
For natural external labels and signed integer channels set
where nonnegative integer channels in the first branch are regarded as natural numbers. This is an endomorphism of ; the ordered external tensor factors in the closure are , and the inner channel is . The star here denotes the displayed covector construction, not complex conjugation. Impose the following three hypotheses separately. First, the category axioms require: for every natural and endomorphism of , there is exactly one with ; for every pair of distinct natural labels , every morphism is zero; for every natural , there exist families and , defined for all natural , such that
and, for every natural , . The fusion families have no further required equations outside , and are not assumed to equal the chosen splits and fuses. Second, vertex normalization requires, for all natural ,
Third, independently of that normalization, tetrahedral seed data require, for every natural ,
This seed hypothesis quantifies over all natural labels, including inadmissible choices, for which its scalar right side is zero. It does not assume a tetrahedral evaluation at arbitrary inner channel . The categorical conclusion is conditional on all three hypotheses; no existence of such data or of a category satisfying them is asserted.
The two conclusions. The first conjunct asserts, for every six integers , with no admissibility, positivity, boundary, or nonvanishing hypotheses,
The second conjunct asserts, for every category and every set of data just quantified over, assuming separately the category axioms, vertex normalization, and tetrahedral seed data above, and then for every and ,
Here multiplication of a morphism by a coefficient means its -scalar action; all scalar definitions use the natural external labels cast to integers. The zero on the right is the zero morphism. Divisions in , too, have zero inverse equal to zero: a term with zero norm denominator is zero regardless of its tetrahedral factor. Both conclusions include , negative channels, absent neighbors, zero external labels, and all inadmissible channels under precisely the conventions above; the categorical tetrahedral definition itself has only the negative-channel guard, not an additional admissibility guard. The scalar identity is not a hypothesis of the categorical identity, nor is an all-channel equality between the scalar and categorical tetrahedral values assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.