## James Bond will return

… because nothing that makes money will ever be laid to rest. (Exhibit A.)

On a different note, if I can get some respite from viruses and visa headaches, blogging here may also return. It remains to be seen if I have enough energy and focus to finish off the series of posts on the central amenability constant of a finite group (which nowadays I have tentatively dubbed the ZL-amenability constant). At this rate the paper may actually get finished and submitted before the blog posts, which wasn’t the intention, but is probably the sensible way round to do these things…

Well, as usual I’ve not kept up enough with the blog. *Déménagement* has taken priority over the last few weeks. As it happens, while dusting off a suitcase that hasn’t been used for *years*, I found this item inside:

I went back to old haunts in 2011 to collect my MMath, and found that a bookstore I was rather fond of was gone. Not quite Martin Blank finding his old home turned into a convenience store, but it still made me a touch maudlin.

Ah well. *Tempus fugit*, and all that; you can’t cling on to auld lang syne forever, even if marketed nostalgia is one of the staple products of our culture. I still wish that they’d kept more 2nd-hand bookstores and had fewer plastic bars/shops, though.

## Removing the Stone of Shame

Following on, in a sense, from the previous post: soon I shall be rid of this turbulent priest, erm, I mean, teaching calculus to 1st year North American students.

(This post brought to you from the Department of Procrastination.)

## Our dream of safety has to disappear

The post title is from W. H. Auden’s Leap Before You Look — full text at this page.

Years ago it was pointed out to me that the rhyme scheme is

abab bbaa baab abba aabb baba

illustrating rather neatly that “4 choose 2 equals 6″. Note also that the last word of each stanza alternates between “leap” and “disappear”, and that there is a kind of “reflectional symmetry” in the order of the stanzas. Specifically, the transposition of a and b has the effect of reversing the order of the 6 4-tuples.

Hmm, maybe I should try this as an example if I get to teach a course introducing people to finite groups…

## The central amenability constant of a finite group: Part 4 of n

Well, that break was longer than intended…

In the last post, we claimed that for every finite, non-abelian group **G**. It turns out that the easiest way to prove this goes via a certain minorant for which we will work with in some subsequent posts. In this post, we’ll introduce this minorant, give an explicit lower bound, and then briefly indicate how it allows us to show the stronger result that

## 1. Recap

Recall that

We can rewrite this in a cosmetic but suggestive way. Observe that the inversion map on **G**, which sends each element to its inverse, maps conjugacy classes to conjugacy classes. It follows that for each D in Conj(**G**), the set

also belongs to Conj(**G**). Moreover, the map is an involution, in particular is bijective. Therefore, since for every character , we obtain

We already saw this idea, in a special case, when we looked at for abelian groups. There, the point of this small change was that it made the expression look more like an inner product, so that one could apply Schur orthogonality relations; a similar idea was applied in a recent paper of Alaghmandan, Samei and myself (arXiv 1302.1929) to handle certain groups which are close to the abelian case in some sense.

## 2. A remark on normalized versus unnormalized counting measure

First, I need to clear up an issue of normalization conventions, which I omitted to deal with before. In our series of posts, we have always been working on the complex group algebra equipped with the -norm. That is, we are looking at where denotes counting measure on the finite set **G**.

On the other hand, the paper of Azimifard–Samei–Spronk (henceforth referred to as [ASS09]), where the amenability constant of the centre of the group algebra was first studied, considers where **G** is a compact group and denotes uniform probability measure on **G**.

However, there is no serious conflict. For if **G** is a finite group, let **A** denote equipped with counting measure and equipped with convolution **using **, and let **B** denote equipped with uniform probability measure and equipped with convolution **using **. Then a direct calculation shows that the obvious isometric rescaling map from **A** to **B** is in fact an isomorphism of Banach algebras. In particular, **A** and **B** have the same amenability constant. Thus, our formula from coincides with the formula in [ASS09] for the amenability constant of .

## 3. A minorant for

At a naive level (but not a completely facile one) we might say that the difficulty in getting non-trivial lower bounds on is due to the fact that one takes the modulus of a sum of different terms, inside which there might be significant cancellation. Indeed, this is exactly what happens in the case of an abelian group: see the previous post for details.

One situation where we can avoid cancellation is where the terms in the sum are all non-negative, so that the modulus is just the sum itself. Looking at the revised formula for , we see that this happens whenever *C=D* (it may also happen for some other choices of *C* and *D*, but let us ignore that for now). Moreover, if we only want a lower bound on and not its precise value, we are free to discard terms indexed by particular *C* and *D*. Thus, as observed in [ASS09], is bounded below by the following quantity

(The paper [ASS09] does not give this quantity a specific symbol, but in subsequent posts it will appear frequently enough that some extra notation seems warranted.)

In the previous post, we claimed that if **G** is a non-abelian finite group then we have > 1. We can now give a sharper statement. (The calculation in [ASS09] does not give the explicit bound that we do, but it is implicit in their work.)

Proposition 1 (Azimifard–Samei–Spronk, 2009)LetGbe a finite, non-abelian group, and letThen

*Proof:* Compare the formula (1) which defines with

Rearranging the sum and using the Schur row and column orthogonality relations, we see that (2) is equal to

Hence

Now all of the terms on the right hand side are non-negative. Some of them may be zero (for instance, whenever *C* consists of just a single point, or whenver ) but we can identify at least one strictly positive term. Namely, let be a conjugacy class of size *s*, and consider the trivial character which takes the value 1 everywhere. Then

which gives us the lower bound that was claimed.

Note that our lower bound “gets worse” as **G** gets bigger. Indeed, I believe the following question is still open.

Question.Is the infimum of over all finite non-abelian groupsGstrictly greater than 1?

Nevertheless, as mentioned in the first post of this series, we can do better when it comes to , which is the original quantity of interest. This was done in [ASS09] by appealing to a hard result of D. A. Rider, which tells us that the norms of central idempotents have “a gap at 1″.

Theorem 2 (Rider, 1973)LetKbe a compact group, letEbe a finite subset of Irr(K), and let . (The orthogonality relations for irreducible characters imply that is a central idempotent in , and all central idempotents in arise this way.) If , then .

Now let **G** be a finite, non-abelian group. Since , Proposition~1 immediately implies that . Now , where is a central idempotent in . Applying Rider’s theorem to we deduce, as in [ASS09], that .

Rider’s proof is rather long and technical and we will not present the details here. The constant 301/300 is somewhat arbitrary, resulting from choices made in chains of estimates, and can be improved slightly by repeating Rider’s arguments with more nit-picking. However, it seems that a significant improvement in the constant would require new ideas.

In the next post, we will see that with a more careful use of the Schur orthogonality relations, one can improve the lower bound in Proposition~1 to a constant that does not depend on |**G**|, provided that **G** has trivial centre. To do this we will need a new ingredient, not available in [ASS09], which ensures that a group which has an irreducible character of “surprisingly large” degree cannot have any small conjugacy classes except for elements of the centre.

**Edited 2013-06-17:** corrected some typos/omissions.

OK, back to the story of the central amenability constant. I’ll take the opportunity to re-tread some of the ground from the first post.

## 1. Review/recap

Given a finite group **G**, denotes the usual complex group algebra: we think of it as the vector space equipped with a suitable multiplication. This has a canonical basis as a vector space, indexed by group elements: we denote the basis vector corresponding to an element *x* of **G** by . Thus for any function , we have .

(Aside: this is not really the correct “natural” way to think of the group algebra if one generalizes from finite groups to infinite groups; one has to be more careful about whether one is thinking “covariantly or contravariantly”. is naturally a contravariant object as **G** varies, but the group algebra should be covariant as **G** varies. However, our approach allows us to view characters on **G** as elements of the group algebra, which is a very convenient elision.)

The centre of , henceforth denoted by , is commutative and spanned by its minimal idempotents, which are all of the form

for some irreducible character . Moreover, is a bijection between the set of irreducible characters and the set of minimal idempotents in .

We define

and, equipping with the natural -norm, defined by

we define to be . Explicitly, if we use the convention that the value of a class function on any element of a conjugacy class **C** is denoted by , we have

the formula stated in the first post of this series.

## 2. Moving onwards

Remark 1

As I am writing these things up, it occurs to me that “philosophically speaking”, perhaps one should regard as an element of the group algebra , whereG^{op}denotes the group whose underlying set is that ofGbut equipped with the reverse multiplication. It is easily checked that a function on is central as an element of if and only if it is central as an element of the algebra , so we can get away with the definition chosen here. Nevertheless, I have a suspicion that the picture is somehow the “right” one to adopt, if one wants to put the study of into a wider algebraic context.

is a non-zero idempotent in a Banach algebra, so it follows from submultiplicativity of the norm that . When do we have equality?

Theorem 2 (Azimifard–Samei–Spronk)if and only ifGis abelian.

The proof of necessity (that is, the “only if” direction) will go in the next post. In the remainder of this post, I will give two proofs of sufficiency (that is, the “if” direction).

In the paper of Azimifard–Samei–Spronk (MR 2490229; see also arXiv 0805.3685) where I first learned of , this direction is glossed over quickly, since it follows from more general facts in the theory of amenable Banach algebras. I will return later, in Section 2.2, to an exposition of how this works for the case in hand. First, let us see how we can approach the problem more directly.

#### 2.1. Proof of sufficiency: direct version

Suppose **G** is abelian, and let . Then **G** has exactly *n* irreducible characters, all of which are linear (i.e. one-dimensional representations, a.k.a. multiplicative functionals). Denoting these characters by , we have

so that

This sum can be evaluated explicitly using some Fourier analysis — or, in the present context, the Schur *column* orthogonality relations. To make this a bit more transparent, recall that for all characters and all *y* in **G**. Hence by a change of variables in the previous equation, we get

For a fixed element *x* in **G**, the *n*-tuple is a column in the character table of **G**. We know by general character theory for finite groups that distinct columns of the character table, viewed as column vectors with complex entries, are orthogonal with respect to the standard inner product. Hence most terms in the expression above vanish, and we are left with

which equals , since each takes values in . This completes the proof.

#### 2.2. Proof of sufficiency: slick version

The following argument is an expanded version of the one that is outlined, or alluded to, in the paper of Azimifard–Samei–Spronk. It is part of the folklore in Banach algebras — for given values of “folk” — but really the argument goes back to the study of “separable algebras” in the sense of ring theory.

Lemma 3LetAbe an associative, commutative algebra, with identity element1. Let be the linear map defined by . Then there is at most one element_{A}min that simultaneously satisfies =1and for all_{A}ainA.

*Proof:* Let us first omit the assumption that **A** is commutative, and work merely with an associative algebra that has an identity.

Define the following multiplication on :

Then is an associative algebra — the so-called enveloping algebra of **A**. If *m* satisfies the conditions mentioned in the lemma, then

and so, by taking linear combinations, for every *w* in . If *n* is another element of satisfying the conditions of the lemma, we therefore have *n**m*=*m*, and by symmetry, *m**n*=*n*.

Now we use the assumption that **A** is commutative. From this assumption, we see that is also commutative. Therefore

as required.

Now let **G** be a finite group and let **A**= . Because **A** is spanned by its minimal idempotents , and because minimal idempotents in a commutative algebra are mutually orthogonal, satisfies the two conditions mentioned in Lemma 3. On the other hand, if **G** is abelian, consider

Clearly =**1 _{A}**, and a direct calculation shows that for all

*g*in

**G**, so by linearity also satisfies both conditions mentioned in Lemma 3. Applying the lemma tells us that , and in particular

as required.

## Kadison-Singer: solved?

I am a bit suprised and disappointed to see that the online maths communities I lurk around seem largely oblivious to this recent preprint 1306.3969. Here is the abstract: the added emphasis is mine.

We use the method of interlacing families of polynomials to prove Weaver’s conjecture KS2,

which is known to imply a positive solution to the Kadison-Singer problem via Anderson’s Paving Conjecture.Our proof goes through an analysis of the largest roots of a family of polynomials that we call the “mixed characteristic polynomials” of a collection of matrices.

(A few years ago, the 2nd and 3rd authors of that preprint recently made a dramatic improvement in our understanding of a theorem of Bourgain and Tzafriri, see arXiv 0911.1114. So this paper is certainly worth taking seriously at the very least.)

Over on G+, Willie Wong quite sensibly asked for some brief explanation of what the problem said, and why people care(d). I must confess that the full background to the Kadison-Singer conjecture/problem is well outside my area of technical expertise, possibly outside my area of competence. Nevertheless, I can at least link to this article by Casazza and Tremain, which mentions some other conjectures in functional analysis that are known to be equivalent to the Paving Conjecture, and hence (by work of Anderson) to the Kadison-Singer conjecture.

P. G. Casazza, J. C. Tremain. The Kadison–Singer Problem in mathematics and engineering. PNAS vol. 103 (2006) no. 7, 2032–2039

Here is a link to some web material for an AIM workshop on the Kadison-Singer problem, which may give the general audience some idea of work in recent years.

The paper of Weaver which the preprint refers to is:

MR2035401 (2004k:46093) N. Weaver. The Kadison-Singer problem in discrepancy theory. Discrete Math. 278 (2004), no. 1-3, 227–239.

arXiv 0209078

The MathReview of Weaver’s paper, by P. J. Stacey, is short enough that it can be reproduced here:

In [Amer. J. Math. 81 (1959), 383–400; MR0123922 (23 #A1243)], R. V. Kadison and I. M. Singer asked if every pure state on an atomic maximal abelian subalgebra of B(H), the algebra of bounded operators on a separable Hilbert space H, extends uniquely to a pure state on B(H). Developing the approach in [C. A. Akemann and J. Anderson, Mem. Amer. Math. Soc. 94 (1991), no. 458, iv+88 pp.; MR1086563 (92e:46113)], the author formulates a combinatorial version of the Kadison-Singer problem, in terms of unit vectors in

C^{k}. Some positive partial results are then obtained using discrepancy theory.

Perhaps I will keep this blog post updated with some more links, if anyone has suggestions. Though really it should be left to the operator theorists, operator algebraists, *and combinatorists* to write some expositions in the weeks to come.

### Update 2013-06-20

I see there is some attention now that Terence Tao has mentioned this on G+ and thence on the Selected Papers Network. (I admit that when I mentioned the paper on G+, I didn’t tag it with #spnetwork, mainly because I didn’t feel I had anything intelligent to say at the time; and if this #spnetwork is to become useful to the community of research mathematicians, it needs less noise from spectators, and more commentary from people who understand some ideas in the papers under discussion!)

Gil Kalai has a blogpost which says a little more about how the paper of Marcus, Spielman and Srivastava relates to the previous results of Bourgain and Tzafriri, and mentions that Spielman and Srivastava had previously given a new proof – an improved proof? – of Bourgain-Tzafriri’s restricted invertibility theorem.

Orr Shallit has also picked up on this, and offers some thoughts from the perspective of an operator algebraist/operator theorist.