betaFeedback

WorksMathematics

Matrix ultraproducts have trivial fundamental group

Abstract

We prove that every tracial ultraproduct ∏UMn(C)\prod_{\mathcal{U}} M_n(\mathbb{C}) of matrix algebras has trivial fundamental group. In particular, this establishes that there are uncountably many nonisomorphic matrix ultraproducts, answering a question of Sorin Popa. We actually prove the stronger result that every matrix ultraproduct has trivial first-order fundamental group and thus our techniques are model-theoretic in nature.

Introduction

By a matrix ultraproduct we mean a II1\mathrm{II}_1 factor of the form ∏UMn(C)\prod_{\mathcal{U}} M_n(\mathbb{C}), where U\mathcal{U} is a nonprincipal ultrafilter on N\mathbb{N} and where the ultraproduct is the tracial ultraproduct. Our main result concerns the fundamental group of such tracial ultraproducts, a notion first introduced by Murray and von Neumann in their seminal paper [27], so we recall this notion first.

Suppose that MM is a II1\mathrm{II}_1 factor. For n∈N>0n \in\mathbb{N}^{>0}, we let Mn(M)M_n(M) denote the algebra of n×nn \times n matrices over MM, which is again a II1\mathrm{II}_1 factor. For t∈(0,1)t \in(0,1), we let MtM_t denote the corner pMppMp, where pp is any projection in MM of trace tt; note that the isomorphism type of such a corner is independent of the choice of projection. For arbitrary t∈R>0t \in\mathbb{R}^{>0}, choose n∈Nn \in\mathbb{N} with n>tn > t and a projection p∈Mn(M)p \in M_n(M) with trace t/nt/n and define Mt:=pMnpM_t := pM_np. The fundamental group F(M)\mathcal{F}(M) of MM is defined to be F(M):={t∈R>0:Mt≅M}\mathcal{F}(M) := \{t \in\mathbb{R}^{>0} : M_t \cong M\}, which is readily checked to be a subgroup of the multiplicative group R>0\mathbb{R}^{>0}.

Many familiar II1\mathrm{II}_1 factors have full fundamental group, by which we mean fundamental group equal to R>0\mathbb{R}^{>0}. For example, Murray and von Neumann proved that the hyperfinite II1\mathrm{II}_1 factor R\mathcal{R} has this property; consequently, any so-called McDuff factor, that is, a II1\mathrm{II}_1 factor which tensorially absorbs R\mathcal{R}, also has full fundamental group. Radulescu proved that the free group factor L(F∞)L(\mathbb{F}_{\infty}) corresponding to the free group on infinitely many generators has full fundamental group [35]. Very recently, the solution by OpenAI [28] to the free group factor problem (see also Shlyakhtenko [37]), together with work of Dykema [9] and Radulescu [36], established that all free group factors L(Fn)L(\mathbb{F}_n) corresponding to finite rank free groups also have full fundamental group.

Finding examples of II1\mathrm{II}_1 factors with proper (that is, not full) fundamental group is much more challenging. The first example known to have a proper fundamental group was obtained by Connes in [6], where he proved that if Γ\Gamma is an ICC group with property (T), then the group factor L(Γ)L(\Gamma) has countable fundamental group. Building upon work of Gaboriau [15], in [31] Popa produced explicit factors with trivial fundamental group. This deformation/rigidity approach was further developed by Popa in [32, 33], where it was established that any subgroup of R>0\mathbb{R}_{>0} appears as the fundamental group of a II1\mathrm{II}_1 factor.

Since matrix ultraproducts are not McDuff (in fact, they do not even have property Gamma, as shown in [13 Theorem 5.1]), it is not obvious as to whether or not they have full fundamental group. In fact, it was an open problem to determine what exactly is the fundamental group of such matrix ultraproducts, and whether or not the fundamental group depends on the ultrafilter. In this paper, we settle the question by showing that all matrix ultraproducts have trivial fundamental group:

Theorem. For any nonprincipal ultrafilter U\mathcal{U} on N\mathbb{N}, we have F(∏UMn(C))={1}\mathcal{F}(\prod_{\mathcal{U}} M_n(\mathbb{C}))=\{1\}.

Observe now that any corner of a matrix ultraproduct is itself (isomorphic to) a matrix ultraproduct. Indeed, given t∈(0,1)t\in(0,1), let f:N→Nf:\mathbb{N}\to\mathbb{N} be given by f(n)=max⁡(1,⌊tn⌋)f(n)=\max(1,\lfloor tn\rfloor). For each nn, pick a projection pn∈Mn(C)p_n\in M_n(\mathbb{C}) whose rank is f(n)f(n). Set p:=(pn)U∈∏UMn(C)p:=(p_n)_{\mathcal{U}}\in\prod_{\mathcal{U}}M_n(\mathbb{C}), a projection of trace tt. Since ff has uniformly bounded fibers, we have that Mt≅pMp≅∏UMf(n)(C)≅∏f∗UMn(C)M_t\cong pMp\cong\prod_{\mathcal{U}}M_{f(n)}(\mathbb{C})\cong\prod_{f_*\mathcal{U}}M_n(\mathbb{C}), where f∗Uf_*\mathcal{U} is the push-forward ultrafilter on N\mathbb{N} given by declaring A∈f∗UA\in f_*\mathcal{U} if and only if f−1(A)∈Uf^{-1}(A)\in\mathcal{U}.

Triviality of the fundamental groups of matrix ultraproducts imply that no two corners of such ultraproducts corresponding to projections of different ranks can be isomorphic. We thus arrive at the following:

Corollary. There are continuum many nonisomorphic matrix ultraproducts.

Let us put the previous corollary into context. According to the introduction to [12], in 2008 Sorin Popa asked Ilijas Farah whether or not there are continuum many nonisomorphic matrix ultraproducts. The first progress on this question was in the aforementioned paper [12], where it was shown that, under the failure of the continuum hypothesis, there are at least two nonisomorphic matrix ultraproducts. In fact, the proof shows that there are at least as many nonisomorphic matrix ultraproducts as there are uncountable cardinals below the continuum, so in a model of ZFC where there are continuum many cardinals below the continuum, Popa’s question has a positive answer. The question remained whether or not one could prove this result in ZFC alone. The previous corollary indeed gives a ZFC resolution to Popa’s question.

Since matrix ultraproducts are countably saturated and have density character the continuum, under the continuum hypothesis, isomorphism for matrix ultraproducts is equivalent to elementary equivalence, that is, having the same first order theory. A corollary of what we actually prove in this paper is the stronger result that there are continuum many non-elementarily equivalent matrix ultraproducts. In particular, the first-order theories Th⁡(Mn(C))\operatorname{Th}(M_n(\mathbb{C})) of matrix algebras do not converge as n→∞n \to\infty. A byproduct of our proof is that there is a single ∃∀∃\exists\forall\exists-sentence σ\sigma such that lim⁡n→∞σMn(C)\lim_{n \to\infty}\sigma^{M_n(\mathbb{C})} does not exist.

In order to deduce the existence of continuum many non-elementarily equivalent matrix ultraproducts, we prove that matrix ultraproducts have trivial first-order fundamental group. In [18], the second author and Bradd Hart introduced the notion of the first-order fundamental group Ffo(M)\mathcal{F}_{\mathrm{fo}}(M) of a II1\mathrm{II}_1 factor MM, which is defined by Ffo(M):={t∈R>0:Mt≡M}\mathcal{F}_{\mathrm{fo}}(M) := \{t \in\mathbb{R}^{>0} : M^t \equiv M\}, where ≡\equiv denotes elementary equivalence. In [18], it was shown that Ffo(M)\mathcal{F}_{\mathrm{fo}}(M) is a closed subgroup of R>0\mathbb{R}^{>0} containing F(M)\mathcal{F}(M) (which itself may not be closed).

The main result of this paper is the following:

Theorem. For any nonprincipal ultrafilter U\mathcal{U} on N\mathbb{N}, we have Ffo(∏UMn(C))={1}\mathcal{F}_{\mathrm{fo}}\left(\prod_{\mathcal{U}} M_n(\mathbb{C})\right) = \{1\}.

It is worth noting that this is the first example of a II1\mathrm{II}_1 factor with proper first-order fundamental group. Moreover, by [18 Proposition 4.16], we see that there are continuum many distinct theories of matrix ultraproducts.

In the next section, we give an outline of the proof of the previous theorem, highlighting the role of definable sets and groups in the proof. The proof outline involves three major blackboxes; the proofs of these blackboxes are given in the subsequent three sections.

To the best of our knowledge, this is the first serious application of definable groups and pseudofinite groups to the model theory of operator algebras. In classical model theory, definable groups are central to applications as they connect model-theoretic notions such as definability, types, stability, rank, and independence with the structure of algebraic and topological groups, thereby allowing geometric model-theoretic methods to address problems in algebra, number theory, and dynamics. A landmark example is Hrushovski’s use of the structure theory of definable groups and fields in his proof of the function-field Mordell–Lang conjecture [20]. Pseudofinite groups, typically in the form of nonprincipal ultraproducts of finite groups, are especially useful because they permit finite combinatorial problems to be studied using compactness, saturation, invariant measures, and structural results for definable sets, after which conclusions can be transferred back to sufficiently large finite groups. This perspective has produced powerful regularity and structure theorems in additive combinatorics, including results for stable subsets and sets of finite VC-dimension in finite groups [4, 5]. For broader background, see the books of Poizat [30] and Pillay [29]. For some work on definable groups in continuous logic, see the papers [2, 3, 22].

We assume that the reader is familiar with basic tracial von Neumann algebra theory and basic continuous model theory; the relevant background in both can be found in [16]. The necessary facts about the first-order fundamental group and its relations to ultraproducts can be found in [18] and [19]. The proofs also involve some basic facts from the theory of representations of finite groups; these facts can be found, for example, in the textbook [23].

Declaration of AI Usage

The main ideas in this paper are due to Chat GPT 6 Astra. In late September of this year, a discussion with Chat GPT led to the proof of the existence of two non-elementarily equivalent matrix ultraproducts; subsequent discussions in October led to the full resulted mentioned above. However, the proof given by Chat GPT was extremely difficult to read. The presentation here is essentially entirely due to the authors. The logical flow of the arguments was completely rewritten in order to make the main ideas more transparent. More importantly, the emphasis on definability is entirely due to the authors. In fact, Chat GPT seemed to stumble upon the notion of definability in continuous logic without actually uttering the phrase “definable.” We place definable groups and definable subalgebras at the forefront of the arguments to highlight their importance in the overall structure of the paper. This is but one example of a number of existing ideas and results that were used by Chat GPT and never mentioned and/or cited, another prominent example being the Kac-Takesaki operator or multiplicative unitary (which Chat GPT referred to by the nonstandard name “copying unitary”) which is used to characterize group elements amongst the unitaries in the group ring.

Claude Opus 5.5 was used to produce the diagrams appearing in § 3.

Outline of the proof

Throughout this paper, all ultrafilters are assumed to be nonprincipal. As stated in the introduction, the main theorem of the paper is the following:

Theorem 2.1. For any ultrafilter U\mathcal{U} on N\mathbb{N}, we have Ffo(∏UMn(C))={1}\mathrm{F}_{\mathrm{fo}}\left(\prod_{\mathcal{U}} \mathrm{M}_{n}(\mathbb{C})\right)=\{1\}.

We begin by making the following reduction, allowing us to focus on particular kinds of matrix ultraproducts that will be more convenient to work with in the sequel:

Proposition 2.2. For any ultrafilter U\mathcal U, there is an ultrafilter V\mathcal V on N\mathbb N such that

Ffo(∏UMn(C))=Ffo(∏VM4j(C)).\mathcal F_{\mathrm{fo}}\left(\prod_{\mathcal U} M_n(\mathbb C)\right)=\mathcal F_{\mathrm{fo}}\left(\prod_{\mathcal V} M_{4^j}(\mathbb C)\right).

Proof. Define h:N→Nh:\mathbb N\to\mathbb N by h(n)=⌊log⁡4n⌋h(n)=\lfloor\log_4 n\rfloor, whence 1≤n/4h(n)≤41\le n/4^{h(n)}\le4. Set s:=lim⁡Un4h(n)s:=\lim_{\mathcal U}\frac{n}{4^{h(n)}}. It follows that ∏UMn(C)≅(∏UM4h(n)(C))s\prod_{\mathcal U}M_n(\mathbb C)\cong\left(\prod_{\mathcal U}M_{4^{h(n)}}(\mathbb C)\right)^s. Set V:=h∗U\mathcal V:=h_*\mathcal U. By Łoś’ theorem, ∏UM4h(n)(C)≡∏VM4j(C)\prod_{\mathcal U}M_{4^{h(n)}}(\mathbb C)\equiv\prod_{\mathcal V}M_{4^j}(\mathbb C). As a consequence of the fact that amplification preserves elementary equivalence (see [19 Lemma 2.5]), the first-order fundamental group of a II1\mathrm{II}_1 factor is equal to that of any amplification and is preserved by elementary equivalence; as a result, the proof is complete. □

By the previous proposition, Theorem 2.1 will follow from the following theorem:

Theorem 2.3. For any ultrafilter U\mathcal U on N\mathbb N, we have that Ffo(∏UM4j(C))={1}\mathcal F_{\mathrm{fo}}\left(\prod_{\mathcal U}M_{4^j}(\mathbb C)\right)=\{1\}.

Before moving forward, let us fix some notation. Throughout, we let U\mathcal U denote a (nonprincipal) ultrafilter on N\mathbb N. By a sequence of integers we mean a sequence d=(dj)j∈N\mathbf d=(d_j)_{j\in\mathbb N} of integers for which lim⁡Udj=∞\lim_{\mathcal U}d_j=\infty. Given two sequences d\mathbf d and r\mathbf r of integers, we write d/r=1\mathbf d/\mathbf r=1 to mean lim⁡Udj/rj=1\lim_{\mathcal U}d_j/r_j=1.

References

  1. [1]L. Alaoglu and G. Birkhoff, General ergodic theorems, Ann. of Math. (2), 41 (1940), pp. 293–309.
  2. [2]I. Ben Yaacov, Stability and stable groups in continuous logic, The Journal of Symbolic Logic, 75 (2010), pp. 1111–1136.
  3. [3]J. F. Carmona and A. Onshuus, Definably amenable groups in continuous logic, arXiv preprint arXiv:2201.09971, (2022).arxiv.org/abs/2201.09971
  4. [4]G. Conant, A. Pillay, and C. Terry, A group version of stable regularity, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 168, Cambridge University Press, 2020, pp. 405–413.
  5. [5]——, Structure and regularity for subsets of groups with finite vc-dimension, Journal of the European Mathematical Society, 24 (2021), pp. 583–621.
  6. [6]A. Connes, A factor of type II₁ with countable fundamental group, Journal of Operator Theory, (1980), pp. 151–153.
  7. [7]M. Daws and B. Horváth, Ring-theoretic (in)finiteness in reduced products of Banach algebras, Canad. J. Math., 73 (2022), pp. 1423–1458.
  8. [8]M. De Chiffre, N. Ozawa, and A. Thom, Operator algebraic approach to inverse and stability theorems for amenable groups, Mathematika, 65 (2019), pp. 98–118.DOI
  9. [9]K. Dykema, Interpolated free group factors, Pacific Journal of Mathematics, 163 (1994), pp. 123–135.arxiv.org/abs/funct-an/9211012
  10. [10]M. Enock and J.-M. Schwartz, Kac algebras and duality of locally compact groups, Springer-Verlag, Berlin, 1992. With a preface by Alain Connes, With a postface by Adrian Ocneanu.DOI
  11. [11]P. Eymard, L’algèbre de Fourier d’un groupe localement compact, Bull. Soc. Math. France, 92 (1964), pp. 181–236.DOI
  12. [12]I. Farah, B. Hart, and D. Sherman, Model theory of operator algebras II: model theory, Israel Journal of Mathematics, 201 (2014), pp. 477–505.arxiv.org/abs/1004.0741
  13. [13]——, Model theory of operator algebras III: elementary equivalence and II₁ factors, Bulletin of the London Mathematical Society, 46 (2014), pp. 609–628.
  14. [14]G. B. Folland, A Course in Abstract Harmonic Analysis, Textbooks in Mathematics, CRC Press, Boca Raton, FL, 2 ed., 2016.DOI
  15. [15]D. Gaboriau, Invariants ℓ² de relations d’équivalence et de groupes, Publications mathématiques de l’IHÉS, 95 (2002), pp. 93–150.DOI
  16. [16]I. Goldbring, Model theory of operator algebras, vol. 11, Walter de Gruyter GmbH & Co KG, 2023.DOI
  17. [17]——, Spectral gap and definability, in Beyond First Order Model Theory, Volume II, Chapman and Hall/CRC, 2023, pp. 103–138.arxiv.org/abs/1805.02752
  18. [18]I. Goldbring and B. Hart, On the theories of McDuff’s II₁ factors, International Mathematics Research Notices, 2017 (2017), pp. 5609–5628.
  19. [19]I. Goldbring and J. Pi, On the first-order free group factor alternative, arXiv preprint arXiv:2305.08168, (2023).arxiv.org/abs/2305.08168
  20. [20]E. Hrushovski, The mordell-lang conjecture for function fields, Journal of the American mathematical society, 9 (1996), pp. 667–690.
  21. [21]A. Ioana, Almost commuting matrices and stability for product groups, J. Eur. Math. Soc. (JEMS), 27 (2025), pp. 4027–4068.arxiv.org/abs/2108.09589
  22. [22]A. Ivanov, Metric groups, unitary representations and continuous logic, Communications in Mathematics, 29 (2021).DOI
  23. [23]G. D. James and M. W. Liebeck, Representations and characters of groups, vol. 2, Cambridge university press Cambridge, 2001.
  24. [24]B. E. Johnson, Approximately multiplicative maps between Banach algebras, J. London Math. Soc. (2), 37 (1988), pp. 294–316.DOI
  25. [25]E. Kaniuth and A. T.-M. Lau, Fourier and Fourier-Stieltjes algebras on locally compact groups, vol. 231 of Mathematical Surveys and Monographs, American Mathematical Society, Providence, RI, 2018.DOI
  26. [26]I. Kovács and J. Szűcs, Ergodic type theorems in von Neumann algebras, Acta Sci. Math. (Szeged), 27 (1966), pp. 233–246.
  27. [27]F. J. Murray and J. von Neumann, On rings of operators. iv, Annals of Mathematics, 44 (1943), pp. 716–808.DOI
  28. [28]Open AI, An isomorphism of the free group factors, family 287 in the collection at github.com/openai/math, (2026).
  29. [29]A. Pillay, Geometric stability theory, Oxford University Press, 1996.DOI
  30. [30]B. Poizat, Stable groups, vol. 87, American Mathematical Soc., 2001.
  31. [31]S. Popa, On a class of type II₁ factors with betti numbers invariants, Annals of Mathematics, (2006), pp. 809–899.
  32. [32]——, Strong rigidity of II₁ factors arising from malleable actions of w-rigid groups, i, Inventiones mathematicae, 165 (2006), pp. 369–408.DOI
  33. [33]——, Strong rigidity of II₁ factors arising from malleable actions of w-rigid groups, II, Inventiones mathematicae, 165 (2006), pp. 409–451.DOI
  34. [34]——, Independence properties in subalgebras of ultraproduct II₁ factors, J. Funct. Anal., 266 (2014), pp. 5818–5846.DOI
  35. [35]F. Radulescu, The fundamental group of the von neumann algebra of a free group with infinitely many generators is R_+ \ {0}, Journal of the American Mathematical Society, 5 (1992), pp. 517–532.
  36. [36]——, Random matrices, amalgamated free products and subfactors of the von Neumann algebra of a free group, of noninteger index, Invent. Math., 115 (1994), pp. 347–389.
  37. [37]D. Shlyakhtenko, On the isomorphism of semicircular algebras, arXiv preprint arXiv:2610.19590, (2026).arxiv.org/abs/2610.19590
  38. [38]W. F. Stinespring, Integration theorems for gages and duality for unimodular groups, Trans. Amer. Math. Soc., 90 (1959), pp. 15–56.DOI
  39. [39]N. Tatsuma, A duality theorem for locally compact groups, J. Math. Kyoto Univ., 6 (1967), pp. 187–293.
  40. [40]S. L. Woronowicz, From multiplicative unitaries to quantum groups, Internat. J. Math., 7 (1996), pp. 127–149.DOI

Paper details

vlnc:W_unpsh4f2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Chat GPT 6 Astra, Claude Opus 5.5

View statement
Looking for related papers…
Contents