In mathematics, planar algebras first appeared in the work of Vaughan Jones on the standard invariant of a II1 subfactor.[1] They also provide an appropriate algebraic framework for many knot invariants (in particular the Jones polynomial), and have been used in describing the properties of Khovanov homology with respect to tangle composition.[2] [3] Any subfactor planar algebra provides a family of unitary representations of Thompson groups.Any finite group (and quantum generalization) can be encoded as a planar algebra.[1]
The idea of the planar algebra is to be a diagrammatic axiomatization of the standard invariant.[1] [4]
A (shaded) planar tangle is the data of finitely many input disks, one output disk, non-intersecting strings giving an even number, say
2n
\star
Here, the mark is shown as a
\star
To compose two planar tangles, put the output disk of one into an input of the other, having as many intervals, same shading of marked intervals and such that the
\star
550px
The planar operad is the set of all the planar tangles (up to isomorphism) with such compositions.
A planar algebra is a representation of the planar operad; more precisely, it is a family of vector spaces
(l{P}n,\pm)n
n
T
r
2n0
2n1,...,2nr
ZT:
l{P} | |
n1,\epsilon1 |
⊗ … ⊗
l{P} | |
nr,\epsilonr |
\to
l{P} | |
n0,\epsilon0 |
with
\epsiloni\in\{+,-\}
\star
550px
The family of vector spaces
(l{T}n,\pm)n
2n
\star
The Temperley-Lieb planar algebra
l{TL}(\delta)
3
l{TL}3,+(\delta)
500px
Moreover, a closed string is replaced by a multiplication by
\delta
500px
Note that the dimension of
l{TL}n,\pm(\delta)
1 | |
n+1 |
\binom{2n}{n}
A semisimple and cosemisimple Hopf algebra over an algebraically closed field is encoded in a planar algebra defined by generators and relations, and "corresponds" (up to isomorphism) to a connected, irreducible, spherical, non degenerate planar algebra with non zero modulus
\delta
Note that connected means
\dim(l{P}0,\pm)=1
\dim(l{P}1,+)=1
A subfactor planar algebra is a planar
\star
(l{P}n,\pm)n
(1) Finite-dimensional:
\dim(l{P}n,\pm)<infty
(2) Evaluable:
l{P}0,\pm=C
(3) Spherical:
tr:=trr=trl
(4) Positive:
\langlea\vertb\rangle=tr(b\stara)
Note that by (2) and (3), any closed string (shaded or not) counts for the same constant
\delta
480px
The tangle action deals with the adjoint by:
ZT(a1 ⊗ a2 ⊗ … ⊗
\star | |
a | |
r) |
=
Z | |
T\star |
\star | |
(a | |
1 |
⊗
\star | |
a | |
2 |
⊗ … ⊗
\star | |
a | |
r |
)
with
T\star
T
\star | |
a | |
i |
ai
l{P} | |
ni,\epsiloni |
No-ghost theorem: The planar algebra
l{TL}(\delta)
a
\langlea\verta\rangle<0
\delta\in\{2\cos(\pi/n)|n=3,4,5,...\}\cup[2,+infty]
\delta
l{I}
a
\langlea\verta\rangle=0
l{TL}(\delta)/l{I}
l{TLJ}(\delta)
\delta
l{TLJ}(\delta)
A planar algebra
(l{P}n,\pm)
N\subseteqM
[M:N]=\delta2
l{P}n,+=N'\capMn-1
l{P}n,-=M'\capMn
trN'=trM
N'\capM
{\rmC}\star
The subfactor planar algebra associated to an inclusion of finite groups, does not always remember the (core-free) inclusion.
A Bisch-Jones subfactor planar algebra
l{BJ}(\delta1,\delta2)
l{TLJ}(\delta)
\delta1
\delta2
\deltai
[K:N]=
2 | |
\delta | |
1 |
[M:K]=
2 | |
\delta | |
2 |
The first finite depth subfactor planar algebra of index
\delta2>4
(5+\sqrt{13})/2\sim4.303
The subfactor planar algebras are completely classified for index at most
5
A subfactor planar algebra remembers the subfactor (i.e. its standard invariant is complete) if it is amenable. A finite depth hyperfinite subfactor is amenable.
About the non-amenable case: there are unclassifiably many irreducible hyperfinite subfactors of index 6 that all have the same standard invariant.
Let
N\subsetM
l{P}
l{P}
l{P}1,+=N'\capM1=C
N\subsetK\subsetM
M | |
e | |
K: |
L2(M)\toL2(K)
M | |
e | |
K |
\inl{P}2,+
M | |
id:=e | |
M |
M | |
e | |
N |
Note that
tr(e1)=\delta-2=[M:N]-1
tr(id)=1
Let the bijective linear map
l{F}:l{P}2,\pm\tol{P}2,\mp
1
90\circ
a*b
a
b
450px
Note that the word coproduct is a diminutive of convolution product. It is a binary operation.
The coproduct satisfies the equality
a*b=l{F}(l{F}-1(a)l{F}-1(b)).
For any positive operators
a,b
a*b
480px
Let
\overline{a}:=l{F}(l{F}(a))
a
180\circ
l{F}4
1
\overline{\overline{a}}=a
In the Kac algebra case, the contragredient is exactly the antipode, which, for a finite group, correspond to the inverse.
A biprojection is a projection
b\inl{P}2,+\setminus\{0\}
l{F}(b)
M | |
e | |
N |
M | |
id=e | |
M |
480px
A projection
b
M | |
e | |
K |
N\subsetK\subsetM
e1\leb=\overline{b}=λb*b,withλ-1=\deltatr(b)
Galois correspondence: in the Kac algebra case, the biprojections are 1-1 with the left coideal subalgebras, which, for a finite group, correspond to the subgroups.
For any irreducible subfactor planar algebra, the set of biprojections is a finite lattice, of the form
[e1,id]
[H,G]
Using the biprojections, we can make the intermediate subfactor planar algebras.
The uncertainty principle extends to any irreducible subfactor planar algebra
l{P}
Let
l{S}(x)=Tr(R(x))
R(x)
x
Tr
Tr=\deltantr
l{P}n,\pm
Noncommutative uncertainty principle: Let
x\inl{P}2,\pm
l{S}(x)l{S}(l{F}(x))\ge\delta2
x
l{F}(x)
x
x