Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

General Temperley–Lieb theta-net evaluation and its root domain

Statement

Initially let q be an indeterminate, let [j]=qj−1+qj−3+⋯+q1−j for j≥1, let [0]!=1, and set δ=q+q−1. For nonnegative integers m,n,p, put r=m+p,s=m+n,t=n+p,h=m+n+p. Equivalently, (r,s,t) satisfies the triangle inequalities and even-sum condition, with m=(r+s−t)/2, n=(s+t−r)/2, and p=(t+r−s)/2. All Jones–Wenzl projectors below have identity coefficient one and are unnormalized.

Let Wm:0→2m be m nested cups, whose outputs are two consecutive m-strand bundles: cup i joins position i of the first bundle to position m+1−i of the second. Let Bm:2m→0 be its horizontal reflection. Define A=1p⊗Wm⊗1n:t⟶r+s,B=1p⊗Bm⊗1n:r+s⟶t, α=(pr⊗ps)Apt,β=ptB(pr⊗ps),Θ(m,n,p)=Tr⁡t(βα). Thus the pairwise bundles at each trivalent vertex have sizes m,n,p: there are m strands between arms r,s, n between arms s,t, and p between arms t,r. This fixes the vertex without a further scalar normalization. The theta net has the three JW-labelled edges r,s,t, since idempotence collapses the doubled projectors. Its value is Θ(m,n,p)=[m]![n]![p]![h+1]![m+n]![n+p]![m+p]!. For p≥1 the closed-diagram strip recurrence is [m+p][n+p]Θ(m,n,p)=[p][m+n+p+1]Θ(m,n,p−1),Θ(m,n,0)=[m+n+1].

These identities specialize to every complex q≠0 for which [j]≠0 for 1≤j≤M=max⁡(r,s,t), using the Laurent-polynomial convention at q=±1. These hypotheses construct the three projectors and make every displayed denominator a unit; [h+1] need not be nonzero. In particular, if q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2, then Θ>0 when h≤ℓ−2, whereas Θ=0 when h≥ℓ−1. The latter vertex has zero trace pairing against every reverse morphism. No undefined higher root projector or 0/0 convention is used.

Facts & Assumptions

Given: The stated m,n,p,r,s,t,h, the positive-loop diagram convention, the nested cup/cap maps Wm,Bm, the unnormalized closure trace, and initially the field C(q). For the specialization conclusion, q∈C× and [1],…,[M] are nonzero. The proof uses only finite matrices and finite diagram contractions; it assumes no quantum-group ribbon or tilting theorem and no choice principle.

[F1]

Quantum integers satisfy [0]δ=0, [1]δ=1, and [j+1]δ=δ[j]δ−[j−1]δ. For δ=q+q−1 the convention at q=±1 is [j]q=jqj−1 (Temperley–Lieb quantum integers and quantum characteristic, Definition).

[F2]

The JW projector has “coefficient 1 on the identity diagram,” is nonzero and idempotent, and is annihilated on both sides by the elementary generators. Its corner is paTLapa=C(q)pa, and Tr⁡a(pa)=[a+1] (Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure, Statement). For a≥1, its defining recursion is pa+1=Pa−([a]/[a+1])PaUaPa with Pa=pa⊗1. The initial values are p0=10, p1=11; the construction uses only the stated unit denominator quantum integers (Jones–Wenzl recursion over unit quantum integers, Definition).

[F3]

A diagram is a noncrossing perfect matching. Stacking removes each closed cycle for a factor equal to the loop value and leaves the exterior matching; composition and horizontal juxtaposition extend bilinearly and form a strict monoidal category (Temperley–Lieb planar diagram data and endomorphism modules, Definition; Stacking is associative and horizontal juxtaposition is strict monoidal, Statement).

[F4]

The elementary cup-cap generators satisfy Ui2=δUi, UiUi+1Ui=Ui, Ui+1UiUi+1=Ui+1, and distant commutation (The elementary diagram generators satisfy the local Temperley–Lieb relations, Statement).

[F5]

Every basis endomorphism diagram is a finite product of elementary generators; the product can be chosen without an intermediate closed cycle (Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram, Statement).

[F6]

Closing a basis diagram with c circles has value δc, and this extends linearly. Closure is cyclic and factors through the stated cup/cap partial trace, with no division by the loop value (Unnormalized diagram closure and partial trace, Definition; Diagram closure trace is cyclic and satisfies the tower rules, Statement).

[F7]

“The homomorphism πn:Pn(R,δ)→TLn(R,δ) sending ui to di is an isomorphism.” This holds for every commutative ring, without requiring the loop value to be nonzero or invertible (The generator presentation is the planar diagram algebra over every commutative ring, Statement).

Proof

technique · evaluate the defined diagram by an explicit JW matrix contraction, prove the resulting finite q-Vandermonde sum, and then specialize only the final localization identity
1.1F3F6givenconstructalgebra

Work first over C(q). Let V have ordered basis (+,−), and define w=+−−q−1(−+) and b(+,−)=−q, b(−,+)=1, b(+,+)=b(−,−)=0. Direct evaluation on + and − gives both snakes (1⊗b)(w⊗1)=1V and (b⊗1)(1⊗w)=1V, while b(w)=−δ. Thus cup ↦w, cap ↦b evaluates every planar diagram with loop −δ: the two snake moves and deletion of a component have exactly their prescribed values, so the evaluation respects stacking and planar matching equality. This is a finite matrix evaluation of TL(−δ), with no quantum-group input.

2.1F4F7step 1.1algebra

Write e=wb and U=−e. In the two weight-zero words the nonzero block is U∣(+−,−+)=(q−1−1q−1), which is symmetric under ordinary transpose. The generators −ei satisfy the positive-loop relations by the two snakes and ei2=−δei; consequently [F7] makes Ui↦−ei an algebra isomorphism between the positive- and negative-loop diagram endomorphism algebras, with its own inverse of the same form.

3.1F1F2F5step 2.1algebra

Under loop −δ, the quantum integers are [j]−=(−1)j−1[j], by the recurrence in [F1]. Substitution in the JW recursion shows inductively that the isomorphism takes the positive projector pa to the negative-loop projector pa−. Its evaluated matrix Pa is therefore the positive-loop JW recursion matrix built from the displayed symmetric U: it is symmetric, idempotent, annihilated by every Ui, and is identity plus nonempty U-words.

4.1step 3.1constructalgebra

For a word x of length a, let j(x) count its minus signs, and let inv⁡(x) count pairs consisting of a minus before a plus. Put za,j=∑j(x)=jqinv⁡(x)x and Za,j=za,jtza,j=∑j(x)=jq2inv⁡(x). The equation Uiv=0 says that the coefficient of a word with −+ in positions i,i+1 is q times the coefficient of the otherwise identical word with +− there. Adjacent swaps connect all words with fixed j, and replacing +− by −+ increases inversion number by one. Hence the common kernel in that weight space is exactly C(q)za,j. The image of Pa lies in the common kernel; conversely its nonidentity generator words kill that kernel by their rightmost factor, so Pa acts as identity there.

5.1step 4.1algebra

A symmetric rank-one projector with image C(q)z is zzt/(ztz). Here Za,j is a nonzero polynomial with constant term one, so it is invertible in C(q). Thus the actual JW matrix, rather than a substitute projector, has entries (Pa)x,y=qinv⁡(x)+inv⁡(y)Za,jwhen j(x)=j(y)=j. This includes a=0 with the empty word and Z0,0=1.

6.1F1step 4.1algebrastep 5.1

Put Q=q2 and write (aj)Q for the Gaussian polynomial. Appending a plus to a word with j minuses creates j inversions, whereas appending a minus creates none. Therefore Za,j=QjZa−1,j+Za−1,j−1, with Za,0=Za,a=1. This is the Gaussian polynomial recurrence with the same initial values; induction gives Za,j=(aj)Q. Also [u]=q1−u(1+Q+⋯+Qu−1), so conversion of the three factorials gives Za,j=qj(a−j)[a]![j]![a−j]!. All inversions here occur in C(q); root specialization will follow only after denominators have been put in the stated unit range.

7.1F2F3F6step 1.1step 4.1algebrastep 6.1

The negative planar trace in this evaluation has pivotal matrix J=−K, where K=diag⁡(q,q−1). Indeed the bilinear matrix of b is B0=(0−q10), and the symmetric planar transpose relation JB0t=B0 gives exactly J=−K; equivalently the corresponding direct cup/cap closure of a matrix f is Tr⁡((−K)f). Tensoring this closure gives Tr⁡((−K)⊗af) on V⊗a. The basis za,j of im⁡Pa has weights a−2j, so the negative-loop trace is dim⁡−(pa)=(−1)a∑j=0aqa−2j=(−1)a[a+1]. The diagram corner ptEnd⁡(t)pt is scalar by [F2], also seen directly because an innermost turnback kills every nonidentity matching. The vector +t is fixed by Pt and detects that scalar. Thus no faithfulness claim about arbitrary diagram Hom spaces is needed to recover the scalar used below.

8.1step 1.1givenalgebrastep 7.1

Form the same A,B,α,β in the negative-loop diagram category, and denote the theta value by Θ−. For a word x of length m, let xˉ be its bitwise complement followed by reversal. The prescribed nested cups and caps give Wm(1)=∑x(−q−1)j(x)x⊗xˉ,Bm(x⊗xˉ)=(−q)m−j(x), and Bm is zero on other pairings of the two word bundles. This follows by multiplying the m fundamental coefficients: a plus in x contributes cup coefficient one and cap coefficient −q; a minus contributes cup coefficient −q−1 and cap coefficient one. The reversed order is exactly the nesting in the Statement.

9.1F2step 7.1step 8.1algebra

The negative-loop diagram βα is in the scalar pt corner, so write its evaluated matrix as LPt. On +t the outer Pt factors may be omitted: they fix this vector, all maps preserve total weight, and weight t in V⊗t is the one-dimensional space C(q)+t. Idempotence removes the doubled middle projectors. Hence L is exactly the coefficient on +t obtained by applying B(Pr⊗Ps)A to +t.

10.1step 5.1step 8.1step 9.1algebra

Let x have j minus signs and v=inv⁡(x). Its A output is (+px)⊗(xˉ+n) with coefficient (−q−1)j. The two word inversion counts are v and v+(m−j)n, since complement followed by reversal preserves inversions. Substitution in the actual projector entries of step 5.1, then summation over words with this fixed j, gives (Pr⊗Ps)A(+t)=∑j=0mCjzr,j⊗zs,m−j,Cj=(−q−1)jq(m−j)nZm,jZr,jZs,m−j. Here the sum of q2v over those words is precisely Zm,j.

11.1step 8.1step 9.1step 10.1algebra

In applying B to the jth tensor in step 10.1, only word pairs (+px,xˉ+n) can leave all of its p leftmost and n rightmost through positions plus. Their contraction coefficient on +t is (−q)m−jq(m−j)nZm,j, by the same inversion count and the cap formula in step 8.1. Therefore every contraction is accounted for in L=(−1)m∑j=0mqm−2j+2n(m−j)Zm,j2Zm+p,jZm+n,m−j. This is an evaluation of the specified bundled, projector-labelled diagram, rather than an asserted strip identity.

12.1step 6.1step 11.1algebra

Substituting step 6.1 into the quotient of Z factors in step 11.1 contributes exponent j(n−p)−mn and factorial factor [m]!2[m+p−j]![n+j]!/([m+p]![m+n]![j]![m−j]!). Consequently L=(−1)m[m]!2[m+p]![m+n]!Sm,n,p,Sm,n,p=∑j=0mqm(n+1)−j(n+p+2)[m+p−j]![n+j]![j]![m−j]!. The exponent simplification is m−2j+2n(m−j)+j(n−p)−mn=m(n+1)−j(n+p+2), so no omitted scalar or power of q enters this norm contraction.

13.1step 6.1constructalgebrastep 12.1

For N≥0 the formal power series identity ∑j≥0(N+jj)Qxj=∏i=0N(1−Qix)−1 follows coefficientwise. If hN,j denotes the right-hand coefficient, multiplying by 1−QNx gives hN,j=hN−1,j+QNhN,j−1. The Gaussian polynomial on the left has the identical recurrence, since (N+jj)Q=(N+j−1j)Q+QN(N+j−1j−1)Q, and the initial values are h0,j=1 and hN,0=1. This Pascal identity follows by clearing the ordinary Q-factorial denominators, or by the inversion-word recurrence of step 6.1. Induction thus proves the displayed formal identity; there is no analytic convergence premise.

14.1step 13.1algebra

Apply step 13.1 to the adjacent exponent intervals [−n−1,−1] and [0,p]. Their geometric-series products multiply to the product for the whole interval [−n−1,p]. The coefficient of xm is therefore ∑j=0mQ−j(n+1)(n+jn)Q(p+m−jp)Q=Q−m(n+1)(m+n+p+1m)Q. The summand uses degree j from the negative interval and degree m−j from the nonnegative interval. Shifting all exponents of the combined interval up by n+1 and applying step 13.1 with N=n+p+1 gives the right side. This proves the finite q-Vandermonde identity used here.

15.1step 6.1step 12.1step 14.1algebra

Divide a summand of Sm,n,p by [n]![p]!. Its factorial part is the product of the symmetric quantum binomials [m+p−jp]q[n+jn]q. Converting these to Gaussian polynomials by step 6.1 changes their combined prefactor to qm(n+1−p)Q−j(n+1). Thus step 14.1 gives the symmetric binomial q−m(n+p+1)(h+1m)Q=[h+1m]q after this same conversion, and hence Sm,n,p=[n]![p]![h+1]![m]![n+p+1]!. Substitution into step 12.1 proves L=(−1)m[m]![n]![p]![h+1]![m+p]![m+n]![n+p+1]!. Every sum and exponent in this evaluation has therefore been derived independently of a theta formula or recoupling coefficient.

16.1F3F5F6step 3.1step 7.1algebrastep 15.1

The negative diagram satisfies Θ−=(−1)t[t+1]L by step 7.1. To compare it with the desired positive-loop theta, expand all three projectors as generator words. Under Ui↦−ei, a term with a total of v generator insertions gains coefficient sign (−1)v, by step 3.1. With no insertions its closed matching has exactly h=m+t circles: m cup/cap circles and t through-strand closures. One cup-cap insertion reconnects two edges of a closed planar one-manifold and merges two components or splits one; thus it changes the circle count by ±1. Consequently the total count c for a term with v insertions satisfies c≡h+v(mod2), including components removed during stacking. Evaluating its loops at −δ gives sign (−1)c, so its combined sign is always (−1)v+c=(−1)h. Summing the terms proves the diagrammatic identity Θ−=(−1)hΘ, without presupposing a factorial evaluation.

17.1step 15.1step 16.1algebra

Since h+t≡m(mod2), steps 15.1 and 16.1 give Θ=(−1)m[t+1]L=[m]![n]![p]![h+1]![m+n]![n+p]![m+p]!. At p=0 this is [m+n+1], which checks the stated normalization: there is no extra sign, dimension, or scalar at a vertex.

18.1step 17.1algebra

The proved scalar expression gives the cross-multiplied closed-diagram strip identity [m+p][n+p]Θ(m,n,p)=[p][m+n+p+1]Θ(m,n,p−1) for p≥1. This is an identity of the specifically defined diagrams' evaluations because steps 1.1–17.1 derived their JW entries, nested cup/cap contractions, exponent factors, and finite sum. A pictorial strip manipulation or the theta recurrence has not been assumed as a premise. Over C(q) its unit factors can be divided to give Θ(m,n,p)/Θ(m,n,p−1)=[p][m+n+p+1]/([m+p][n+p]). Starting with Θ(m,n,0)=[m+n+1], the product telescopes as [m+n+1]∏j=1p[j][m+n+j+1][m+j][n+j]=[m]![n]![p]![h+1]![m+n]![m+p]![n+p]!. The analogous strip recurrence in m or n follows by relabelling the three bundles or by the proved symmetric expression.

19.1F1F2step 17.1step 18.1algebra

Each JW recursion coefficient is a rational Laurent function with denominators products of [j] for j≤M=max⁡(r,s,t), by [F2]. The actual theta diagram therefore belongs to the localization Z[q,q−1,[1]−1,…,[M]−1]. The right side of step 17.1 is in the same localization, since its only denominators are [r]![s]![t]!. Their equality over C(q) is consequently an equality in that localization and specializes at every point where these quantum integers are units, even if an intermediate norm formula or a quotient of two theta values has a zero denominator there. This specializes the final identity, rather than dividing a zero theta value at the root. The Laurent-polynomial convention of [F1] also covers q=±1.

20.1F1step 19.1algebra

Now let q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2. Every denominator index is at most ℓ−2, so its quantum integer is nonzero. If h≤ℓ−2, all numerator indices are at most ℓ−1, and [j]=sin⁡(jπ/ℓ)/sin⁡(π/ℓ)>0 in this range, so Θ>0. If h≥ℓ−1, then [h+1]! contains [ℓ]=0, while the denominator remains nonzero, so Θ=0. This uses no division by [ℓ] and no 0/0 limit, and covers even ℓ and ℓ=3. Labels outside a domain in which their required JW projectors exist are not unqualified root diagrams.

21.1F2F3F6step 17.1step 18.1step 19.1step 20.1algebra∎

Finally sandwich any matching t→r+s by pt and pr⊗ps. If an arc joins two points on the same labelled arm, its innermost turnback is killed by that arm's projector. The only remaining noncrossing matching is the stated m,n,p-bundled vertex. Thus its projected Hom space is spanned by α, and the reverse space by β, over the root field as well as generically. Their entire trace pairing is scalar multiplication by Θ. Nonzero Θ makes that vertex pairing nondegenerate; zero Θ makes the vertex have zero trace pairing against every reverse morphism, including an arbitrary reverse map after inserting the projectors and using cyclicity. This proves the stated root pairing conclusions without dividing by a forbidden-level theta value. Together with steps 17.1 and 18.1–20.1, it proves all claims.

Remarks

Chen's Theorem 3.2.3 explicitly states the theta formula and refers to Kauffman–Lins, Chapter 6, for a proof. The finite projector contraction and geometric-series summation above supply an independent local proof. The generic proof temporarily inverts the nonzero polynomials Za,j; root specialization uses only the final identity in the JW localization. It does not specialize those intermediate norm denominators or normalize a forbidden-level vertex by a vanishing theta value.

Depends on

Used by

Dependency tree · two levels

31 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