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.
Every boundary tensor-ideal component is the fixed embedded two-sided ideal
Statement
Let , , , and . Put and
If is the categorical tensor ideal generated by , then at every rank. Moreover, for , . Thus this single embedded two-sided ideal already contains every annular consequence with arbitrary external strands and cups/caps. Below the boundary its component is zero, including contractions given by a partial trace rather than an internal turnback.
Facts & Assumptions
Given: The complex diagram category and the exact boundary projector.
Temperley–Lieb planar diagram data and endomorphism modules, Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram and The elementary diagram generators satisfy the local Temperley–Lieb relations give the matching basis, cup/cap snakes and generator relations.
Unnormalized diagram closure and partial trace and Diagram closure trace is cyclic and satisfies the tower rules give unnormalized partial closure and its composition rules.
Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives , its one-dimensional corner and .
Temperley–Lieb quantum integers and quantum characteristic gives , for , and .
Proof
For write . Closing matching graphs gives -bilinearity and . For , it also gives . In this latter range, for , Indeed the two neighboring cups/caps close precisely the last input/output strand of , leaving its other strands and the final cup/cap unchanged; every closed component contributes the same factor on both sides. For this gives , fixing the unnormalized factor. Since is generated by and , this identity reduces every alternating word with two final generators to one with fewer such occurrences. Hence is spanned by .
To handle arbitrary-size morphisms we give an auxiliary diagram factorization. It does not identify a positive-loop pivotal category with the quantum ribbon category. Choose , so , and put . Its inverse is because . The adjacent triple expansion gives Yang–Baxter, with remaining coefficient . Let and . The snakes give , and , whence Reflection gives the two corresponding cap slides. Thus ordered block crossings are natural with every matching, since cups, caps and identities generate those morphisms; linearity gives naturality with arbitrary diagram elements. Partitioning a block proves both block-crossing identities, and the triple relation identifies the ordered crossing words. All crossings used here are finite linear combinations of ordinary diagrams.
Every nonempty generator word kills on its appropriate side, so . The boundary partial trace is Its denominator is nonzero by [F4]. Thus . This covers a seam contraction even when no two adjacent input endpoints of the projector are joined by a cap.
Denote by the planar curl of this auxiliary block crossing. Closing one strand gives . The cup/cap slides of step 1.2 give where closes the last strands. To verify the second identity, close those strands from right to left, slide each cap through its block crossing by the displayed cap equations, then remove its matching cup by a snake. One remaining strand acquires the scalar curl ; the unclosed strands retain the two block-crossing words in the first identity. Induction, beginning with the computed one-strand value, proves both formulas. In particular is times a product of invertible crossings, so its inverse exists in . This is a calculation inside the positive-loop diagram category, independent of any universal quantum .
Inclusion gives . We prove by induction; below it is trivial and at it is step 2.1. Let , so the embedded generator is in . Expand each multiplier of a generator by the spanning formula of step 1.1. With all and , the four types are , , , and . Their partial traces are, respectively, The first three belong to . In the fourth, the induction hypothesis puts the middle factor in , whose inclusion belongs to , or is zero at the boundary. This proves trace closure. Iterated partial traces consequently carry into for every .
Fix arbitrary , and , with . Set and form the actual element The tensor is an endomorphism of object : its source has strands and its target strands. Its middle factor equals , so . Naturality gives , so also . Pulling maps on the untraced wires outside the closure and using step 2.2 now gives By step 3.1 this belongs to , even when , where it is zero. This is an explicit factorization for all external strands and all seam contractions, not a claim that every low-rank diagram has an internal cap against .
A tensor-ideal word containing is a finite sum of composites . If it contains further copies of , expand those in their finite matching basis and absorb them into the multipliers, leaving one distinguished copy. Naturality with the auxiliary crossings moves to by an invertible conjugation, absorbed in . Step 4.1 therefore puts every such consequence in , proving . Conversely tensoring with identities and composing on either side puts the generators and all their two-sided multiples in . Hence . Their equality and all partial-trace assertions follow, including the zero components below .
Depends on
- Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure
- Unnormalized diagram closure and partial trace
- Diagram closure trace is cyclic and satisfies the tower rules
- Temperley–Lieb planar diagram data and endomorphism modules
- Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram
- The elementary diagram generators satisfy the local Temperley–Lieb relations
- Temperley–Lieb quantum integers and quantum characteristic
Used by
Dependency tree · two levels
13 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)