Planar Algebra

In mathematics, planar algebras first appeared in the work of Vaughan Jones on the standard invariant of a II₁ subfactor.
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. 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.

Definition

The idea of the planar algebra is to be a diagrammatic axiomatization of the standard invariant.

Planar tangle

A (shaded) planar tangle is the data of finitely many ''input'' disks, one ''output'' disk, non-intersecting strings giving an even number, say $2n$, intervals per disk and one $\star$-marked interval per disk.

200px

Here, the mark is shown as a $\star$-shape. On each input disk it is placed between two adjacent outgoing strings, and on the output disk it is placed between two adjacent incoming strings. A planar tangle is defined up to isotopy.

Composition

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$-marked intervals coincide. Finally we remove the coinciding circles. Note that two planar tangles can have zero, one or several possible compositions.

550px

Planar operad

The planar operad is the set of all the planar tangles (up to isomorphism) with such compositions.

Planar algebra

A planar algebra is a ''representation'' of the planar operad; more precisely, it is a family of vector spaces $(\mathcal_)_$, called $n$-box spaces, on which ''acts'' the planar operad, i.e. for any tangle $T$ (with one output disk and $r$ input disks with $2n_0$ and $2n_1, \dots, 2n_r$ intervals respectively) there is a multilinear map
: $Z_T : \mathcal_ \otimes \cdots \otimes \mathcal_ \to \mathcal_$

with $\epsilon_i \in \$ according to the shading of the $\star$-marked intervals, and these maps (also called partition functions) respect the composition of tangle in such a way that all the diagrams as below commute.

550px

Examples

Planar tangles

The family of vector spaces $(\mathcal_)_$ generated by the planar tangles having $2n$ intervals on their ''output'' disk and a white (or black) $\star$-marked interval, admits a planar algebra structure.

Temperley–Lieb

The Temperley-Lieb planar algebra $\mathcal(\delta)$ is generated by the planar tangles without input disk; its $3$-box space $\mathcal_(\delta)$ is generated by

500px

Moreover, a closed string is replaced by a multiplication by $\delta$.

500px

Note that the dimension of $\mathcal_(\delta)$ is the Catalan number $\frac\binom$.
This planar algebra encodes the notion of Temperley–Lieb algebra.

Hopf algebra

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$ and of depth two.

Note that ''connected'' means $\dim(\mathcal_) = 1$ (as for ''evaluable'' below), ''irreducible'' means $\dim(\mathcal_) = 1$, ''spherical'' is defined below, and ''non-degenerate'' means that the traces (defined below) are non-degenerate.

Subfactor planar algebra

Definition

A subfactor planar algebra is a planar $\star$-algebra $(\mathcal_)_$ which is:
: (1) Finite-dimensional: $\dim (\mathcal_) < \infty$
: (2) Evaluable: $\mathcal_ = \mathbb$
: (3) Spherical: $tr:=tr_r = tr_l$
: (4) Positive: $\langle a \vert b \rangle = tr(b^a)$ defines an inner product.

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:
: $Z_T(a_1 \otimes a_2 \otimes \cdots \otimes a_r)^ = Z_(a_1^ \otimes a_2^ \otimes \cdots \otimes a_r^)$

with $T^$ the mirror image of $T$ and $a_i^$ the adjoint of $a_i$ in $\mathcal_$.

Examples and results

''No-ghost theorem'': The planar algebra $\mathcal(\delta)$ has no ghost (i.e. element $a$ with $\langle a \vert a \rangle < 0$) if and only if
: \delta \in \ \cup , +\infty
For $\delta$ as above, let $\mathcal$ be the null ideal (generated by elements $a$ with $\langle a \vert a \rangle = 0$). Then the quotient $\mathcal(\delta)/\mathcal$ is a subfactor planar algebra, called the Temperley–Lieb-Jones subfactor planar algebra $\mathcal(\delta)$. Any subfactor planar algebra with constant $\delta$ admits $\mathcal(\delta)$ as planar subalgebra.

A planar algebra $(\mathcal_)$ is a subfactor planar algebra if and only if it is the standard invariant of an extremal subfactor $N \subseteq M$ of index :N= \delta^2 , with $\mathcal_= N' \cap M_$ and $\mathcal_= M' \cap M_$.
A finite depth or irreducible subfactor is extremal ($tr_ = tr_$ on $N' \cap M$).

There is a subfactor planar algebra encoding any finite group (and more generally, any finite dimensional Hopf $^$-algebra, called Kac algebra), defined by generators and relations. A (finite dimensional) Kac algebra "corresponds" (up to isomorphism) to an irreducible subfactor planar algebra of depth two.

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 $\mathcal(\delta_1, \delta_2)$ (sometimes called Fuss-Catalan) is defined as for $\mathcal(\delta)$ but by allowing two colors of string with their own constant $\delta_1$ and $\delta_2$, with $\delta_i$ as above. It is a planar subalgebra of any subfactor planar algebra with an intermediate such that :N= \delta_1^2 and :K= \delta_2^2 .

The first finite depth subfactor planar algebra of index $\delta^2 > 4$ is called the Haagerup subfactor planar algebra. It has index $(5+\sqrt)/2 \sim 4.303$.

The subfactor planar algebras are completely classified for index at most $5$
and a bit beyond.
This classification was initiated by Uffe Haagerup.
It uses (among other things) a listing of possible principal graphs, together with the embedding theorem
and the jellyfish algorithm.

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.

Fourier transform and biprojections

Let $N \subset M$ be a finite index subfactor, and $\mathcal$ the corresponding subfactor planar algebra. Assume that $\mathcal$ is irreducible (i.e. $\mathcal_ = N' \cap M_1 = \mathbb$). Let $N \subset K \subset M$ be an intermediate subfactor. Let the Jones projection $e^M_K: L^2(M) \to L^2(K)$. Note that $e^M_K \in \mathcal_$. Let $id:=e^M_M$ and $e_1:=e^M_N$.

410px

Note that tr(e_1) = \delta^ = :N and $tr(id) = 1$.

Let the bijective linear map $\mathcal: \mathcal_ \to \mathcal_$ be the Fourier transform, also called $1$-click (of the outer star) or $90^$ rotation; and let $a * b$ be the coproduct of $a$ and $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 = \mathcal(\mathcal^(a) \mathcal^(b)).$

For any positive operators $a,b$, the coproduct $a*b$ is also positive; this can be seen diagrammatically:

480px

Let $\overline := \mathcal(\mathcal(a))$ be the contragredient $a$ (also called $180^$ rotation). The map $\mathcal^$ corresponds to four $1$-clicks of the outer star, so it's the identity map, and then $\overline = 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 \in \mathcal_ \setminus \$ with $\mathcal(b)$ a multiple of a projection.
Note that $e_1=e^M_N$ and $id=e^M_M$ are biprojections; this can be seen as follows:

480px

A projection $b$ is a biprojection iff it is the Jones projection $e^M_K$ of an intermediate subfactor $N \subset K \subset M$, iff $e_1 \le b=\overline = \lambda b * b, \text \lambda^ = \delta tr(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 _1,id , as for an interval of finite groups ,G.

Using the biprojections, we can make the intermediate subfactor planar algebras.

The uncertainty principle extends to any irreducible subfactor planar algebra $\mathcal$:

Let $\mathcal(x) = Tr(R(x))$ with $R(x)$ the range projection of $x$ and $Tr$ the unnormalized trace (i.e. $Tr = \delta^n tr$ on $\mathcal_$).

Noncommutative uncertainty principle:

Let $x \in \mathcal_$, nonzero. Then
: $\mathcal(x) \mathcal(\mathcal(x)) \ge \delta^$
Assuming $x$ and $\mathcal(x)$ positive, the equality holds if and only if $x$ is a biprojection. More generally, the equality holds if and only if $x$ is the ''bi-shift'' of a biprojection.

References

{{reflist, 2

Operator algebras
Diagram algebras
Knot theory