Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck escalatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Root fusion paths have nonzero pairings

Statement

For generic q, or whenever the quantum integers needed for pr,ps,pt are units, the unnormalized trivalent theta pairing satisfies

Θ(r,s,t)=[m]![n′]![p]![m+n′+p+1]![m+n′]![n′+p]![m+p]!,

where m=(r+s−t)/2, n′=(s+t−r)/2, p=(t+r−s)/2 are nonnegative integers. The vertices and exact unit domain are those of General Temperley–Lieb theta-net evaluation and its root domain. At q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2, the pairing is positive when the triangle/parity conditions hold and r+s+t≤2ℓ−4; it is zero for a triangle/parity triple above that level. A triple requiring an undefined root JW projector is not implicitly included.

Put k=ℓ−2 and quotient the diagram category by the tensor ideal generated by pk+1. A retained path of length n is a=(a0,…,an) with a0=0, 0≤ai≤k and ∣ai−ai−1∣=1. There are inclusions ia:pan→n and retractions ra:n→pan such that raib=0 for distinct paths, raia=pan, and ∑aiara=1n. Consequently the Ea,b=iarb at a common endpoint form complete matrix units, with

Ea,bEc,d=δb,cEa,d,Tr⁡n(Ea,b)=δa,b[an+1]q.

Their pairing is nondegenerate. The endpoint pk+1 is deleted before normalization; no denominator [ℓ] is used.

Facts & Assumptions

Given: All ℓ≥3, the positive-loop diagram convention and its unnormalized trace.

[F1]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives idempotence, absorption, turnback annihilation and ptr⁡a(pa)=([a+1]/[a])pa−1.

[F2]
[F3]

Temperley–Lieb quantum integers and quantum characteristic gives [j]>0 for 1≤j<ℓ and [ℓ]=0.

[F4]

General Temperley–Lieb theta-net evaluation and its root domain proves the full theta formula, its generic unit domain and its retained-root nonzero/zero level alternatives.

[F5]

Every boundary tensor-ideal component is the fixed embedded two-sided ideal identifies every tensor-ideal endomorphism component with the fixed embedded two-sided ideal. Partial-trace closure of negligible morphisms proves tensor-ideal closure when the two pivotal traces agree on all endomorphisms. Here either closure of any basis endomorphism counts exactly the same finite matching components with the same factor δ per component; linearity therefore verifies that hypothesis.

Proof

1.1F3F4givenalgebra

The theta formula and exact vertex convention are [F4]. At a retained triangle/parity triple, its denominator indices are r,s,t≤ℓ−2. If h=(r+s+t)/2≤ℓ−2, every numerator index is at most ℓ−1 and [F3] makes the ratio positive. If h≥ℓ−1, its numerator factorial [h+1]! contains [ℓ], whereas the denominator stays nonzero; its value is zero. These conclusions specialize the generic localization identity, not a ratio of theta values at the root.

1.2F1F2F3constructalgebra

For 1≤a≤k set fa=pa⊗1, Xa=faUafa and λa=[a+1]/[a]. Define αa=fa(1a−1⊗∪)pa−1,βa=pa−1(1a−1⊗∩)fa. Absorption of pa−1 next to pa gives αaβa=Xa: insert the cup/cap and remove the absorbed lower projector. Closing the other composite is exactly the right partial trace of pa in its lower corner, so [F1] gives βaαa=λapa−1. Thus Xa2=λaXa. The JW recursion gives fa=pa+1+λa−1αaβa. The two terms are orthogonal because pa+1 kills the joining turnback. The down maps are inclusion αa and retraction λa−1βa; the up maps are the tautological inclusion/retraction of pa+1. For a=0 there is only p1. Every denominator here has index at most ℓ−1 and is nonzero.

1.3F1F2F3F5algebra

For retained endpoints, Hom⁡(pa,pb)=0 if a≠b and is Cpa if a=b. Indeed any matching between unequal boundaries has an innermost adjacent cap or cup at the larger boundary and is killed by its JW projector. Between equal boundaries, every nonidentity matching has such a turnback. The identity corner survives in the quotient: its trace is [a+1]>0, while the boundary tensor ideal is negligible. For the latter assertion, pk+1 has one-dimensional endomorphism corner and trace [ℓ]=0, so every test trace vanishes; tensor-ideal closure in [F5] gives the assertion at all objects. Thus the quotient introduces no extra identification in the retained scalar corners.

2.1F3F5step 1.2algebra

At a=k, pass to the categorical quotient and delete pk+1 from the decomposition before taking any further normalization. The identity becomes pk⊗1=λk−1αkβk with λk=[ℓ−1]/[ℓ−2]≠0. It therefore has only its down summand. In particular at ℓ=3, k=1, this says that the quotient tensor square is its trivial channel; no retained highest-weight-2 summand is asserted. The endomorphism ideal being killed is exactly [F5]'s embedded one.

3.1F1F2step 1.2step 2.1inductionconstructalgebra

Start with the single rank-zero path and tensor its identity decomposition by 1. Inductively split each endpoint summand pa⊗1 by steps 1.2 and 2.1 and compose its up/down maps with the preceding path maps. Cross-composites of the new up/down terms vanish by turnback annihilation; the equal down composite is λa−1βaαa=pa−1 and the up composite is pa+1. Different preceding paths have zero composite by induction. Their new projections sum to the old projection tensored with 1, because the split is complete; at the boundary only the down term remains. This proves simultaneously raib=0 for distinct paths, raia=pan and ∑aiara=1n for every rank.

4.1F1F2F3step 1.1step 3.1step 1.3algebra∎

For paths with equal endpoint put Ea,b=iarb. The composites in step 3.1 give their matrix-unit multiplication. Insert the complete path identity on each side of any morphism and use the corners of step 1.3: these units span all endomorphisms, and the same argument describes unequal-degree Hom spaces. They are independent because multiplying a putative relation by ra and ib isolates its coefficient times the nonzero endpoint projector. Closing iarb has the same finite component graph as closing rbia, even though the cut occurs at a different object. Thus the trace is zero off the diagonal and [an+1] on it. Each matrix block has nonzero weighted ordinary trace pairing, detected by its transposed matrix units. This proves completeness and nondegeneracy at every rank. Together with step 1.1 it proves all assertions without a recoupling division at the boundary.

Depends on

Used by

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources