You are currently browsing the category archive for the ‘Research’ category.
The following is an approach to the maximality conjecture for which asks what happens to a counterexample when you quotient . If is noncommutative, you generate another counterexample .}
Most of my attempts at using this approach were doomed to fail as I explain below.
Let be a quantum permutation group with (universal) algebra of continuous functions generated by a fundamental magic representation . Say that is classical when is commutative and genuinely quantum when is noncommutative.
Definition 1 (Commutator and Isotropy Ideals)
Given , the commutator ideal is given by:
The isotropy ideal is given by:
Lemma 1
The commutator ideal is equal to the ideal
Proof:
with a similar statement for .
On the other hand:
Proposition 1
The commutator and isotropy ideals are Hopf*-ideals. The quotient gives a classical permutation group , the classical version , and the quotient giving an isotropy quantum subgroup. If is classical, this quotient is the isotropy subgroup of for the action .
Via , the classical permutation group is a quantum subgroup . It is conjectured that for all it is a maximal subgroup.
Theorem 1 (Wang/Banica/Bichon)
is maximal for .
Read the rest of this entry »Consider the symmetric group . Let count the number of fixed points of a permutation . Where , we have that for a random permutation chosen with respect to the uniform distribution, the converges in distribution to in the sense that:
.
In this note we will look at the distribution in the case where the uniform distribution is conditioned on .
Theorem
Let be chosen according to the distribution uniform on permutations for which one is a fixed point. The number of fixed points has distribution in the sense that, where ,
.
Proof: What can be shown, ostensibly from stuff from the quantum permutation side of the house is that, where is integration against the uniform distribution, and is integration against the uniform distribution on permutations with one a fixed point, that, for :
,
the -st Bell number. Now consider the moments of :
,
using the fact that the Bell numbers are the moments of that Poisson distribution and the standard recurrence for the Bell numbers.
Local vs Global Conditioning of Quantum Permutations
In the quantum case we define
,
where is the fundamental magic representation. The moments of with respect to the Haar state are the Catalan numbers and it follows that the law of is a Marchenko-Pastur distribution, with density
:
Note that when we measure the Haar state with some finite spectrum version of we find:
- the probability of finding an integer number of fixed points is zero, and
- independently of , the probability of finding more than four fixed points is zero.
In the classical case above when we chose the permutation uniformly from those who fix one, there are two ways of viewing it:
- we pick an element of that fixes one, OR
- we consider the isotropy subgroup and choose our permutation from .
Classically, these are the same thing. In the quantum case these two things can be interpreted differently. The second case is quite clear in the quantum case. For , we take the isotropy via the quotient .
The analogue of the uniform distribution on here is the Haar idempotent . Note this maps to . Now, using the fact that , the Catalan number, we have that the moments of with respect to is the binomial transform of the Catalan numbers (the binomial transform of is ). It follows, using similar stuff to the above, that the distribution of with respect to is just a shifted version of Marchenko–Pastur:
I guess this is marginally more interesting than the unshifted version.
Now, what about an analogue of “we pick an element of that fixes one”. So if we take the Haar state and measure the observable that asks of a quantum permutation, does it fix one, we get, conditioned on this, the state:
.
And, it turns out, as above, using stuff from the quantum permutation side of the house:
.
Quite quickly from here we find that the density of the distribution of with respect to is
This is so interesting:
- it doesn’t change the support — we still find between 0 and 4 fixed points,
- we have a new symmetry about , we had another unexpected symmetry here.
- the mean jumps from one to two, that is not unexpected, but
- the mode jumps from zero to two!
- even though we have observed one to one, there can still be less than one fixed point when we measure… and this happens with probability .
The next obvious question is what happens with:
Epilogue?
So what about this local vs global conditioning? Well, no matter what subsequent measurements are made to , we will always find that one is a fixed point. That conditioning is ‘global’.
This is not the case with , and why the support of the law is not bounded above one, like that of the globally conditioned . In fact, there is a non-zero probability that is observed to fix two but then subsequently not fix one anymore. That conditioning was only local: the probability that fixes one is 100%… but subsequent measurements can destroy that conditioning… it is only local.
Classical Warm-up
Let be the classical permutation group on symbols. The algebra of continuous functions on is generated by indicator functions:
.
This algebra is commutative, but we will use some non-commutative algebraic analogues. Let be the uniform probability distribution on and by the associated state on :
When choosing a permutation at random what is the probability that it sends ? Well, this will equal, in some notation we won’t fully explain here:
.
Once this has been observed, there is a conditioning of the state :
.
The state was given by but is now given by . Now, after having observed this random permutation mapping , we can ask it another question.
Consider a subset and define:
.
This is an observable, which basically asks of a permutation, do you map three into ? One for yes, zero for no. So let us ask this of :
What is the probability that a random permutation maps three into after having been observed mapping one to one?
We find, with a fairly elementary calculation that the answer to this question is:
.
If , we get further conditioning, to let us say :
What is the probability that after seeing after we see ? We find it is:
.
Therefore, where means after, and the state-conditioning implicit
Now let us ask a ridiculous question. What was the probability that ? But is just a conditioning of , which mapped one to one with probability one:
.
Of course the answer is zero. Can we actually see it in the above framework: well, yes, because the algebra of functions is commutative. You end up with evaluating a state at
,
but commutativity sees … and no permutation maps one to one and one to two (you’d need a relation to do that), and so , so is the length five monomial above, and so is the probability we spoke about.
We don’t have to do state conditioning and multiplication to calculate the probability that a random permutation maps one to one, then maps three into , then maps two to two though. Where :
.
Let us remark that this probability is increasing in : the less we specify about the event, in this case represented by the projection , the more general it is, the larger the probability.
Let’s Go Quantum
In the case of quantum permutations, so talking the ridiculous question of asking what is the probability that a quantum permutation maps one to two after it had previously mapped one to one… is no longer zero. Where , the probability of the analogue of a “random” quantum permutation, the Haar state doing this is:
Anyway, the quantum versions of the are entries of a universal magic unitary. We say:
,
where . We find this probability is:
.
This is also increasing in . Again, the less specificity about the event, the greater the probability.
This quantity is related to the classical probability above, and there are asymptotic similarities. Writing , where is the complement of in :
I guess this also says, the larger , the more similar the classical and quantum probabilities.
A twist
What if instead of looking at after after but instead we asked about ? This should be non-zero, but what is the dependence on ?
From our classical intuition, we would probably just expect, well, the same really. The larger the value of , the less we are saying about the event. The larger the probability. But in fact this is not the case. The probability is largest when is close to . We will write down the probability, and then explain, mathematically, why the symmetry with respect to , with respect to :
.
Proof: Consider . Insert between them :
.
Like in the classical case, by definition here, . So split into two sums:
.
Now, classically, this is just a sum of zero terms equal to zero, but not in the quantum world where we have these . They are not positive though. We can now split:
.
Now take the of both sides to show that:
This yields the strange probability above. I think any intuition I have for this would be very much post-hoc. I think I will just let it hang there as something weird, cool and mysterious about quantum permutations…
This paper referenced in the title (preprint here) tries to establish some very basic properties of a so-called exotic quantum permutation group, one intermediate to the classical and quantum permutation groups:
.
If a compact matrix quantum subgroup (here is generic, not exotic) given by a quotient , is such that for all monomials in the generators :
,
then in fact . In the paper above I explored calculating the Haar state on using invariances related to the inclusion … the point being that the Haar measure on exotic shares these invariances too… and perhaps, very speculatively, we could show that these Haar states coincide on such monomials… and a famous open problem in the theory would be solved.
The paper above fails at generators of length four though. The invariances do not determine the Haar measure on and we have to include a representation theory result around the law of the main character to give the explicit formulae. If we leave out the representation theory input, we have the Haar state up to a parameter.
However, a very basic algebraic result, that a product of three generators in exotic can be zero for trivial reasons only, allows us to put bounds on the Haar state. If these bounds could force the fourth moment of the main character (with respect to the Haar state) to equal 14, then the Haar state on length four monomials would be equal for both. Alas… they only bound them less than or equal to 15. At this point the paper gives up… but this moment is a whole number, either 14 or 15… so I added the relation that the fourth moment is 15… and what comes out is that the parameter above is zero… but when this parameter is zero we find, in exotic :
,
but this is not the case, as is not zero for trivial reasons, and the Haar state is faithful… the fourth moment equal to 15 gives classical . Therefore the fourth moment for exotic is forced equal to 14, giving the same explicit formula for length four generators as for . Further work needed here.
Idea and Intuition
Let be a (usually finite) set of generators and a (usually finite) set of relations between the generators. The generators at this point are indeterminates, and we will be momentarily vague about what is and isn’t a relation. We write (if it exists!) for the universal -algebra generated by generators and relations .
It has the following universal property. Suppose . Let be a -algebra with elements that satisfy the relations , then there is a (unique) *-homomorphism mapping . This map will be a surjective *-homomorphism (aka a quotient map and a quotient of .
If the generate , , then is a surjective *-homomorphism.
My (highly non-rigourous, the tilde reminding of hand-waving) intuition for this object is that you collect all (really all, not just isomorphism classes, we want below and e.g. ) of -algebras generated by generators satisfying the relations and forming a “big direct sum/product thingy” out of all of them:
.
Then the *-homomorphism given by the universal property is given by projection onto that factor (which is a surjective *-homomorphism, a quotient):
.
This intuition works well but we should give a brief account of things are done properly.
First off, not every relation will give a universal -algebra. For example, consider and . The problem here is one of norm. Recall our rough intuition from above. What is the norm on , this big thing ? It should be something like, where the norm of is the supremum over the factors:
The first approach to show that does not exist is to consider for each the -algebra which is singly-generated by the self-adjoint . But the norm in is the supremum norm, so we find . From here:
which is unbounded. The relations must give a bounded norm to the generators.
As an example of relations that do bound the generators, consider, self-adjoint generators such that the sum of their squares is the identity:
.
These relations bounds the norm of the generators 1, and this gives existence to this algebra, using the Gelfand philosophy giving the “algebra of continuous functions on the free sphere”, (I think first considered by Banica and Goswami).
Note here the relations are given by polynomial relations. If the polynomial relations are suitably admissible (i.e. give a bound to the generators), in this setting there is a real construction (real vs our ridiculous ) of . See p.885 (link to *.pdf quantum group lecture notes of Moritz Weber).
In fact, this is only a small class of the possible relations. I suggest there are at least two more types:
- relations that would be (admissible) norm relations (for example, in one generator, adding , a non-polynomial relation, to the polynomial relation gives an admissible set of relations, and . For /norm relations see here and maybe here.
- (admissible) strong relations (see here for a use of this, with reference)
The constructions in one or both of cases might be constructive, as in the case (admissible) polynomial relations, but there is also an approach using category theory. But the main feature in all such definitions is the universal property, whose use could be summarised as follows:
Let be a universal -algebra. The universal property can be used to answer questions about such as:
- is some polynomial in the generators non-zero,
- is infinite dimensional,
- is non-commutative;
because, if is a -algebra with elements that satisfy the relations then there is a unique *-homomorphism . So, for example, where is some such then
- if , then as ,
- if is infinite dimensional then is a surjective *-homomorphism onto an infinite dimensional algebra, and so the domain is infinite dimensional too.
- if the commutator , so that is non-commutative, then so is as
These quotients can be considered models of .
Two Examples
A projection in a -algebra is such that . Consider
.
Existence is easy, because the norm of a non-zero projection is one. To answer questions about this algebra consider the infinite dihedral group . This has group algebra and group -algebra . Note that and in satisfy the relations of , and so we have a *-homomorphism (in fact a *-isomorphism) . This tells us that any monomial in the generators of is non-zero, is infinite dimensional, and is non-commutative.
A partition of unity is a finite set of projections that sum to the identity, . A magic unitary in a -algebra is a matrix such that the entries along any one row or column form a partition of unity. Consider (notation to be kept mysterious):
.
Consider the following magic unitary:
.
Note that the satisfy the relations of and in fact generate from above. Thus we have a quotient which shows that is infinite dimensional and noncommutative.
It is possible to show using a magic unitary with entries in that for , a monomial with entries in is zero for trivial reasons only (link to *.pdf, from Theorem 1 on).
In addition it can be shown that for (and similarly ) the matrix in with – entries
is a magic unitary, and thus by the universal property is a *-homomorphism… the comultiplication giving the structure of a compact quantum group.
Commutative Examples
If a universal algebra is commutative (as in commutativity, , is one of the relations, vs the relations imply commutativity, as in (nice exercise)), we write . In this case Gelfand’s Theorem, that , often allows us to easily identity the algebra (vs the noncommutative case where the universal algebra is mostly studied via models, quotients).
Theorem
If is a (polynomial) universal commutative -algebra, then it of the form , and is given by the tuples that satisfy the relations of of .
Proof: Characters are *-homomorphisms .
Suppose that satisfy the relations. Then by the universal property, is a *-homomorphism.
On the contrary, suppose that is a character. Then the relations are preserved under a *-homomorphism.
Examples
For , projections in are just the scalars zero and one. Thus the spectrum is and is the algebra of continuous functions on four points.
For collect the tuple of generators in a matrix. The relations imply that each such tuple is in fact a permutation matrix, and so the universal algebra above is the algebra of continuous functions on .
For
you end up with tuples of real numbers in whose sum of squares is one… otherwise known as the sphere .
Liberations
An interesting business here is to start with a universal commutative algebra, say one of the three examples above… and see do you get something strictly bigger, necessarily non-commutative, if you drop commutativity. In the above, yes you do. Gelfand’s theorem says that a commutative unital -algebra is the algebra of continuous functions on a compact space (which we call a classical space). The Gelfand Philosophy says therefore that a noncommutative unital -algebra can be thought of as the algebra of continuous functions on a compact quantum space . Note here is not a set-of-points, but a virtual object, and strictly is just notation (but see here).
Liberating the second example above from commutativity is the passage from the permutation group to the quantum permutation group . Liberating the third example above gives the passage from the real sphere to a quantum sphere called the free sphere .
We can also, of course, work in the other direction, imposing commutativity on not-necessarily universal . If we write , then imposing commutativity gives us the classical version of .
Imposing commutativity is not so scary: using the above you just get … and everything we said above about identifying characters on holds for too.
This can be used: for example if a quantum group acts on a structure , then its classical version acts on . This idea was used by Banica and I to show that not every quantum permutation group is the quantum automorphism group of a finite graph (link to *.pdf).
- If you have positive elements in a -algebra with bounded sum, say then we can bound the summands . Write . Note is positive with norm . Let be a state such that and apply this to , which yields, with bounded of norm one, . The result follows by positivity of the sum and the state. To apply to the above play with the identity. Incidentally, I cannot remember how Murphy proves the existence of but I like for positive in a -algebra, . Then let and define a state on . It is the case that , also equal to the norm of in the ambient algebra (by a spectral radius theorem). Extend the evaluation functional to the whole algebra by Hahn-Banach. ↩︎
I am or rather was interested in the following problem: while we cannot hope to measure with infinite precision in the real world, in the mathematical world can I measure a continuous-spectrum self-adjoint operator given a fixed state? That is measure it with infinite precision?
Let be a unital -algebra, and a state on it… actually I will use the Gelfand–Birkhoff picture:
Note that has an extension to a -weakly continuous state on the bidual, . The algebra sits isometrically in the bidual: the bidual as a von Neumann algebra contains the spectral projections of any self-adjoint . We use the notation for Borel .
Let . Define:
.
Suppose for a state that for all :
.
(the situation where will be moot).
Then we want to consider the entity:
.
If this limit exists then it is a state.
Alas, this limit does not exist in general. There is a commutative counterexample by Nik Weaver on MO, which we will share here.
Let and given by and integration against Lesbesgue measure. Let and .
Define
,
and , an element of .
Consider and let , with . It is possible to show that in this case:
.
However, at , we get . This means that the limit above does not exist.
Now, without proof we could expect that for , and the same and , we could expect that in fact exists, and .
The problem here is that for , functions that disagree on a set of measure zero are identified and in general does not make sense for .
The best we can do is measure up to tolerance . Say we measure with a state . Then we get conditioning of to a state:
In the commutative case, this is giving the average of on the interval .
I had hoped to use to explain why classical spheres don’t admit quantum symmetry. Alas the above means my argument probably cannot work (well, maybe I can use the of room?)
Perhaps we could try and understand in which -algebras the state is well-defined… but we can say at least for today that we cannot measure continuous observables with infinite precision… even mathematically.
…and why it doesn’t work for a quantum alternating group
Despite problems around its existence being well-known, the Google search “quantum alternating group” only gets one (relevant) hit. This is to a paper of Freslon, Teyssier, and Wang, which states:
We therefore have to resort to another idea, which is to compare the process with the so-called pure quantum transposition random walk and prove that they asymptotically coincide. This is a specifically quantum phenomenon connected to the fact that the pure quantum transposition walk has no periodicity issue because there is no quantum alternating group.
Let us explain this a little. Take a deck of cards, say in some known order. What we are going to do is take two (different) cards at random, and swap them. The question is, does this mix up the deck of cards? What does this question mean? Let be the order of the cards after of these pure random transposition shuffles. If the shuffles mix up the cards then:
.
The random variable is a product of transpositions and using the sign group homomorphism:
.
Take a permutation of odd sign, then:
and so this pure random transposition shuffle cannot mix up the deck of cards. The order of the deck alternates (geddit) between , the alternating group, and , the complement of in (if we allow the two cards to be chosen independently, so that there is a chance we pick the same card twice, and do a do-nothing shuffle, then this barrier disappears and this random transposition shuffle does mix up the cards. See Diaconis & Shahshahani).
Amaury Freslon instigated a study of a quantum version of the above random walk. The probability distribution of the shuffles above is:
.
The measure is the measure uniform on transpositions in . No such measure makes direct sense in the quantum setting, but if we recast this measure as the measure constant on permutations with fixed points there is a direct analogue, (see Section 4 for details).
If is the fundamental representation, and , an element of , the entry-wise abelianisation, the trace counts the number of fixed points. The functions asking of a permutation, do you map ? One for yes, zero for no:
.
Freslon’s can be thought of as the measure uniform on those quantum permutations that satisfy .
If you shuffle according to classical , you meet the periodicity issue associated with . However, there is no such periodicity issue in the quantum case, because there is nothing analogous to a quantum sign homomorphism:
.
The classical alternating group is:
,
but with no quantum sign, we don’t seem to be able to define a quantum alternating group in the same way.
This is related to difficulties around the determinant (equal to the sign for permutation matrices). I think, but would have to check, that we can quotient by the relation , and you get in that case… but problems with the determinant mean this cannot happen in the quantum case.
Private communication has shown me a proof that if you quotient any compact matrix quantum group with , then you get a commutative algebra, that is, a classical group. In particular,
,
and not something non-commutative, corresponding to a quantum alternating group .
Another way?
This no-go result, which is cool but unpublished, doesn’t rule out a quantum alternating group of the form:
.
There is indeed for every a genuine quantum group with , but this quantum group does not sit nicely as a quantum subgroup of (from here, Section 4).
Given a quantum permutation group , the set of characters on universal forms a group , the classical version of . The group law is convolution:
.
I have a particular interest in characters, and have a pre-print (Section 4) doing some analysis on them. Let be a character. Then, applying what I call the Birkhoff slice (Section 4.1), , applying a state to the fundamental magic representation component-wise, gives a permutation matrix:
.
In this case we write , and where is the abelianisation, :
.
The characters have support projections, and these in general do not live in but in the bidual . These support projections live in the strong closure of in its bidual. Briefly, let:
.
(as an aside, if we transpose in the indices, so instead of , then .)
It turns out that the support projection of is the strong limit of … and if converges to zero… then is zero, not a character, and is not in the classical version of .
Enter this talk by Gilles Gonçalves De Castro (Universidade Federal de Santa Catarina, Brazil), who teaches us with his coauthor Giulioano Boava that it is possible to include (admissible) strong as well as norm relations in defining a universal -algebra.
An idea!
So, why not take , or rather , and quotient out the characters in the complement of in ? We can do this via the relations for , they are admissible. So… define the following algebra:
There is a lot of work to do here to prove that this is a quantum group… have we a *-homomorphism ? But at least we have a candidate algebra.
Failure
Actually we don’t. In fact, either the algebra does not admit a quantum group structure OR
,
Unfortunately, because of non-coamenability issues, lots of algebras of continuous functions on quantum permutation groups also have for all … not because they have no classical versions, but because classical versions are defined on the universal level… where there are always characters… at the reduced level the algebras admit no characters.
In particular, the reduced algebra of functions satisfies for all , and so, if we assume that DOES have a quantum group structure, we have a comultiplication preserving quotient:
.
Then with the help of J. De Ro, this means we have a Hopf*-algebra morphism on the level of the dense Hopf*-algebras, saying that is a quantum subgroup of . But of course this is a quantum subgroup of and so it follows in this case that the two quantum groups coincide.
This isn’t a great no-go theorem: but a log of something that doesn’t work. And of course this approach doesn’t work for any subgroup of .
Alice, Bob and Carol are hanging around, messing with playing cards.
Alice and Bob each have a new deck of cards, and Alice, Bob, and Carol all know what order the decks are in.
Carol has to go away for a few hours.
Alice starts shuffling the deck of cards with the following weird shuffle: she selects two (different) cards at random, and swaps them. She does this for hours, doing it hundreds and hundreds of times.
Bob does the same with his deck.
Carol comes back and asked “have you mixed up those decks yet?” A deck of cards is “mixed up” if each possible order is approximately equally likely:
She asks Alice how many times she shuffled the deck. Alice says she doesn’t know, but it was hundreds, nay thousands of times. Carol says, great, your deck is mixed up!
Bob pipes up and says “I don’t know how many times I shuffled either. But I am fairly sure it was over a thousand”. Carol was just about to say, great job mixing up the deck, when Bob interjects “I do know that I did an even number of shuffles though.“.
Why does this mean that Bob’s deck isn’t mixed up?
I gave a talk to the Quantum Groups & Interactions Workshop in Glasgow.
Abstract: Woronowicz proved the existence of the Haar state for compact quantum groups under a separability assumption later removed by Van Daele in a new existence proof. A minor adaptation of Van Daele’s proof yields an idempotent state in any non-empty weak*-compact convolution-closed convex subset of the state space. Such subsets, and their associated idempotent states, are studied in the case of quantum permutation groups.
I gave the same talk to the Non local games seminar and C*-Days in Prague:
Abstract: The first part of the talk will give a post hoc motivation for Banica’s 2005 definition of the quantum automorphism group of a finite graph, and in doing so attempt to build a good intuition for quantum automorphism. Frucht in 1939 showed that every finite group is the automorphism group of a finite graph, and a natural pursuit in the theory of quantum automorphism groups is to establish quantum analogues of this result. Based on a joint work with Banica, the second part of the talk will address this question.
Slides below, video here from the Prague NCGT Group’s YouTube:
The slides are subtly different: the one for C*-Days is the latest version:
Recent Comments