Differences

This shows you the differences between two versions of the page.

--- category_of_partitions [2019/03/01 14:04]
d.gromada removed
+++ category_of_partitions [2021/11/23 11:56] (current)
@@ Line 1: / Line 1: @@
-====== Linear category of partitions ======
+====== Category of partitions ======
-**Partition categories** also known as **linear categories of partitions** have been recently heavily studied by researchers from different fields of mathematics and physics such as group theory, [[Compact quantum group|compact quantum groups]], operator algebras, tensor categories or statistical physics. In the theory of (compact quantum) groups they are used to model the representation theory of a given quantum group.
+This page is about //easy// categories of partitions in the sense of Banica and Speicher [(ref:BS09)]. If we equip those with a linear structure, we get [[linear_category_of_partitions|linear categories of partitions]].
-Note that in the theory of [[compact_matrix_quantum_group|compact matrix quantum groups]], the term **category of partitions** often means an [[Category of partitions|easy category of partitions]] in the sense of Banica and Speicher.
-===== Definitions =====
+===== Definition =====
 ==== 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)$.
+Let $k,l\in\mathbb{N}_0$, by a [[partition|partition]] of $k$ upper and $l$ lower points we mean herre 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 $\Pscr(k,l)$. We denote the union $\Pscr:=\bigcup_{k,l\in\N_0}\Pscr(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.
+Below, we give an example of two partitions $p\in\Pscr(3,4)$ and $q\in\Pscr(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=
@@ Line 34: / Line 32: @@
 $$
-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)$.
+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\Pscr(0,1)$ and $\upsingleton\in\Pscr(1,0)$.
-==== Operations on partitions ====
+==== 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)$.
+The set of all [[Partition|partitions]] $\Pscr$ can be given the structure of a monoidal involutive category by introducing the following operations.
-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\Pscr(k,l)$ and $q\in\Pscr(k',l')$ is the partition $p\otimes q\in \Pscr(k+k',l+l')$ obtained by writing the graphical representations of $p$ and $q$ "side by side".
-  * 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{
@@ Line 70: / Line 66: @@
 }
 $$
-  * 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$.
+  * For $p\in\Pscr(k,l)$, $q\in\Pscr(l,m)$ we define their **composition** $qp\in\Pscr(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.
 $$
 \BigPartition{
@@ Line 98: / Line 94: @@
 \Pline (2.75,-0.25) (4,-0.25)
 }
-= \delta^2
+=
 \BigPartition{
 \Pblock 0 to 0.25:2,3,4
@@ Line 106: / Line 102: @@
 }
 $$
-  * 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.
+  * For $p\in\Pscr(k,l)$ we define its **involution** $p^*\in\Pscr(l,k)$ by reversing its graphical representation with respect to the horizontal axis.
 $$
 \left(
@@ Line 125: / Line 121: @@
 $$
-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.
-==== Linear categories of partitions ====
+The set of all natural numbers with zero $\N_0$ as a set of objects together with the sets of partitions $\Part_\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 involutive category. All objects in the category are self-dual. This category is called the **category of all 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.
+Any monoidal involutive subcategory with duals $\Cscr$ is called a **category of partitions**. That is, a category of partitions is a collection of subsets $\Cscr(k,l)\subset\Pscr(k,l)$ containing the identity partition $\idpart\in\Cscr(1,1)$ and the pair partition $\pairpart\in\Cscr(0,2)$, which is closed under the category operations.
-A linear category of partitions is any subcategory of the category of all partitions. That is, any collection $\mathscr{K}$ of linear subspaces $\mathscr{K}(k,l)\subset\Partlin_\delta(k,l)$ containing the **identity partition** $\idpart\in\mathscr{K}(1,1)$ and the **pair partition** $\pairpart\in\mathscr{K}(0,2)$, which is closed under the category operations is called a **linear category of partitions**.
+For given $p_1,\dots,p_n\in\Pscr$, we denote by $\langle p_1,\dots,p_n\rangle$ the smallest linear category of partitions containing $p_1,\dots,p_n$. We say that $p_1,\dots,p_n$ **generate** $\langle p_1,\dots,p_n\rangle$. Note that the pair partition is contained in the category by definition and hence will not be explicitly listed as a generator. Any element in $\langle p_1,\dots,p_n\rangle$ can be obtained from the generators $p_1,\dots,p_n$ and the pair partition $\pairpart$ by performing a finite amount of category operations and linear combinations.
-For given $p_1,\dots,p_n\in\Partlin_\delta$, we denote by $\langle p_1,\dots,p_n\rangle_\delta$ the smallest linear category of partitions containing $p_1,\dots,p_n$. We say that $p_1,\dots,p_n$ **generate** $\langle p_1,\dots,p_n\rangle_\delta$. Note that the pair partition is contained in the category by definition and hence will not be explicitly listed as a generator. Note that any element in $\langle p_1,\dots,p_n\rangle_\delta$ can be obtained from the generators $p_1,\dots,p_n$ and the pair partition $\pairpart$ by performing a finite amount of category operations and linear combinations.
+===== Relation with linear categories =====
-===== Connection with CMQG =====
+Consider a category of partitions $\Cscr$. Put $\Kscr(k,l):=\spanlin\Cscr(k,l)\subset\Part_\delta(k,l)$. Then $\Kscr$ is a [[linear_category_of_partitions|linear category of partitions]]. Moreover, supposing $\delta\neq 0$, if $\Cscr=\langle p_1,\dots,p_n\rangle$, then $\Kscr=\langle p_1,\dots,p_n\rangle_\delta$.
-===== See also =====
+Conversely, a [[linear_category_of_partitions|linear category of partitions]] $\Kscr$ is called **easy** if it is //spanned by partitions//. That is, if there is a collection of sets $\Cscr(k,l)\subset\Pscr(k,l)$ such that $\Kscr(k,l)=\spanlin\Cscr(k,l)$. Then the collection $\Cscr(k,l)$ is a category of partition.
-  * [[Tannaka--Krein duality|Tannaka--Krein duality]]
+This means that categories of partitions can be understood as an //easy// subclass of linear categories of partitions. Their advantage is that they are much easier to work with. In particular, a complete classification of categories is available, which serves as a source of many examples of linear categories of partitions. Since any linear category of partitions induces a [[compact_matrix_quantum_group|compact matrix quantum group]] through the [[Tannaka–Krein duality|Tannaka–Krein duality]], categories of partitions can also serve as a source of many examples of quantum groups. Quantum groups corresponding to categories of partitions are called **easy**.
+===== Classification of categories of partitions =====
+In this section, we summarize the classification results for categories of partitions. More information is provided in the separate articles.
+==== Non-crossing partitions ====
+There are the following seven easy [[Non-crossing category of partitions|non-crossing categories]] of partitions [(ref:BS09)],[(ref:Web13)].
+$$NC_2=\langle\rangle\subset\Big\{\begin{matrix}\langle\singleton\otimes\singleton\rangle\subset\langle\Labac\rangle\subset\langle\singleton\rangle\\\langle\fourpart\rangle\subset\langle\fourpart,\singleton\otimes\singleton\rangle\end{matrix}\Big\}\subset\langle\fourpart,\singleton\rangle=NC$$
+Here, we denote by $NC$ the [[Category of all non-crossing partitions|category of all non-crossing partitions]]. The smallest category $\langle\rangle$ is  $NC_2$, the [[Temperley–Lieb category|category of non-crossing pairings]].
+==== The group categories ====
+A category of partition $\Cscr$ is called a **group category** if it contains the **crossing partition** $\crosspart$. It is called a //group category// because the crossing partition corresponds to commutativity relation. So, a quantum group corresponding to a group category is actually a group.
+For any group category $\Cscr$ it holds that $\Cscr':=\Cscr\cap NC$ is a non-crossing category of partitions. Conversely, it holds that $\Cscr=\langle\Cscr',\crosspart\rangle$. Thus, all categories with the crossing partition arise by adding the crossing to a non-crossing category. The seven non-crossing categories induce the following six categories with crossing [(ref:BS09)],[(ref:Web13)]
+$$\Pscr_2=\langle\crosspart\rangle\subset\Big\{\begin{matrix}\langle\crosspart,\singleton\otimes\singleton\rangle\subset\langle\crosspart,\singleton\rangle\\\langle\crosspart,\fourpart\rangle\subset\langle\crosspart,\fourpart,\singleton\otimes\singleton\rangle\end{matrix}\Big\}\subset\langle\crosspart,\fourpart,\singleton\rangle=\Pscr$$
+Here, we denote by $\Pscr_2$ the [[Brauer category|category of all pairings]]. The largest category is of course the [[category_of_all_partitions|category of all partitions]] $\Pscr$.
+==== The half-liberated categories ====
+A category of partitions $\Cscr$ is called **half-liberated** if $\halflibpart\in\Cscr$, but $\crosspart\not\in\Cscr$. Their classification [(ref:Web13)] consists of the categories $\langle\halflibpart\rangle$, $\langle\halflibpart,\singleton\otimes\singleton\rangle$, $\halflibpart,\fourpart\rangle$ and an infinite series $\langle\halflibpart,\fourpart,h_s\rangle$ for $s\ge 3$. Here, $h_s$ is a partition on $2s$ points consisting of two blocks, where all odd points are in one block and all even points are in the second block (in the [[partition#Word representation|word representation]] $h_s=(\mathsf{ab})^s=\mathsf{ab}\,\mathsf{ab}\cdots\mathsf{ab}$).
+==== The hyperoctahedral categories ====
+A category of partitions $\Cscr$ is called **hyperoctahedral** if $\fourpart\in\Cscr$ but $\singleton\otimes\singleton\not\in\Cscr$. We have the following classification of hyperoctahedral categories [(ref:RW16)].
+If $\Paabaab\not\in\Cscr$, then $\Cscr$ is equal to either $\langle \pi_k\rangle$ or $\langle \pi_l\mid l\in\N\rangle$, where $\pi_k\in\Pscr(0,4k)$ is a partition, whose [[partition#word_representation|word representation]] can be written as
+$$\pi_k=\mathsf{a}_1\mathsf{a}_2\cdots\mathsf{a}_k\mathsf{a}_k\cdots\mathsf{a}_2\mathsf{a}_1\mathsf{a}_1\mathsf{a}_2\cdots\mathsf{a}_k\mathsf{a}_k\cdots\mathsf{a}_2\mathsf{a}_1.$$
+Note that $\pi_1=\fourpart$ is a non-crossing partition. All the $\pi_k$ for $k>2$ have a crossing and the corresponding categories are pairwise distinct and also different from the above mentioned.
+If $\Paabaab\in\Cscr$, then $\Cscr$ is so-called [[Group-theoretical category|group-theoretical category]]. There is a certain normal subgroup $A\subset\Z_2^{*n}$ such that the set of all partitions in $\Cscr$ written in the [[partition#word_representation|word representation]] using the generators of $\Z_2^{*n}$ as the alphabet coincide with $A$ [(ref:RW14)], [(ref:RW15)].
 ===== Further reading =====
+  * Moritz Weber, //Introduction to compact (matrix) quantum groups and Banica–Speicher (easy) quantum groups//, [[https://doi.org/10.1007/s12044-017-0362-3|Proceedings – Mathematical Sciences, Vol. 127, No. 5, pp. 881–933, 2017]]. [[https://www.ias.ac.in/article/fulltext/pmsc/127/05/0881-0933|Full text online.]]
 ===== References =====
+[(ref:BS09>>
+title     : Liberation of orthogonal Lie groups
+journal   : Advances in Mathematics
+volume    : 222
+number    : 4
+pages     : 1461--1501
+year      : 2009
+url       : http://dx.doi.org/10.1016/j.aim.2009.06.009
+author    : Teodor Banica and Roland Speicher
+)]
+[(ref:Web13>>
+title     : On the classification of easy quantum groups
+journal   : Advances in Mathematics
+volume    : 245
+pages     : 500--533
+year      : 2013
+url       : http://dx.doi.org/10.1016/j.aim.2013.06.019
+author    : Moritz Weber
+)]
+[(ref:RW14>>
+author    : Sven Raum and Moritz Weber
+title     : The combinatorics of an algebraic class of easy quantum groups
+journal   : Infinite Dimensional Analysis, Quantum Probability and Related Topics
+volume    : 17
+number    : 03
+pages     : 1450016
+year      : 2014
+url       : http://dx.doi.org/10.1142/S0219025714500167
+)]
+[(ref:RW15>>
+author    : Sven Raum and Moritz Weber
+title     : Easy quantum groups and quantum subgroups of a semi-direct product quantum group
+journal   : Journal of Noncommutative Geometry
+volume    : 9
+number    : 4
+pages     : 1261--1293
+year      : 2015
+url       : http://dx.doi.org/10.4171/JNCG/223
+)]
+[(ref:RW16>>
+author    : Sven Raum and Moritz Weber
+title     : The Full Classification of Orthogonal Easy Quantum Groups
+journal   : Communications in Mathematical Physics
+year      : 2016
+volume    : 341
+number    : 3
+pages     : 751--779
+url       : http://dx.doi.org/10.1007/s00220-015-2537-z
+)]
+~~REFNOTES ref ~~

User Tools

Site Tools

Differences

Page Tools