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
be a
commutative ring and fix
. The Temperley–Lieb algebra
is the
-algebra generated by the elements
, subject to the Jones relations:
for all
for all
for all
for all
such that
Using these relations, any product of generators
can be brought to Jones' normal form:
where
and
are two strictly increasing sequences in
. Elements of this type form a basis of the Temperley-Lieb algebra.
The dimensions of Temperley-Lieb algebras are Catalan numbers:
The Temperley–Lieb algebra
is a subalgebra of the
Brauer algebra
, and therefore also of the
partition algebra
. The Temperley–Lieb algebra
is
semisimple for
where
is a known, finite set. For a given
, all semisimple Temperley-Lieb algebras are isomorphic.
Diagram algebra
may be represented diagrammatically as the vector space over noncrossing pairings of
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
is the diagram in which the
-th and
-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
are:
From left to right, the unit 1 and the generators
,
,
,
.
Multiplication on basis elements can be performed by concatenation: placing two rectangles side by side, and replacing any closed loops by a factor
, for example
e1e4e3e2 x e2e4e3=\deltae1e4e3e2e4e3
:
× = =
.
The Jones relations can be seen graphically:
=
=
=
The five basis elements of
are the following:
.
From left to right, the unit 1, the generators
,
, and
,
.
Representations
Structure
For
such that
is semisimple, a complete set
of simple modules is parametrized by integers
with
. The dimension of a simple module is written in terms of
binomial coefficients as
} - \binom
A basis of the simple module
is the set
of monic noncrossing pairings from
points on the left to
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
: any such diagram can be cut into two elements of
for some
.
Then
acts on
by diagram concatenation from the left. (Concatenation can produce non-monic pairings, which have to be modded out.) The module
may be called a
standard module or
link module.
If
with
a root of unity,
may not be semisimple, and
may not be irreducible:
W\ellreducible\iff\existsj\in\{1,2,...,\ell\}, q2n-4\ell+2+2j=1
If
is reducible, then its quotient by its maximal proper submodule is irreducible.
Branching rules from the Brauer algebra
Simple modules of the Brauer algebra
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}}
W\ell\left(TLn(\delta)\right)
The coefficients
do not depend on
, and are given by
=
(-1)r\binom{\ell-r}{r}\binom{\ell-2r}{\ell-|λ|-2r}(\ell-|λ|-2r)!!
where
is the number of standard Young tableaux of shape
, given by the
hook length formula.
Affine Temperley-Lieb algebra
The affine Temperley-Lieb algebra
is an infinite-dimensional algebra such that
TLn(\delta)\subsetaTLn(\delta)
. It is obtained by adding generators
such that
for all
,
,
.The indices are supposed to be periodic i.e.
, and the Temperley-Lieb relations are supposed to hold for all
. Then
is central. A finite-dimensional quotient of the algebra
, sometimes called the
unoriented Jones-Temperley-Lieb algebra, is obtained byassuming
, and replacing non-contractible lines with the same factor
as contractible lines (for example, in the case
, this implies
).
The diagram algebra for
is deduced from the diagram algebra for
by turning rectangles into cylinders. The algebra
is infinite-dimensional because lines can wind around the cylinder. If
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
of
is generated by the set of monic pairings from
points to
points, just like the module
of
. However, the pairings are now on a cylinder, and the right-multiplication with
is identified with
for some
. If
, there is no right-multiplication by
, and it is the addition of a non-contractible loop on the right which is identified with
. Cell modules are finite-dimensional, with
}The cell module
is irreducible for all
, where the set
is countable. For
,
has an irreducible quotient. The irreducible cell modules and quotients thereof form a complete set of irreducible modules of
. Cell modules of the unoriented Jones-Temperley-Lieb algebra must obey
if
, and
if
.
Applications
Temperley–Lieb Hamiltonian
Consider an interaction-round-a-face model e.g. a square lattice model and let
be the number of sites on the lattice. Following Temperley and Lieb
[1] we define the Temperley–Lieb
Hamiltonian (the TL Hamiltonian) as
In what follows we consider the special case
.
We will firstly consider the case
. The TL Hamiltonian is
, namely
= 2 - - .
We have two possible states,
and .
In acting by
on these states, we find
= 2 - - = -,
and
= 2 - - = - + .
Writing
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
with the
lowest eigenvalue is known as the
ground state. In this case, the lowest eigenvalue
for
is
. The corresponding
eigenvector is
. As we vary the number of sites
we find the following table
[2]
|
|
|
|
---|
2 | (1) | 3 | (1, 1) |
4 | (2, 1) | 5 |
|
6 |
| 7 |
|
8 | (170,752,71,562,50,30,144,6,1)
| 9 |
|
|
|
|
|
|
where we have used the notation
-times e.g.,
.
An interesting observation is that the largest components of the ground state of
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=
\left(3j+1\right)
(n=2,4,6,...)
and for an odd numbers of sites
1,3,26,646,\ldots=
| (2j+1)!(6j+3)! |
(4j+2)!(4j+3)! |
(n=3,5,7,...)
Surprisingly, these sequences corresponded to well known combinatorial objects. For
even, this corresponds to cyclically symmetric transpose complement plane partitions and for
odd,, these correspond to
alternating sign matrices symmetric about the vertical axis.
XXZ spin chain
Further reading
- Book: Kauffman, Louis H. . Knots and Physics . 1991 . World Scientific . 978-981-02-0343-6 . en.
- Louis H.. Kauffman. Louis H. Kauffman. State Models and the Jones Polynomial. Topology. 1987. 26. 3. 395–407. 10.1016/0040-9383(87)90009-7. 0899057. free.
- Book: Baxter, Rodney J.. Rodney J. Baxter. Exactly solved models in statistical mechanics. Academic Press Inc.. London . 1982. 0690578. 0-12-083180-5 .
Notes and References
- 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.
- Batchelor. Murray. Murray Batchelor. de Gier. Jan . Nienhuis. Bernard. 2001. The quantum symmetric
chain at
, alternating-sign matrices and plane partitions. . 34. 19. L265–L270. 10.1088/0305-4470/34/19/101. 1836155. cond-mat/0101385. 118048447.
- 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.