One of the nicest things that happen on math blogs is that people write expository posts on other people’s work. Tim Gowers and Terry Tao have set a fine example in their expositions of the works of Fields Medalists or Abel Prize laureates. These are among the most interesting and important posts out there, I think.
Recently, at the Canadian Mathematical Society’s Winter Meeting, Matthew Kennedy was awarded the CMS 2012 Doctoral Prize (at the meeting several other prizes were awarded by the CMS as you can see on the meeting’s homepage). See here for the media release, and here for a description of the prize and a list of past recipients.
Matt gave a plenary lecture at the CMS meeting surveying (some of) his work. Here are the slides, which are certainly worth looking at (thanks to Matt for allowing me to post them). Note that on the last slide there are photos of two gentlemen with no captions; these are Ken Davidson (on the left, Matt’s PhD supervisor) and Heydar Radjavi (Matt’s undergraduate research supervisor).
In this post I will describe a couple of Matt’s first really big results, one of which didn’t make it into his talk. These are the existence of wandering vectors for (certain) free semigroup algebras, and the reflexitivity of free semigroup algebras. These result appeared in the tour-de-force paper “Wandering vectors and the reflexivity of free semigroup algebras”; here are links to arxiv, mathscinet, and the official version in Crelle.
1. Free semigroup algebras
Let $latex H$ be a Hilbert space. A row isometry is an n-tuple $latex V_1, ldots, V_n$ isometries which have mutually orthogonal ranges (n here is allowed to be any integer, but let us assume that $latex n geq 2$). Thus we have the relations $latex V_i^* V_j = 0$ if $latex i neq j$ and $latex V_i^* V_i = I$ for all i. The reason for the terminology is that a tuple $latex V_1, ldots, V_n$ is a row isometry if and only if the row operator $latex V = [V_1, ldots, V_n] : H oplus ldots oplus H rightarrow H$, defined on the sum of n copies of $latex H$ by $latex V(h_1, ldots, h_n) = sum V_i h_i$, is isometric.
At first sight, it might not be clear if there is a rich supply of row isometries. Let me start by describing the canonical example.
Let $latex F^n_+$ be the free semigroup generated by n generators $latex 1,ldots, n$. Let $latex H$ be a Hilbert space with orthonormal basis $latex {e_{w}}_{win F^n_+}$ parametrized by $latex F^n_+$. We define n operators $latex L_1, ldots, L_n$ on $latex H$ by
$latex L_i e_w = e_{iw} quad , quad w in F^n_+ ,, , ,, i=1, ldots, n .$
It is easy to see that $latex L_1, ldots, L_n$ is a row isometry. The unital norm–closed algebra $latex mathcal{A}_n$ that it generates is called the noncommutative disc algebra and was first introduced and studied by Gelu Popescu. The unital weak–operator–closed algebra that is generated by $latex L_1, ldots, L_n$ is denoted $latex mathcal{L}_n$ and is referred to as the left regular free semigroup algebra or as the noncommutative analytic Toeplitz algebra (also first introduced and studied by Popescu). The C*–algebra that this row isometry generates is called known as the Cuntz–Toeplitz algebra.
It is well known that the C*–algebra generated by a row isometry is *–isomorphic to the Cuntz algebra if $latex sum V_i V_i^* = I$, and is *–isomorphic to the Cuntz–Toeplitz algebra otherwise — no other C*–algebras can be generated by a row isometry.
It is less known that, no matter how the particular isometries are chosen, the norm–closed unital algebra generated by $latex V_1, ldots, V_n$ is isometrically isomorphic to the noncommutative disc algebra $latex mathcal{A}_n$ (this was proved by Popescu in this paper).
It might therefore come as a surprise that the weak–operator–closed unital algebras generated by different row isometries can be totally different; in a sense, they can be as different from one another as weak–operator closed algebras can be. More on this below, but for now I’ll just state that such an algebra does not have to be even algebraically isomorphic to $latex mathcal{L}_n$.
Thus, the (non–self–adjoint) weak–operator–closed algebras generated by a row isometry contains more information on the row–isometry than the C*–algebra or norm–closed algebra generated by the row isometries. Since this is the situation, and since row isometries have been of growing interest for several decades now, it makes sense to study these weak–operator–closed algebras.
A free semigroup algebra is a weak–operator–closed unital algebra generated by a row isometry. This class of operator algebras was introduced and studied by Kenneth Davidson and David Pitts in these two papers, and in a series of subsequent papers. Let me mention also this paper from 2001 by Davidson, Katsoulis and Pitts, where a general structure theorem for free semi–group algebras is obtained. This paper ended with some interesting and important open problems. Here is one of these open problems (two more will be described below).
Problem 1: Is there a row isometry such that the free semigroup algebra it generates is a von–Neumann algebra?
Charles Read solved this problem by showing, actually, that $latex B(H)$ is a free semigroup algebra! There are many ways to see that $latex mathcal{L}_n$ is different in many ways from $latex B(H)$. From a spatial perspective, $latex mathcal{L}_n$ has joint eigenvectors, $latex mathcal{L}_n$ has no non–scalar normal elements, $latex mathcal{L}_n$ a gigantic commutant, $latex mathcal{L}_n$ has no non–zero compacts, etc. From an intrinsic perspective these two algebras are not even algebraically isomorphic let alone isometrically isomorphic; for example, one has many ideals and the other has only one, one has no proper projections, etc. One may consult the above mentioned papers for more details.
2. Reflexivity and wandering vectors
Given an operator algebra $latex mathcal{A} subseteq B(H)$, its lattice of invariant subspaces is defined
$latex Lat(mathcal{A}) = {F subseteq H : forall T in mathcal{A} . TF subseteq F} .$
And given a family $latex mathcal{F}$ of subspaces of $latex H$, the algebra corresponding to $latex mathcal{F}$ is defined
$latex Alg(mathcal{F}) = {T in B(H) : forall F in mathcal{F} . TF subseteq F } .$
An operator algebra $latex mathcal{A}$ is said to be reflexive if $latex mathcal{A} = Alg(Lat(mathcal{A}))$. The notion of reflexivity grew out of problems related to the invariant subspace problem, and was introduced by Radjavi and Rosenthal in 1969 in this paper (the terminology was suggested by Halmos). The problem of whether or not an algebra is reflexive, or satisfies some quantified version of reflexivity, has been a problem of central interest in operator algebras. One of the open problems that Davidson, Katsoulis and Pitts posed at the end of their 2001 paper was
Problem 2: Is every free semigroup algebra reflexive?
Say that a free semigroup algebra is of type L if it is algebraically isomorphic to $latex mathcal{L}_n$ (I am perhaps using outdated terminology. Today type L algebras are also said to be analytic, which is perhaps more suggestive). Davidson and Pitts observed early on that $latex mathcal{L}_n$ is reflexive. By the structural results of Davdison, Katsoulis and Pitts the above problem can be reduced to the problem of whether or not every free semigroup algebra of type L is reflexive. The problem is that algebras of type L can behave spatially very differently from $latex mathcal{L}_n$, so at first it is not clear how being algebraically isomorphic to $latex mathcal{L}_n$ helps solve the problem of reflexivity — which is a spatial problem. (Remark: by spatial we mean something that has to do with the particular representation of the algebra on a certain space. So invariant subspaces, eigenvectors and so forth are spatial notions, whereas the ideal structure is an algebraic notion). It was not clear at first, and it did not become any clearer later, and the problem of whether or not every type L algebra is reflexive remained open since 2001 until Matt solved in 2011 (I am citing year of publication in both cases).
It turned out that this problem is equivalent to a seemingly unrelated problem. Let $latex mathcal{A}$ be a free semigroup algebra on $latex H$ generated by the row isometry $latex V_1, ldots, V_n$. A unit vector $latex u in H$ is said to be a wandering vector for $latex mathcal{A}$ if the set
$latex {V_{i_1} cdots V_{i_k} u big| i_1 i_2 cdots i_k in F^n_+ }$
is orthonormal. For example, in the left regular free semigroup algebra every one of the basis vectors $latex e_w$, $latex w in F^n_+$, is a wandering vector.
Since the left regular representation is the canonical one, it is at first hard to imagine that a free semigroup algebra can have no wandering vector. But this can indeed happen: indeed, if there is a wandering vector then there are many nontrivial invariant subspaces, while on the other hand $latex B(H)$ — a free semigroup algebra — has none.
But Davidson, Katsoulis and Pitts conjectured that every free semigroup algebra of type L has a wandering vector. This was their third open problem posed at the end of their 2001 paper.
Problem 3: Does very free semigroup algebra of type L have a wandering vector?
In 2005 Davidson, Li and Pitts proved that if a type L algebra has a wandering vector then it is reflexive.
3. What Kennedy did
In his 2011 paper “Wandering vectors and the reflexivity of free semigroup algebras” Kennedy solved the above Problems 2 and 3. The main (in my opinion) technical achievement was proving that every type L algebra has a wandering vector. From what I wrote above this implies in turn (by results of other researchers) that every type L algebra is reflexive and therefore that every free semigroup is reflexive (he obtained some other and sharper results which I shall not discuss). I will end this post by discussing the main ingredient that went into his proof that a wandering vector exists.
Let $latex V_1, ldots, V_n$ be a row isometry. How does one produce a wandering vector? You might try to begin with a unit vector $latex u$ in the range of $latex V_1$. Then for all $latex i=1, ldots, n$, $latex V_i u$ is orthogonal to $latex V_j u$ for $latex j neq i$ and also to $latex u$ if $latex i geq 2$ (because the ranges are orthogonal). But there is no reason why $latex u$ would be orthogonal to $latex V_1 u$. If you go and try to fix this in some direct way then you will probably not get very far. Kennedy’s approach is quite indirect, using what he calls “dual algebra techniques”, which he attributes to Bercovici, Foias, Pearcy, and others, and traces back to S. Brown’s proof of the existence of invariant subspaces for subnormal operators.
Definition: Let $latex mathcal{S}$ be weak*–closed subspace of $latex B(H)$. $latex mathcal{S}$ is said to have property $latex mathbb{A}_1$ if for every weak*–continuous functional $latex phi$ on $latex mathcal{S}$, there exist $latex x,y in H$ such that for all $latex T in mathcal{S}$
$latex phi(T) = (Tx,y) .$
Property $latex mathbb{A}_1$ can be thought of heuristically as measure of how small the predual of a subspace is. This is a truly non–trivial property to possess (and therefore very useful); for example, $latex B(H)$ does not have property $latex mathbb{A}_1$. On the other hand, the infinite amplification of any weak* closed subspace does have property $latex mathbb{A}_1$ (why?).
Kennedy proved that every type L algebra has property $latex mathbb{A}_1$ (he actually proved that it has property $latex mathbb{A}_1(1)$, which is a sharper version). A thick part of his paper was dedicated to this, and the argument is quite delicate and hard. I will not go into the details of that. Instead, I want to explain how property $latex mathbb{A}_1$ implies the existence of a wandering vector, which is much easier to explain and shows how property $latex mathbb{A}_1$ can be useful (but it must be understood that in order to see the heart of the proof you will really have to read Kennedy’s paper).
Theorem (Kennedy): Every type L free semigroup algebra has a wandering vector.
Proof: Let $latex V_1, ldots, V_n$ be a row isometry on $latex H$ and let $latex mathcal{A}$ be the free semigroup algebra that they generate. Let $latex mathcal{A}_0$ be the weak*–closed ideal that is generated by $latex V_1, ldots, V_n$. The canonical algebraic isomorphism between $latex mathcal{A}$ and $latex mathcal{L}_n$ sending $latex V_i$ to $latex L_i$ is known to be weak*–continuous (but this is not trivial). Therefore, $latex mathcal{A}_0$ is a nontrivial ideal which does not contain $latex I := I_H$. By the Hahn–Banach Theorem, there is a weak*–continuous functional $latex phi$ on $latex mathcal{A}$ which annihilates $latex mathcal{A}_0$ and maps $latex I$ to $latex 1$. Since $latex mathcal{A}$ has property $latex mathbb{A}_1$, there are $latex x, y in H$ such that
$latex phi(T) = (Tx,y)$
for all $latex T in mathcal{A}$. We may assume that $latex y in mathcal{A} x$, because if it is not then we replace it with its projection on that space. On the other hand, we have that $latex (V_{i_1} cdots V_{i_k} x, y) = 0$ for all $latex i_1 i_2 cdots i_k in F^n_+$, therefore $latex y perp mathcal{A}_0 x$. Thus $latex y in mathcal{A}x ominus mathcal{A}_0 x$ (the orthogonal complement of $latex mathcal{A}_0 x$ inside $latex mathcal{A} x$).
Let $latex u = y/|y|$. Then $latex u$ is the wandering vector that we are looking for. Indeed, for every $latex i_1, ldots, i_k$, the vector $latex V_{i_1} cdots V_{i_k} u$ is in $latex mathcal{A}_0 u subseteq mathcal{A}_0 mathcal{A} x = mathcal{A}_0 x$, and therefore orthogonal to $latex u$, thus
$latex (V_{i_1} cdots V_{i_k} u, u) = 0 .$
From here, using the pair–wise orthogonal ranges assumption, it easily follows that for every two distinct words $latex i_1 i_2 cdots i_k$ and $latex j_1 j_2 cdots j_m$ in $latex F^n_+$, $latex (V_{i_1} cdots V_{i_k} u, V_{j_1} cdots V_{j_m} u) = 0$. That shows that $latex u$ is a wandering vector and completes the proof.