
TL;DR
This paper constructs operator algebraic models for quantum permutation groups using *-homomorphisms into C*-algebras, leading to a new family of quantum groups that interpolate between classical and free quantum permutations.
Contribution
It introduces a series of *-homomorphisms that model quantum permutation matrices and constructs an inverse limit quantum group, extending understanding of quantum permutation groups for larger N.
Findings
Constructed *-homomorphisms for N≥4
Defined a compact matrix quantum group G between S_N and S_N^+
Open problem for N≥6 regarding the nature of G
Abstract
For we present a series of *-homomorphisms where is the quantum permutation group. They are not necessarily representations of the quantum group but they yield good operator algebraic models of quantum permutation matrices. The C*-algebras allow the construction of an inverse limit which defines a compact matrix quantum group . We know for from Banica's work, but we have to leave open the case .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Models of quantum permutations
Stefan Jung and Moritz Weber
Saarland University, Fachbereich Mathematik, Postfach 151150, 66041 Saarbrücken, Germany
[email protected], [email protected]
Abstract.
For we present a series of ∗-homomorphisms where is the quantum permutation group. They are not necessarily representations of the quantum group but they yield good operator algebraic models of quantum permutation matrices. The -algebras allow the construction of an inverse limit which defines a compact matrix quantum group . We know for from Banica’s work, but we have to leave open the case .
Key words and phrases:
-algebras, easy quantum groups
Both authors were funded by the ERC Advanced Grant NCDFP, held by Roland Speicher. The second author was also funded by the SFB-TRR 195 and the DFG project Quantenautomorphismen von Graphen. This article is part of the first author’s PhD thesis. We thank Roland Speicher and Adam Skalski for pointing out further questions related to our work; see the end of the article.
1. Introduction
In [Wan98] Sh. Wang introduced quantum versions of the classical permutation groups , the so-called quantum permutation groups , which are examples of compact matrix quantum groups in the sense of Woronowicz, see [Wor87]. The -algebra is given by the universal unital -algebra
[TABLE]
where a matrix is called a magic unitary if and only if its entries are projections summing up to in every row and column. The name quantum permutation group is justified by the fact, that one obtains its classical analogue, (or rather ), by adding commutativity to the generators.
In this article we are interested in models of , i.e. ∗-homomorphisms from to -algebras . We do not require to respect the comultiplication, hence we are only interested in finding “good” ∗-homomorphisms for the -algebra . This is linked to the research on matrix models in [BN17] or on Hopf images in [BB10]. As coincides with if and only if we concentrate on the situation .
In fact, we construct a whole series of models whose kernels become smaller and smaller for increasing . As an example for , we consider
[TABLE]
where
[TABLE]
and
[TABLE]
is the magic unitary constructed by
[TABLE]
Here,
[TABLE]
and
is defined as in [Wor87]. The choice of the matrix might be a bit surprising for the reader familiar with the canonical proof of the noncommutativity of , where one usually uses the matrix with the second and third column swapped. However, behaves much better under the operation
(see also Example 3.10), hence our choice.
We define by dividing out the relations in the last two legs of . The construction for general is analogous (the definition of being slightly more elaborate) and we obtain the following commuting diagram.
[TABLE]
The lower row of the diagram is an inverse system and admits an inverse limit . The central result of this article is the following.
Theorem** (Theorem 4.6).**
G:=\big{(}B_{\infty},M_{\infty}\big{)}* is a compact matrix quantum group fulfilling .*
In the situation of it follows from the maximality of the inclusion proved in [Ban18] that the constructed inverse limit is equal to . We have to leave it open whether we have for .
Our results may be interpreted in the sense that Woronowicz’s operation
applied iteratively to the representation as above is powerful enough to finally reproduce all of , at least in the cases and . Hence, R^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;n} yields good models of quantum permutation matrices for practical purposes such as in [LMR18], see also Section 3.4.
In Section 5, we comment on how to generalize the presented ideas and results in the situation of easy quantum groups, of which the (quantum) permutation groups are special cases. We show that the construction of an inverse system and the corresponding inverse limit as above can be performed whenever a suitable starting pair is given.
2. Preliminaries
In this section we define compact matrix quantum groups and quantum permutation groups . Throughout this work, let denote the minimal tensor product of -algebras and we write for the set of natural numbers .
2.1. The categories and compact matrix quantum groups
Definition 2.1**.**
Consider for given the category whose objects are pairs where
- •
is a -algebra,
- •
is an -matrix over , i.e. and
- •
the -algebra is generated by the entries of .
Arrows in between objects and are ∗-homomorphisms sending the entries of canonically onto the entries of , i.e.
[TABLE]
In [Wor87] Woronowicz defined -algebraic compact matrix quantum groups.
Definition 2.2**.**
Let and let be an object in the category such that is a unitary and u^{(*)}:=\big{(}u_{ij}^{*}\big{)} is invertible. Assume that there exists a unital ∗-homomorphism (called comultiplication on ) that fulfils
[TABLE]
Then we denote also by , by and G\!:=\!\big{(}C(G),u_{G}\big{)} is a compact matrix quantum group of size .
Compact matrix quantum groups are generalizations of (unitary) compact matrix groups, compare [Tim08, Prop. 6.1.10].
2.2. Quantum permutation groups
We now come to the definition of the objects of interest in this work, the quantum permutation groups as defined by Wang in [Wan98].
Definition 2.3**.**
- (a)
Given for some a matrix with entries in some unital ∗-algebra, we call a magic unitary if its entries are projections (i.e. ) that sum up to in every row and column.
- (b)
Let and be an -matrix of generators. Define
[TABLE]
Then we call the compact matrix quantum group the quantum permutation group and write .
Remark 2.4**.**
When we divide out in the commutativity relations, we obtain , seen as the compact matrix quantum group S_{N}=\big{(}C(S_{N}),u_{S_{N}}\big{)}.
Definition 2.5**.**
Given an object in that is a compact matrix quantum group, we say that it fulfils the subgroup relation if and only if there exists a diagram
[TABLE]
We write in addition if the arrow from \big{(}A,u\big{)} to \big{(}C(S_{N}),u_{S_{N}}\big{)} is not injective (i.e. not invertible).
For the compact matrix quantum groups and coincide. For however, we have in the sense that there is a non-injective ∗-homomorphism sending generators to generators. Recall that is not a group in this case, i.e. is a noncommutative -algebra. Indeed, mapping to
[TABLE]
is a surjective ∗-homomorphism onto a noncommutative -algebra. Usually, one uses a variant of where the second and third columns are swapped, but we prefer this matrix for later purposes.
3. A sequence of models for
For the rest of this article let .
3.1. The -product
We start by defining the so-called
-product of matrices, compare [Wor87].
Definition 3.1**.**
Given two matrices and for two -algebras and , we define the matrix
[TABLE]
an -matrix with entries in (or any suitable -subalgebra of it).
Lemma 3.2**.**
If and are magic unitaries, so is M_{1}\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;M_{2}.
Proof.
Straightforward. ∎
3.2. The matrix
Definition 3.3**.**
- (a)
We define the -algebra by
[TABLE]
the universal unital -algebra generated by two projections.
- (b)
Consider and let be pairwise different. We define the matrix
[TABLE]
by the following properties:
- (1)
The entries and are given by .
- (2)
The entries and are given by .
- (3)
All other diagonal entries are equal to .
- (4)
The entries and are given by .
- (5)
The entries and are given by .
- (6)
All other off-diagonal entries are zero.
Example 3.4**.**
In the case only one entry in a matrix is equal to . For example we have
[TABLE]
Definition 3.5**.**
Let be a natural number such that each permutation can be written as a product of at most transpositions. For let be a matrix where are chosen such that are pairwise different. We define the object in the category by
[TABLE]
and
[TABLE]
Lemma 3.6**.**
Consider the object in from Definition 3.5. There exists a diagram of the form
[TABLE]
Proof.
The existence of is by Lemma 3.2. In order to prove existence of the arrow , we start with the matrices , the matrix and the -algebra . Dividing out in all appearing legs the commutativity relations , we obtain matrices , a matrix and a commutative -algebra . The corresponding quotient map is an arrow
[TABLE]
and is magic. By Remark 2.4, we have an arrow
[TABLE]
because is magic and its entries pairwisely commute. It remains to prove the following claim:
[TABLE]
This shows that the vector space dimension of is N!\!=\!\dim\big{(}C(S_{N})\big{)} and the arrow above is invertible. The composition is the desired arrow from to \big{(}C(S_{N}),u_{S_{N}}\big{)}.
In order to prove the statement for given , we define
[TABLE]
and observe that it suffices to construct a ∗-homomorphism
[TABLE]
that fulfils . We write as a product of transpositions with such that is as small as possible:
[TABLE]
By definition of and , it holds
[TABLE]
with . Writing out this
-product, we see that is of the form
[TABLE]
i.e. we find, among other
-factors, matrices , , , that appear from left to right in this order. Let’s say these matrices appear in the
-product from Equation 3.3 at positions . Define a quotient map on in the following way:
- (i)
In each of the legs we apply a quotient map that divides out exactly the relation . Note that we have
[TABLE]
- (ii)
In each of the remaining legs we apply a quotient map that divides out exactly the relations . Note that we have
[TABLE]
From these observations we directly deduce
[TABLE]
Recall that a permutation matrix fulfils
[TABLE]
so it holds
[TABLE]
We conclude
[TABLE]
and thus is non-zero, proving . ∎
Remark 3.7**.**
Obviously, there is an arrow
[TABLE]
because is a magic unitary with commuting entries. The composition with from Lemma 3.6 is an arrow
[TABLE]
3.3. The matrices
Definition 3.8**.**
Consider the object in from Definition 3.5. Define
[TABLE]
and
[TABLE]
By Remark 3.7, we have for every an arrow
[TABLE]
given by restricting to . We obtain a commuting diagram of the form
[TABLE]
In particular, by Lemma 3.2, every pair defines a model of .
Remark 3.9**.**
Considering as described in Lemma 3.6, the composition
[TABLE]
is an arrow from to .
3.4. More models of
We end this section by listing further models of . They may be used in order to obtain additional models in the general case of by filling up the diagonal with units. In the following let always be the -algebra as in Definition 3.3.
Example 3.10**.**
The idea of the matrices (and the associated models ) originates in the matrix
[TABLE]
which is usually taken into account when proving non-commutativity of . However, we have
[TABLE]
and the corresponding object in is equivalent to . Therefore, any
-product of matrices gives an object equivalent to , i.e. the sequence of models exists, but, as a sequence, it is trivial. Note that the inverse of , the arrow
[TABLE]
defines a comultiplication on such that becomes a compact matrix quantum group. This seems not to be the case for the objects from Definition 3.8, see also Remark 3.14 below.
Example 3.11**.**
In order to obtain a model for , the symbols and do not have to be on the diagonal of . The matrix
[TABLE]
from the introduction gives an example for such a matrix.
Example 3.12**.**
As mentioned in the introduction, the second
-power of is
[TABLE]
and it is obviously not equivalent to the model given by .
Example 3.13**.**
The third
-power of is given by
[TABLE]
If denotes the -subalgebra generated by the entries of R^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;3}, then the matrix R^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;3} allows an arrow
[TABLE]
The proof is analogous to the proof of part (c) in Lemma 3.6 apart from the fact that the claim can be directly checked in the present case. Consequently, all R^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;n} with allow a corresponding arrow to \big{(}C(S_{4}),u_{S_{4}}\big{)}.
Remark 3.14**.**
Let us comment a bit on the matrix and its powers as in Examples 3.11, 3.12 and 3.13.
- (a)
The pair does not allow an arrow to , hence we cannot define the arrows as in Definition 3.8 and their existence is unclear. This is why we focused on even
-powers of and defined in the introduction M_{1}\!:=\!R\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;R. Roughly speaking, every
-multiplication with in some sense “swaps” the second and third column such that every second
-power of has the ’s and ’s in the right places.
- (b)
Neither the pair nor (B_{1},M_{1})=(B_{1},R\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;R) allows an arrow to \big{(}C(S_{N}),u_{S_{N}}\big{)}. This is clear for as it has vanishing entries. For M_{1}=R\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;R this follows for example from , see Example 3.12.
- (c)
In virtue of Section 4 following hereafter, the sequence could be used alternatively to the one from Definition 3.8. Indeed, in order to obtain Theorem 4.6, it suffices that there is a pair allowing for a (non-injective) arrow to .
4. The limit object
4.1. Inverse limits of inverse systems
Inverse systems and inverse limits can be defined in a much more general context, see for example [Phi88] and the references mentioned there. However, we stick to a very special situation such that its description and the proof of existence becomes easy to handle.
Consider for the category from Definition 2.1. We call a diagram of the form
[TABLE]
an inverse system. Recall, see for example [Mac71], that the limit of a diagram as above is the minimal object in that allows a commuting diagram of the form
[TABLE]
Minimality says that for every other object that allows a diagram of this form,
[TABLE]
there exists an arrow
[TABLE]
such that each arrow in Diagram 4.1 factors through , i.e. for every the following diagram commutes:
[TABLE]
Lemma 4.1**.**
Let \Big{(}\,\big{(}(D_{n},M_{n})\big{)}_{n\in\mathbb{N}}\,,\,\big{(}\pi_{n+1,n}\big{)}_{n\in\mathbb{N}}\,\Big{)} be an inverse system in . Denote for the entries of with . If for all the sequence of -th entries (m^{(n)}_{ij}\big{)}_{n\in\mathbb{N}} is bounded, then the limit of the inverse system exists. We denote it by
[TABLE]
and call it the inverse limit of the given inverse system.
Proof.
Existence and uniqueness is not difficult to prove, see for example [Phi88]. However, to keep this work self-contained, we present an own proof.
We start with the proof of existence.
Step 1: Construction of : Consider the free ∗-algebra generated by symbols with and let be the ∗-homomorphism given by the mapping . Impose on the -seminorms
[TABLE]
as well as
[TABLE]
Note that is bounded pointwise by assumption, so exists. We have and is norm-decreasing as it is a ∗-homomorphism. Therefore, the sequence \big{(}f_{n}\big{)}_{n\in\mathbb{N}} is increasing and the supremum that defines is in fact a limit. Evidently, gives a -norm on the quotient and we define to be its completion. Considering the as elements in and defining M_{\infty}:=\big{(}m^{(\infty)}_{ij}\big{)}_{1\leq i,j\leq N}, the pair is an object in our category .
Existence of the arrows
[TABLE]
for every can now be proved as follows: Firstly, we have because . Secondly, it holds because .
We conclude
[TABLE]
and the last equality holds because is by definition a surjective ∗-homomorphism. Finally, the quotient map
[TABLE]
is a (norm-decreasing) ∗-homomorphism. Its extension is the desired arrow from to as it holds by construction. We conclude that a diagram as in Picture 4.1 exists, so we can turn towards the universal property of , described by Diagram 4.3.
Step 2: Universal property of : Consider an object as described in Diagram 4.2. Denote with the ∗-subalgebra generated by the entries of . By the definition of a limit we need to prove the existence of the commuting Diagrams 4.3. It suffices to prove existence of an arrow from to as there is at most one arrow from one object to another. To do so, we consider first a ∗-algebraic expression in the letters and we let be the expression but every letter is replaced by . By the properties of our considered category, it holds
[TABLE]
for every . As the are norm-decreasing, we deduce
[TABLE]
i.e. the mapping defines a norm-decreasing ∗-homomorphism from to and it can be extended to a ∗-homomorphism . This finishes the proof of existence.
Step 3: Uniqueness of Uniqueness up to isomorphism is clear by the universal property of a limit. In the case of two limit objects we could switch roles to construct invertible arrows between them. ∎
4.2. The inverse limit
Considering the sequence of models \big{(}(B_{n},M_{n})\big{)}_{n\in\mathbb{N}} as constructed in Section 3, we have an inverse system
[TABLE]
Its inverse limit
[TABLE]
exists by Lemma 4.1. The matrix is a magic unitary as it defines a model of , see Lemma 3.6. By Lemma 3.2, all matrices are magic unitaries and so does , hence the inverse limit above defines a model of ,
[TABLE]
It is larger than all models in the sense that we have, by definition of the limit of a diagram, arrows from to every .
In this section we prove that this inverse limit is a compact matrix quantum group. It only remains to show that on there exists a comultiplication that fulfils
[TABLE]
In order to prove this, we consider the following situation. Consider some with and let be a ∗-polynom in the indeterminants . For we define to be the element in obtained by inserting the entries of canonically into . Analogously, let P(M_{n}\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;M_{n}) be given by replacing with .
Existence of the comultiplication on as described above is proved once we have shown the inequality
[TABLE]
for all ∗-polynomials .
The following results will be crucial in order to prove Theorem 4.6, saying that yields a CMQG. The logical structure is as follows: Lemma 4.2 is preparatory for Lemma 4.3 which in turn entails Lemma 4.4. Eventually, Lemma 4.4 and Lemma 4.5 are used in Theorem 4.6.
Lemma 4.2**.**
Consider the arrows
[TABLE]
*which exist by the property of an inverse limit. Let be linearly independent. Then there is a such that are linearly independent for all .
In particular, we find for any non-zero some such that for all .*
Proof.
Recall from the construction of an inverse limit, compare Lemma 4.1, that the sequence of -semi norms \big{(}\lVert{\phi_{n}(\cdot)}\rVert_{B_{n}}\big{)}_{n\in\mathbb{N}} is increasing and its limit is the norm .
We now use induction on to prove our claim. For we observe that a collection with only one element is linearly independent if its element is non-zero, so we have . In particular is non-zero for all up to finitely many .
Now let the statement be proved for some and consider linear independent elements . We assume the opposite of our claim, i.e. we find arbitrary large such that are linearly dependent. By the induction hypothesis we find such that are linearly independent for all . So we find some such that
[TABLE]
for suitable coefficients . As is non-zero by linear independence of , we find by the induction base case such that
[TABLE]
for all . With the same arguments as before we find some such that
[TABLE]
It holds because
[TABLE]
Defining , we conclude that
[TABLE]
a contradiction to the linear independence of . ∎
Lemma 4.3**.**
The -seminorm
[TABLE]
is a -norm on the algebraic tensor product .
Proof.
Recall that the algebraic tensor product is linearly spanned by elements with . For the proof we fix with , all and linearly independent. Note that the sequence \big{(}\lVert{\big{(}\phi_{n}\otimes\phi_{n}\big{)}(x)}\rVert_{B_{n}\otimes B_{n}}\big{)}_{n\in\mathbb{N}} is increasing, so the supremum in the statement is in fact a limit. The statement is proved if we find an such that \lVert{\big{(}\phi_{L}\otimes\phi_{L}\big{)}(x)}\rVert_{B_{L}\otimes B_{L}} is nonzero.
By Lemma 4.2 we find such that for all the elements are linearly independent. As all are non-zero, we find by Lemma 4.2 some such that for all . But then we obviously have
[TABLE]
as the first legs are linearly independent and the second ones are non-zero. In particular, it holds
[TABLE]
∎
We even have that defines a norm on and it is equal to the norm on the minimal tensor product.
Lemma 4.4**.**
The mapping from Lemma 4.3 is equal to the norm on .
Proof.
Recall that the norm of a minimal tensor product of two -algebras is by construction the smallest -norm on and it is defined by the supremum of the -seminorms where and are representations of on and on , respectively and is the product representation of on . Furthermore, is faithful if both and are and in this case it holds .
It holds because the -semi norms all appear in the collection of semi norms as we can combine with a faithful representation of .
Conversely, we have because defines by Lemma 4.3 a -norm on . As is by definition the smallest possible -norm on , we have
Combing both inequalities, we conclude that equals the minimal tensor product norm on , and therefore on the whole . ∎
The following result is preparatory for Theorem 4.6.
Lemma 4.5**.**
For any it holds
[TABLE]
as an equation in (or any suitable -subalgebra).
Proof.
Starting with the ∗-polynomial , we obtain the left side of Equation 4.5 by replacing by and the right side by replacing it by . Equality of both sides follows from the associativity of the
-product which in turn follows from the associativity of the tensor product: It holds for
\displaystyle=(M_{1}^{\raisebox{-1.0pt}{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;}(2n)})_{ij}
\displaystyle=\sum_{k=1}^{4}\left(M_{1}^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;n}\right)_{ik}\otimes\left(M_{1}^{\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;n}\right)_{kj}
∎
Theorem 4.6**.**
The -algebra together with its matrix of generators M_{\infty}=\big{(}m_{ij}^{(\infty)}\big{)}_{1\leq i,j\leq N} defines a compact matrix quantum group .
Proof.
As mentioned above, the only thing left to prove is the existence of a ∗-homomorphism fulfilling
[TABLE]
and this can be guaranteed by proving the inequality
[TABLE]
for all ∗-polynomials as described above. Due to the fact that the sequence is not only bounded but also increasing and its limit defines the norm , it holds
[TABLE]
Using the inclusion of -algebras together with Lemma 4.5 and Lemma 4.4, we conclude
[TABLE]
Hence, Inequality 4.6 is true and is a compact matrix quantum group. ∎
The proof of Theorem 4.6 even shows that the comultiplication on the compact matrix quantum group is isometric. Moreover, the diagram
[TABLE]
further shows that the constructed compact matrix quantum group lies in between the quantum permutation group and its classical analogue, compare Definition 2.5.
Corollary 4.7**.**
The compact matrix quantum group from Theorem 4.6 fulfils
[TABLE]
Proof.
The only thing left to show is the inequality . As the -algebra from Equation 3.1 is non-commutative, so are and , hence the arrow
[TABLE]
cannot be invertible. ∎
It is a long standing conjecture (see for instance [Ban18]) that the inclusion is maximal, i.e. there is no compact matrix quantum group strictly in between them.
Conjecture 4.8**.**
For all , there is no quantum group with .
This has been proved in [Ban18] for the cases and . Exploiting this, we obtain the following result and question.
Corollary 4.9**.**
For the compact matrix quantum group from Theorem 4.6 equals .
Question 4.10**.**
Is equal to for every ? This is trivial if Conjecture 4.8 is true.
Moreover, we are wondering whether the inverse system is stationary at some point (we believe this is not the case). We phrase it as the following question.
Question 4.11**.**
Are there polynomials in the generators such that for , but ?
We believe that such polynomials exist although we cannot prove it. Such a sequence would show that none of the maps is injective. Note that (at least for and ) the models approximate completely, hence the
operation applied on such simple matrices as in Definition 3.5 or Example 3.11 is powerful enough to reproduce eventually. In the case that Question 4.11 is answered affirmatively, one can produce infinitely many mutually different quantum permutation matrices using the
operation.
5. Generalization to easy quantum groups
Orthogonal easy quantum groups have been defined for the first time in [BS09] and they have been generalized in [TW18] and [TW17] to unitary easy quantum groups. This section is aimed for readers familiar with easy quantum groups and we refer to the references above for more details. The notions of (two-coloured) partitions and quantum group relations, see below, are adopted from [JW18].
The definition of easy quantum groups is based on Tannaka-Krein duality, see [Wor88], saying that there is a one-to-one correspondence between compact matrix quantum groups and their intertwiner spaces. To define an easy quantum group, one starts with a so-called category of two-coloured partitions (of sets) and associated to it a collection of intertwiner spaces (which defines a compact matrix quantum group).
In this work, however, we reduce the theory of easy quantum groups to a simple construction: Starting with (suitable) sets of partitions, one can associate to every partition a collection of quantum group relations on the canonical generators of a compact matrix quantum group C\big{(}G_{N}(\Pi)\big{)}. We finish this section by generalizing the result of the last section to arbitrary easy quantum groups, compare Proposition 5.5: Given for an easy quantum group – which is an object in – and an arrow
[TABLE]
the whole construction of the sequence of models \big{(}(B_{n},M_{n})\big{)}_{n\in\mathbb{N}} as in Section 3 is possible. If there is in addition an arrow
[TABLE]
the construction of the inverse system
[TABLE]
as in Section 3 and 4 is possible and its inverse limit is well-defined and gives a compact matrix quantum subgroup of .
Definition 5.1**.**
Consider and let be an -matrix of generators. Given , we associate with a partition the ∗-algebraic relations
[TABLE]
for all and on the matrix entries and call them the quantum group relations associated to and .
We now state the definition of easy quantum groups as formulated in [JW18].
Definition 5.2**.**
Consider and Let be a set of partitions such that it contains \{\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,0.2){\line(0,1){0.4}} \put(0.7,0.2){\line(0,1){0.4}} \put(0.2,0.6){\line(1,0){0.5}} \put(0.5,-0.2){\bullet} \put(0.0,-0.2){\circ} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,0.2){\line(0,1){0.4}} \put(0.7,0.2){\line(0,1){0.4}} \put(0.2,0.6){\line(1,0){0.5}} \put(0.5,-0.2){\circ} \put(0.0,-0.2){\bullet} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,-0.1){\line(0,1){0.4}} \put(0.7,-0.1){\line(0,1){0.4}} \put(0.2,-0.1){\line(1,0){0.5}} \put(0.5,0.3){\bullet} \put(0.0,0.3){\circ} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,-0.1){\line(0,1){0.4}} \put(0.7,-0.1){\line(0,1){0.4}} \put(0.2,-0.1){\line(1,0){0.5}} \put(0.5,0.3){\circ} \put(0.0,0.3){\bullet} \end{picture}}\}\subseteq\Pi. Then we call the universal -algebra
[TABLE]
the non-commutative functions over the easy quantum group . Analogous to the definition of compact matrix quantum groups, we write A\!=\!C\big{(}G_{N}(\Pi)\big{)}, as well as G_{N}(\Pi)\!=\!(A,u)\!=\!\big{(}C(G_{N}(\Pi)),u_{G_{N}(\Pi)}\big{)}.
Remark 5.3**.**
Note, that the relations associated to the partitions\{\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,0.2){\line(0,1){0.4}} \put(0.7,0.2){\line(0,1){0.4}} \put(0.2,0.6){\line(1,0){0.5}} \put(0.5,-0.2){\bullet} \put(0.0,-0.2){\circ} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,0.2){\line(0,1){0.4}} \put(0.7,0.2){\line(0,1){0.4}} \put(0.2,0.6){\line(1,0){0.5}} \put(0.5,-0.2){\circ} \put(0.0,-0.2){\bullet} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,-0.1){\line(0,1){0.4}} \put(0.7,-0.1){\line(0,1){0.4}} \put(0.2,-0.1){\line(1,0){0.5}} \put(0.5,0.3){\bullet} \put(0.0,0.3){\circ} \end{picture}},\leavevmode\hbox{\set@color \begin{picture}(1.0,1.0)\put(0.2,-0.1){\line(0,1){0.4}} \put(0.7,-0.1){\line(0,1){0.4}} \put(0.2,-0.1){\line(1,0){0.5}} \put(0.5,0.3){\circ} \put(0.0,0.3){\bullet} \end{picture}}\} exactly say that and are both unitary matrices, compare [TW17]. This guarantees that the universal -algebra is well-defined. It can be checked by straightforward computation, see also Remark 5.6 and the proof of Proposition 5.5, that a quantum group relation is preserved by the symbolwise replacement
[TABLE]
Hence, any easy quantum group is a compact matrix quantum group indeed.
Example 5.4**.**
Starting with
[TABLE]
the construction of due to Definition 5.2 gives the compact matrix quantum group as defined in Definition 2.3.
Proposition 5.5**.**
Consider and a set of partitions
[TABLE]
Whenever there exists in the category an object and arrows
[TABLE]
the formula
[TABLE]
defines in an inverse system
[TABLE]
where is the restriction of to . The inverse limit
[TABLE]
exists and it defines a compact matrix quantum group .
Proof.
By the aforementioned considerations it only remains to show that every defines a model of C\big{(}G_{N}(\Pi)\big{)}, i.e. there exists an arrow
[TABLE]
By the universal property of C\big{(}G_{N}(\Pi)\big{)} we only have to show that the relations \big{(}\mathcal{R}_{p}^{Gr}(M_{n})\big{)}_{p\in\Pi} hold. We use induction on .
For the statement is true by assumption, more precisely, by existence of . Now assume the claim to be proved for some . To simplify notation, we write
[TABLE]
Recall that the quantum group relations read as
[TABLE]
for all and . Using repeatedly that these relations are fulfilled for the ’s and the ’s, we can directly check the respective quantum group relations for the matrix
[TABLE]
Given and , we compute
[TABLE]
These are the relations and the proof is finished. ∎
Remark 5.6**.**
The computation in the proof of Proposition 5.5 is exactly the one that proves existence of the comultiplication on C\big{(}G_{N}(\Pi)\big{)}, compare item (ii) of Remark 5.3: The relations imply R_{p}^{Gr}(u\;\raisebox{1.13791pt}{\scalebox{0.72}{\bigcirc\textnormal{}\perp}}\;u).
Let us end this article with a number of questions. As formulated in Question 4.10, we do not know whether or not the quantum group from Theorem 4.6 coincides with for general . If it doesn’t, it would be a very interesting object to study and it would answer Conjecture 4.8 to the negative. Moreover, we have no understanding on the dependence on the initial matrix ; recall that the construction of is completely determined by the matrix – Roland Speicher raised the question, whether different matrices yield different quantum groups . A positive answer would solve Question 4.10 and disprove Conjecture 4.8.
Moreover, Theorem 4.6 shows, that the tensor product construction
is powerful enough to eventually produce an interesting quantum group (or to reproduce ). In Question 4.11, we ask whether one has to apply
infinitely many times or whether a finite application is sufficient for obtaining the limit object. Related is a question that Adam Skalski pointed out to us: For , one may think of our matrix as being obtained from (note however, that , of course). What happens if one applies a similar construction to in order to produce quantum groups between and ? (Or more generally, using for obtaining quantum subgroups of , where is any series of quantum groups.) In particular, it would be interesting to see whether the half-liberated quantum group may be constructed in this way, and whether one may produce an example whose existence is also an open question. These questions are related to the concept of topological generation of quantum groups from certain quantum subgroups.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ban 18] T. Banica. Homogeneous quantum groups and their easiness level. arxiv:1806.06368 , 2018. to appear in Kyoto J. Math.
- 2[BB 10] T. Banica and J. Bichon. Hopf images and inner faithful representations. Glasg. math. J. , 52:677–703, 2010.
- 3[BN 17] T. Banica and I. Nechita. Flat matrix models for quantum permutation groups. Adv. Appl. Math. , 83:24–46, 2017.
- 4[BS 09] T. Banica and R. Speicher. Liberation of orthogonal Lie groups. Adv. Math. , 222(4):1461–1501, 2009.
- 5[JW 18] S. Jung and M. Weber. Partition quantum spaces. arxiv:1801.06376 , 2018. to appear in J. Noncommut. Geom.
- 6[LMR 18] M. Lupini, L. Mančinska, and D. E. Roberson. Non local games and quantum permutation grops. ar Xiv:1712.01820 v 2 , 2018.
- 7[Mac 71] S. Mac Lane. Categories for the working mathematician , volume 5 of Graduate Texts in Mathematics . Springer, New York, 1971.
- 8[Phi 88] N. C. Phillips. Inverse limits of C ∗ superscript 𝐶 {C}^{*} -algebras. J. Operator Theory , 19:159–195, May 1988.
