Quantifier elimination in II1 factors
Abstract.
No type II1 tracial von Neumann algebra has theory that admits quantifier elimination.
Model theory is largely the study of definable sets, more precisely sets definable by first order (continuous or discrete) formulas. If the theory of a structure admits elimination of quantifiers, then its definable subsets are definable by quantifier-free formulas and therefore easier to grasp. This is the case with atomless Boolean algebras, dense linear orderings without endpoints, real closed fields, divisible abelian groups…See for example [37]. Quantifier elimination is equivalent to an assertion about embeddings between finitely-generated substructures of an ultrapower that resembles the well-known fact that all embeddings of the hyperfinite II1 factor into its ultrapower are unitarily equivalent (Proposition 1.2, Proposition 3.2). Our motivation for studying quantifier elimination in tracial von Neumann stems from Jekel’s work on 1-bounded entropy in -algebras defined on types ([31], [30]). Our main result implies that 1-bounded entropy is a genuine generalization of Hayes’s 1-bounded entropy (see [27], [28]). This is because the latter is defined for quantifier-free types, while the former is defined for full types.
In [24, Theorem 2.1] it was proven that the theory of the hyperfinite II1 factor does not admit quantifier elimination (see §1) and that if is a II1 McDuff factor such that every separable II1 factor is -embeddable111All ultraproducts in this paper are associated to nonprincipal ultrafilters on and almost all of them are tracial. then the theory of does not admit elimination of quantifiers ([24, Theorem 2.2]).
In spite of the slow start, the question of quantifier elimination in -algebras has been answered completely. In [17, Theorem 1.1] it was proven that the only -algebras whose theories in the language of unital -algebras admit quantifier elimination are (with denoting the Cantor space) , , and , and that the only -algebras whose theories in the language without a symbol for a unit admit quantifier elimination are and .
The key component of [17] is an observation due to Eberhard Kirchberg,222This is the paragraph with norm ultraproducts. that there are two very different embeddings of into the ultrapower of the Cuntz algebra . First, by [36], every exact -algebra embeds into and diagonally into its ultrapower. Second, by [25], embeds into , giving a nontrivial embedding into the ultrapower of .
Later on, in [23], paragraph preceding Lemma 5.2, it was pointed out without a proof that the argument from [24] implies that no McDuff II1 factor admits elimination of quantifiers. Also, in [22, Proposition 4.17] it was proven that if is a II1 factor such that and have the same universal theory and is existentially closed for its univeral theory, then is McDuff. This implies that if is not McDuff and embeds unitally into , then does not admit elimination of quantifiers.
During a reading seminar on model theory and free probability based on [31] at York University in the fall semester of 2022, the author (unaware of the recent developments described in the last paragraph) rediscovered an easy argument that the theory of a non-McDuff factor such that embeds unitally into , does not admit quantifier elimination and asserted that closer introspection of the proof of [24, Theorem 2.1] ought to yield the same result for all II1 factors. This is indeed the case; the following answers the [31, Question 2.18] in case of tracial von Neumann algebras of type II1.
Theorem 1.
If is a tracial von Neumann algebra with a direct summand of type II1, then the theory of does not admit elimination of quantifiers.
The key lemma is proven in §2 and the proof of Theorem 1 can be found at the end of this section. The well-known criterion for quantifier elimination is proven in §3 (in spite of it being well-known, a self-contained proof of this fact was not available in the literature until it appeared in [26, Proposition 9.4]). In §4 we state conjectures on when the theory of a tracial von Neumann algebra is model-completene and when it admits quantifier elimination.
Our terminology is standard. For model theory see [9], [26], for general operator algebras [12], for II1 factors [1], and for model theory of tracial von Neumann algebras [31] and [23].
For simplicity of notation, every tracial state is denoted , except those on , denoted .
A tracial von Neumann algebra is -embeddable if it embeds into some (equivalently, any) ultrapower of the hyperfinite II1 factor associated with a nonprincipal ultrafilter on . By [32], not all tracial von Neumann algebras with separable dual are -embeddable.
A personal note
Two personal notes are in order. First, at a dinner in Oberwolfach I pointed out, politely and enthusiastically, that much of [35] can be construed as model theory. Let’s just say that Eberhard made it clear (politely) that he did not share my enthusiasm. A couple of years later we collaborated on a model theory paper ([17]). The present note does for type II1 factors what [17] did for -algebras. Second, I wish that I recorded all conversations that I had with Eberhard. It took me weeks to process some of the enlightening raw information that he dumped on me, parts of which may be lost for posterity. He will be missed.
Acknowledgments
I am indebted to the participants of the seminar on Model Theory and Free Probability held at York University in the fall semester 2022, and in particular to Saeed Ghasemi, Pavlos Motakis, and Paul Skoufranis for some insightful remarks. I would also like to thank Srivatsav Kunnawalkam Elayavalli for informing me that he proved Lemma 2.1 independently in February 2023 and for useful remarks on an early draft of this paper, and to Isaac Goldbring for remarks on the first version of this paper and to the referee for a delightfully opinionated (and very useful) report.
1. Quantifier elimination in II1 factors
We specialize the definitions from [21, §2.6] to the case of tracial von Neumann algebras. The ongoing discussion applies to any other countable continuous language and, with obvious modifications, to any continuous language . For simplicity, we consider only formulas in which all free variables range over the (operator) unit ball. This is not a loss of generality, as an easy rescaling argument shows.
For and an -tuple of variables (if this is the empty sequence) let be the -algebra of formulas in the language of tracial von Neumann algebras with free variables included in . For a fixed tracial von Neumann algebra define a seminorm on by ( denotes the evaluation of at in )
where ranges over all -tuples in the unit ball of . (The standard definition takes supremum over all structures elementarily equivalent to and all -tuples in of the appropriate sort, but by the universality of ultrapowers and the Downward Löwenheim–Skolem theorem, the seminorms coincide.)
Let denote the -algebra of all quantifier-free formulas in . This is clearly a subalgebra of .
If is a subalgebra of and in , it is said that is an elementary submodel of if for all . An isometric embedding is elementary if its range is an elementary submodel. For quantifier-free formulas this equality is automatic, but this is a strong assumption in general. For example, any two elementary embeddings of a separable structure into an ultrapower333Ultrapower of a separable structure associated with a nonprincipal ultrafilter on . are conjugate by an automorphism of the latter if the Continuum Hypothesis holds444Continuum Hypothesis has little bearing on the relations between separable structures by Shoenfield’s Absoluteness Theorem; see e.g., [34]. ([18, Corollary 16.6.5]).
Definition 1.1.
The theory of a tracial von Neumann algebra admits elimination of quantifiers if is -dense in for every .
Proposition 1.2 below is essentially a special case [9, Proposition 13.6] stated with a reference to [29, pp. 84–91] in lieu of a proof; see also [31, Lemma 2.14]. Until recently, a self-contained proof of this fact could not be found in the literature. This has finally been remedied in [26, Proposition 9.4]. For reader’s convenience I include a proof using ultrapowers instead of elementary extensions (see Proposition 3.2, the equivalence of (1), (2), and (3)).
Proposition 1.2.
For every tracial von Neumann algebra555Needless to say, the analogous statement holds for -algebras and for any other axiomatizable category. the following are equivalent.
-
(1)
The theory of admits elimination of quantifiers.
-
(2)
For every finitely generated -subalgebra of , every trace-preserving embedding of a finitely generated -subalgebra of extends to a trace-preserving embedding .
-
(3)
Same as (2), but for arbitrary separable substructures.
Clause (2) resembles the well-known property of the hyperfinite II1 factor , that any two copies of in are unitarily conjugate ([33], [14]), the analogous (well-known) fact about strongly self-absorbing -algebras, as well as the defining property of ‘Generalized Jung factors’ (in this case, automorphisms are not required to be inner, see [4], also see [3]) but it is strictly stronger since neither nor any of the strongly self-absorbing -algebras admit quantifier elimination. The point is that and in (2) range over arbitrary finitely-generated substructures of the ultrapower.
2. Topological dynamical systems associated to II1 factors
Lemma 2.1 below is proven by unravelling of the proof of [14, Corollary 6.11]. Modulo the standard results (Proposition 1.2, Proposition 3.2) it implies Theorem 1.
Lemma 2.1.
There are a II1 factor with separable predual, a subfactor of , and an automorphism of such that
-
(1)
, but ,
and for every type II1 tracial von Neumann algebra and every ultrapower the following two conditions hold.
-
(2)
There is a trace-preserving embedding such that
-
(3)
There is a trace-preserving embedding of the crossed product into , and .
Moreover, one can choose for any and (regardless on the choice of ) , for any -embeddable tracial von Neumann algebra with separable predual .
By for example taking , we can take and .
Proof.
Let be a property (T) group with infinitely many inequivalent irreducible representations on finite-dimensional Hilbert spaces. For the ‘moreover’ part, fix and an -embeddable tracial von Neumann algebra with separable predual, let for any , let , , and , for some nontrivial automorphism of . Thus (1) holds. Since is -embeddable, (3) follows by [2, Proposition 3.4(2)].
It remains to prove (2). For let be an irreducible action of on , if such action exists, and trivial action otherwise. (The choice of in the latter case will be completely irrelevant.) Then defines a unital *-homomorphism of the group algebra into , also denoted . Let .
Fix a nonprincipal ultrafilter on that concentrates on the set is irreducible. If is the quotient map, then is a unital *-homomorphism. Let be the ultraweak closure of . If , then [6, Theorem 1] implies that isomorphic to the group factor ; this nice fact however does not affect the remaining part of our proof.
For we have a representation , where is a unitary in for every . Since is -embeddable, it is also embeddable into . Let be a countable set that that generates an isomorphic copy of .
Our copy of in and the copy of generated by need not generate an isomorphic copy of . In order to ‘correct’ this, we invoke some standard results.
At this point we need terminology from free probability. A unitary in a tracial von Neumann algebra is a Haar unitary if whenever . Such Haar unitary is free from some if for every , if is such that and in the linear span of and if for , then (note that since is a Haar unitary)
More generally, if and are subsets of then is free from if for every , if is such that and in the linear span of and is such that and in the linear span of for , then
Since is a Kazhdan group ([7]), we can fix a Kazhdan pair for . By [39, Theorem 2.2], there is a Haar unitary free from .
A routine calculation shows that is free from and that generates an isomorphic copy of . Therefore the -subalgebra of generated by is isomorphic to . This defines an embedding .
Fix a type II1 tracial von Neumann algebra . In order to find an embedding of into as required in (2), for every write (where is the corner of associated to a projection whose center-valued trace is ). Define an embedding of into by (the far right side is in disguise)
Let be the composition of the embedding of into with this embedding.
It remains to prove that . Since , only the forward inclusion requires a proof. Suppose that and fix a representing sequence for . Fix for a moment . Then the set ( is a Kazhdan pair for )
belongs to .666The set would have belonged to regardless of whether the maximum had been taken over or some other finite subset of . The maximum has been taken over because we need to bound the norm of the commutator of with all elements of , and not elements of some other finite subset of .
For each we define an action as follows. For let . For , let
This gives an action by isometries of on , which continuously extends to action of on .
For and we have . Since is an irreducible representation, the space of -invariant vectors in is equal to . Let be the projection onto this space. Since is a Kazhdan pair for , by [13, Proposition 12.1.6] (with ) or [7, Proposition 1.1.9] (the case when is compact, and modulo rescaling) we have .
Therefore belongs to , which is equal to . Recall that . Since in was arbitrary, is included in (and is therefore equal to it), as required. ∎
Lemma 2.1 shows, in terminology of [14, Corollary 6.11] (also [15]), that for all type II1 tracial von Neumann algebras , all , and all -embeddable tracial von Neumann algebras with separable predual , for the natural action of on there is an extreme point with trivial stabilizer.
Proof of Theorem 1.
Suppose for a moment that is of type II1. Let and be as in Lemma 2.1. The embeddings of and into provided by (2) and (3) of this lemma satisfy (2) of Proposition 1.2, and therefore the theory of does not admit elimination of quantifiers.
In the general case, when has a type II1 summand, we can write it as , where is type I and is type II1 (e.g., [12, §III.1.4.7]). Then . Let , , and , with the tracial states and such that . Since type II1 algebra cannot be embedded into one of type I, this choice of tracial states forces that every embedding of into sends to the image of under the diagonal map. An analogous fact holds for . Therefore, as in the factorial case, Proposition 1.2 implies that the theory of does not admit elimination of quantifiers. ∎
3. Proof of Proposition 1.2
As promised, here is a long overdue self-contained proof of [9, Proposition 13.6] (Proposition 3.2 below). We provide a proof in case when the language is single-sorted and countable. The former is a matter of convenience777Although the language of tracial von Neumann algebras has a sort for every operator -ball, by homogeneity one can assume that all free variables range over the unit ball anyway. and the latter requires a minor change of the statement, considering sufficiently saturated models instead of ultrapowers (see [9, Proposition 13.6]).
Let be an -tuple of elements in a metric structure and let be an -tuple of variables. Each expression of the form ( is a formula and )
is a condition (in some contexts called closed condition) in over . A set of conditions over is a type over . If all formulas occurring in conditions of a type are quantifier-free, then the type is said to be quantifier-free. Some satisfies condition if , and it realizes the type if it satisfies all of its conditions. A type over in some metric structure is consistent if for every finite set of conditions in and every some element of approximately realizes each of these conditions, up to .
The salient property of ultrapowers (associated with nonprincipal ultrafilters on ) is that they are countably saturated: every consistent type over a separable set is realized (e.g., [9], [21], [18]).
The quantifier-free type of an -tuple in is the set of all conditions of the form , when ranges over . The full type of an -tuple in is the set of all conditions of the form , when ranges over . Quantifier-free and full types are naturally identified with a homomorphism from (, respectively) into (see [21]). If is a subset of a metric structure , we may expand the language of by constant symbols for the element of . The type of in in the expanded language is called the type of over .
The following well-known and straightforward lemma is somewhat illuminating.
Lemma 3.1.
Suppose that and are -tuples in metric structures in the same language. Then for defines an isometric isomorphism between the structures generated by and if and only if and have the same quantifier-free type. ∎
While the quantifier-free type of a tuple codes only the isomorphism type of an algebra generated by it, the full type codes first-order properties such as the existence of square roots of unitaries and Murray–von Neumann equivalence of projections. These existential properties are coded by K-theory, at least in unital -algebras for which Groethendieck maps are injective. In this case, a unitary has the -th root if and only if the -class is divisible by , and projections and are Murray–von Neumann equivalent if and only if (see [38] or [11]). However, the information coded by theory and types is different from that coded by K-theory. On the one hand, there are separable AF-algebras with nonisomorphic groups ([16]) and on the other hand there are separable, nuclear -algebras with the same Elliott invariant but different theories. All known counterexamples to the Elliott program fall into this category; see ‘The theory as an invariant’ in [21, p. 4–5].
In the following denotes the relation of elementary equivalence (i.e., sharing the same theory).
Proposition 3.2.
If is a countable metric language, then for every -structure the following are equivalent.
-
(1)
The theory of admits elimination of quantifiers.
-
(2)
For every finitely generated -substructure of an ultrapower888Again, this ultrapower is associated to a nonprincipal ultrafilter on . , every isometric embedding of a finitely generated -substructure of into extends to an isometric embedding of .
-
(3)
Same as (2), but for arbitrary separable substructures.
-
(4)
For every finitely generated -substructure of some , for every isometric embedding of a finitely generated -substructure of into there is an elementary extension of such that the embedding of into extends to an embedding of into .
-
(5)
If is quantifier free -formula, then the formula is a -limit of quantifier free formulas.
Proof.
The equivalence of (2) and (4) is a well-known consequence of saturation of ultraproducts (see [18, §16]), and (4) will not be used in this paper (it is included only for completeness).
For simplicity and without loss of generality we assume that the language is single-sorted. Assume (1) and fix finitely generated -substructures and an isometric embedding . By Lemma 3.1, and have the same quantifier-free type (over the empty set). It suffices to prove that extends to an isometric embedding of in case when is generated by and for a single element .
Let for every . Consider the following quantifier-free type over ,999Since the formulas are quantifier-free, we do not need to specify the algebra in which they are being evaluated.
This type is uncountable, but separable in since the space is separable in .
In order to prove that is satisfiable, fix a finite set of conditions in , say for , . Consider the formula
Then , as witnessed by . Since the theory of admits elimination of quantifiers, there are quantifier-free formulas , for , such that for all . Therefore, since is an isometry between the structures generated by and , we have
Thus is consistent, and by countable saturation ([18, §16])some realizes it. Thus and have the same quantifier-free type. By mapping to and Lemma 3.1, one finds an isometric extension of to as required.
To prove that (2) implies (5), assume that (5) fails. Fix a quantifier-free formula in variables and such that every satisfies
Let be the type in variables with the following conditions.
This type is consistent by our assumptions, and by countable saturation it is realized in by some . With denoting the -structure generated by , we have an isometric embedding of into that sends to .
By using countable saturation again, we can find such that . Let be the -structure generated by and . Then cannot be extended to an isometric embedding of into , and (2) fails.
4. Concluding remarks
The theory of (with respect to the Lebesgue trace) admits elimination of quantifiers ([31, Theorem 2.13], see also [8, Fact 2.10] and [10, Example 4.3]). By [31, Lemma 2.17], every matrix algebra admits elimination of quantifiers. However, if then the algebra , with respect to the tracial state (where is the normalized trace on ), does not admit elimination of quantifiers. This is because the units of the two summands have the same quantifier-free type (the quantifier-free type of a projection is determined by its trace by Lemma 3.1), but if then there is no isometric embedding from into that sends to . On the other hand, we have the following.
Proposition 4.1.
Suppose that is equipped with a tracial state which has the property that two projections and in are Murray–von Neumann equivalent if and only if .
Then the theory of this algebra admits elimination of quantifiers.
If it is not obvious that tracial states with the property required in Proposition 4.1 exist, it may be easier to prove that there are only finitely many tracial states that do not have this property. To wit, there are only finitely many Murray-von Neumann equivalence classes of projections in . For any two such distinct classes and , there is at most one tracial state such that . (Consider the system of two linear equations in two variables and , corresponding to the values of at rank-1 projections of and . It has infinitely many solutions if and only if .)
Proof of Proposition 4.1.
Suppose that satisfies the assumption, is a -subalgebra of , and is a trace-preserving embedding. Then is a direct sum of matrix algebras. Let , for , be the units of these matrix algebras. Then for all . By the assumption on there is a partial isometry such that and . Therefore is a unitary such that for . Since every automorphism of a matrix algebra is implemented by a unitary, for every there is such that and for we have . Therefore coincides with conjugation by the unitary . This implies that automatically extends to an embedding of any such that into . ∎
The fact that the theory of a fixed structure may or may not admit elimination of quantifiers, depending on the choice of a language, is hardly surprising. After all, this is exactly what happens with the full matrix algebras, as we pass from the language of tracial von Neumann algebras to the language of -algebras.
The idea of the proof of Proposition 4.1 should provide the first step towards a confirmation of the following conjecture and a complete answer to [31, Question 2.18].
Conjecture 4.2.
If is the theory of a tracial von Neumann algebra, then the following are equivalent.
-
(1)
admits elimination of quantifiers.
-
(2)
Every model of is of type I, and if has separable predual then two projections and in are conjugate by a trace preserving automorphism if and only if .
Model completeness is a useful weakening of quantifier elimination. A theory is model complete if every embedding between its models is elementary. As the referee pointed out, the following can be extracted from a well-known semantic characterization of elementary embeddings (see the paragraph between Fact 2.1.2 and Fact 2.1.3 in [5]), but there is some merit in stating it explicitly.
Proposition 4.3.
Assume the Continuum Hypothesis. For a continuous theory in a complete language the following are equivalent.
-
(1)
The theory is model-complete.
-
(2)
If and are separable models of and is an isometric embedding, then there is an isomorphism such that the following diagram commutes (the horizontal arrows are diagonal embeddings)
The use of Continuum Hypothesis in (2) is innocuous, as it has no effect on projective statements. This is a forcing argument well-known to set theorists but poorly documented in the literature; see for example [17, Lemma 5.20]. It is also a red herring, since in its absence (2) can be replaced with a considerably more complex, but (once mastered) equally useful, assertion about the existence of a -complete back-and-forth system of partial isomorphisms between separable subalgebras of and (see [18, §8.2, Theorem 16.6.4])
Proof.
Assume (1). Then is a separable elementary submodel of , and the Continuum Hypothesis implies that , via an isomorphism that sends the diagonal copy of onto . The -algebra case is proven in [18, Theorem 16.7.5], and the proof of the general case is virtually identical.
Assume (2) and let be an embedding between models of . We need to prove that is elementary. By replacing and with separable elementary submodels large enough to detect a given failure of elementarity, we may assume they are separable. With as guaranteed by (2), the embedding of into is, being the composition of an elementary embedding and an isomorphism, elementary. Since the diagonal image of in is elementary, it follows that is elementary. ∎
Conjecture 4.4.
The theory of a tracial von Neumann algebra is model complete if and only if is of type I.
A fact relevant to both conjectures is that by [20, Proposition 3.1], elementarily equivalent type I tracial von Neumann algebras with separable preduals are isometrically isomorphic. Following a referee’s advice, we state the following one-time side remark in the theorem environment, with a proof.
Proposition 4.5.
The theory of every type I tracial von Neumann algebra is model complete.
Proof.
This is an immediate consequence of the results of [20]. Fix a type I tracial von Neumann algebra .
If is abelian, then for a probability measure . Then [20, Lemma 3.2] implies that theory of determines the measures of the atoms of (these are the values of for , using the notation from this lemma and taken in the decreasing order; is the measure of the diffuse part).
Therefore if then , and the measures of the atoms of (if any) are exactly the same as the measures of the atoms of . Every trace-preserving *-homomorphism from into has to send the diffuse part to the diffuse part. Since these parts are of the same measure, it also sends atomic part to the atomic part. Finally, since the atoms in and have the same measures (with multiplicities), and since we are dealing with a probability measure, the restriction of to the atomic part is an isomorphism. The theory of space of a diffuse measure admits elimination of quantifiers, hence the restriction of to the diffuse part is elementary. Thus can be decomposed as a direct sum of two elementary embeddings, and is therefore elementary by the second part of [20, Corollary 2.6].
This proves Proposition in case when is abelian.
In general, when is not necessarily abelian, it is isomorphic to , where , and for every we have , for a commutative von Neumann algebra . Suppose that . Then [20, Lemma 3.2] implies that (with the same set ) and that for all . (Using the notation from [20, Lemma 3.2], these quantities are both equal to , for every .)
Now assume that is a trace-preserving *-homomorphism. For in we have that and are orthogonal. By induction on , this implies that for all .
By the abelian case, the restriction of to is elementary for every . By the second part of [20, Corollary 2.6], is elementary. ∎
The original version of this paper contained an appendix by Srivatsav Kunnawalkam Elayavalli, removed following a suggestion of the referee. The appendix was concerned with the two notions that seem to be sensitive to the choice of additional axioms of ZFC, and the author’s strong opinion on such definitions is expressed in a long footnote on p. 12 of [19].
References
- [1] C. Anantharaman and S. Popa. An introduction to II1 factors. available at https://idpoisson.fr/anantharaman/publications/IIun.pdf, 2017.
- [2] C. Anantharaman-Delaroche. Amenable correspondences and approximation properties for von neumann algebras. Pacific Journal of Mathematics, 171(2):309–341, 1995.
- [3] S. Atkinson and S. K. Elayavalli. On ultraproduct embeddings and amenability for tracial von Neumann algebras. International Mathematics Research Notices, 2021(4):2882–2918, 2021.
- [4] S. Atkinson, I. Goldbring, and S. K. Elayavalli. Factorial relative commutants and the generalized Jung property for II1 factors. Advances in Mathematics, 396:108107, 2022.
- [5] Scott Atkinson, Isaac Goldbring, and Srivatsav Kunnawalkam Elayavalli. Factorial relative commutants and the generalized jung property for factors. Advances in Mathematics, 396:108107, 2022.
- [6] B. Bekka. Operator-algebraic superridigity for , . Inventiones mathematicae, 2(169):401–425, 2007.
- [7] B. Bekka, P. de La Harpe, and A. Valette. Kazhdan’s property (T). Cambridge university press, 2008.
- [8] I. Ben Yaacov. On theories of random variables. Israel Journal of Mathematics, 194:957–1012, 2013.
- [9] I. Ben Yaacov, A. Berenstein, C.W. Henson, and A. Usvyatsov. Model theory for metric structures. In Z. Chatzidakis et al., editors, Model Theory with Applications to Algebra and Analysis, Vol. II, number 350 in London Math. Soc. Lecture Notes Series, pages 315–427. London Math. Soc., 2008.
- [10] I. Ben Yaacov and A. Usvyatsov. Continuous first order logic and local stability. Transactions of the American Mathematical Society, 362(10):5213–5259, 2010.
- [11] B. Blackadar. K-theory for operator algebras, volume 5 of MSRI Publications. Cambridge University Press, 1998.
- [12] B. Blackadar. Operator algebras, volume 122 of Encyclopaedia of Mathematical Sciences. Springer-Verlag, Berlin, 2006. Theory of -algebras and von Neumann algebras, Operator Algebras and Non-commutative Geometry, III.
- [13] N. Brown and N. Ozawa. -algebras and finite-dimensional approximations, volume 88 of Graduate Studies in Mathematics. American Mathematical Society, 2008.
- [14] N.P. Brown. Topological dynamical systems associated to factors. Adv. Math., 227(4):1665–1699, 2011. With an appendix by Narutaka Ozawa.
- [15] N.P. Brown and V. Capraro. Groups associated to II1-factors. Journal of Functional Analysis, 264(2):493–507, 2013.
- [16] B. De Bondt, A. Vaccaro, B. Veličković, and A. Vignati. Games on AF-Algebras. International Mathematics Research Notices, 11 2022. rnac313.
- [17] C. J. Eagle, I. Farah, E. Kirchberg, and A. Vignati. Quantifier elimination in -algebras. International Mathematics Research Notices, 2017(24):7580–7606, 2017.
- [18] I. Farah. Combinatorial Set Theory and -algebras. Springer Monographs in Mathematics. Springer, 2019.
- [19] I. Farah. Quantifier elimination in II1 factors. version 2, with appendix by Srivatsav Kunnawalkam Elayavalli, arXiv preprint arXiv:2304.11371, https://arxiv.org/abs/2304.11371v2, 2023.
- [20] I. Farah and S. Ghasemi. Preservation of elementarity by tensor products of tracial von Neumann algebras. arXiv preprint arXiv:2304.08437, 2023.
- [21] I. Farah, B. Hart, M. Lupini, L. Robert, A. Tikuisis, A. Vignati, and W. Winter. Model theory of -algebras. Mem. Amer. Math. Soc., 271(1324):viii+127, 2021.
- [22] I. Goldbring and B. Hart. On the theories of Mcduff’s II1 factors. International Mathematics Research Notices, 2017(18):5609–5628, 2017.
- [23] I. Goldbring and B. Hart. A survey on the model theory of tracial von Neumann algebras. arXiv preprint arXiv:2210.15508, 2022.
- [24] I. Goldbring, B. Hart, and T. Sinclair. The theory of tracial von Neumann algebras does not have a model companion. J. Symbolic Logic, 78(3):1000–1004, 2013.
- [25] U. Haagerup and S. Thorbjørnsen. A new application of random matrices: is not a group. Ann. of Math. (2), pages 711–775, 2005.
- [26] B. Hart. An introduction to continuous model theory. arXiv preprint arXiv:2303.03969, 2023.
- [27] B. Hayes. 1-bounded entropy and regularity problems in von neumann algebras. International Mathematics Research Notices, 2018(1):57–137, 11 2016.
- [28] B. Hayes, D. Jekel, B. Nelson, and T. Sinclair. A random matrix approach to absorption in free products. International Mathematics Research Notices, 2021(3):1919–1979, 2021.
- [29] C.W. Henson and J. Iovino. Ultraproducts in analysis. In Catherine Finet and Christian Michaux, editors, Analysis and Logic, number 262 in London Mathematical Society Lecture Notes Series.
- [30] D. Jekel. Covering entropy for types in tracial -algebras. arXiv preprint arXiv:2204.02582, 2022.
- [31] D. Jekel. Free probability and model theory of tracial -algebras. arXiv preprint arXiv:2208.13867, 2022.
- [32] Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H. Yuen. MIP*= RE. arXiv preprint arXiv:2001.04383, 2020.
- [33] K. Jung. Amenability, tubularity, and embeddings into . Mathematische Annalen, 338(1):241–248, 2007.
- [34] A. Kanamori. The higher infinite: large cardinals in set theory from their beginnings. Perspectives in Mathematical Logic. Springer, Berlin–Heidelberg–New York, 1995.
- [35] E. Kirchberg. Central sequences in -algebras and strongly purely infinite algebras. In Operator Algebras: The Abel Symposium 2004, volume 1 of Abel Symp., pages 175–231. Springer, Berlin, 2006.
- [36] E. Kirchberg and N.C. Phillips. Embedding of exact -algebras in the Cuntz algebra . J. Reine Angew. Math., 525:17–53, 2000.
- [37] D. Marker. Model theory, volume 217 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
- [38] M. Rørdam, F. Larsen, and N.J. Laustsen. An Introduction to K-theory for C∗ algebras. Number 49 in London Mathematical Society Student Texts. Cambridge University Press, 2000.
- [39] D. Voiculescu. A strengthened asymptotic freeness result for random matrices with applications to free entropy. International Mathematics Research Notices, 1998(1):41–63, 1998.