This is an old revision of the document!

Category of all partitions

Definitions

Partitions

Let $k,l\in\mathbb{N}_0$ , by a partition of $k$ upper and $l$ lower points we mean a partition of the set $\{1,\dots,k\}\sqcup\{1,\dots,l\}\approx\{1,\dots,k+l\}$ , that is, a decomposition of the set of $k+l$ points into non-empty disjoint subsets, called blocks. The first $k$ points are called upper and the last $l$ points are called lower. The set of all partitions on $k$ upper and $l$ lower points is denoted $\Part(k,l)$ . We denote the union $\Part:=\bigcup_{k,l\in\N_0}\Part(k,l)$ .

We illustrate partitions graphically by putting $k$ points in one row and $l$ points on another row below and connecting by lines those points that are grouped in one block. All lines are drawn between those two rows.

Below, we give an example of two partitions $p\in\Part(3,4)$ and $q\in\Part(4,4)$ defined by their graphical representation. The first set of points is decomposed into three blocks, whereas the second one is into five blocks. In addition, the first one is an example of a non-crossing partition, i.e. a partition that can be drawn in a way that lines connecting different blocks do not intersect (following the rule that all lines are between the two rows of points). On the other hand, the second partition has one crossing.

$p= \BigPartition{ \Pblock 0 to 0.25:2,3 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1,4 \Pline (2.5,0.25) (2.5,0.75) } \qquad q= \BigPartition{ \Psingletons 0 to 0.25:1,4 \Psingletons 1 to 0.75:1,4 \Pline (2,0) (3,1) \Pline (3,0) (2,1) \Pline (2.75,0.25) (4,0.25) }$

A block containing a single point is called a singleton. In particular, the partitions containing only one point are called singletons and for clarity denoted by an arrow $\singleton\in\Part(0,1)$ and $\upsingleton\in\Part(1,0)$ .

The category structure

Let us fix a complex number $\delta\in\C$ . Let us denote $\Partlin_\delta(k,l)$ the vector space of formal linear combination of partitions $p\in\Part(k,l)$ . That is, $\Partlin_\delta(k,l)$ is a vector space, whose basis is $\Part(k,l)$ .

Now, we are going to define some operations on $\Partlin_\delta$ . First, let us define those operations just on partitions.

The tensor product of two partitions $p\in\Part(k,l)$ and $q\in\Part(k',l')$ is the partition $p\otimes q\in \Part(k+k',l+l')$ obtained by writing the graphical representations of $p$ and $q$ “side by side”.

$\BigPartition{ \Pblock 0 to 0.25:2,3 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1,4 \Pline (2.5,0.25) (2.5,0.75) } \otimes \BigPartition{ \Psingletons 0 to 0.25:1,4 \Psingletons 1 to 0.75:1,4 \Pline (2,0) (3,1) \Pline (3,0) (2,1) \Pline (2.75,0.25) (4,0.25) } = \BigPartition{ \Pblock 0 to 0.25:2,3 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1,4,5,8 \Psingletons 1 to 0.75:5,8 \Pline (2.5,0.25) (2.5,0.75) \Pline (6,0) (7,1) \Pline (7,0) (6,1) \Pline (6.75,0.25) (8,0.25) }$

For $p\in\Part(k,l)$ , $q\in\Part(l,m)$ we define their composition $qp\in\Partlin_\delta(k,m)$ by putting the graphical representation of $q$ below $p$ identifying the lower row of $p$ with the upper row of $q$ . The upper row of $p$ now represents the upper row of the composition and the lower row of $q$ represents the lower row of the composition. Each extra loop that appears in the middle and is not connected to any of the upper or the lower points, transforms to a multiplicative factor $\delta$ .

$\BigPartition{ \Psingletons 0 to 0.25:1,4 \Psingletons 1 to 0.75:1,4 \Pline (2,0) (3,1) \Pline (3,0) (2,1) \Pline (2.75,0.25) (4,0.25) } \cdot \BigPartition{ \Pblock 0 to 0.25:2,3 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1,4 \Pline (2.5,0.25) (2.5,0.75) } = \BigPartition{ \Pblock 0.5 to 0.75:2,3 \Pblock 1.5 to 1.25:1,2,3 \Psingletons 0.5 to 0.75:1,4 \Pline (2.5,0.75) (2.5,1.25) \Psingletons -0.5 to -0.25:1,4 \Psingletons 0.5 to 0.25:1,4 \Pline (2,-0.5) (3,0.5) \Pline (3,-0.5) (2,0.5) \Pline (2.75,-0.25) (4,-0.25) } = \delta^2 \BigPartition{ \Pblock 0 to 0.25:2,3,4 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1 \Pline (2.5,0.25) (2.5,0.75) }$

For $p\in\Part(k,l)$ we define its involution $p^*\in\Part(l,k)$ by reversing its graphical representation with respect to the horizontal axis.

$\left( \BigPartition{ \Pblock 0 to 0.25:2,3 \Pblock 1 to 0.75:1,2,3 \Psingletons 0 to 0.25:1,4 \Pline (2.5,0.25) (2.5,0.75) } \right)^* = \BigPartition{ \Pblock 1 to 0.75:2,3 \Pblock 0 to 0.25:1,2,3 \Psingletons 1 to 0.75:1,4 \Pline (2.5,0.25) (2.5,0.75) }$

Now we can extend the definition of tensor product and composition on the vector spaces $\Partlin_\delta(k,l)$ linearly. We extend the definition of the involution antilinearly. These operations are called the category operations on partitions.

The set of all natural numbers with zero $\N_0$ as a set of objects together with the spaces of linear combinations of partitions $\Partlin_\delta(k,l)$ as sets of morphisms between $k\in\N_0$ and $l\in\N_0$ with respect to those operations form a monoidal $*$ -category. All objects in the category are self-dual. This category is called the (linear) category of all partitions.

User Tools

Site Tools

Table of Contents

Category of all partitions

Definitions

Partitions

The category structure

Page Tools