Temperley–Lieb algebra explained

In statistical mechanics, the Temperley–Lieb algebra is an algebra from which are built certain transfer matrices, invented by Neville Temperley and Elliott Lieb. It is also related to integrable models, knot theory and the braid group, quantum groups and subfactors of von Neumann algebras.

Structure

Generators and relations

Let

R

be a commutative ring and fix

\delta\inR

. The Temperley–Lieb algebra

TLn(\delta)

is the

R

-algebra generated by the elements

e1,e2,\ldots,en-1

, subject to the Jones relations:
2
e
i

=\deltaei

for all

1\leqi\leqn-1

eiei+1ei=ei

for all

1\leqi\leqn-2

eiei-1ei=ei

for all

2\leqi\leqn-1

eiej=ejei

for all

1\leqi,j\leqn-1

such that

|i-j|1

Using these relations, any product of generators

ei

can be brought to Jones' normal form:

E=

(e
i1
e
i1-1

e
j1
)(e
i2
e
i2-1

e
j2
)(e
ir
e
ir-1

e
jr

)

where

(i1,i2,...,ir)

and

(j1,j2,...,jr)

are two strictly increasing sequences in

\{1,2,...,n-1\}

. Elements of this type form a basis of the Temperley-Lieb algebra.

The dimensions of Temperley-Lieb algebras are Catalan numbers:

\dim(TLn(\delta))=

(2n)!
n!(n+1)!

The Temperley–Lieb algebra

TLn(\delta)

is a subalgebra of the Brauer algebra

ak{B}n(\delta)

, and therefore also of the partition algebra

Pn(\delta)

. The Temperley–Lieb algebra

TLn(\delta)

is semisimple for

\delta\inC-Fn

where

Fn

is a known, finite set. For a given

n

, all semisimple Temperley-Lieb algebras are isomorphic.

Diagram algebra

TLn(\delta)

may be represented diagrammatically as the vector space over noncrossing pairings of

2n

points on two opposite sides of a rectangle with n points on each of the two sides.

The identity element is the diagram in which each point is connected to the one directly across the rectangle from it. The generator

ei

is the diagram in which the

i

-th and

(i+1)

-th point on the left side are connected to each other, similarly the two points opposite to these on the right side, and all other points are connected to the point directly across the rectangle.

The generators of

TL5(\delta)

are:

From left to right, the unit 1 and the generators

e1

,

e2

,

e3

,

e4

.

Multiplication on basis elements can be performed by concatenation: placing two rectangles side by side, and replacing any closed loops by a factor

\delta

, for example

e1e4e3e2 x e2e4e3=\deltae1e4e3e2e4e3

:

× = =

\delta

.

The Jones relations can be seen graphically:

=

\delta

=

=

The five basis elements of

TL3(\delta)

are the following:

.

From left to right, the unit 1, the generators

e2

,

e1

, and

e1e2

,

e2e1

.

Representations

Structure

For

\delta

such that

TLn(\delta)

is semisimple, a complete set

\{W\ell\}

of simple modules is parametrized by integers

0\leq\ell\leqn

with

\ell\equivn\bmod2

. The dimension of a simple module is written in terms of binomial coefficients as

\dim(W\ell)=\binom{n}{

n-\ell
2
} - \binom

A basis of the simple module

W\ell

is the set

Mn,\ell

of monic noncrossing pairings from

n

points on the left to

\ell

points on the right. (Monic means that each point on the right is connected to a point on the left.) There is a natural bijection between

\cup\begin{array{c}0\leq\ell\leqn\\ell\equivn\bmod2\end{array}}Mn,\ell x Mn,\ell

, and the set of diagrams that generate

TLn(\delta)

: any such diagram can be cut into two elements of

Mn,\ell

for some

\ell

.

Then

TLn(\delta)

acts on

W\ell

by diagram concatenation from the left. (Concatenation can produce non-monic pairings, which have to be modded out.) The module

W\ell

may be called a standard module or link module.

If

\delta=q+q-1

with

q

a root of unity,

TLn(\delta)

may not be semisimple, and

W\ell

may not be irreducible:

W\ellreducible\iff\existsj\in\{1,2,...,\ell\},q2n-4\ell+2+2j=1

If

W\ell

is reducible, then its quotient by its maximal proper submodule is irreducible.

Branching rules from the Brauer algebra

Simple modules of the Brauer algebra

ak{B}n(\delta)

can be decomposed into simple modules of the Temperley-Lieb algebra. The decomposition is called a branching rule, and it is a direct sum with positive integer coefficients:

Wλ\left(ak{B}n(\delta)\right)=oplus\begin{array{c}|λ|\leq\ell\leqn\\ell\equiv|λ|\bmod2\end{array}}

λ
c
\ell

W\ell\left(TLn(\delta)\right)

The coefficients
λ
c
\ell
do not depend on

n,\delta

, and are given by
λ
c
\ell

=

\ell-|λ|
2
f
r=0

(-1)r\binom{\ell-r}{r}\binom{\ell-2r}{\ell-|λ|-2r}(\ell-|λ|-2r)!!

where

fλ

is the number of standard Young tableaux of shape

λ

, given by the hook length formula.

Affine Temperley-Lieb algebra

The affine Temperley-Lieb algebra

aTLn(\delta)

is an infinite-dimensional algebra such that

TLn(\delta)\subsetaTLn(\delta)

. It is obtained by adding generators
-1
e
n,\tau,\tau
such that

\tauei=ei+1\tau

for all

1\leqi\leqn

,
2
e
1\tau

=e1e2en-1

,

\tau\tau-1=\tau-1\tau=id

.The indices are supposed to be periodic i.e.

en+1=e1,en=e0

, and the Temperley-Lieb relations are supposed to hold for all

1\leqi\leqn

. Then

\taun

is central. A finite-dimensional quotient of the algebra

aTLn(\delta)

, sometimes called the unoriented Jones-Temperley-Lieb algebra, is obtained byassuming

\taun=id

, and replacing non-contractible lines with the same factor

\delta

as contractible lines (for example, in the case

n=4

, this implies

e1e3e2e4e1e3=\delta2e1e3

).

The diagram algebra for

aTLn(\delta)

is deduced from the diagram algebra for

TLn(\delta)

by turning rectangles into cylinders. The algebra

aTLn(\delta)

is infinite-dimensional because lines can wind around the cylinder. If

n

is even, there can even exist closed winding lines, which are non-contractible.

The Temperley-Lieb algebra is a quotient of the corresponding affine Temperley-Lieb algebra.

The cell module

W\ell,z

of

aTLn(\delta)

is generated by the set of monic pairings from

n

points to

\ell

points, just like the module

W\ell

of

TLn(\delta)

. However, the pairings are now on a cylinder, and the right-multiplication with

\tau

is identified with

zid

for some

z\inC*

. If

\ell=0

, there is no right-multiplication by

\tau

, and it is the addition of a non-contractible loop on the right which is identified with

z+z-1

. Cell modules are finite-dimensional, with

\dim(W\ell,z)=\binom{n}{

n-\ell
2
}The cell module

W\ell,z

is irreducible for all

z\inC*-R(\delta)

, where the set

R(\delta)

is countable. For

z\inR(\delta)

,

W\ell,z

has an irreducible quotient. The irreducible cell modules and quotients thereof form a complete set of irreducible modules of

aTLn(\delta)

. Cell modules of the unoriented Jones-Temperley-Lieb algebra must obey

z\ell=1

if

\ell0

, and

z+z-1=\delta

if

\ell=0

.

Applications

Temperley–Lieb Hamiltonian

Consider an interaction-round-a-face model e.g. a square lattice model and let

n

be the number of sites on the lattice. Following Temperley and Lieb[1] we define the Temperley–Lieb Hamiltonian (the TL Hamiltonian) as

l{H}=

n-1
\sum
j=1

(\delta-ej)

In what follows we consider the special case

\delta=1

.

We will firstly consider the case

n=3

. The TL Hamiltonian is

l{H}=2-e1-e2

, namely

l{H}

= 2 - - .

We have two possible states,

and .

In acting by

l{H}

on these states, we find

l{H}

= 2 - - = -,

and

l{H}

= 2 - - = - + .

Writing

l{H}

as a matrix in the basis of possible states we have,

l{H}=\left(\begin{array}{rr} 1&-1\\ -1&1 \end{array}\right)

The eigenvector of

l{H}

with the lowest eigenvalue is known as the ground state. In this case, the lowest eigenvalue

λ0

for

l{H}

is

λ0=0

. The corresponding eigenvector is

\psi0=(1,1)

. As we vary the number of sites

n

we find the following table[2]

n

\psi0

n

\psi0

2(1)3(1, 1)
4(2, 1)5

(33,12)

6

(11,52,4,1)

7

(264,102,92,82,52,12)

8

(170,752,71,562,50,30,144,6,1)

9

(646,\ldots)

\vdots

\vdots

\vdots

\vdots

where we have used the notation

mj=(m,\ldots,m)

j

-times e.g.,

52=(5,5)

.

An interesting observation is that the largest components of the ground state of

l{H}

have a combinatorial enumeration as we vary the number of sites,[3] as was first observed by Murray Batchelor, Jan de Gier and Bernard Nienhuis. Using the resources of the on-line encyclopedia of integer sequences, Batchelor et al. found, for an even numbers of sites

1,2,11,170,\ldots=

n-2
2
\prod
j=0

\left(3j+1\right)

(2j)!(6j)!
(4j)!(4j+1)!

   (n=2,4,6,...)

and for an odd numbers of sites

1,3,26,646,\ldots=

n-3
2
\prod(3j+2)
j=0
(2j+1)!(6j+3)!
(4j+2)!(4j+3)!

   (n=3,5,7,...)

Surprisingly, these sequences corresponded to well known combinatorial objects. For

n

even, this corresponds to cyclically symmetric transpose complement plane partitions and for

n

odd,, these correspond to alternating sign matrices symmetric about the vertical axis.

XXZ spin chain

Further reading

Notes and References

  1. Neville. Temperley. Harold Neville Vazeille Temperley. Elliott H. Lieb. Elliott. Lieb. Relations between the 'percolation' and 'colouring' problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the 'percolation' problem. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 322. 1549 . 1971. 251–280. 0498284 . 10.1098/rspa.1971.0067. 77727. 1971RSPSA.322..251T. 122770421.
  2. Batchelor. Murray. Murray Batchelor. de Gier. Jan . Nienhuis. Bernard. 2001. The quantum symmetric

    XXZ

    chain at

    \Delta=-1/2

    , alternating-sign matrices and plane partitions. . 34. 19. L265–L270. 10.1088/0305-4470/34/19/101. 1836155. cond-mat/0101385. 118048447.
  3. de Gier. Jan. 2005. Loops, matchings and alternating-sign matrices. . 298. 1–3. 365–388. 10.1016/j.disc.2003.11.060. 2163456. math/0211285. 2129159.