Eqs. (6)–(10) — four-valent bases and recoupling
ProvedQuantumSixJ.Network.four_valent_basesLet be a -linear preadditive monoidal category, , with additive and -linear tensor product. The chosen objects for natural labels satisfy and have exact self-pairings. Assume SuQ2Axioms: unique scalar endomorphisms of each , zero morphisms between different labels, the admissible fusion decompositions, and the loop values . Choose trivalent vertices , and assume VertexNormalized W: theta normalization and cyclicity. Scalars act through , fixing . Composition means first , then .
Without TetSeed, prove the complete four-valent basis and recoupling statement for every natural :
- and , including inadmissible channels.
- Every state has scalar pairing coefficients in each basis and equals its corresponding orthogonal expansion. Every covector has the dual expansion as well. Horizontal sums run over and vertical sums over ; coefficients are divided by the respective norms.
- Prove the diagram identification
where the right-hand side is the explicitly defined graphical network . This equality is a conclusion to establish, not an extra hypothesis or an assumed change of notation. 4. For every , scalar coefficients exist with and
The statement includes coefficient existence rather than presupposing that all closures have already been evaluated. Division by zero follows the specified zero-extension convention.
Independent mathematical read-back
Four-valent pairings and expansions
Let , and let be the coefficient embedding fixing . Work in an arbitrary preadditive -linear monoidal category with tensor product additive and -linear in both variables. Write for the tensor unit. Composition means first , then ; canonical associators and unitors are implicit, never permutations of tensor factors.
Hypotheses and notation
For each natural , an object is given, together with and a self-duality cup and cap satisfying both snake identities. There is a chosen covariant vertex for every natural triple.
A triple is admissible when its entries are nonnegative, satisfy all three triangle inequalities, and have even sum. The assumed category axioms are: every endomorphism of is a unique scalar multiple of its identity; all morphisms between distinctly labelled objects vanish; for every there exist maps and , for all natural , with for admissible , and ; and .
Set , with for negative integer , and otherwise. For natural , . For admissible , put and
set otherwise.
Whiskers and mean and . With , the upward vertex, split, and fuse are the following ordered composites, with only canonical regrouping suppressed:
Vertex normalization assumes exactly , and that
for every natural triple. There is no tetrahedral seed hypothesis, no all-channel identification with a scalar tetrahedral sum, and no assumed general tetrahedral symmetry. No braiding or Hermitian structure is assumed.
Fix arbitrary , with no admissibility restriction, and write , left-associated. The states and covectors are
States go from to , covectors in the reverse direction. The superscript denotes these explicitly defined covectors, not a conjugate-linear adjoint.
Define rational-function norms
They are bilinear pairing scalars, not positive or Hermitian norms.
The eight conclusions
For every fixed natural quadruple , the assertion is the conjunction of the following eight statements.
- For every ,
- For every ,
- For every state , there exists a function such that, simultaneously,
- For every covector , there exists a function such that
- For every state , there exists a function such that
- For every covector , there exists a function such that
In statements 3–6 the existential functions are independently chosen for the given morphism and expansion. The pairing equalities cover all natural indices, even outside the finite sum. The sums range over all integers from zero through the displayed inclusive upper endpoint, not filtered admissible ranges. The statement does not explicitly assert uniqueness of these functions or nonzero norms at every summed index. 7. For every ,
The tetrahedral endomorphism is defined, for integer channels , by
Thus the literal unfolded assertion here, since are natural, is
More explicitly, the left composite is
whereas the right composite is
This is a substantive equality between closures with boundary orders and and interchanged channel roles, not merely the defining formula for Tet. Pure substitution into that definition instead gives the left closure as ; the assertion therefore equates that endomorphism with . 8. For every , there exists a function such that
This expands each vertical state in horizontal states, not the reverse expansion. It asserts scalar existence for every Tet in this natural-channel family, but does not give a numerical formula for those scalars or identify them with a separately defined finite-sum tetrahedral evaluation. The same function supplies both all-channel scalar equalities and the finite expansion, and may depend on .
All divisions are total divisions in a rational-function field, so a zero denominator yields zero. No nonvanishing hypotheses or restrictions to a complex specialization are added. These are pairings and spanning assertions for the full natural-indexed families, not a claim that every indexed state is a nonzero basis element. The tetrahedral symmetry in statement 7 is among the conclusions to establish, not among the assumptions.
import Definitions.Def_QuantumSixJNetwork open CategoryTheory MonoidalCategory open scoped BigOperators QuantumSixJ universe v u
namespace QuantumSixJ.Network
theorem four_valent_bases {C : Type u} [Category.{v} C] [Preadditive C] [Linear K C]
[MonoidalCategory C] [MonoidalPreadditive C] [MonoidalLinear K C]
(S : SuQ2Data C) (W : Vertex S) (hS : SuQ2Axioms S) (hW : VertexNormalized W) :
∀ a b c d : ℕ,
(∀ j k : ℕ, W.H a b c d k ≫ W.Hcov a b c d j =
if k = j then ι (h a b c d j) • 𝟙 (𝟙_ C) else 0) ∧
(∀ l m : ℕ, W.X a b c d m ≫ W.Xcov a b c d l =
if m = l then ι (x a b c d l) • 𝟙 (𝟙_ C) else 0) ∧
(∀ f : 𝟙_ C ⟶ S.V a ⊗ S.V b ⊗ S.V c ⊗ S.V d,
∃ s : ℕ → K,
(∀ j : ℕ, f ≫ W.Hcov a b c d j = s j • 𝟙 (𝟙_ C)) ∧
f = ∑ j ∈ Finset.range (b + c + 1), (s j / ι (h a b c d j)) • W.H a b c d j) ∧
(∀ g : S.V a ⊗ S.V b ⊗ S.V c ⊗ S.V d ⟶ 𝟙_ C,
∃ s : ℕ → K,
(∀ j : ℕ, W.H a b c d j ≫ g = s j • 𝟙 (𝟙_ C)) ∧
g = ∑ j ∈ Finset.range (b + c + 1), (s j / ι (h a b c d j)) • W.Hcov a b c d j) ∧
(∀ f : 𝟙_ C ⟶ S.V a ⊗ S.V b ⊗ S.V c ⊗ S.V d,
∃ s : ℕ → K,
(∀ l : ℕ, f ≫ W.Xcov a b c d l = s l • 𝟙 (𝟙_ C)) ∧
f = ∑ l ∈ Finset.range (a + b + 1), (s l / ι (x a b c d l)) • W.X a b c d l) ∧
(∀ g : S.V a ⊗ S.V b ⊗ S.V c ⊗ S.V d ⟶ 𝟙_ C,
∃ s : ℕ → K,
(∀ l : ℕ, W.X a b c d l ≫ g = s l • 𝟙 (𝟙_ C)) ∧
g = ∑ l ∈ Finset.range (a + b + 1), (s l / ι (x a b c d l)) • W.Xcov a b c d l) ∧
(∀ j l : ℕ, W.X a b c d l ≫ W.Hcov a b c d j = W.tet a b c d j l) ∧
(∀ l : ℕ, ∃ s : ℕ → K,
(∀ j : ℕ, W.tet a b c d j l = s j • 𝟙 (𝟙_ C)) ∧
W.X a b c d l = ∑ j ∈ Finset.range (b + c + 1),
(s j / ι (h a b c d j)) • W.H a b c d j) := by sorry
end QuantumSixJ.NetworkConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.