Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Temperley–Lieb planar diagram data and endomorphism modules

Definition

Let R be a commutative ring with unit (Algebras over a commutative ring, central structure maps, and algebra homomorphisms) and let δ∈R. The object labels are the nonnegative integers n=0,1,2,…. For labels m,n, place bottom points b1,…,bm and top points t1,…,tn along the rectangle from left to right on their respective edges. Their cyclic order is t1,…,tn,bm,…,b1. When m=n=0, the empty matching is included.

An (m,n) diagram is a perfect matching of these m+n boundary labels which is noncrossing: there are no four labels a,b,c,d in cyclic order whose matched pairs are {a,c} and {b,d}. 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 m+n is odd, there are no such diagrams. Write D(m,n) for this set and define the R-module

MR(m,n):=R(D(m,n)),

the free R-module on the set of diagrams (The free module on a set and its standard basis). In particular, its diagram basis is empty when m+n is odd.

For basis diagrams D:m→n and E:n→p, stack E above D and identify the n 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 δc, where c is the number of removed cycles. Denote this output by E∘D and extend the rule R-bilinearly to a map MR(n,p)×MR(m,n)→MR(m,p). A following result proves closure of these operations on the diagram modules and the category axioms.

The matching 1n:n→n pairs each bottom point to the top point directly above it. Horizontal juxtaposition, with the left diagram placed first, defines m⊗m′=m+m′ on object labels and D⊗D′ on basis diagrams; extend it R-bilinearly to the modules. A following result proves that these operations give a strict monoidal category.

For 1≤i<n, let di∈MR(n,n) be the diagram with a cap joining top points i,i+1, a cup joining bottom points i,i+1, and vertical through strands at every other position. Define TLn(R,δ) to be the R-module MR(n,n) with bilinear multiplication xy:=x∘y and distinguished element 1n. A following result proves that it is a unital associative R-algebra and identifies it with the endomorphism algebra at object n.

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 d1 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.

t1t2t3b1b2b3

These data are over a commutative ring; associativity and the R-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

…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