Planar algebra

From testwiki
Jump to navigation Jump to search

Template:Technical 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.[4] Any finite group (and quantum generalization) can be encoded as a planar algebra.[1]

Definition

The idea of the planar algebra is to be a diagrammatic axiomatization of the standard invariant.[1][5][6]

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 -marked interval per disk.

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

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 (𝒫n,±)n, 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 2n0 and 2n1,,2nr intervals respectively) there is a multilinear map

ZT:𝒫n1,ϵ1𝒫nr,ϵr𝒫n0,ϵ0

with ϵi{+,} according to the shading of the -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.

Examples

Planar tangles

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

Temperley–Lieb

The Temperley-Lieb planar algebra 𝒯(δ) is generated by the planar tangles without input disk; its 3-box space 𝒯3,+(δ) is generated by

Moreover, a closed string is replaced by a multiplication by δ.

Note that the dimension of 𝒯n,±(δ) is the Catalan number 1n+1(2nn). 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 δ and of depth two.[7]

Note that connected means dim(𝒫0,±)=1 (as for evaluable below), irreducible means dim(𝒫1,+)=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 -algebra (𝒫n,±)n which is:

(1) Finite-dimensional: dim(𝒫n,±)<
(2) Evaluable: 𝒫0,±=
(3) Spherical: tr:=trr=trl
(4) Positive: a|b=tr(ba) defines an inner product.

Note that by (2) and (3), any closed string (shaded or not) counts for the same constant δ.

The tangle action deals with the adjoint by:

ZT(a1a2ar)=ZT(a1a2ar)

with T the mirror image of T and ai the adjoint of ai in 𝒫ni,ϵi.

Examples and results

No-ghost theorem: The planar algebra 𝒯(δ) has no ghost (i.e. element a with a|a<0) if and only if

δ{2cos(π/n)|n=3,4,5,...}[2,+]

For δ as above, let be the null ideal (generated by elements a with a|a=0). Then the quotient 𝒯(δ)/ is a subfactor planar algebra, called the Temperley–Lieb-Jones subfactor planar algebra 𝒯𝒥(δ). Any subfactor planar algebra with constant δ admits 𝒯𝒥(δ) as planar subalgebra.

A planar algebra (𝒫n,±) is a subfactor planar algebra if and only if it is the standard invariant of an extremal subfactor NM of index [M:N]=δ2, with 𝒫n,+=NMn1 and 𝒫n,=MMn.[8][9][10] A finite depth or irreducible subfactor is extremal (trN=trM on NM).

There is a subfactor planar algebra encoding any finite group (and more generally, any finite dimensional Hopf C-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.[11][12]

The subfactor planar algebra associated to an inclusion of finite groups,[13] does not always remember the (core-free) inclusion.[14][15]

A Bisch-Jones subfactor planar algebra 𝒥(δ1,δ2) (sometimes called Fuss-Catalan) is defined as for 𝒯𝒥(δ) but by allowing two colors of string with their own constant δ1 and δ2, with δi as above. It is a planar subalgebra of any subfactor planar algebra with an intermediate such that [K:N]=δ12 and [M:K]=δ22.[16][17]

The first finite depth subfactor planar algebra of index δ2>4 is called the Haagerup subfactor planar algebra.[18] It has index (5+13)/24.303.

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

A subfactor planar algebra remembers the subfactor (i.e. its standard invariant is complete) if it is amenable.[24] 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.[25]

Fourier transform and biprojections

Let NM be a finite index subfactor, and 𝒫 the corresponding subfactor planar algebra. Assume that 𝒫 is irreducible (i.e. 𝒫1,+=NM1=). Let NKM be an intermediate subfactor. Let the Jones projection eKM:L2(M)L2(K). Note that eKM𝒫2,+. Let id:=eMM and e1:=eNM.

Note that tr(e1)=δ2=[M:N]1 and tr(id)=1.

Let the bijective linear map :𝒫2,±𝒫2, 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.

Note that the word coproduct is a diminutive of convolution product. It is a binary operation.

The coproduct satisfies the equality a*b=(1(a)1(b)).

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

Let a:=((a)) be the contragredient a (also called 180 rotation). The map 4 corresponds to four 1-clicks of the outer star, so it's the identity map, and then a=a.

In the Kac algebra case, the contragredient is exactly the antipode,[12] which, for a finite group, correspond to the inverse.

A biprojection is a projection b𝒫2,+{0} with (b) a multiple of a projection. Note that e1=eNM and id=eMM are biprojections; this can be seen as follows:

A projection b is a biprojection iff it is the Jones projection eKM of an intermediate subfactor NKM,[27] iff e1b=b=λb*b, with λ1=δtr(b).[28][26]

Galois correspondence:[29] 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,[30] of the form [e1,id], as for an interval of finite groups [H,G].

Using the biprojections, we can make the intermediate subfactor planar algebras.[31][32]

The uncertainty principle extends to any irreducible subfactor planar algebra 𝒫:

Let 𝒮(x)=Tr(R(x)) with R(x) the range projection of x and Tr the unnormalized trace (i.e. Tr=δntr on 𝒫n,±).

Noncommutative uncertainty principle:[33] Let x𝒫2,±, nonzero. Then

𝒮(x)𝒮((x))δ2

Assuming x and (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

Template:Reflist