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
. 2012 Nov 26;109(50):20338–20343. doi: 10.1073/pnas.1217792109

Type II1 factors satisfying the spatial isomorphism conjecture

Jan Cameron a, Erik Christensen b, Allan M Sinclair c, Roger R Smith d,1, Stuart A White e, Alan D Wiggins f
PMCID: PMC3528588  PMID: 23184993

Abstract

This paper addresses a conjecture in the work by Kadison and Kastler [Kadison RV, Kastler D (1972) Am J Math 94:38–54] that a von Neumann algebra M on a Hilbert space Inline graphic should be unitarily equivalent to each sufficiently close von Neumann algebra N, and, moreover, the implementing unitary can be chosen to be close to the identity operator. This conjecture is known to be true for amenable von Neumann algebras, and in this paper, we describe classes of nonamenable factors for which the conjecture is valid. These classes are based on tensor products of the hyperfinite II1 factor with crossed products of abelian algebras by suitably chosen discrete groups.

Keywords: Kadison-Kastler stability, perturbations, bounded group cohomology


In 1972, Kadison and Kastler (1) initiated the study of perturbation theory of operator algebras. The setting was a Hilbert space Inline graphic and the collection of all von Neumann subalgebras of the bounded operators Inline graphic on Inline graphic, namely those *-closed subalgebras of Inline graphic that contain the identity operator and are closed in the strong operator topology. By applying the Hausdorff distance to the unit balls of two von Neumann algebras, Kadison and Kastler (1) equipped the collection of all von Neumann subalgebras with a metric Inline graphic. This metric can be described as the infimum of numbers Inline graphic, for which each element of either unit ball is within a distance λ of an element of the other in the operator norm on Inline graphic. Natural examples of close pairs of von Neumann algebras arise by fixing a von Neumann algebra Inline graphic and considering a unitary Inline graphic. It is easy to see that

graphic file with name pnas.1217792109uneq1.jpg

and therefore, if u is chosen with Inline graphic being small, then Inline graphic will be close to M. In this case, we refer to Inline graphic as a small unitary perturbation of M. The work by Kadison and Kastler (1) proposed that such a small unitary perturbation should be essentially the only way of producing pairs of close von Neumann algebras, leading to the following conjecture.

Conjecture 1 (Kadison–Kastler).

For all Inline graphic, there exists Inline graphic with the property that, if Inline graphic are von Neumann algebras with Inline graphic, then there exists a unitary operator u on Inline graphic with Inline graphic and Inline graphic.

Initial progress on this conjecture focused on amenable von Neumann algebras, which, due to the work of Connes (2), may be characterized as inductive limits of finite dimensional von Neumann algebras. For these algebras, this conjecture was established in the late 1970s in the works by Christensen (3), Johnson (4), and Raeburn and Taylor (5) [see Theorem 2 below]. In this paper, we will describe our examples of nonamenable von Neumann algebras that satisfy the conjecture. Full details and proofs will be available elsewhere in a longer account.

Background

As the Kadison–Kastler conjecture predicts that close operator algebras should be isomorphic, it is natural to ask whether they necessarily share the same invariants and structural properties. This was the primary focus of ref. 1, which examined the type decomposition of close von Neumann algebras. The foundational work of Murray and von Neumann (6) decomposes every von Neumann algebra M uniquely into a direct sum Inline graphic, where the summands have types I, II1, Inline graphic, and III, respectively. In particular, every von Neumann factor (those von Neumann algebras that are maximally noncommutative in that the centers consist only of scalar multiples of the identity operator) is of one of these types. Our work is concerned with factors of type II1, and a formulation equivalent to the original definition is that M should be infinite dimensional and possess a positive linear functional τ of norm 1 satisfying Inline graphic for Inline graphic. This functional is called a trace, and it is the counterpart of the standard trace on the algebra of Inline graphic matrices that averages the diagonal entries. The main theorem of ref. 1 shows that, if M and N are close von Neumann algebras, then the projections onto the summands of each type are necessarily close. This work also shows that algebras close to factors are again factors, and therefore, any von Neumann algebra close to a II1 factor is again a II1 factor (1), a result that we will use subsequently.

It is also natural to consider perturbation theory for other classes of operator algebras. In ref. 7, the work by Phillips initiated the study of these questions in the context of norm closed self-adjoint algebras (Inline graphic-algebras) and examined the ideal lattices of close algebras. A key difference in flavor between perturbation theory for Inline graphic-algebras and the von Neumann algebra version was exposed in two critical examples: ref. 8 gives examples of arbitrarily close but nonisomorphic Inline graphic-algebras, whereas ref. 9 gives examples of close unitarily conjugate separable Inline graphic-algebras for which it is not possible to choose a unitary witnessing this conjugacy close to the identity. The counterexamples of ref. 8 are nonseparable, and therefore, the appropriate formulation of Conjecture 1 for Inline graphic-algebras is that sufficiently close separable Inline graphic-algebras acting on a separable Hilbert space should be spatially isomorphic but without asking for control of the unitary implementing a spatial isomorphism. Special cases of this conjecture were established for separable approximately finite dimensional Inline graphic-algebras (10, 11) and continuous trace algebras (12) in the early 1980s, and a complete analog of the perturbation results for amenable von Neumann algebras was recently given in refs. 13 and 14, which establish the conjecture for separable nuclear Inline graphic-algebras. There has also been significant work on perturbation questions for nonself-adjoint algebras (see ref. 15, for example).

A related notion of near-containments also plays a substantial role in our work. We say that Inline graphic if each element of the unit ball of M is within a distance γ of an element of N (not required to be in the unit ball of N). Analogous to Conjecture 1, one might expect a sufficiently small near-inclusion of von Neumann algebras to arise from a small unitary perturbation of a genuine inclusion. That is, for each Inline graphic, does there exist Inline graphic such that, if Inline graphic is a near inclusion of von Neumann algebras on Inline graphic, then there is a unitary u on Inline graphic with Inline graphic and Inline graphic? The work by Christensen (11) introduced this notion, with the twofold purpose of improving numerical estimates and extending perturbation results beyond the amenable von Neumann algebra setting. In particular, the work by Christensen (11) gave the following positive answer to the previous question when M is amenable, but N is arbitrary. It is easy to use Theorem 2 to show that, if Inline graphic and M is amenable, then there is a unitary Inline graphic with Inline graphic and Inline graphic.

Theorem 2 (Spatial Embedding Theorem).

Let M and N be von Neumann algebras on a Hilbert space Inline graphic, and suppose that M is amenable. If Inline graphic for a constant Inline graphic, then there exists a unitary Inline graphic so that Inline graphic, Inline graphic, and Inline graphic.

Embedding theorems are also possible in the setting of Inline graphic-algebras; given a sufficiently close near-inclusion of a separable nuclear Inline graphic-algebra A into a general Inline graphic-algebra B, ref. 16 establishes the existence of an embedding Inline graphic.

The other general context in which perturbation results have been obtained is when we replace Inline graphic with a finite von Neumann algebra. Given unital von Neumann subalgebras Inline graphic and Inline graphic of a finite von Neumann algebra M with Inline graphic, ref. 16 gives a unitary Inline graphic with Inline graphic and Inline graphic.

In our longer account of the work surveyed in this paper, we keep track of the estimates involved at each step. Here, we simplify matters by describing our results qualitatively.

Kadison–Kastler Stability and the Similarity Problem

The spatial embedding theorem does not depend on the particular *-representation of M on a Hilbert space. Our search for positive answers to Conjecture 1 is guided by this result, leading us to the following definition.

Definition 3.

Let M be a von Neumann algebra. Say that M is strongly Kadison-Kastler stable if, for every Inline graphic, there exists Inline graphic such that for every faithful normal unital *-representation Inline graphic and every von Neumann algebra N on Inline graphic with Inline graphic, there is a unitary operator u on Inline graphic with Inline graphic and Inline graphic.

We use this terminology, because it is the strongest of several versions of the conjecture that one could consider. For example, one could ask for spatial isomorphisms without requiring control of Inline graphic or isomorphisms between close algebras that are not necessarily spatial. Our methods also give examples of von Neumann algebras satisfying these weaker forms of the conjecture (Theorems 7 and 8). An Inline graphic-direct sum argument can be used to show that Conjecture 1 is equivalent to the statement that all von Neumann algebras are strongly Kadison-Kastler stable.

Conjecture 1 implies that the operation

graphic file with name pnas.1217792109uneq2.jpg

of taking commutants of von Neumann algebras in Inline graphic is continuous with respect to the Kadison–Kastler metric, and this implication would extend to Inline graphic-algebras by an application of Kaplansky’s density theorem. This question is equivalent to another long-standing question: the similarity problem. In 1955, motivated by work by Dixmier and Day on uniformly bounded group representations, in ref. 18 Kadison asked whether every bounded representation of a Inline graphic-algebra on a Hilbert space is necessarily similar to a Inline graphic-representation. Using the equivalence of the similarity and derivation problems in the work by Kirchberg (19), we recently observed (20) that the similarity problem is equivalent to the continuity of commutants. The arguments in ref. 21 also give a local version of this equivalence: a Inline graphic-algebra A has the similarity property if the operation of taking commutants is continuous at A, uniformly over all representations of A (ref. 20 gives the precise statement). The following consequence is of particular relevance here (we restrict to II1 factors, where it suffices to consider normal representations in the similarity property; see the proof of theorem 2.3 in ref. 22).

Proposition 4.

Every strongly KadisonKastler-stable II1 factor satisfies the similarity property.

The similarity problem is known to have positive answers for von Neumann algebras of types Inline graphic, Inline graphic, and III (23), but it remains open for finite algebras and particularly, factors of type II1. Here, the only factors for which a positive answer is known are those factors with Murray and von Neumann’s property gamma (the factors with property gamma are those containing non-trivial asymptotically centralizing sequences, and this property was introduced in ref. 6 to distinguish the hyperfinite II1 factor from the free group factors) (22). In particular, McDuff factors (those factors M that absorb the hyperfinite II1 factor R tensorially, meaning that Inline graphic) have the similarity property. Thus, to produce new examples of strongly Kadison–Kastler-stable factors, we work with II1 factors with property gamma.

The role played by the similarity property in obtaining examples of strongly Kadison-Kastler stable factors is encapsulated in the following result, which dates back to ref. 17.

Proposition 5.

Let A be a Inline graphic-algebra satisfying the similarity property, and suppose that Inline graphic are two *-representations with Inline graphic sufficiently small. Then, there exists a unitary u on Inline graphic such that Inline graphic. Furthermore, one can control Inline graphic in terms of Inline graphic and quantitative estimates on how well A satisfies the similarity property.

In the presence of the similarity property, if we can show that two close von Neumann algebras M and N on Inline graphic are *-isomorphic through an isomorphism θ close to the inclusion map Inline graphic, then it will follow that θ is spatially implemented by a unitary close to Inline graphic. Consequently, M will be strongly Kadison-Kastler stable.

Twisted Crossed Products

Our examples of strongly Kadison-Kastler stable factors arise from the crossed product construction that goes back to Murray and von Neumann. Consider a countable infinite discrete group Inline graphic acting by measure-preserving transformations on a probability space Inline graphic, and write α for the induced action of Inline graphic on the abelian von Neumann algebra Inline graphic. A unitary-valued normalized 2-cocycle is a function Inline graphic with Inline graphic for all Inline graphic, which satisfies the cocycle identity

graphic file with name pnas.1217792109uneq3.jpg

Two such 2-cocycles Inline graphic are cohomologous if there exists Inline graphic with Inline graphic and (Eq. 1) holds:

graphic file with name pnas.1217792109eq1.jpg

Given a unitary-valued normalized 2-cocycle ω, the twisted crossed product

graphic file with name pnas.1217792109uneq4.jpg

is a von Neumann algebra generated by a copy of Inline graphic and unitaries Inline graphic, satisfying (Eq. 2):

graphic file with name pnas.1217792109eq2.jpg

Because the action is measure-preserving, we obtain a trace τ on the twisted crossed product by extending (Eq. 3)

graphic file with name pnas.1217792109eq3.jpg

from the dense *-subalgebra of finite linear combinations Inline graphic with Inline graphic; therefore, the twisted crossed product is of type II1. The two conditions (Eqs. 2 and 3) characterize twisted crossed products, and we will use these conditions to recognize factors close to a twisted crossed product as again of this form, albeit via a possibly different 2-cocycle.

We will impose two additional conditions on the action Inline graphic in addition to preserving a standard probability measure.

  • i) Essential freeness: For Inline graphic, the stabilizer Inline graphic is required to be null. This requirement ensures that the copy of Inline graphic is a maximal abelian subalgebra of the twisted crossed product Inline graphic.

  • ii) Ergodicity: This condition requires any Inline graphic-invariant subset to be either null or conull. In the presence of freeness, the twisted crossed product Inline graphic is a factor if and only if the action is ergodic.

Combining these assumptions, the twisted crossed products Inline graphic are always II1 factors.

We are now in position to state our main result. Recall that Inline graphic denotes the group of Inline graphic matrices with integer entries and determinant equal to one.

Theorem 6.

Let Inline graphic be a standard probability space, and suppose that Inline graphic acts freely and ergodically by measure-preserving transformations on Inline graphic for Inline graphic. Then, the II1 factor (Eq. 4)

graphic file with name pnas.1217792109eq4.jpg

is strongly Kadison-Kaster stable.

The key property of the group Inline graphic used in the proof of Theorem 6 is cohomological. By combining the results in the works of Burger and Monod (24, 25) and Monod and Shalom (26) with later results in the work by Monod (27), it follows that the bounded cohomology groups

graphic file with name pnas.1217792109uneq5.jpg

vanish for Inline graphic [a key difficulty, which is overcome in ref. 27, is that the module Inline graphic is a nonseparable Banach space]. In Theorem 6, the groups Inline graphic can be replaced by any discrete group Inline graphic, for which Inline graphic; the works (2427) also establish a vanishing result for the bounded cohomology in degree 2 of certain other irreducible higher-rank lattices. The effect of the vanishing of this bounded cohomology group is that the open mapping theorem gives a constant Inline graphic with the property that, for any two unitary 2-cocycles Inline graphic with

graphic file with name pnas.1217792109uneq6.jpg

we can find Inline graphic such that Eq. 1 holds, and

graphic file with name pnas.1217792109uneq7.jpg

For the purpose of finding examples to which Theorem 6 applies, it is useful to note that, for measure-preserving actions of Inline graphic with Inline graphic on nonatomic standard probability spaces Inline graphic, ergodicity implies freeness by ref. 28.

Examples of suitable actions of Inline graphic are given by Bernoulli shifts. Given a base probability space Inline graphic (which could be atomic but is not a singleton), form the infinite product space Inline graphic indexed by the group, and let μ be the product measure on X. Then, Inline graphic acts on X by shifting the indices: Inline graphic. When Inline graphic is infinite, it induces a free ergodic probability measure-preserving action. By suitably varying the base space Inline graphic and using the results in the works by Bowen (29) and Popa (30, 31), one obtains an uncountable family of pairwise nonisomorphic factors of the form (Eq. 4) to which Theorem 6 applies.

The role of the hyperfinite II1 factor R in Theorem 6 is to ensure that the tensor product Inline graphic has the similarity property. Indeed, if one could construct a free ergodic probability measure-preserving action Inline graphic for Inline graphic so that the resulting crossed product factor Inline graphic has the similarity property, then this crossed product will be strongly Kadison-Kastler stable. However, the only known method for establishing the similarity property for a II1 factor is to establish property gamma. By combining results from refs. 32 and 33, the presence of Kazhdan’s property (T) (34) for Inline graphic (Inline graphic) provides an obstruction to property gamma for the crossed product factors Inline graphic.

Outline of the Proof of Theorem 6

In the light of Proposition 5, to prove Theorem 6, it suffices to show that, if N is close to a II1 factor M of the form (Eq. 4), then there is a *-isomorphism of M onto N which is close to the inclusion of M into the containing Inline graphic. Our strategy involves three main steps.

  • i) Because M takes the form Inline graphic (where Inline graphic and R is the hyperfinite II1 factor), we show that N is also a McDuff factor and after a small unitary perturbation, that the factorizations of M and N are compatible. To do this work, we use the spatial embedding theorem to produce a small unitary perturbation Inline graphic of N, which contains R, and then, we define Inline graphic. One can check that Inline graphic is small. To identify Inline graphic as Inline graphic, we need to show that Inline graphic is generated by Inline graphic and R.

  • ii) To obtain an isomorphism between Inline graphic and Inline graphic, we transfer the crossed product structure of Inline graphic to Inline graphic. Given a II1 factor Inline graphic, which is sufficiently close to a crossed product factor Inline graphic, it is possible to use Theorem 2 repeatedly to find a copy of Inline graphic inside Inline graphic close to the copy in Inline graphic and unitaries Inline graphic normalizing Inline graphic and inducing the same action as the Inline graphic. We must then show that Inline graphic is generated by Inline graphic and the unitaries Inline graphic. Once this is achieved, it follows that Inline graphic is a twisted crossed product

graphic file with name pnas.1217792109uneq8.jpg
  • where ω is a 2-cocycle measuring the failure of multiplicitivity of the map Inline graphic.

  • iii) In the previous step, each Inline graphic can be chosen close to the corresponding Inline graphic, and therefore,

graphic file with name pnas.1217792109uneq9.jpg
  • Our cohomological assumption then ensures that ω is cohomologous to a trivial cocycle, which induces a *-isomorphism between Inline graphic and Inline graphic. Moreover, the fact that we ask for the bounded cohomology group Inline graphic to vanish [and not just for Inline graphic to vanish] gives additional information: one can find a surjective *-isomorphism Inline graphic such that Inline graphic is small for all Inline graphic with Inline graphic and all Inline graphic. In general, there is no reason to expect Inline graphic to be uniformly small for all y in the unit ball of Inline graphic, but we are able to use extra ingredients to achieve this result.

A common feature of the first two steps is the need to show that, if we are given close von Neumann algebras, one of which is generated by a certain collection of elements, then the second can be generated by suitably chosen elements close to the original generators. Because the set of generators of a von Neumann algebra is not open in the norm topology, we approach this problem indirectly by changing representations to standard position and working at the Hilbert space level. This problem is the subject of the next two sections, and the techniques developed are also used to ensure that Inline graphic is uniformly close to y across the unit ball of Inline graphic in step iii.

The steps above can be used to prove additional stability results; we give two examples. In Theorem 7, we use the fact that free groups have cohomological dimension one, and therefore, Inline graphic. This result enables us to untwist the cocycle ω in step iii; however, because Inline graphic, we cannot obtain any information about how the resulting isomorphism behaves on the canonical unitaries. In Theorem 8, cohomological methods do not apply, and instead, we use the recent work by Popa and Vaes (35) on the uniqueness (up to unitary conjugacy) of the Cartan masa in a crossed product by a hyperbolic group. The results of ref. 35 are valid for a more general class of groups, and Theorem 8 holds for this class.

Theorem 7.

Suppose that Inline graphic is a free ergodic measure-preserving action of a free group on a standard probability space. Write Inline graphic. Then, there exists Inline graphic such that if Inline graphic is a normal unital representation of M and Inline graphic is a von Neumann algebra with Inline graphic, then Inline graphic. Additionally, if we assume that the action is not strongly ergodic (i.e., every sequence of asymptotically invariant subsets of X is approximately null or conull), then such an isomorphism Inline graphic is necessarily spatial.

Theorem 8.

There exists Inline graphic with the following property. Suppose that Inline graphic for Inline graphic are two free ergodic probability measure-preserving actions of hyperbolic groups on standard probability spaces, and write Inline graphic. If Inline graphic, then Inline graphic.

Changing Representations, Standard Position, and the Basic Construction

The theory of normal representations of von Neumann algebras is easy to describe; any two faithful normal representations of a von Neumann algebra are unitarily equivalent after an amplification. Thus, given faithful unital normal representations Inline graphic and Inline graphic, we can find a Hilbert space Inline graphic and a unitary isomorphism Inline graphic such that Inline graphic for all Inline graphic. In this way, representations of a II1 factor M with separable predual on a separable Hilbert space are classified up to unitary equivalence by the coupling constant or M-dimension of the space. Suppose that Inline graphic is a unital normal representation on a separable Hilbert space. The commutant Inline graphic is a type II factor, so is either type II, where we define Inline graphic, or type II1, in which case we define Inline graphic, where Inline graphic and Inline graphic are the normalized traces on M and Inline graphic, ξ is a unit vector in Inline graphic, Inline graphic is the projection in Inline graphic onto Inline graphic and Inline graphic is the projection in M onto Inline graphic. This quantity is independent of the choice of ξ. In Lemma 9, when M and N have separable preduals, we can always reduce to the situation where they act on a separable Hilbert space by cutting by a projection with range Inline graphic for some Inline graphic, which lies in Inline graphic.

Lemma 9.

Suppose that M and N are II1 factors acting on a separable Hilbert space Inline graphic with Inline graphic small. Let Inline graphic be a unital normal representation on another separable Hilbert space. Then, there exists a unital normal representation Inline graphic with Inline graphic. When M has the similarity property, this estimate can be improved to Inline graphic.

Sketch Proof of Lemma 9

We can assume that Inline graphic, because if not the case, we can simultaneously amplify both M and N [that is, replace Inline graphic by Inline graphic, M by Inline graphic, and N by Inline graphic] to reach this situation without changing the distance between M and N. If Inline graphic, then Inline graphic is unitarily equivalent to the initial representation of M on Inline graphic, and we can use a unitary implementing this equivalence to define Inline graphic. Otherwise, we can find a projection Inline graphic such that Inline graphic is a unital normal representation of N on Inline graphic, which is unitarily equivalent to Inline graphic. When M has the similarity property, Inline graphic and Inline graphic are close, and therefore, e is close to a projection f in Inline graphic. We can then find a unitary u close to Inline graphic with Inline graphic. This gives us a normal unital representation of N on Inline graphic by Inline graphic for Inline graphic, and Inline graphic is close to Inline graphic on Inline graphic. We define Inline graphic by conjugating the representation Inline graphic by the same unitary used to show that Inline graphic is equivalent to Inline graphic.

In the case that M does not have the similarity property, after the initial amplification, it will not always be possible to approximate an arbitrary projection in Inline graphic by a projection in Inline graphic. However, using work on the derivation problem in the presence of a cyclic vector, which dates back to the work in ref. 36, we can show that, given Inline graphic such that M has a cyclic vector for Inline graphic, then it is possible to find a nonzero subprojection Inline graphic in Inline graphic, which is close to Inline graphic. By choosing a projection in Inline graphic close to p, we obtain close representations of M and N on Inline graphic as above. At this point in the argument, we are only able to obtain estimates of the form Inline graphic in contrast with the Inline graphic estimate that one obtains in the presence of the similarity property. Our methods do not enable us to get a lower bound on Inline graphic, which could be very small, but we can take a further subprojection of p to ensure that Inline graphic for some Inline graphic. In this way, we can make a suitable amplification of our representations on Inline graphic such that the resulting representation of M is unitarily equivalent to Inline graphic. This completes the proof of Lemma 9.

A II1 factor M is said to be in standard position on a Hilbert space Inline graphic if Inline graphic. In this case, there exists a unit vector Inline graphic such that the vector state Inline graphic restricts to the traces on M and Inline graphic. This vector has the properties that Inline graphic for Inline graphic implies that Inline graphic (ξ is separating for M), and Inline graphic is dense in Inline graphic (ξ is cyclic for M). These properties also hold for Inline graphic. One defines the modular conjugation operator Inline graphic with respect to ξ by extending the map Inline graphic for Inline graphic to a conjugate linear isometry on Inline graphic. The commutant Inline graphic takes the form Inline graphic, and therefore, we have an anti-isomorphism Inline graphic between M and Inline graphic.

By applying Lemma 9 to a pair of close II1 factors M and N on Inline graphic, we can find new close representations on a Hilbert space Inline graphic, where M is now in standard position. Our objective is to show that N is also in standard position on Inline graphic. To establish this result, we first extend the work in ref. 21 (section 3) to show that N is almost in standard position in the sense that Inline graphic; it follows that Inline graphic and Inline graphic are close on Inline graphic (this result is automatic when M has the similarity property). Now, given an amenable subalgebra Inline graphic, we have Inline graphic and Inline graphic for some small γ, and we can use the spatial embedding theorem (Theorem 2) two times to replace N by a small unitary perturbation such that Inline graphic and Inline graphic. In this way, we can apply Lemma 10 to see that N is in standard position.

Lemma 10.

Suppose that M is a II1 factor in standard position on Inline graphic with respect to Inline graphic, and suppose that Inline graphic is a maximal abelian subalgebra (masa) in M. Suppose that N is another II1 factor on Inline graphic such that Inline graphic, Inline graphic, and Inline graphic is sufficiently small. Then, ξ is a tracial vector for N and Inline graphic, and therefore, N is also in standard position on Inline graphic.

Sketch Proof of Lemma 10

The lemma is proved by using the unique trace preserving expectation Inline graphic from N onto A. It is easy to check that, because A is maximal abelian in M, it is also maximal abelian in N, and then, the form of Inline graphic is known: Inline graphic lies in the strongInline graphic-closed convex hull of the set Inline graphic of unitary conjugates of x by A for Inline graphic. The assumption Inline graphic gives

graphic file with name pnas.1217792109uneq10.jpg

and therefore, Inline graphic for all Inline graphic. Because Inline graphic and ξ is tracial for M, we have Inline graphic. However, it is not hard to check that, because M and N are close, Inline graphic and Inline graphic agree on A, and therefore, Inline graphic for Inline graphic. Because Inline graphic is Inline graphic-preserving, this shows that ξ is tracial for N.

To see that ξ is also tracial for Inline graphic, interchange the roles of the algebras M and N and their commutants. Here, we use the standard position of M to ensure that Inline graphic is small. This completes the proof.

In fact, we immediately get additional information: in the situation of Lemma 10, the inclusions Inline graphic and Inline graphic induce the same basic construction. This construction, developed extensively in ref. 37, is the starting point for Jones’s theory of subfactors, and it plays a key role in the perturbation results for subalgebras of finite von Neumann algebras (30, 38). Given a subalgebra A of M, write Inline graphic for the projection on Inline graphic with range Inline graphic. The basic construction of Inline graphic is the von Neumann algebra Inline graphic obtained by adjoining Inline graphic to M, and it is denoted Inline graphic. This algebra satisfies Inline graphic.

Corollary 11.

With the same hypotheses as in Lemma 10, we have

graphic file with name pnas.1217792109uneq11.jpg

Proof of Corollary 11

We have Inline graphic by hypothesis. Standard properties of the basic construction from ref. 37 show that Inline graphic commutes with A and Inline graphic, and therefore, Inline graphic (using the fact that Inline graphic). As a result,

graphic file with name pnas.1217792109uneq12.jpg

Now, Inline graphic is a masa in Inline graphic; moreover, Inline graphic and Inline graphic are close, and it follows that Inline graphic is also maximal abelian in Inline graphic. Hence, Inline graphic, and the result follows by taking commutants. This completes the proof.

After we have reached this point of our argument, we can replace A in Corollary 11 by an amenable subalgebra Inline graphic with Inline graphic using a technical theorem in the work by Popa (39). This replacement enables us to formulate versions of our main results for suitable actions of discrete groups on the hyperfinite II1 factor: any factor of the form Inline graphic for a properly outer action α and Inline graphic is strongly Kadison-Kaster stable.

Using the Basic Construction to Prove Theorem 6

A considerable amount of information regarding an inclusion Inline graphic of finite von Neumann algebras is encoded in the basic construction algebra Inline graphic. Of particular relevance here is the result in the work by Popa (ref. 40, proposition 1.4.3), which shows that a masa A in a II1 factor M is Cartan in the sense of ref. 41 [i.e., the group of normalizers Inline graphic generates M as a von Neumann algebra] if and only if Inline graphic is generated by projections that are finite in Inline graphic. As the spatial embedding theorem, Lemma 9, Lemma 10, and Corollary 11 combine to show that close inclusions of masas into II1 factors can be adjusted by a small unitary perturbation to give the same basic construction algebras (albeit possibly on a different Hilbert space), we obtain the next result.

Proposition 12.

Let Inline graphic be a Cartan masa in a II1 factor acting on a Hilbert space Inline graphic. Any inclusion Inline graphic with Inline graphic and Inline graphic sufficiently small is also an inclusion of a Cartan masa in a II1 factor.

Given a crossed product II1 factor Inline graphic arising from a free ergodic probability measure-preserving action Inline graphic and another factor Inline graphic close to Inline graphic, the assumption of freeness ensures that Inline graphic is a maximal abelian subalgebra of Inline graphic. In step ii of Theorem 6, we use the spatial embedding theorem to assume that Inline graphic and find unitary normalizers Inline graphic in Inline graphic close to the canonical unitary normalizers Inline graphic in Inline graphic. The previous proposition shows that Inline graphic is generated by all normalizers of A, but in fact, Inline graphic is generated by Inline graphic as required for step ii of the proof of Theorem 6. Once we convert to standard position so that Inline graphic and Inline graphic induce the same basic construction, one first notes that Inline graphic are pairwise orthogonal and sum to Inline graphic. Because Inline graphic and Inline graphic are close, we must have Inline graphic, but in fact, these projections are equal [because they both are in Inline graphic]. The equation Inline graphic can then be used to see that finite linear combinations Inline graphic (for Inline graphic) are dense in Inline graphic.

A similar argument, working at the Hilbert space level, is used in step i to show that, if M is a McDuff factor of the form Inline graphic and N is close to M and contains R, then N is generated by the commuting subalgebras Inline graphic and R.

The fact that Inline graphic in Inline graphic is also vital in step iii of the proof of Theorem 6. At this point, using our earlier results, we have a crossed product Inline graphic acting in standard position on Inline graphic with respect to ξ and an isomorphic copy Inline graphic of Inline graphic on Inline graphic with Inline graphic and Inline graphic. The isomorphism Inline graphic is obtained from step ii using the vanishing of the bounded cohomology group Inline graphic, and so it satisfies Inline graphic for Inline graphic and that Inline graphic is small for all Inline graphic. Because Lemma 10 shows that Inline graphic and Inline graphic are both in standard position on Inline graphic, the isomorphism θ is spatially implemented on Inline graphic by W, where W is given by extending the map Inline graphic for Inline graphic. Since Inline graphic for Inline graphic, it follows that Inline graphic, and similarly, the assumption that Inline graphic ensures that Inline graphic. That is, Inline graphic.

Write Inline graphic. It is a standard fact that Inline graphic for each Inline graphic, and so W decomposes as Inline graphic for some unitary operators Inline graphic. For each Inline graphic, the condition that Inline graphic translates to Inline graphic, and therefore (using the centrality of Inline graphic), Inline graphic. However, Inline graphic, and therefore, Inline graphic. Thus, Inline graphic has Inline graphic, giving us uniform control on Inline graphic across the unit ball of Inline graphic.

Concluding Remarks and Open Questions

We end with some questions and possible future directions.

It is not hard to use Lemma 10 to show that, for each Inline graphic, there exists Inline graphic with the property that, if Inline graphic are II1 factors with Inline graphic and Inline graphic, then Inline graphic. However, we have not been able to show that sufficiently close II1 factors necessarily have the same coupling constant in general. One consequence of a positive answer to this question would be that, in Theorem 7, the isomorphism would automatically be spatial without the assumption of a non-strongly ergodic action.

Question 1.

Does there exist Inline graphic such that whenever Inline graphic are II1 factors with Inline graphic, then Inline graphic?

In Theorem 8, we use uniqueness results for Cartan masas from the work in ref. 35 to obtain an isomorphism. In contrast with Theorems 6 and 7, this method relies on imposing structural hypotheses on both M and N. Furthermore, there are hyperbolic groups Inline graphic for which Theorem 8 applies, but our cohomological methods do not. Such factors provide a suitable test case for future developments.

Question 2.

Let Inline graphic be a crossed product factor such that Inline graphic is the unique Cartan masa up to unitary conjugacy but the comparison map

graphic file with name pnas.1217792109uneq13.jpg

is not zero [i.e., there are nontrivial bounded 2-cocycles, which are not trivial in Inline graphic]. Does there exist Inline graphic such that any II1 factor N with Inline graphic is isomorphic to M?

Is it possible to use the methods in the work in ref. 42 to find stability results for factors that are completely close [i.e., Inline graphic is small]?

Finally, what is the analogous statement to Theorem 6 in the category of Inline graphic-algebras? A major difficulty here is that the known embedding theorem for separable nuclear Inline graphic-algebras from ref. 16 is not as strong as Theorem 2, because it does not guarantee that the resulting embedding is spatial. Because of the counterexamples in ref. 8, it cannot give uniform control on the embedding.

Acknowledgments

The research by J.C. is partially supported by an American Mathematical Society–Simons Research Travel Grant, R.R.S. is partially supported by National Science Foundation Grant DMS-1101403, and S.A.W. is partially supported by Engineering and Physical Sciences Research Council Grant EP/I019227/1. The authors also thank the following sources of funding that enabled this research to be undertaken. A visit by E.C. to Scotland in 2007 was supported by a grant from the Edinburgh Mathematical Society. J.C., R.R.S., and S.A.W. visited Copenhagen in 2011 supported by the Danish Council for Independent Research (Natural Sciences). A visit by R.R.S. to Scotland in 2011 was supported by a grant from the Royal Society of Edinburgh. S.A.W. visited Vassar College in 2010 supported by the Rogol Distinguished Visitor Program.

Footnotes

The authors declare no conflict of interest.

This article is a PNAS Direct Submission. L.G. is a guest editor invited by the Editorial Board.

References

  • 1.Kadison RV, Kastler D. Perturbations of von Neumann algebras. I. Stability of type. Am J Math. 1972;94:38–54. [Google Scholar]
  • 2.Connes A. Classification of injective factors. Cases II1, Inline graphic Inline graphic Inline graphic. Ann Math. 1976;104(1):73–115. [Google Scholar]
  • 3.Christensen E. Perturbations of operator algebras. Invent Math. 1977;43(1):1–13. [Google Scholar]
  • 4.Johnson BE. Perturbations of Banach algebras. Proc London Math Soc (3) 1977;34(3):439–458. [Google Scholar]
  • 5.Raeburn I, Taylor JL. Hochschild cohomology and perturbations of Banach algebras. J Funct Anal. 1977;25(3):258–266. [Google Scholar]
  • 6.Murray F, von Neumann J. On rings of operators. IV. Ann Math. 1943;44(2):716–808. [Google Scholar]
  • 7.Phillips J. Perturbations of Inline graphic-algebras. Indiana Univ Math J. 1973;23:1167–1176. [Google Scholar]
  • 8.Choi M, Christensen E. Completely order isomorphic and close Inline graphic-algebras need not be *-isomorphic. Bull Lond Math Soc. 1983;15(6):604–610. [Google Scholar]
  • 9.Johnson BE. A counterexample in the perturbation theory of Inline graphic-algebras. Can Math Bull. 1982;25(3):311–316. [Google Scholar]
  • 10.Phillips J, Raeburn I. Perturbations of AF-algebras. Can J Math. 1979;31(5):1012–1016. [Google Scholar]
  • 11.Christensen E. Near inclusions of Inline graphic-algebras. Acta Math. 1980;144(3–4):249–265. [Google Scholar]
  • 12.Phillips J, Raeburn I. Perturbations of Inline graphic-algebras. II. Proc London Math Soc (3) 1981;43(1):46–72. [Google Scholar]
  • 13.Christensen E, Sinclair AM, Smith RR, White SA, Winter W. The spatial isomorphism problem for close separable nuclear Inline graphic-algebras. Proc Natl Acad Sci USA. 2010;107(2):587–591. doi: 10.1073/pnas.0913281107. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Christensen E, Sinclair AM, Smith RR, White SA, Winter W. Perturbations of nuclear Inline graphic-algebras. Acta Math. 2012;208(1):93–150. [Google Scholar]
  • 15.Pitts DR. Close CSL algebras are similar. Math Ann. 1994;300(1):149–156. [Google Scholar]
  • 16.Hirshberg I, Kirchberg E, White S. Decomposable approximations of nuclear Inline graphic-algebras. Adv Math. 2012;230:1029–1039. [Google Scholar]
  • 17.Christensen E. Perturbations of operator algebras. II. Indiana Univ Math J. 1977;26:891–904. [Google Scholar]
  • 18.Kadison RV. On the othogonalization of operator representations. Am J Math. 1955;77:600–620. [Google Scholar]
  • 19.Kirchberg E. The derivation problem and the similarity problem are equivalent. J Operator Theory. 1996;36(1):59–62. [Google Scholar]
  • 20.Cameron J, et al. A remark on the similarity and perturbation problems. C R Math Rep Acad Sci Can. 2012 arXiv:1206.5405v1. [Google Scholar]
  • 21.Christensen E, Sinclair AM, Smith RR, White SA. Perturbations of Inline graphic-algebraic invariants. Geom Funct Anal. 2010;20(2):368–397. [Google Scholar]
  • 22.Christensen E. Similarities of II1 factors with property Inline graphic. J Operator Theory. 1986;15(2):281–288. [Google Scholar]
  • 23.Haagerup U. Solution of the similarity problem for cyclic representations of Inline graphic-algebras. Ann Math. 1983;118(2):215–240. [Google Scholar]
  • 24.Burger M, Monod N. Bounded cohomology of lattices in higher rank Lie groups. J Eur Math Soc. 1999;1(2):199–235. [Google Scholar]
  • 25.Burger M, Monod N. Continuous bounded cohomology and applications to rigidity theory. Geom Funct Anal. 2002;12(2):219–280. [Google Scholar]
  • 26.Monod N, Shalom Y. Cocycle superrigidity and bounded cohomology for negatively curved spaces. J Differential Geom. 2004;67(3):395–455. [Google Scholar]
  • 27.Monod N. On the bounded cohomology of semi-simple groups, S-arithmetic groups and products. J Reine Angew Math. 2010;640:167–202. [Google Scholar]
  • 28.Stuck G, Zimmer R. Stabilizers for ergodic actions of higher rank semisimple groups. Ann Math. 1994;139(3):723–747. [Google Scholar]
  • 29.Bowen L. Measure conjugacy invariants for actions of countable sofic groups. J Am Math Soc. 2010;23(1):217–245. [Google Scholar]
  • 30.Popa S. Strong rigidity of II1 factors arising from malleable actions of w-rigid groups, I. Invent Math. 2006;165(2):369–408. [Google Scholar]
  • 31.Popa S. On Ozawa’s property for free group factors. Int Math Res Not. 2007 11:ID rnm036. [Google Scholar]
  • 32.Akemann CA, Walter ME. Unbounded negative definite functions. Can J Math. 1981;33(4):862–871. [Google Scholar]
  • 33.Herman RH, Jones VFR. 1987. Central sequences in crossed products. Operator Algebras and Mathematical Physics (Iowa City, Iowa, 1985), Contemporary Math (American Mathematics Society, Providence, RI), Vol 62, pp 539–544.
  • 34.Každan D. On the connection of the dual space of a group with the structure of its closed subgroups. Funkcional Anal i Priložen. 1967;1:71–74. [Google Scholar]
  • 35.Popa S, Vaes S. Unique Cartan decomposition for II1 factors arising from arbitrary actions of hyperbolic groups. J Reine Angew Math. 2012 arXiv:12012842v1. [Google Scholar]
  • 36.Christensen E. Extensions of derivations. II. Math Scand. 1982;50(1):111–122. [Google Scholar]
  • 37.Jones VFR. Index for subfactors. Invent Math. 1983;72(1):1–25. [Google Scholar]
  • 38.Christensen E. Subalgebras of a finite algebra. Math Ann. 1979;243(1):17–29. [Google Scholar]
  • 39.Popa S. On a problem of R. V. Kadison on maximal abelian *-subalgebras in factors. Invent Math. 1981/82;65(2):269–281. [Google Scholar]
  • 40.Popa S. On a class of type II1 factors with Betti numbers invariants. Ann Math. 2006;163(3):809–899. [Google Scholar]
  • 41.Dixmier J. Sous-anneaux abéliens maximaux dans les facteurs de type fini. Ann Math. 1954;59(2):279–286. [Google Scholar]
  • 42.Roydor J. A non-commutative Amir-Cambern theorem for von Neumann algebras. 2011 arXiv:1108.1970v1. [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