Eqs. (15), (17) — one- and two-term Tet evaluations
ProvedQuantumSixJ.tet_two_evaluationsFor the family , 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.
- If and is admissible, put . The raw summand for can be nonzero only at , 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
- If , and are admissible, and or , put . The raw summand can be nonzero only at , and its full coarse sum is that single term. In both orientations,
- For arbitrary integer , the Tet is zero if any of , , or is inadmissible.
The coarse upper endpoints are respectively and . These statements cover the patterns , and 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 , with indeterminate, and write
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 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 ,
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
The full tetrahedral scalar is
when all four triples 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 , must be distinguished.
The assertion has five conjuncts.
1. Diagonal raw-sum reduction
For every , assume , , and admissible, and set . For every integer ,
Moreover,
This reduces the raw sum, not the full . The two indices are candidates: the statement does not assert that both terms are nonzero. Substitution gives , , and the individual candidate terms are
The same negative-factorial and total-division conventions apply to these expressions, including triangle-equality boundaries.
2. Adjacent raw-sum reduction
For every , assume , and admissible, and either or . Put and . For every integer ,
and
Again this is a statement about the raw sum. Up to ordering, and . Consequently the candidate term is
The hypotheses do not require or separately; their nonnegativity follows from admissibility.
3. Diagonal full-scalar evaluation
For every integer under exactly the hypotheses in part 1,
Thus the factorial-canceled full scalar is
Here and are nonzero for positive . 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 under exactly the hypotheses in part 2,
Equivalently, the factorial-canceled full scalar is the right-hand side divided by . The larger of , 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 , without positivity assumptions, if at least one of
is inadmissible, then . This is a statement about the full scalar, not a claim that every raw summand vanishes for arbitrary inadmissible labels. In particular it covers , negative labels, triangle or parity failures, and pairs 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.
import Definitions.Def_QuantumSixJScalar open scoped BigOperators QuantumSixJ
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 QuantumSixJConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.