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.
Temperley–Lieb planar diagram data and endomorphism modules
Definition
Let be a commutative ring with unit (Algebras over a commutative ring, central structure maps, and algebra homomorphisms) and let . The object labels are the nonnegative integers . For labels , place bottom points and top points along the rectangle from left to right on their respective edges. Their cyclic order is . When , the empty matching is included.
An diagram is a perfect matching of these boundary labels which is noncrossing: there are no four labels in cyclic order whose matched pairs are and . A picture consists of disjoint arcs realizing the matching; equality is equality of the matching, so planar deformation that fixes the boundary does not change a diagram. If is odd, there are no such diagrams. Write for this set and define the -module
the free -module on the set of diagrams (The free module on a set and its standard basis). In particular, its diagram basis is empty when is odd.
For basis diagrams and , stack above and identify the matching boundary points. The resulting finite graph has degree two at each identified point, where degree means the number of incident arcs. Each component is a path joining two exterior boundary points or a closed cycle. Remove every cycle and multiply the remaining exterior matching by , where is the number of removed cycles. Denote this output by and extend the rule -bilinearly to a map . A following result proves closure of these operations on the diagram modules and the category axioms.
The matching pairs each bottom point to the top point directly above it. Horizontal juxtaposition, with the left diagram placed first, defines on object labels and on basis diagrams; extend it -bilinearly to the modules. A following result proves that these operations give a strict monoidal category.
For , let be the diagram with a cap joining top points , a cup joining bottom points , and vertical through strands at every other position. Define to be the -module with bilinear multiplication and distinguished element . A following result proves that it is a unital associative -algebra and identifies it with the endomorphism algebra at object .
The left factor is stacked above the right factor. The loop value is ; no invertibility or nonzero condition on is part of these data.
Remarks
This TikZ picture shows on three strands. The top and bottom labels increase left to right; the cap is on top, the cup is on the bottom, and the third strand passes through. The algebraic definition is the matching on labeled boundary points, not the drawing.
These data are over a commutative ring; associativity and the -algebra structure are proved on this page. They make no semisimplicity, trace, cellularity, or Hecke-quotient assertion. The published localized Hecke quotient The Temperley-Lieb quotient and the Jones specialization uses idempotent generators and a separate parameter conversion; the diagram/presentation isomorphism is proved locally below.
Depends on
Used by
- A zero Temperley–Lieb cell form can have a nonzero simple module Counterexample
- At loop value zero, a local generator is nilpotent but nonzero Counterexample
- Finite diagram tower inclusion and normalized right closure Definition
- Jones–Wenzl recursion in the nonvanishing-denominator range Definition
- Jones–Wenzl recursion over unit quantum integers Definition
- Negligible morphisms for a pivotal trace Definition
- Negligible morphisms in the Temperley–Lieb category Definition
- Normalized Temperley–Lieb trace from diagram closure Definition
- Temperley–Lieb link-state standard modules by defect number Definition
- Unnormalized diagram closure and partial trace Definition
- At loop value zero the normalized closure trace is undefined Example
- At q squared of order three, TL2 is semisimple with a degenerate Jones trace Example
- At the order-three root the trace degenerates on a semisimple block Example
- Right closure on the five rank-three diagrams Example
- The rank-three one-defect link-state module Example
- The two-strand Jones-Wenzl projector at loop value two Example
- A Jones–Wenzl annihilator exists exactly when the trivial module is projective Lemma
- Diagram closure trace is cyclic and satisfies the tower rules Lemma
- Every boundary tensor-ideal component is the fixed embedded two-sided ideal Lemma
- Exact Temperley–Lieb truncation reduces decomposition to trivial factors Lemma
- General Temperley–Lieb theta-net evaluation and its root domain Lemma
- Jones–Wenzl existence over a field is detected by one quantum-binomial row Lemma
- Jones–Wenzl projectors over a coefficient ring and quantum-binomial units Lemma
- Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure Lemma
- Negligible Temperley–Lieb morphisms form a tensor ideal Lemma
- Normalized right closure preserves the diagram trace radical Lemma
- Restriction of a link-state module has a two-step filtration Lemma
- Right closure is a trace-preserving diagram-tower expectation Lemma
- Root fusion paths have nonzero pairings Lemma
- The elementary diagram generators satisfy the local Temperley–Lieb relations Lemma
- The integral two-letter Temperley–Lieb representation has a linear left inverse Lemma
- The Jones–Wenzl recursion gives annihilating idempotents and their trace Lemma
- The link-state Gram form is symmetric and invariant Lemma
- The link-state quotient is a right Temperley–Lieb module Lemma
- The normalized closure trace is cyclic and satisfies the Markov rules Lemma
- The zero-loop perfect-matching standard module is simple Lemma
- Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram Theorem
- Stacking is associative and horizontal juxtaposition is strict monoidal Theorem
- The generator presentation is the planar diagram algebra over every commutative ring Theorem
- The rank-n diagram basis is counted by the nth Catalan number Theorem
…and 1 more result.
Dependency tree · two levels
6 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
- David Ridout and Yvan Saint-Aubin, Standard Modules, Induction and the Structure of the Temperley-Lieb Algebra, §2 (standard reference, not scraped)
- Dana C. Ernst, Michael G. Hastings, and Sarah K. Salmon, Factorization of Temperley–Lieb diagrams (standard reference, not scraped)
- Vaughan F. R. Jones, The Jones Polynomial, author-hosted notes (standard reference, not scraped)