Appendix — scalar foundations and support identities
ProvedQuantumSixJ.scalar_foundationsOver , with an indeterminate, establish the scalar foundations for the Appendix formulas. The nonzero quantities are , , for every nonzero integer , for every nonnegative integer , for , on admissible triples, and the norms on their respective admissible channels.
Under both horizontal and vertical admissibility, let be the Appendix half-sums, , and . For every integer summation index , the raw factorial summand is nonzero exactly when , and
Thus its effective Appendix support lies inside the coarse defining finite interval.
In addition, the explicitly defined two-index matrix satisfies , is zero unless , and has , 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 , with an indeterminate. Write
In particular, . 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 at numerical poles.
A triple is admissible precisely when all three entries are nonnegative, each is at most the sum of the other two, and is even. Put
Define for , and zero otherwise. For an admissible triple, with , define
set for an inadmissible triple. The norms are
and zero outside their respective admissible domains.
For six labels define the four entries of and the three entries of , in order, by
All divisions producing integer labels mean integer division; on the admissible domain the displayed half-sums are integral. The raw summand is
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:
- .
- .
- For every integer , .
- For every integer , .
- For every integer , .
- For every admissible integer triple , .
- For every five integers satisfying , .
- For every five integers satisfying , .
- For every seven integers , assuming both and , set
Then if and only if . This quantifies over every integer , not merely over a defining finite summation range. 10. For every six integers satisfying the same two admissibility hypotheses,
- For every six integers , without admissibility hypotheses, .
- For every six integers , if , , and , then .
- For every four integers , .
The matrix used here is specified independently as follows. Set
on admissible triples, and zero otherwise. On the diagonal,
if and , and zero otherwise. If , let , . When both horizontal channels are admissible,
otherwise it is zero. All remaining entries are zero. In particular, the value is an explicit zero branch, not a cancellation across a vanishing denominator.
import Definitions.Def_QuantumSixJScalar open scoped BigOperators QuantumSixJ
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 QuantumSixJConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.