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 be an indeterminate, let for , let , and set . For nonnegative integers , put Equivalently, satisfies the triangle inequalities and even-sum condition, with , , and . All Jones–Wenzl projectors below have identity coefficient one and are unnormalized.
Let be nested cups, whose outputs are two consecutive -strand bundles: cup joins position of the first bundle to position of the second. Let be its horizontal reflection. Define Thus the pairwise bundles at each trivalent vertex have sizes : there are strands between arms , between arms , and between arms . This fixes the vertex without a further scalar normalization. The theta net has the three JW-labelled edges , since idempotence collapses the doubled projectors. Its value is For the closed-diagram strip recurrence is
These identities specialize to every complex for which for , using the Laurent-polynomial convention at . These hypotheses construct the three projectors and make every displayed denominator a unit; need not be nonzero. In particular, if , , and , then when , whereas when . The latter vertex has zero trace pairing against every reverse morphism. No undefined higher root projector or convention is used.
Facts & Assumptions
Given: The stated , the positive-loop diagram convention, the nested cup/cap maps , the unnormalized closure trace, and initially the field . For the specialization conclusion, and 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.
Quantum integers satisfy , , and . For the convention at is (Temperley–Lieb quantum integers and quantum characteristic, Definition).
The JW projector has “coefficient on the identity diagram,” is nonzero and idempotent, and is annihilated on both sides by the elementary generators. Its corner is , and (Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure, Statement). For , its defining recursion is with . The initial values are , ; the construction uses only the stated unit denominator quantum integers (Jones–Wenzl recursion over unit quantum integers, Definition).
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).
The elementary cup-cap generators satisfy , , , and distant commutation (The elementary diagram generators satisfy the local Temperley–Lieb relations, Statement).
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).
Closing a basis diagram with circles has value , 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).
“The homomorphism sending to 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
Work first over . Let have ordered basis , and define and , , . Direct evaluation on and gives both snakes and , while . Thus cup , cap 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 , with no quantum-group input.
Write and . In the two weight-zero words the nonzero block is , which is symmetric under ordinary transpose. The generators satisfy the positive-loop relations by the two snakes and ; consequently [F7] makes an algebra isomorphism between the positive- and negative-loop diagram endomorphism algebras, with its own inverse of the same form.
Under loop , the quantum integers are , by the recurrence in [F1]. Substitution in the JW recursion shows inductively that the isomorphism takes the positive projector to the negative-loop projector . Its evaluated matrix is therefore the positive-loop JW recursion matrix built from the displayed symmetric : it is symmetric, idempotent, annihilated by every , and is identity plus nonempty -words.
For a word of length , let count its minus signs, and let count pairs consisting of a minus before a plus. Put and . The equation says that the coefficient of a word with in positions is times the coefficient of the otherwise identical word with there. Adjacent swaps connect all words with fixed , and replacing by increases inversion number by one. Hence the common kernel in that weight space is exactly . The image of lies in the common kernel; conversely its nonidentity generator words kill that kernel by their rightmost factor, so acts as identity there.
A symmetric rank-one projector with image is . Here is a nonzero polynomial with constant term one, so it is invertible in . Thus the actual JW matrix, rather than a substitute projector, has entries This includes with the empty word and .
Put and write for the Gaussian polynomial. Appending a plus to a word with minuses creates inversions, whereas appending a minus creates none. Therefore , with . This is the Gaussian polynomial recurrence with the same initial values; induction gives . Also , so conversion of the three factorials gives All inversions here occur in ; root specialization will follow only after denominators have been put in the stated unit range.
The negative planar trace in this evaluation has pivotal matrix , where . Indeed the bilinear matrix of is , and the symmetric planar transpose relation gives exactly ; equivalently the corresponding direct cup/cap closure of a matrix is . Tensoring this closure gives on . The basis of has weights , so the negative-loop trace is The diagram corner is scalar by [F2], also seen directly because an innermost turnback kills every nonidentity matching. The vector is fixed by and detects that scalar. Thus no faithfulness claim about arbitrary diagram Hom spaces is needed to recover the scalar used below.
Form the same in the negative-loop diagram category, and denote the theta value by . For a word of length , let be its bitwise complement followed by reversal. The prescribed nested cups and caps give and is zero on other pairings of the two word bundles. This follows by multiplying the fundamental coefficients: a plus in contributes cup coefficient one and cap coefficient ; a minus contributes cup coefficient and cap coefficient one. The reversed order is exactly the nesting in the Statement.
The negative-loop diagram is in the scalar corner, so write its evaluated matrix as . On the outer factors may be omitted: they fix this vector, all maps preserve total weight, and weight in is the one-dimensional space . Idempotence removes the doubled middle projectors. Hence is exactly the coefficient on obtained by applying to .
Let have minus signs and . Its output is with coefficient . The two word inversion counts are and , since complement followed by reversal preserves inversions. Substitution in the actual projector entries of step 5.1, then summation over words with this fixed , gives Here the sum of over those words is precisely .
In applying to the th tensor in step 10.1, only word pairs can leave all of its leftmost and rightmost through positions plus. Their contraction coefficient on is , by the same inversion count and the cap formula in step 8.1. Therefore every contraction is accounted for in This is an evaluation of the specified bundled, projector-labelled diagram, rather than an asserted strip identity.
Substituting step 6.1 into the quotient of factors in step 11.1 contributes exponent and factorial factor . Consequently The exponent simplification is , so no omitted scalar or power of enters this norm contraction.
For the formal power series identity follows coefficientwise. If denotes the right-hand coefficient, multiplying by gives . The Gaussian polynomial on the left has the identical recurrence, since , and the initial values are and . This Pascal identity follows by clearing the ordinary -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.
Apply step 13.1 to the adjacent exponent intervals and . Their geometric-series products multiply to the product for the whole interval . The coefficient of is therefore The summand uses degree from the negative interval and degree from the nonnegative interval. Shifting all exponents of the combined interval up by and applying step 13.1 with gives the right side. This proves the finite q-Vandermonde identity used here.
Divide a summand of by . Its factorial part is the product of the symmetric quantum binomials . Converting these to Gaussian polynomials by step 6.1 changes their combined prefactor to . Thus step 14.1 gives the symmetric binomial after this same conversion, and hence Substitution into step 12.1 proves Every sum and exponent in this evaluation has therefore been derived independently of a theta formula or recoupling coefficient.
The negative diagram satisfies by step 7.1. To compare it with the desired positive-loop theta, expand all three projectors as generator words. Under , a term with a total of generator insertions gains coefficient sign , by step 3.1. With no insertions its closed matching has exactly circles: cup/cap circles and 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 . Consequently the total count for a term with insertions satisfies , including components removed during stacking. Evaluating its loops at gives sign , so its combined sign is always . Summing the terms proves the diagrammatic identity , without presupposing a factorial evaluation.
Since , steps 15.1 and 16.1 give At this is , which checks the stated normalization: there is no extra sign, dimension, or scalar at a vertex.
The proved scalar expression gives the cross-multiplied closed-diagram strip identity for . 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 its unit factors can be divided to give . Starting with , the product telescopes as The analogous strip recurrence in or follows by relabelling the three bundles or by the proved symmetric expression.
Each JW recursion coefficient is a rational Laurent function with denominators products of for , by [F2]. The actual theta diagram therefore belongs to the localization . The right side of step 17.1 is in the same localization, since its only denominators are . Their equality over 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 .
Now let , , and . Every denominator index is at most , so its quantum integer is nonzero. If , all numerator indices are at most , and in this range, so . If , then contains , while the denominator remains nonzero, so . This uses no division by and no limit, and covers even and . Labels outside a domain in which their required JW projectors exist are not unqualified root diagrams.
Finally sandwich any matching by and . 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 -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 ; 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
- Jones–Wenzl recursion over unit quantum integers
- Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure
- Diagram closure trace is cyclic and satisfies the tower rules
- Unnormalized diagram closure and partial trace
- Temperley–Lieb planar diagram data and endomorphism modules
- Stacking is associative and horizontal juxtaposition is strict monoidal
- The elementary diagram generators satisfy the local Temperley–Lieb relations
- Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram
- The generator presentation is the planar diagram algebra over every commutative ring
- Temperley–Lieb quantum integers and quantum characteristic
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
- Joshua Chen, The Temperley-Lieb Categories and Skein Modules (standard reference, not scraped)