Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 2010 Feb 25;107(11):4840–4844. doi: 10.1073/pnas.0914150107

Kadison–Singer algebras, II: General case

Liming Ge a,b,1, Wei Yuan a
PMCID: PMC2841906  PMID: 20185756

Abstract

A new class of operator algebras, Kadison–Singer (KS-) algebras, is introduced. These highly noncommutative, non self-adjoint algebras generalize triangular matrix algebras. They are determined by certain minimally generating lattices of projections in the von Neumann algebras corresponding to the commutant of the diagonals of the KS-algebras. It is shown that these lattices and their reduced forms are often homeomorphic to classical manifolds such as the sphere.

Keywords: Kadison–Singer lattice, reflexive algebra, triangular algebra, von Neumann algebra


KS-algebras were previously introduced (1). Examples of KS-algebras with hyperfinite diagonals were given and studied. In this article, we shall continue our study of KS-algebras and mostly deal with the case when the diagonal is a finite von Neumann algebra. We shall use the notation and definitions previously introduced (1).

Suppose Inline graphic is a Hilbert space and Inline graphic is the algebra of all bounded operators on Inline graphic. Recall that a KS-algebra is a maximal reflexive subalgebra of Inline graphic with respect to a given von Neumann algebra as its diagonal algebra. Previously (1), we constructed KS-algebras with hyperfinite factors as their diagonal algebras and provided many previously undescribed reflexive lattices. Our main result in this paper is to prove that the reflexive lattice generated by a double triangle (a special lattice with only three nontrivial projections) is, in general, homeomorphic to the two-dimensional sphere S2 (plus two distinct points corresponding to zero and I), and the corresponding reflexive algebra is a KS-algebra. In particular, we show that the algebra that leaves three free projections invariant is a KS-algebra. This shows that many factors are (minimally) generated by a reflexive lattice of projections that is topologically homeomorphic to S2. Noncommutative algebraic structures on S2, determined by the projections, give rise to non-isomorphic factors and KS-factors.

The paper contains five sections. In section two, maximal triangularity is discussed in different aspects. In section three, we describe the reflexive lattice generated by three free projections and show that it is homeomorphic to S2. In section four, we show that this lattice is a KS-lattice and thus the corresponding algebra is a KS-algebra. Certain generalizations of the result is also discussed. In section five, we introduce a notion of connectedness of projections in a lattice of projections in a finite von Neumann algebra and show that all connected components form another lattice, called a “reduced lattice.” Reduced lattices of most of our examples were computed.

Maximality conditions

In the definition of KS-algebras, we require that the algebra be maximal in the class of reflexive algebras with the same diagonal. Our examples of KS-algebras given previously (1) are “maximal triangular” in the class of all algebras with the same diagonal, that is, an algebraic maximality without reflexiveness or closedness assumptions. In general, the algebraic maximality assumption is a much stronger requirement. We call a subalgebra Inline graphic of Inline graphic “maximal triangular with respect to its diagonal C*- (or von Neumann) algebra Inline graphic” if, for any subalgebra Inline graphic of Inline graphic, Inline graphic contains Inline graphic and has the same diagonal as Inline graphic, then Inline graphic is equal to Inline graphic. This may lead to unique, interesting classes of non self-adjoint algebras. Many similar questions as those introduce previously (2), that is, the closedness of Inline graphic, can be asked accordingly.

In the following, we give a canonical method to construct a maximal triangular algebra in the class of weak-operator, closed algebras with respect to a given von Neumann algebra as its diagonal.

Suppose Inline graphic is a von Neumann algebra acting on a Hilbert space Inline graphic and H1,…,Hn are positive elements in Inline graphic such that Inline graphic generate Inline graphic as a von Neumann algebra. From previous work (3), we know that many von Neumann algebras can be generated by such positive elements, especially all type III and properly infinite von Neumann algebras. Let Inline graphic be the direct sum of n + 1 copies of Inline graphic. Then Inline graphic. With this identification, we shall view both Inline graphic and Inline graphic as subalgebras of Inline graphic. Let Eij and i,j = 1,…,n + 1 be a matrix unit system for Inline graphic. We shall write elements in Inline graphic in a matrix form with respect to this unit system (with entries from Inline graphic).

Theorem One.

Define

Theorem One.

where * denotes all possible elements in Inline graphic. Then Inline graphic is maximal upper triangular with respect to the diagonal Inline graphic Inline graphic.

Proof:

It is easy to check that Inline graphic. Similar techniques we used in the proof of theorem three (1) will show that Inline graphic is maximal upper triangular with the given diagonal. We omit the details here.

With Inline graphic given in theorem one, suppose P is a projection in Inline graphic with Inline graphic and Inline graphic. It is easy to see that P must be diagonal and (I - Pii)TPjj = 0 for all i < j and any T in Inline graphic. Thus, Inline graphic for some k. We know that such a P lies in Inline graphic. This shows that Inline graphic. Clearly, this implies that Inline graphic is not reflexive. It is interesting to know if Inline graphic contains a subalgebra that is a KS-algebra with the same diagonal.

The semidirect product of a von Neumann algebra Inline graphic with a semigroup S (embedded in the automorphism group of Inline graphic) will give us another construction of triangular algebras. In general, such construction will not give us a maximal triangular algebra. Whether there is a KS-algebra containing such a triangular algebra for certain ergodic actions is another interesting question.

On the other hand, if we start with a “minimal” lattice Inline graphic of projections in a von Neumann algebra so that the lattice generate the von Neumann algebra, then is Inline graphic a KS-algebra? In general, Inline graphic. Thus, Inline graphic may not be a KS-lattice. But we shall see that Inline graphic is often a KS-algebra in the next section.

Reflexive lattices generated by three projections

Lattices generated by two projections are always reflexive (4). But lattices generated by three projections are complicated. Most of factors acting on a separable Hilbert space are known to be generated by three projections or a projection and a positive operator (3).

Example One:

Suppose Inline graphic is a factor acting on Inline graphic and write Inline graphic, where Inline graphic is a subfactor of Inline graphic. We assume that Inline graphic is generated by a projection P and a positive element H with 0 ≤ H ≤ I and supp(H) = supp(I - H) = I. Here, we view Inline graphic as a subalgebra of Inline graphic and Inline graphic as the relative commutant of Inline graphic in Inline graphic. Let E11, E12, E21, and E22 be the standard matrix unit system for Inline graphic. Define P1 = E11, Inline graphic, P3 = E11 + E22P, and P4 = P2P3. Assume that P1P2 = 0 and P1P2 = I. Then Inline graphic, generated by {P1,P2,P3}, is a distributive lattice and thus reflexive (5). From our construction, we know that Inline graphic is generated by Inline graphic as a von Neumann algebra. One also easily checks that any proper sublattice of Inline graphic does not generate Inline graphic. Thus, Inline graphic is a KS-lattice and Inline graphic is a KS-factor. From this construction, we can realize most of the factors as diagonals of KS-algebras. For example, one may choose Inline graphic as a factor of type II1 generated by a projection P of trace Inline graphic and a positive operator H such that P and H are free, and H has the same distribution (with respect to the trace on Inline graphic) as the function Inline graphic on [0,1] (with respect to Lebesgue measure). Let τ be the trace on Inline graphic. In this case, Inline graphic, Inline graphic, and Inline graphic. Then Inline graphic is a KS-factor of type II1.

It is hard to determine when a lattice is reflexive even for a finite lattice. Finite distributive lattices are reflexive (5). But most of the lattice are not distributive. The simplest, non-distributive lattice is a “double triangle” where it contains zero; I; and three projections P1, P2, and P3 so that PiPj = I and PiPj = 0 for any i ≠ j and i,j = 1,2,3. Any lattice that contains a double triangle sublattice is not distributive. Three free projections with trace Inline graphic in a factor of type II1 (together with zero, I) form a double triangle lattice. In the following, we first describe factors generated by free projections. For basic theory on freeness and distributions, we refer to ref. 6.

Let Gn be the free product of Inline graphic with itself n times, for n≥2 or = ∞. When n≥3, Gn is an i.c.c. group so its associated group von Neumann algebra Inline graphic is a factor of type II1 acting on l2(Gn) (7). If U1,…,Un are canonical generators for Inline graphic corresponding to the generators of Gn with Inline graphic, then Inline graphic, j = 1,…,n, are projections of trace Inline graphic. Let Inline graphic be the lattice consisting of these n free projections, zero, and I.

Clearly, Inline graphic is a minimal lattice that generates Inline graphic as a von Neumann algebra. Is Inline graphic and n≥3, a KS-algebra? What is Inline graphic? When n = 2, Halmos (4) showed that Inline graphic is reflexive and, thus, Inline graphic is maximal and, hence, a KS-algebra. We shall answer the above questions for the case when n = 3 and show that Inline graphic is a KS-algebra and Inline graphic is homeomorphic to S2, the two-dimensional sphere.

We shall realize Inline graphic as the von Neumann algebra generated by Inline graphic and its relative commutant Inline graphic in Inline graphic and write projection generators of Inline graphic in terms of 2 × 2 matrices (with respect to the standard matrix units in Inline graphic) given by the following equations:

graphic file with name pnas.0914150107eq280.jpg

The freeness among P1, P2, and P3 require that H1, H2, and V be free, H1 and H2 have the same distribution as Inline graphic on [0,1] with respect to Lebesgue measure and V a Haar unitary element. Then the subalgebra Inline graphic of Inline graphic is the von Neumann algebra generated by H1, H2, and V. Now Inline graphic and Inline graphic.

When Inline graphic is a subalgebra of Inline graphic, we may also view Inline graphic where Inline graphic is the commutant of Inline graphic in Inline graphic. Thus, all operators can be written as 2 × 2 matrices with entries from Inline graphic. In fact, when Inline graphic for some Hilbert space Inline graphic, then Inline graphic.

Because Inline graphic, any operator T belonging to Inline graphic must be upper triangular. The following lemma follows from the invariance of P2 and P3 under T. The computation is straight forward.

Lemma One.

With notation given above, Inline graphic, where Inline graphic if, and only if,

Lemma One.

By using unbounded operators affiliated with Inline graphic, one can construct many finite rank operators in Inline graphic. Unbounded operators affiliated with a finite von Neumann form an algebra (7). Any finitely, many unbounded operators have a common dense domain. Let ξ and η be vectors in the common domain of Inline graphic, Inline graphic, and the adjoint Inline graphic. We shall use xy to denote the rank one operator defined by xy(z) = 〈z,xy, for any Inline graphic with x and y arbitrarily given. Now let Inline graphic, Inline graphic, and Inline graphic (determined by lemma one ). Then Inline graphic is a finite rank operator (at most rank four). This shows that Inline graphic contains many finite rank (and thus compact) operators. In fact, lemma three below will show that Inline graphic contains “almost” a copy of Inline graphic.

The following is a technical result that will be used frequently. The result might be well known. We only sketch a proof here.

Lemma Two.

Suppose U is a Haar unitary element in a factor Inline graphic of type II1, and A is an element in (or an unbounded operator affiliated with) Inline graphic such that A and U are free with each other. Then any nonzero scalar λ can not be a point spectrum of AU.

Proof:

Suppose Inline graphic is a nonzero point spectrum of AU. By symmetry and freeness of A and ωU, we know that λ must be a point spectrum for A(ωU) for any Inline graphic with |ω| = 1. This implies that ω-1λ is a point spectrum of AU. Suppose Pβ is the spectral projection of AU supported at Inline graphic. Then Pλ is equivalent to Pωλ for any |ω| = 1. A direct computation shows that if λ ≠ λj for j = 1,2,…,n then Pλ∧(Pλ1∨⋯∨Pλn) = 0. From finiteness of Inline graphic, it is easy to conclude that Pλ = 0 when λ ≠ 0.

In the following, we shall describe all elements in Inline graphic. Unbounded operators will be used in our computation. All unbounded operators affiliated with the factor Inline graphic form an algebra. From function calculus, many unbounded operators we encounter in this paper can be viewed as (positive) functions defined on (0,1), with respect to Lebesgue measure. When H (= H1 or H2) is identified with Inline graphic then I - H, Inline graphic, Inline graphic, Inline graphic, et cetera, can be viewed as trigonometric functions and they are all determined by any one of them. Lemma two also tells that many linear combinations of free (non-self-adjoint) operators such as Inline graphic are invertible (with unbounded inverses).

When S, T are unbounded operators affiliated with Inline graphic or a finite von Neumann algebra and Inline graphic, then SXT is an unbounded operator that can be viewed as the weak-operator limit of bounded operators of the form SEϵXFϵT for projections Eϵ and Fϵ in Inline graphic (or the finite von Neumann algebra) so that SEϵ and FϵT are bounded and Eϵ and Fϵ have a strong operator limit I (as ϵ → 0). Thus, for any operator X in a weak-operator dense subalgebra Inline graphic of Inline graphic, the operator SXT is a bounded operator.

By using unbounded operators, we may restate the above lemma in the following form.

Lemma Three.

With Inline graphic given above, let Inline graphic be an unbounded operator affiliated with Inline graphic. If Inline graphic then there is an Inline graphic such that

Lemma Three.

Conversely, if Inline graphic such that Inline graphic and S-1AS are bounded operators, then the above T belongs to Inline graphic.

The above lemma shows that Inline graphic is quite large, in particular, Inline graphic is infinite dimensional. The following result follows easily from the above lemma and shows that all nontrivial projections in Inline graphic have trace Inline graphic.

Corollary Two.

For any Inline graphic, we have that QP1 = 0, QP1 = I, and Inline graphic.

Proof:

For any Inline graphic, Inline graphic. Thus, QP1 is invariant under all T given in lemma three and, thus, the A in (1,1) entry of T. This implies that QP1 = P1 or zero. Similarly, we can show that QP1 = I or P1.

This corollary actually shows that, for any distinct projections, Q1, Q2 in Inline graphic, Q1Q2 = 0, and Q1Q2 = I.

For any Inline graphic or an unbounded operator X affiliated with a (finite) von Neumann algebra, we shall use supp(X) to denote the support of X, that is, the range projection of XX. When supp(X) = supp(X) = I, X has an (unbounded) inverse.

Theorem Three.

For any projection Q in Inline graphic, there are K and U in Inline graphic such that

Theorem Three.

where Inline graphic (or K) and U are determined by the polar decomposition of Inline graphic for some Inline graphic. Moreover, for any given a in Inline graphic, the polar decomposition determines U and K uniquely, which give rise to a projection Q (in the above form) in Inline graphic.

Proof:

Suppose Q is given in the theorem. From corollary two, we know that supp(I - K) = I. From lemma three, for any Inline graphic (the commutant of Inline graphic in Inline graphic, Inline graphic for some Hilbert space Inline graphic) such that S-1AS and Inline graphic are bounded, then

Proof:

here Inline graphic. Thus, (I - Q)TQ = 0. This implies that

Proof:

Because supp(I - K) = I, I - K is invertible. We have

Proof:

This gives us

Proof:

The above equation holds for all A in a weak-operator dense subalgebra of Inline graphic (Inline graphic). Thus, there is an Inline graphic such that

Proof:

This implies that

Proof:

Conversely, when K and U are given by this equation, all above equations hold. From lemma three, one checks easily that Q, given in the theorem, lies in Inline graphic.

Inline graphic is a KS-Algebra

In this section, we shall prove that Inline graphic is a KS-lattice, which implies that Inline graphic is a KS-algebra.

Lemma Four.

For any two distinct projections, Q1 and Q2 in Inline graphic, we have that Inline graphic.

Proof:

By theorem three, we may assume that, for i = 1,2,

Proof: [1]

where Inline graphic and a1 ≠ a2. Then we have Inline graphic. Replacing S by (a1 - a2)S in lemma three, we know that Inline graphic.

Lemma Five.

For any three distinct projections Q1, Q2 and Q3 in Inline graphic, we always have that P1∈Lat(Alg({Q1,Q2,Q3})).

Proof:

We may assume that Inline graphic and Qi is given [1] in the proof of lemma four, for i = 1,2,3 and a1, a2, and a3 are distinct scalars.

To prove this lemma, we only need to show that if

graphic file with name pnas.0914150107eq291.jpg

then A21 = 0. Now assume that the above A belongs to Alg({Q1,Q2,Q3}). Then (I - Qi)AQi = 0, for i = 1,2,3. The (1,2) entries of the equation AQi = QiAQi give us that

graphic file with name pnas.0914150107eq292.jpg

This implies that

graphic file with name pnas.0914150107eq293.jpg

Thus, for i,j = 1,2,3 and from Inline graphic, we have

graphic file with name pnas.0914150107eq294.jpg

From this, we conclude that

graphic file with name pnas.0914150107eq295.jpg

By using the relation Inline graphic again, we easily get

graphic file with name pnas.0914150107eq296.jpg

which implies that

graphic file with name pnas.0914150107eq297.jpg

This gives us that A21 = 0 and the lemma follows.

Now the follow theorem follows easily from our lemmas and theorem three.

Theorem Four.

With the above notation, we have that Inline graphic is a KS-algebra and Inline graphic is determined by the following: Inline graphic and P ≠ 0,I,P1 if, and only if,

Theorem Four.

where K and U are uniquely determined by the following polar decomposition with any Inline graphic: Inline graphic. As a consequence, we have Inline graphic and as a tends to ∞, the projection P converges strongly to P1. Thus, Inline graphic is homeomorphic to S2.

Proof:

We only need to show the minimality of Inline graphic. Clearly, for any sublattice Inline graphic containing only two projections Q1 and Q2 in Inline graphic, Inline graphic can not generate the type II1 factor Inline graphic. Lemma four shows that any reflexive sublattice of Inline graphic containing more than two nontrivial projections must agree with Inline graphic. Thus, Inline graphic is a KS-lattice.

Although the above theorem is stated for Inline graphic, similar results hold when P1, P2, and P3 are not assumed to be free. There are many other factors that can be generated by three projections. Let Inline graphic be a factor of type II1 with trace τ and Inline graphic and Inline graphic, a subfactor of Inline graphic with generators H1, H2, and V, where 0 ≤ H1, H2 ≤ I, and V is a unitary operator. Suppose Inline graphic. Let Inline graphic be a projection in Inline graphic. Furthermore, we assume that

graphic file with name pnas.0914150107eq299.jpg

are projections in Inline graphic such that P2P3 = I, P2P3 = 0, Inline graphic, Inline graphic, and Inline graphic are bounded invertible operators. All above conditions are satisfied when H1 and H2 are free positive elements with disjoint spectra in (0,1) (V = I), and Inline graphic and Inline graphic have disjoint spectra.

Theorem Five.

With the above notation and assumptions, we have that Alg({P1,P2,P3}) is a KS-algebra and Lat(Alg({P1,P2,P3})) is determined by the following: P∈Lat(Alg({P1,P2,P3})) and P ≠ 0,I,P1 if, and only if,

Theorem Five.

where L and U are uniquely determined by the following polar decomposition with any Inline graphic: Inline graphic. As a consequence, we have Inline graphic.

The proof of this theorem will be the same as that of theorem four. Moreover, as a → ∞, the projection P → P1 in strong-operator topology. Thus Lat(Alg({P1,P2,P3}))∖{0,I} is homeomorphic to the one point compactification of Inline graphic, that is, homeomorphic to S2.

When a lattice contains four or more projections in a von Neumann algebra, the situation is not clear. Even for Inline graphic (the lattice generated by four free projections), we know from our above result that Inline graphic contains several copies of S2. But we do not have a complete characterization of this lattice. The following theorem shows that Inline graphic contains no nonzero compact operators. We believe that Inline graphic, when n≥4, does not contain any compact operators.

Theorem Six.

Let Inline graphic be the lattice generated by countably, infinitely many free projections of trace Inline graphic in Inline graphic, whereas G is the free product of countably infinitely many copies of Inline graphic then Inline graphic does not contain any nonzero compact operators.

Proof:

Let Uj and j = 1,2,… be the standard generators of Inline graphic and Inline graphic the free projections in Inline graphic. Suppose Inline graphic is a compact operator. From (I - Pj)TPj = 0, we know that (I + Uj)T(I - Uj) = 0 for j = 1,2,…. For any x and y in l2(G), we have

Proof:

Because Uj has weak-operator limit zero as j → ∞ and T compact, we have that 〈Ujx,y〉 → 0, 〈Tx,Ujy〉 → 0, and TUjx → 0 (as j → ∞). This implies that 〈Tx,y〉 = 0 and thus T = 0.

Reduced lattices

Suppose Inline graphic is a lattice of projections in a finite von Neumann algebra Inline graphic with a faithful normal trace τ. Two projections P and Q in Inline graphic are said to be “connect” if, for any ϵ > 0, there are elements P1,P2,…,Pn in Inline graphic such that P1 = P, Pn = Q, |τ(Pj - Pj+1)| < ϵ, and either Pj ≤ Pj+1 or PjPj+1, for j = 1,…,n - 1. Define the connected component O(P) of P to be the set of all projections in Inline graphic that are connected with P. Let Inline graphic be the set of all connected components in Inline graphic. We shall see that Inline graphic carries an induced lattice structure from Inline graphic and we call Inline graphic the reduced lattice of Inline graphic. It is clear that if Inline graphic is a continuous nest, then Inline graphic contains only one point. A basic fact on connected components is given in the following.

Proposition Seven.

Suppose Inline graphic is a lattice of projections in a finite von Neumann algebra Inline graphic, Inline graphic. If O(P) ≠ O(Q), then O(P)∩O(Q) = ∅.

The proof of this proposition follows easily from the definition. If O(P) and O(Q) are two elements in Inline graphic, then for any Q1O(Q) it is easy to see that O(PQ) = O(PQ1). Thus, O(PQ) depends on the components O(P) and O(Q), not the choices of P and Q in the components. We define O(P)∨O(Q) = O(PQ). Similarly, we define that O(P)∧O(Q) = O(PQ). It is easy to show that Inline graphic is a lattice. The following theorem is immediate.

Theorem Eight.

Suppose Inline graphic is a lattice of projections in a finite von Neumann algebra Inline graphic with a (faithful normal) trace τ. If Inline graphic contains only finitely many trace values, then Inline graphic is the same as Inline graphic (i.e., every connected component contains only one element in Inline graphic).

From this theorem, we know that Inline graphic. Suppose Inline graphic is a KS-lattice and Inline graphic generates a finite von Neumann algebra. If Inline graphic contains only one point, then we call Inline graphic “contractible.” Thus, continuous nests are contractible. In a forthcoming paper, we shall construct other contractible KS-lattices and also show that manifolds of higher dimensions can appear as the reduced lattices of KS-lattices.

Reduced lattices can not contain continuous nests. The following theorem shows that all possible trace values can appear in a reduced lattice.

Theorem Nine.

Suppose Inline graphic is the lattice given in section four (1), then Inline graphic.

The proof is a direct computation. We omit the details here.

Acknowledgments.

The authors wish to thank J. Shen and M. Ravichandran for many helpful discussions. Research was supported in part by the President Fund of the Academy of Mathematics and Systems Science, Chinese Academy of Sciences.

Footnotes

The authors declare no conflict of interest.

This article is a PNAS Direct Submission. J.R.R. is a guest editor invited by the Editorial Board.

References

  • 1.Ge L, Yuan W. Kadison–Singer algebras, hyperfinite case. Proc Natl Acad Sci USA. 2010 doi: 10.1073/pnas.0907161107. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 2.Kadison R, Singer I. Triangular operator algebras. Fundamentals and hyperreducible theory. Am J Math. 1960;82:227–259. [Google Scholar]
  • 3.Ge L, Shen J. On the generator problem of von Neumann algebras; Proc of ICCM 2004 (Hong Kong); Boston: Intern. Press; [Google Scholar]
  • 4.Halmos P. Reflexive lattices of subspaces. J London Math Soc. 1971;4:257–263. [Google Scholar]
  • 5.Harrison K. Melbourne: Monash University; 1970. On lattices of invariant subspaces. Doctoral Thesis. [Google Scholar]
  • 6.Voiculescu D, Dykema K, Nica A. Free Random Variables. Vol 1. Academic Press; 1992. (CRM Monograph Series). [Google Scholar]
  • 7.Kadison R, Ringrose J. Fundamentals of the Operator Algebras. Vols 1and 2. Orlando: Academic Press; 1983 and 1986. [Google Scholar]

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES