
TL;DR
This paper explores algebraic actions as factors of Bernoulli shifts, providing examples involving harmonic models over certain groups, and discusses conditions under which these actions are Bernoulli.
Contribution
It introduces new classes of algebraic actions that are factors of Bernoulli shifts, especially over left orderable groups, expanding understanding of Bernoulli properties.
Findings
Examples of algebraic actions as factors of Bernoulli shifts.
Identification of harmonic models over groups with large enough growth.
Demonstration of Bernoulli actions without obvious Bernoulli partitions.
Abstract
We give many examples of algebraic actions which are factors of Bernoulli shifts. These include certain harmonic models over left orderable groups of large enough growth, as well as algebraic actions associated to certain lopsided elements in any left orderable group. For many of our examples, the acting group is amenable so these actions are Bernoulli (and not just a factor of a Bernoulli), but there is no obvious Bernoulli partition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Harmonic Models and Bernoullicity
Ben Hayes
University of Virginia
Charlottesville, VA 22904
Abstract.
We give many examples of algebraic actions which are factors of Bernoulli shifts. These include certain harmonic models over left orderable groups of large enough growth, as well as algebraic actions associated to certain lopsided elements in any left orderable group. For many of our examples, the acting group is amenable so these actions are Bernoulli (and not just a factor of a Bernoulli), but there is no obvious Bernoulli partition.
The author gratefully acknowledges support from NSF Grant DMS-1827376.
Contents
-
A.2 General Results on formal inverses in von Neumann algebras and the Proof of Lemma 3.2
-
A.3 Fuglede-Kadison determinants of lopsided and semi-lopsided elements
1. Introduction
The goal of this paper is to give many examples of algebraic actions which are either Bernoulli shifts, or factors of Bernoulli shifts. Given a countable, discrete, group and a probability space the Bernoulli shift with base is the action given by for Bernoulli shifts have been a natural class of action of interest since the beginning of ergodic theory. In many ways, this is because they are the most natural example of a probability measure-preserving action of a group and are in some sense an ergodic theoretic version of the action of a group on itself.
Bernoulli shifts are also inherently tied with dynamical entropy: the first application of the Kolmogorov-Sinaǐ entropy was to show that Bernoulli shifts with different base entropy are not isomorphic (here the base entropy is ). Work of Ornstein [44, 45] then showed that the class of Bernoulli shifts actions over are completely classified by dynamical entropy. This was extended to the amenable case by Ornstein-Weiss in [46]. A striking combination of recent results shows that the same is true for the class of sofic groups: Bowen showed in [7] that two Bernoulli shifts with different base entropy are nonisomorphic when the acting group is sofic, and a recent result of Seward [53] (following up on work of Bowen in [9]) shows that for any group if two probability spaces have the same Shannon entropy, then the Bernoulli shifts with that base are isomorphic. It is not known if two Bernoulli shifts with different base entropies are not isomorphic for general groups.
Another significant aspect of the study of Bernoulli shifts is that, for amenable groups, we can often say many actions are Bernoulli even if they have no obvious generating partition with independent translates. This is due to Ornstein theory, first developed by Ornstein for the case of [44, 45], and then by Ornstein-Weiss for amenable groups [46]. Of particular interest for us are algebraic actions: these are actions of a countable, discrete, group by continuous automorphisms of a compact, metrizable group If we give the Haar measure then is a probability measure-preserving action. When there are many results that say that frequently algebraic actions are Bernoulli: for example, Katznelson showed in [30] that ergodic automorphism of a finite-dimensional tours are Bernoulli, Lind showed that the same is true for an infinite torus [41], and Rudolph-Schmidt showed [50] that algebraic actions of with completely positive entropy are Bernoulli. This can be used to efficiently “detect” Bernoullicity of many natural algebraic actions of Unfortunately, little is known about Bernoullicity of algebraic actions outside of the case, even in the amenable case. For example, it is still not known if an algebraic action of an amenable group with completely positive entropy is Bernoulli.
It is known that for non-amenable groups there can be factors of Bernoulli shifts which are not Bernoulli. One example is the Popa factor: where and is viewed inside of as the set of elements with constant coordinates. If has Property (T), then Popa showed (see [47, Theorem 1], see also [48] for related results) that the Popa factor is not Bernoulli, and it is clearly an algebraic action. On the other hand, when is treeable, then the Popa factor is Bernoulli, by Gaboriau-Seward [20]. There are other nice examples of algebraic actions of free groups which are Bernoulli, and not obviously so, due to Lind-Schmidt in [37]. Outside of these, we do not known of many nonobvious examples of algebraic actions that are even factors of Bernoulli.
For readers who are less familiar with the nonamenable setting, let us remark that being a factor of Bernoulli still has significant consequences in the nonamenable case: if the acting group is sofic then the action has completely positive entropy [31], it is solidly ergodic by the work of Chifan-Ioana [13], it is mixing of all orders, has spectral gap, etc. Because of this, we have several conditions which guarantee that an action is not a factor of a Bernoulli shift when the acting group is nonamenable: if it is not mixing, if it is orbit equivalent to a compact action, if it is not strongly ergodic, if its Koopman representation does not embed into an infinite direct sum of the left regular representation, if it not solidly ergodic. For example, if is a unitary representation of a group and if does not embed into an infinite direct sum of the left regular representation, then the corresponding Gaussian action is not a factor of a Bernoulli shift. If the acting group is assumed sofic, we can also say that any action with zero sofic entropy with respect to some sofic approximation is not a factor of a Bernoulli shift. By a recent result of Bowen [6], this implies that a generic action of a sofic group is not a factor of a Bernoulli shift. Special to the sofic case, we can also exhibit actions that are inverse limits of Bernoulli shifts but have zero entropy and are thus not factors of a Bernoulli shift (see [6, Corollary 4.4]). Moreover, if and if is a probability measure-preserving action which is not a factor of a Bernoulli shift over then the coinduction of to gives an action which is not a factor of a Bernoulli shift. From this and [6, 51] one can show that given if is any group with an infinite subgroup so that is either sofic, or does not have Property (T), then has an ergodic action which is not a factor of a Bernoulli shift. Such an action can automatically be made free by taking a product with a Bernoulli shift (this preserves ergodicity as well as the property of “not a factor of a Bernoulli shift”).
In fact, in the nonamenable setting, it is actually harder to do the reverse: find criterion on an ergodic action which guarantees that it does not factor onto a Bernoulli shift. For example, no compact action can factor onto a Bernoulli shift (and in the nonamenable setting, even an action orbit equivalent to a compact action cannot factor onto a Bernoulli shift see [5, Section 4.6.1]), but being not mixing, or having a Koopman representation which is not embeddable into the infinite direct sum of the left regular representation is not sufficient. When the acting group is sofic, and the action is free, factoring onto a Bernoulli shift is equivalent to having a factor with positive entropy with respect to some sofic approximation, by a recent stunning result of Seward [54]. So, in the sofic case, a free action does not factor onto a Bernoulli shift is equivalent to having completely zero entropy (i.e. every action has zero entropy) with respect to some (equivalent any) sofic approximation.
The main result of this paper gives a large class of examples of algebraic actions which are factors of Bernoulli shifts. When the acting group is amenable, this implies that they are Bernoulli shifts, by Ornstein theory. We need some preliminary notions from group theory. A left-invariant order on a group is a total order on so that if and then for all Given such an order, an element is positive if A group is left-orderable if there is a left-invariant order on and a left-ordered group is a group equipped with a fixed left-invariant order. We refer the reader to Section 4 for a discussion of many examples of left-orderable groups, both amenable and nonamenable. Finally, if is finitely generated with finite generating set then for an integer we let be the ball of radius centered at the identity in the word metric coming from That is, Unlike the usual situation, we will typically be interested in anti-symmetric generating sets i.e. ones for which Lastly, given we let be the Pontryagin dual of That is, is the space of continuous homomorphisms from to We now present the two main results of the paper.
Theorem 1.1**.**
Let be a finitely generated, left-ordered group, and assume that is a set of positive generators. Suppose for some constants Let and assume that for all and that Then is a factor of a Bernoulli shift. If is assumed amenable, then is isomorphic to a Bernoulli shift with entropy
If in the above and for all then is called a harmonic model. This is because we can write where for some and is in some sense the space of “-valued -harmonic functions” (here ), see [10, Section 1] for more details. The ergodic theory of the harmonic model was previously studied by several authors, see e.g. [10, 34, 38, 40, 52]. The proof of Theorem 1.1 uses our results in [24], which allow one to measurably extend the convolution map from convolving with -vectors to convolving with -vectors. As explained in [24, Proposition 3.8], there is no canonical way to measurably extend the convolution map to case of convolving with -vectors, with Because of this, one cannot use the same techniques we used to prove Theorem 1.1 to weaken the growth assumption on (see the remarks following Corollary 3.5 for more information).
If and and then is called lopsided. In this case, we can drop the assumption on the growth rate of and only require orderability.
Theorem 1.2**.**
Let be a finitely generated, left-ordered group, and assume that is a set of positive generators, and that Let and assume that Then is a factor of a Bernoulli shift. If is assumed amenable, then is isomorphic to a Bernoulli shift with entropy
We remark here that there are many examples of left-orderable groups including: torsion-free nilpotent groups, polycyclic groups, certain groups of intermediate growth, Thompson’s group, free groups, certain mapping class groups etc. See Section 4 for detailed examples with references.
In each of Theorem 1.1, 1.2, if is amenable, then the reason we know that is a Bernoulli shift by Ornstein theory. We know which Bernoulli shift it is by of the results of [17, 18, 36], and the fact that we can directly compute the Fuglede-Kadison determinant (see Appendix A.3) in this case. If is not assumed amenable, then by [26] (see also [10] in the harmonic model case, and [8, 32] in the expansive case), and Appendix A.3, we know that the entropy of has entropy Unfortunately, Ornstein theory is not developed in the nonamenable case, so we do not know if is isomorphic to a Bernoulli shift. However, if is odd, the factor map we use to show that is a factor of a Bernoulli is a map between spaces of equal entropy, and we suspect that it is injective modulo null sets. This is known in certain examples when is the free group by work of Lind-Schmidt [37].
We mention that in Theorems 1.1 and 1.2 we do not actually need the group to be totally ordered. A left-invariant partial order on is a partial order so that if and then for all If we set then:
- •
implies
- •
Equivalently, is a subsemigroup of with (we remark that left-invariant partial orders on groups also appeared in [2] but for different reasons). A subset of satisfying the above two axioms is called a positive semigroup. If we are given a positive semigroup, then we can define a left-invariant partial order on by if So positive semigroups correspond to left-invariant partial orders on We can extend Theorems 1.1 and 1.2 to groups so that there is a positive semigroup with see Section 3.2. Such groups cannot be torsion, but we also have examples of such groups which are not torsion-free. See Section 4 for a discussion of examples.
We finish by discussing the organization of the paper. In Section 2 we discuss some background results for the paper. These involve the technique we used in [24] to measurably extend the convolution map from convolving with -vectors to convolving with -vectors. We state the main results on this construction obtained in [24], which are the main tool we will use to get factor maps from Bernoulli shifts. In Section 3.1 we explain how the growth rate assumption on shows up, this is related to decay rates of return time probability of random walks on In Section 3.2, we explain why the orderability assumption on is relevant. We also prove the two main results of the paper in this section. In Section 4, we give many examples of actions we can prove are factors of Bernoulli shifts using our work. We split this into the amenable case and the nonamenable case, since in the amenable case we get that they are isomorphic to Bernoulli shifts as a consequence of Ornstein theory. In section 5 we give some closing remarks, as well as state some conjectures related to our work. In particular, we strongly suspect that the factor maps we produce in the nonamenable case are often isomorphisms. Appendix A gives some background results on tracial von Neumann algebras we will use in the paper. In particular, in Section 3.1 we require a few background lemmas whose proof we give in Appendix A.1,A.2. Appendix A.2 contains general results on formal inverses which may be of independent interest. We will need to compute the entropy of the algebraic actions in question using the results of [36, 26]. This requires computing some Fuglede-Kadison determinants, which we do in Appendix A.3. Lastly, the reader may be more familiar with arguments involving lopsided elements and inverses, or even inverses in the group von Neumann algebra, as opposed to formal inverses. We discuss the difference between these notions in Appendix B.1.
Acknowledgments. I thank Doug Lind for interesting discussions related to this work. I thank Yago Antolín, Thomas Koberda, and Yash Lodha and for useful discussions related to left-orderable groups. I thank Lewis Bowen and Klaus Schmidt for their comments on an earlier version of the paper.
1.1. Conventions and Notation
If is a measure space and is a compact Hausdorff space, we let be the space of all measurable maps where two maps are identified if they agree almost everywhere. We give the topology of convergence in measure: so a basic neighborhood of is given by
[TABLE]
where is a neighborhood of the diagonal in and We often call this topology the measure topology. If is a countable, discrete group and is probability measure-preserving, and by homeomorphisms, we let be the set of (almost surely) -equivariant elements of If is a set, we let be given by for If is a compact, Hausdorff space, then so is and this action is by homeomorphisms. If is a finite set, then we equip with the uniform probability measure If is a locally compact, Hausdorff space, we let be the space of all Radon probability measures on
If is a countable, discrete group we let denote its complex group ring. Recall that this is the ring of all formal sums where and all but finitely many of the are We let be all finitely supported functions and all functions so that is finite for every We define by Given we define by
[TABLE]
We will adopt obvious notation such as to denote etc. Similar remarks apply to etc. For let be given by For we let
[TABLE]
Given we define by
[TABLE]
Similarly, we define by
[TABLE]
Related to the above, we introduce the following notation. If we let be defined by
[TABLE]
If we let
Let be a locally compact, abelian group. We let be the set of continuous homomorphisms where For we define the Fourier transform of by
[TABLE]
If is a countable, discrete group we identify with under the pairing
[TABLE]
For we let be given by
2. Background results
In [24, Section 3], we defined a way to “measurably” extend the map given by convolution by a finitely supported vector to the case of convolving by an -vector. We restate the results here for the convenience of the reader.
Theorem 2.1**.**
Let be a countable, discrete group. Fix a with mean zero and finite second moment. There is a unique map so that:
- (i)
* ** for all and all , *** 2. (ii)
* is continuous if we give the -topology and the topology of convergence in measure.*
Moreover, if we set then
[TABLE]
with the product on the right hand side converging absolutely.
We refer the reader to [24, Proposition 3.8] for a discussion of the fact that is optimal in the above theorem. Namely, if then as long as is not the point mass at there does not exist a map which is continuous if we give the -topology and the topology of convergence in measure, and which agrees with when
As we mention later (see Section 5), Theorem 2.1 is significantly easier when and in that case we do not need to assume that has mean zero. However, in order to apply this to the context of for this would force to be invertible in the convolution algebra As we discuss in Appendix B.1, the version of Theorem 2.1 is insufficient for our purposes. The reader may also be familiar that in previous works (see [35, 27, 25] for example) one assumed that is invertible in the group von Neumann algebra. We remark in Appendix B.1 that this would force us to have the acting group be nonamenable, in general. Since we do not want to restrict ourselves to the nonamenable case, and want to study both the amenable and nonamenable setting, we want to work with the version of Theorem 2.1.
Definition 2.2**.**
Let be a countable, discrete group, and We say is semi-lopsided if
- •
- •
We say is lopsided if We say that is well-balanced if for all and
Some authors use lopsided to mean However, we are primarily interested in the case and the corresponding action Since we may take without loss of generality.
We may regard as all so that for all and so that An equivalent way to say that is well-balanced is that it can be written as where and We will apply Theorem 2.1 to show that, in many cases, a semi-lopsided element gives rise to an algebraic action which is a factor of a Bernoulli shift. In order to do this, we need find an element to apply Theorem 2.1 to. For this, we will need a generalized notion of invertibility.
Definition 2.3**.**
Let we say that is a formal right inverse of if If we will say that is a formal right inverse of If we will say that is an formal right inverse.
In the above definition, it can be shown that if and is an formal right inverse of , then (see e.g. [28, Proposition 2.2]). Thus, if will simply say that has an formal inverse. The notion of an formal inverse will be the main way in which we obtain vectors to apply Theorem 2.1 to. As we mentioned before, the case is optimal in Theorem 2.1, so we cannot apply our methods to if we only assume that has an formal inverse for or which has a formal inverse. One reason why formal inverses are helpful is the following Corollary of Theorem 2.1. This corollary is shown explicitly in [24, Section 3], but we state it here for convenience.
Corollary 2.4**.**
Let be a countable, discrete group fix a with mean zero and finite second moment. For let be defined as in Theorem 2.1 for this Suppose that has an formal inverse Then is supported on
3. Proof of the main Theorem
We will use Theorem 2.1 to prove that for certain choices of and for semi-lopsided we have that is a factor of a Bernoulli shift. If is an inverse to then is a probability measure on for every with mean zero and a finite second moment. By definition, is a factor of a Bernoulli shift, and so we just want to force to be We do this by computing its Fourier transform using Theorem 2.1 and verifying that it agrees with the Fourier transform of
In summary, what we want to find are classes of countable discrete groups semi-lopsided and probability measures with mean zero and finite second moment, so that:
- •
has an formal inverse
- •
if we set then we can use the Fourier transform formula to show that and thus that
These two bulleted items are where the growth assumption on and where the orderability of appear, respectively. We explore these in the next two subsections.
3.1. formal inverses and growth
In this section, we concentrate on conditions which guarantee that has a formal inverse. If is lopsided, then by standard Banach algebra arguments it has an formal inverse. If is semi-lopsided, but not lopsided, then it can be written as with and So we focus on conditions that guarantee that if with then has a formal inverse. Formally, one considers the geometric series and attempts to prove that this converges in The following two lemmas will be helpful in this regard. The proofs we give of them utilize the machinery of tracial von Neumann algebras, which require us to recall a few preliminaries. To ensure that the core ideas of this section remain in the foreground, we have relegated the proof of these two lemmas to Appendix A.
Lemma 3.1**.**
Suppose that and Lastly suppose that the group generated by is infinite. Then for all
Lemma 3.2**.**
Let be a countable discrete group, and with with Then has an formal inverse if has an formal inverse.
As an application of Lemma 3.1, in the well-balanced case we can completely characterize when has an formal inverse as well as compute what this inverse has to be.
Lemma 3.3**.**
Suppose that and Assume that the group generated by is infinite. Let with
- (i)
We have that has an formal inverse if and only if the series
[TABLE]
converges conditionally. Moreover, if has an formal inverse, then this formal inverse is . 2. (ii)
A sufficient condition for to have an formal inverse is that If then this sufficient condition is also necessary.
Proof.
For a natural number set
(i): Suppose has an inverse Then
[TABLE]
the last step following from Lemma 3.1.
Conversely, suppose that converges conditionally, and set Then
[TABLE]
by Lemma 3.1.
(ii): First, suppose that For we have that
[TABLE]
So
[TABLE]
by the dominated convergence theorem. Hence is a Cauchy sequence and thus converges. Hence, by part (i) we know that has an formal inverse.
Conversely, suppose that is an formal inverse to and that Let be defined as in the first half of the proof. Then
[TABLE]
Hence,
[TABLE]
So
[TABLE]
∎
The above result is much easier to say when and is self-adjoint.
Lemma 3.4**.**
Let be of the form with Suppose that and that is infinite. Then has an formal inverse if and only if
Proof.
By Lemma 3.3, we know that has an formal inverse if and only if
[TABLE]
Since the above sum is easily seen to be the proof is complete.
∎
The combination of Lemma 3.2 and Lemma 3.4 reduces our problem to showing that if with then decays quickly. Recall that is a probability measure on so is also a probability measure on which is now symmetric. Given such a measure, one can form the random walk on which is a -valued discrete time process with and so that where are independent, random elements of each with distribution It is easily seen that is the probability that i.e. that this random walk returns to the identity after steps. There are well known results, due to Varopolous, which give a precise relation between the decay rate of this probability and the growth of the group Because of this, we easily obtain the following.
Corollary 3.5**.**
Let be a countable, discrete, group and let be semi-lopsided. Let Suppose that generates an infinite group. Let
- (i)
If is lopsided, then has an formal inverse. 2. (ii)
If is not lopsided, and if either has super polynomial growth, or polynomial growth of degree at least then has an formal inverse.
Proof.
Let and write In each case, we examine the invertibility of
(i): This is well known, but we repeat the proof here. In this case, and so by standard Banach algebra theory we know that has a -convolution inverse By definition, this means that
(ii): By Lemma 3.3 and Lemma 3.2, we may assume that and that By Lemma 3.4, it suffices to show that Set By assumption there is a constant with for all By [60, Theorem 3] this implies that there is a constant so that for all Hence
[TABLE]
∎
We remark that if with and has polynomial growth of degree then there is a constant so that for all (see [1, Corollary 1.9]). Thus, in the self-adjoint case, the assumption that has either superpolynomial growth or polynomial growth of degree at least is optimal. Unfortunately, we do not know if the assumption that has either superpolynomial growth or polynomial growth of degree at least is optimal in the case that is not self-adjoint. That is to say, it is possible that there is a group and a with so that has polynomial growth of degree at most and so that has an formal inverse.
At this stage, we have addressed why the growth assumption on is needed. In the next subsection, we will address why the assumption of orderability of is important.
3.2. Orderability and Fourier Transforms
In the previous section, we saw that we could put mild assumptions on the growth of in order to guarantee that any semi-lopsided whose support generates has an inverse. We thus turn to addressing the second part of exhibiting as a factor of a Bernoulli measure: finding conditions on so that the Fourier transform of is
It may be helpful to sketch what the difficulty is here. Suppose has mean zero and a finite second moment, and that has an formal inverse Set Let with then
[TABLE]
Note that this is an absolutely converging product. So this product will be zero if and only if for some So we try to find such a (which will depend upon ). As we know that is identically on so necessarily we must find a so that Fortunately, the fact that is an formal inverse to and that is enough to guarantee that there is a with So now we have forced to be less than in absolute value. Of course, this is not enough. We need to force to be zero. So we need to find probability measures on whose Fourier transforms vanish reasonably often. Given it is not hard to exhibit a with mean zero and finite second moment which has on e.g.
[TABLE]
So we need to ensure that there is some so that the is not an integer, and that its denominator is “not too big.” The following lemma helps us in this regard by allowing us to assume that the coefficients of are not very big.
Lemma 3.6**.**
Let be a countable, discrete group, and let be semi-lopsided. Suppose that has a formal right inverse. Set and let
- (i)
If then we may write where and 2. (ii)
If then we may write where and for every Moreover, we may choose so that if then for every
Proof.
Let Let be a formal right inverse of since we may write where and Right multiplying by we have that
[TABLE]
and this shows that So we may write for some We show that has the desired properties in each case.
(i): This case is divide into two subcases. First, suppose that is lopsided, so Then for every
[TABLE]
So Thus
If is not lopsided, then and the fact that implies that we can choose an so that Fix Then
[TABLE]
Additionally,
[TABLE]
The fact that and implies that Thus
[TABLE]
So and as in the first subcase the fact that is integer valued implies that
(ii): In this case, we must have that for every Fix Since for every
[TABLE]
Similarly,
[TABLE]
So It simply remains to show that if then for every
So suppose that Then
[TABLE]
Since for all and the fact that forces for every Now fix Using that for all and that we have:
[TABLE]
So
∎
We now explicitly discuss where orderability comes into play. We will work with something slightly more general than a left-invariant total order on
Definition 3.7**.**
Let be a countable, discrete group. We say that a partial order on is left-invariant if whenever with then for all we have that If there is a left-invariant total order on then we say that is left-orderable.
For example, it is easy to exhibit a left-invariant partial order on Let be the set of elements of which are products of (no occur in its word decomposition), with the convention that We can then define a partial order by demanding that if and only if This is a partial order on and it makes the generators order positive (i.e. larger than in this partial order). It is a fact that there is a left-invariant total order on which make the generators order positive, but it is harder to construct.
Lemma 3.8**.**
Let be a countable, discrete group, and let be semi-lopsided, and set Suppose that has an formal inverse . Let and assume that has a left-invariant partial order so that and that is infinite. If but then there is a so that
Proof.
Let since is a partial order on we have that Since we may then extend the partial order on to a partial order on by saying that if It is easy to see that this partial order on is left-invariant so we may assume, without loss of generality, that has a left-invariant partial order which makes the elements of positive.
Note that if and if satisfies then So by Lemma 3.6 we may, and will, assume that one of the following two cases hold. Either
- (a)
or 2. (b)
for every Further, if then for every
Let be an element of which is minimal with respect to this partial order. We make the following claim.
Claim:
To prove the claim, we first note that if (a) holds then the claim is trivial, so we may assume that (b) holds. Note that for every So and for every So by minimality of we must that for every So (b) now implies that
We now return to the proof of the lemma. Let so Then, by Lemma 3.3 we have that
[TABLE]
Fix then
[TABLE]
Let Then and since Thus So and since By minimality we thus have that for all and thus for all So by the claim,
[TABLE]
Since it follows that
[TABLE]
∎
Corollary 3.9**.**
Let be a countable, discrete group, and let be semi-lopsided. Suppose that has an formal inverse. Suppose that and that has a left-invariant partial order so that and that is infinite. Then is a factor of a Bernoulli shift.
Proof.
Let be the formal inverse to and First assume that is an odd integer, and write We can let be defined as in Theorem 2.1 corresponding to Let So for every
[TABLE]
Suppose and write Then Hence we have for all Since for every we have that Suppose that but Then by Lemma 3.8, there is some so that So (since ), and thus Hence we know that and this is equivalent to saying that
Now assume that is even. Let and set Observe that is a measure on and since we have that
[TABLE]
Moreover, it is direct to check that has mean zero. Let be defined as in Theorem 2.1 for this , and set Then
[TABLE]
for all First suppose that Then as in the case that is odd, we know that and thus Now assume that but that As in the case that is odd, we may find a so that For such a we have that and thus So and thus
∎
Corollary 3.10**.**
Let be a countable, discrete group, and be semi-lopsided. Suppose that there is a left-invariant partial order on the group so that Assume that is infinite. Set Suppose that one of the following three cases hold:
- (i)
either is lopsided, or 2. (ii)
* has super-polynomial growth, or* 3. (iii)
* has polynomial growth of degree at least *
Then is a factor of a Bernoulli shift.
As we will see in the next section, our assumptions imply that the kernel of is finite, and that is essentially free. Thus, by [46], if is amenable, then we can say that is a Bernoulli shift.
4. Sample Applications
In this section, we shall give many examples of groups and semi-lopsided elements so that is a factor of a Bernoulli shift. We have divided this section into subsections: one where the examples have the acting group amenable, and one where it is not (the second section should maybe be titled “potentially nonamenable groups” as it includes Thompson’s group and the question of whether or not it is amenable is open). This is because in the amenable case we can apply Ornstein theory to show that this actions are in fact Bernoulli (once we argue that these actions are essentially free). While we cannot do this in the nonamenable case (there is a counterexample due to Popa in [47, Corollary 2], see also [3]), the fact that these actions are factors of Bernoulli shifts still has lots of interesting consequences such as showing that they have completely positive entropy, are solidly ergodic, are mixing of all orders, and have countable Lebesgue spectrum.
Most of examples will have the acting group be left-orderable. In this case, the assumption that is infinite is always satisfied except in the case that has size In both the amenable and nonamenable case we will also give examples of groups which are not torsion-free for which we can explicitly write down left-invariant partial orders, and this allow us to give nice examples of principal algebraic actions which are factors of Bernoulli shifts. Typically in this situation, the assumption that is infinite is also straightforward, and we will not explicitly prove it except in the cases where it is slightly less obvious.
For amenable demanding that be left-orderable and finitely generated implies that is locally indicable (i.e. every finitely-generated subgroup of has a surjective homomorphism onto ), by [42]. So this rules out some possibilities for for example it cannot be simple. By results of [29], there exists a continuum size collection of pairwise nonisomorphic, simple, nonamenable, finitely generated, left-orderable groups (this follows up previous related work in [33, Theorem 1.7]), and so nonamenable left-orderable groups can be simple. We do not know if there are examples of simple, finitely generated, amenable, groups which have a positive semigroup so that . We will give an example later of a group so that for every positive semigroup but so that it has a left-orderable subgroup of finite-index. So it is not always the case that a group can be generated by a positive semigroup, even if it has a “large” left-orderable subgroup.
In each case the elements we construct will have the property that generates even though this is not necessary to apply Corollary 3.10. There are three primary reasons for this. The first is that, in the semi-lopsided case, it makes it more transparent that has fast enough growth. Of course this is not an issue if we stick to lopsided elements, but this removes the harmonic model examples which are quite interesting for their connection with random walks. The second two reasons are as follows: suppose we take and let be the group generated by the support of For clarity, we let be the Pontryagin dual of and be the Pontryagin dual of Then is the coinduced action of (see [26, Section 6] for the terminology and a proof of this). The coinduction of a Bernoulli shift is a Bernoulli shift, and a factor map between -actions functorially induces a factor map between the corresponding -actions. Thus if is a Bernoulli shift (respectively a factor of a Bernoulli shift), then will be a Bernoulli shift (respectively a factor of a Bernoulli shift). This gives us two more reasons to restrict to the case The first is that we can do so without loss of generality, once we know the case when the support of generates the case when it does not follows by a simple application of the coinduction construction. The second is that while we can create examples where is a Bernoulli shift and is not all of many of these will be factors of Bernoulli (or factors of Bernoulli) for not very interesting reasons. For example, we can view inside of (in any number of ways). Certainly we know of many for which is Bernoulli, (e.g. by [30, 41, 50] this is true as long as it is ergodic) and so by coinduction we know that is Bernoulli. Since the group structure of does not enter in a nontrivial way in the proof that is Bernoulli, examples constructed in this manner are not very satisfactory. Similar remarks apply to any other group with infinite amenable subgroups. Of course, once one exhibits a set of generators for the group, then it is easy to construct several other sets of generators. In most of the examples we give we will typically only consider so that where are some “well known” generators of the group. We will leave it to the reader to modify these sets of generators and create many more examples of Bernoulli (or factor of Bernoulli) principal algebraic actions. There are certainly an endless number of ways of doing this.
We remark that once we demand that the assumption that there is a left-invariant partial order on so that is contained in the corresponding positive semigroup becomes an actual restriction on the group. Of course, such a group cannot be torsion. But even if has a finite-index, left-orderable subgroup, it is not necessarily the case that has a positive semigroup with For example, consider the unique nontrivial action by automorphisms, and set There is no positive semigroup with the property that This is because any positive semigroup must have no torsion elements, and this forces So our methods do not apply to any principal algebraic action of this group.
4.1. The Amenable Case
Corollary 3.10 is most striking when is amenable, since in this case being a factor of a Bernoulli shift implies that the action is a Bernoulli shift (at least when one quotients by the kernel of the action). This is a consequence of Ornstein theory. However, as Ornstein theory only applies to free actions of groups we should first observe that the actions we are considering are free after modding out by the kernel.
Proposition 4.1**.**
Let be a countable, discrete group and suppose that has a formal inverse. If is the kernel of the action then is finite and is essentially free.
Proof.
As was pointed out in [10], the fact that has a formal inverse implies that is mixing. This makes it obvious that is finite. Additionally, the fact that is mixing forces to be essentially free by [59].
∎
So in the amenable case, we can always conclude that if is a factor of a Bernoulli shift. In most of our examples, is additionally torsion-free. In this case, we have that is trivial, i.e. the algebraic action is faithful. If is assumed torsion-free, there is a more elementary proof that is essentially free by appealing to [24, Appendix A]. This does not use the Feit-Thompson theorem as in [59]. By Proposition 4.1 and the extension of Ornstein theory to amenable groups (see [46]), if is amenable and is a factor of a Bernoulli shift, and if is the kernel of the action then is isomorphic to a Bernoulli shift (this follows from [46, III.4 Proposition 1, III.6 Theorem 2, III.5 Corollary 5]). We will give several examples of Bernoulli principal algebraic actions of amenable groups shortly, but let us first point out explicitly here that this annoyance with finite normal subgroups can occur.
Proposition 4.2**.**
Let be a countable, discrete, group and let be finite with Let be an integer, and let
[TABLE]
Then has an inverse in and is the kernel of Further, the induced action is isomorphic to the Bernoulli action
Proof.
Let so and we can write as
[TABLE]
Simple calculations show that has an inverse in given by
[TABLE]
Moreover, it is easy to check that the normality of implies that and thus is central in
To check that acts trivially on let It then suffices to show that So let Then by direct calculation,
[TABLE]
So So acts trivially on
It simply remains to prove that is Bernoulli. Let be the left ideal in generated by by normality of this is in fact a two sided ideal. It is easy to see that we have an isomorphism of modules given by Since we already saw that we get a natural -modular surjection and so we have a natural -modular surjection given by
It remains to compute the kernel of Note that if then if and only if By a direct computation, So
[TABLE]
and thus if and only if By definition, this means that Since are easily seen to be relatively prime, this is the same as saying that So we have shown that
So we have exhibited an isomorphism of -modules, and applying Pontryagin duality shows that So is isomorphic to the Bernoulli shift
∎
Let us proceed to give several examples of semi-lopsided elements whose corresponding actions are Bernoulli. In many examples our groups will be torsion-free, and so it is a consequence of Proposition 4.1 that the actions we are considering are essentially free. We will thus not explicitly reference that these actions are essentially free before applying Ornstein theory. In later examples, we will consider groups with torsion and will give an explicit argument that these actions are faithful (and thus free by Proposition 4.1).
Since we know in these examples that the actions are isomorphic to Bernoulli, it is nice to know what Bernoulli shift they are. Since Bernoulli shifts over amenable groups are completely classified by their entropy by [44, 45, 46] (see [7, 9, 53, 56] for the more general fact that Bernoulli shifts overs sofic groups are completely classified their entropy), once we compute the entropy of these actions we will know what Bernoulli shift they are isomorphic to. By [26, Proposition 2.2] we know that once has an formal inverse, then is injective as a convolution operator So by [36] (see also [26] for the sofic case), the entropy of is In Appendix A.3 (see Corollary A.15) it is shown that if is semi-lopsided, and if where for some positive semigroup then So in all of the examples we are considering, we know that the entropy of is
Example 1*.*
Let be the Heisenberg group of upper triangular matrices with integer entries and all diagonal entries Then has polynomial growth of order 4 by the Bass-Guivarc’h formula. So our results only allow us to use lopsided elements. The group has a presentation Every element of can be uniquely represented as for integers The group has a total order given by saying that if either:
- •
or
- •
and
- •
and
It can be checked that this is a total order which is left and right invariant. By Corollary 3.10 and Ornstein theory, if
- •
with and or
- •
with and
then is isomorphic to Since we are only considering lopsided elements, if we set then we can in fact take any pairwise distinct any with and then
[TABLE]
will be such that is a Bernoulli shift with entropy provided . The reason for the restriction is that once we have that is a nontrivial subgroup of and as such this subgroup is infinite because is torsion-free.
Example 2*.*
We can generalize the previous example slightly. For let be the group of upper triangular -matrices with integer entries, on the diagonal, and so that all other nonzero entries are on the first row or the last column. For let be the matrix defined by Define by and for define by Then
- •
- •
are abelian,
- •
is central in
- •
if
- •
Every element of can be uniquely represented as
[TABLE]
for integers We can order lexicographically as before:
[TABLE]
if when is the minimal index such that It can again be checked that this is both left and right-invariant. If we set then as before we can take with and will have being a Bernoulli shift with entropy
The growth of is by the Bass-Guivarc’h formula, and so once we even have semi-lopsided, but not lopsided examples. For example, with
[TABLE]
we have that is isomorphic to a Bernoulli shift with base entropy (proved ). As we show in Appendix B.1, since is well-balanced, we know that does not have an inverse. We show there as well, using that is amenable, that is not invertible.
We can of course add signs here and consider, e.g.,
[TABLE]
for any in We then still have that is a Bernoulli shift with entropy Since we can similarly consider
[TABLE]
where and are not zero. Then is a Bernoulli shift with entropy
Similar examples, can be given by taking products of the generators. E.g. if we may consider
[TABLE]
Example 3*.*
For let be the group of upper-triangular -matrices with s on the diagonal. As contains from example 2, we know that has polynomial growth of degree at least once Define by and for with let Then and we leave it is an exercise to the reader argue as in Example 2 to show that has an left-invariant total order which makes Thus if
- •
- •
- •
satisfies
then with we have that is isomorphic to a Bernoulli shift with entropy If each and then we have that has no inverse and is not invertible, so we really have to use formal inverses.
Suppose that
[TABLE]
is an exact sequence of groups. Then if are equipped with left-invariant partial orders, we can equip with a left-invariant partial order as follows. We say that if either:
- •
are comparable and or
- •
with
In particular, if are left-orderable, then is left-orderable.
Example 4*.*
Fix an and let There is a natural map given by and it is direct to see that the kernel is isomorphic to Thus is left-orderable and there is a left-invariant ordering on which makes So if we set
[TABLE]
with nonzero integers such that then is isomorphic to a Bernoulli shift with entropy
Example 5*.*
Suppose that is polycyclic. This means that we have a chain of groups
[TABLE]
so that for all Suppose we choose so that Then it is possible to find a left-invariant order on so that for all So if we choose with then has isomorphic to a Bernoulli shift with entropy If is either superpolynomial growth, or polynomial growth of degree at least then we can allow to force to be isomorphic to a Bernoulli shift with entropy
It often happens that has exponential growth. For example, suppose that has no eigenvalues on the unit circle. Then is of exponential growth. Let then for any with setting we have that is isomorphic to a Bernoulli shift with entropy
Suppose is a Polish space, and that is a partial order on so that is closed for every Suppose that faithfully by order-preserving homeomorphisms. Then we can define a left-invariant partial order on as follows: let be a dense sequence in we then say that if
- •
is not empty,
- •
if then
If is a total order on then it is easy to check that this gives a total order on
It is a folklore result that this construction characterizes left-orderable groups: namely, a countable group is left-orderable if and only if it embeds into the group of order-preserving homeomorphisms of See, for example, [21, Theorem 6.8].
The order described above seems fairly abstract. However, since we are allowed to prescribe the first few terms of our sequence it makes it relatively straightforward to construct orders which make certain generators bigger than in that order.
Example 6*.*
All the preceding examples were solvable. We can consider non-solvable examples, in fact groups of intermediate growth. Let be the homeomorphisms of defined recursively by:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Let be the group generated by Notice that preserves the lexographic ordering on Fix a dense sequence in with Define an order on by saying that if when we set then Then is a left-invariant order on which makes all bigger than Also by [22] this group has intermediate growth. So for any with and with we have that is a Bernoulli shift with entropy
This group was defined in [23], and its orderability was first shown there. We have followed the exposition in [43, Section 1.1].
Our ability to use partial orders is in fact nontrivial, and we can construct examples where the acting group is not torsion-free (and thus not left-orderable). For this, it will be helpful to switch to positive semigroups instead of partial orders.
Suppose is a group equipped with a left-invariant partial order and let be the corresponding positive semigroup. Suppose that by automorphisms and that We can then define a positive semigroup in by From this positive semigroup we get a left-invariant partial order as described before. In many cases, is finite and so is not left-orderable.
A particular example is the case of generalized wreath products. For a group and a set we will use H^{\oplus I}=\{h\in H^{I}:h(i)=1\mbox{ for all but finitely many i}\}. Let be a group acting on a set and another group. We then let by permuting the coordinate of (using the action ). The generalized wreath product is then the semidirect product Suppose that has a left-invariant partial order We may then define a partial order on by saying that if then if and only if for all This is clearly invariant under the action of on for all and thus induces an order on by the above construction. Since this construction sometimes produces groups which are not torsion-free, we need to take some care in applying Proposition 4.1 to have our actions be essentially free. The following lemma will do most of the work for us. This lemma is surely well known, but we will include a proof for completeness.
Lemma 4.3**.**
Suppose that is an infinite group with no nontrivial finite normal subgroups. Let be a set, and let be a group with faithfully. Then has no nontrivial finite normal subgroups.
Proof.
We use for the action of on Let and suppose that is a finite normal subgroup in Let and write with and Let be the intersection of and the centralizer of in Since is a finite normal subgroup, we know that the centralizer of in has finite index, and thus is a finite index subgroup of Suppose that then and So we are forced to have Hence Since is infinite, the fact that is finite-index in forces to act trivially on Since the action of is faithful, we must have that Thus Since has no nontrivial finite normal subgroups we must have that Thus and since was an arbitrary element of we must have that is trivial.
∎
We will use this to give one more example of a Bernoulli shift where the acting group is torsion-free, and then one more where it is not.
Example 7*.*
Consider and use the natural order on to induce a left-invariant partial order as described above. Let be given by and let Then generate and since embeds into for all it is clear that has superpolynomial growth. Moreover, is an infinite order element, and so is infinite. The left-invariant partial order describe above has Hence, for all with and with we have that is a Bernoulli shift with entropy
Example 8*.*
Fix and let Give its natural order and use this to induce an order on as described above. Let be given by and let Then generate Consider with if and if Let be given by By Lemma 4.3, we know that has no finite normal subgroups, and thus by Proposition 4.1 that is essentially free. So by Ornstein theory, we know that is a Bernoulli shift with entropy
Let act on in the natural way. In one has a left-invariant partial order so that So if is arbitrary, we may consider as a group with a left-invariant partial order. So we can obtain similar modifications of Example 8. Let be a set of generators for and let be such that the group generated by is all of Let be such that Set
[TABLE]
If then is a Bernoulli shift with entropy If then as long as we assume that we still have that is a Bernoulli shift with entropy
Of course the possibilities here are endless, and one can consider other wreath products where is left-orderable. E.g. one can take to be the Heisenberg group, or other polycyclic groups.
4.2. Nonamenable examples
Example 9*.*
For an integer let be the free group on letters Let be the set of nonidentity elements of whose word decompositions only have positive powers of the generators, then is a positive semigroup. Thus induces a left-invariant order on by if In fact, by [61] we know that there is a left-invariant total order on so that but we will not need this. Thus if with and then is a factor of a Bernoulli shift.
More generally, any residually free group is left-orderable. This includes fundamental groups of compact surfaces without boundary whose genus is larger than . Additionally, if is residually free, and we have an explicit family of homomorphisms for integers so that then we get an explicit left-invariant partial order on Thus in many cases, we can explicitly describes semi-lopsided elements so that is a factor of a Bernoulli shift. More generally by [61], we also have that free products of left-orderable groups are left-orderable.
Example 10*.*
For an integer consider the braid group which has the following presentation:
[TABLE]
Dehornoy proved (see [16]) that has a left-invariant order which is now called the Dehornoy order. This ordering is uniquely defined by saying that for all we have for all Let and Since we know that contains a free group on two generators and thus has exponential growth. So if we have that is a factor of a Bernoulli shift.
More generally, let be a compact surface with a finite set of punctures (potentially empty) and nonempty boundary, and let be the mapping class group of Then by [49], we know that is left-orderable (see also [55]). In many cases, we can explicitly describe a left-invariant order on and as before this allows us to explicitly produces semi-lopsided with a factor of a Bernoulli shift.
Example 11*.*
Consider Thompson’s group which is the group of all increasing, piecewise linear homeomorphisms of whose break points are dyadic rationals, and whose slopes are powers of By definition, is a subgroup of the group of increasing homeomorphisms of and is thus left-orderable. Let denote the element of whose break points are and has Let be the element of whose break points are with It is known (see [12, Section 3]) that generate and that has exponential growth. We may choose a left-invariant order so that for example by considering a dense sequence in with and using this to define a left-invariant order on as described before. Thus if with then has a factor of a Bernoulli shift.
Example 12*.*
Let for Let be the generator of the first factor of and let be the generator of the second factor. Let be the semigroup generated by A simple exercise shows that this is a positive semigroup with and that has infinite order. Thus if and then then is a factor of a Bernoulli shift.
In this case, it is also direct to establish that has no finite normal subgroups. So, we know that is free. This is of less significance in this case, as Ornstein theory no longer applies in the nonamenable setting.
Example 13*.*
Fix an integer Regard as the free group on letters Let be the semigroup generated by As before we have that is a positive semigroup in Consider the natural action of by automorphisms on given by permuting the generators. This semigroup is clearly invariant under so this induces a left-invariant partial order on
Regard via the translation action on Let Let Then if and then
[TABLE]
is such that is a factor of a Bernoulli shift.
Again, in this case one can argue as in Lemma 4.3 to show that (and also ) has no nontrivial finite normal subgroups. So is also essentially free in this case.
5. Closing Remarks
Suppose that is a countable, discrete group and that is semi-lopsided. If is assumed sofic, then we know that the entropy of is from the results of [26, 36], and Appendix A.3. It is worth noting that if is odd, then the proof of Corollary 3.9 exhibits as a factor of a Bernoulli shift which has equal entropy. It thus makes it very plausible that this factor map is, in fact, an isomorphism. If is even, then the domain of is a Bernoulli shift whose entropy is not equal to that of So the factor map exhibited in the proof of Corollary 3.9 is not injective modulo null sets (if is assumed sofic). However, under the stronger assumption that has an formal inverse we can exhibit a factor map from a Bernoulli shift with equal entropy.
To prove this, we will need to note that, though we did not prove this in [24], we can replace the assumption that has mean zero and finite second moment with the assumption that has a finite first moment provided we work with vectors instead of vectors. This follows from the exact same methods as in [24, Section 3]. In this case there is no need to apply the uniform continuity as in [24, Section 3], since the fact that has finite first moment implies that for -almost every it is true that for every the series
[TABLE]
converges absolutely. We state the analogous version of Theorem 2.1 for convolving with vectors here. The only difficult part is computing the Fourier transform of and this follows by identical arguments as those in [28, 24].
Theorem 5.1**.**
Let be a countable, discrete group and fix a with finite first moment. For let be the (almost everywhere defined) map Set Then for every
[TABLE]
Using this, we can exhibit as an equal entropy factor of a Bernoulli shift, provided that has an formal inverse.
Corollary 5.2**.**
Let be a countable, discrete group and let Let and Suppose that there is a left-invariant partial order on so that Set
- (i)
Assume that is odd and that has an formal inverse Set and let be defined as in Theorem 2.1 corresponding to this Then If is assumed sofic, then the actions both have entropy for any sofic approximation of 2. (ii)
Assume that has an formal inverse Define by Then If is assumed sofic, then the actions both have entropy for any sofic approximation of
Proof.
(i): The fact that is shown in the course of the proof of Corollary 3.9. By [7], we know that has entropy with respect to any sofic approximation of The fact that has entropy is a consequence of [36, 26] and the fact that the Fuglede-Kadison determinant of is (see Appendix A.3, namely Corollary A.15, for more details).
[TABLE]
Since for and for every it follows as in the proof of Corollary 3.9 that
∎
Thus in either case (i), (ii) of Corollary 5.2 we can exhibit as an equal factor map of a Bernoulli shift with the same entropy, so this makes it plausible that this factor map is an isomorphism.
Conjecture 1**.**
Let be a countable, discrete, group with a left-invariant partial order Let be semi-lopsided and such that Set Suppose that either:
- (i)
* has an formal inverse and is odd,* 2. (ii)
* has an formal inverse.*
In case (i) let be defined as in case (i) of Corollary 5.2, and in case (ii) let be defined as in case (ii) of Corollary 5.2. Then is injective modulo null sets.
We remark that if is a free group, then Lind-Schmidt [37] can show that case (ii) of Conjecture 1 is true for some examples of
We also remark here that in the proof of Corollary 3.9, we did not really need to find a fixed choice of so that for every there is some with In actuality the major point here is that we need to ensure that if then there is some so that is a noninteger rational number whose denominator is “not too big.” We state this precisely as follows.
Theorem 5.3**.**
Let be a countable, discrete group and Suppose that has an formal inverse Suppose that there is an with the following property. For every there is a so that for some Then is a factor of a Bernoulli shift.
Proof.
It suffices to find a probability measure which is finitely supported and has mean zero and so that for every We can then simply follow the proof of Corollary 3.9 to see that is a factor of a Bernoulli shift. For let
[TABLE]
Now set As
[TABLE]
and
[TABLE]
it is easy to see that has the desired properties.
∎
Appendix A Background on tracial von Neumann algebras
Let be a Hilbert space. Every element of is a function and so we may view The strong operator topology on is the subspace topology inherited from the product topology on . We may also define this topology by prescribing a basis. Given a finite and an set
[TABLE]
The collection ranging over all finite and form a neighborhood basis at in the strong operator topology.
Definition A.1**.**
A von Neumann algebra is a subalgebra for some Hilbert space which is closed under adjoints and in the strong operator topology.
A tracial von Neumann algebra is a pair where is a von Neumann algebra and is a linear functional which is:
- •
a state: for all and ,
- •
faithful: if and only if ,
- •
tracial: for all
- •
normal: \tau\big{|}_{\{x\in M:\|x\|\leq 1\}} is strong operator topology continuous.
For notation, we will usually use for the identity operator on The main example which concerns us is the group von Neumann algebra. Let be a countable discrete group, and define by
[TABLE]
The group von Neumann algebra of denoted is defined by
[TABLE]
Here the span and closure are taken by viewing Define by
[TABLE]
We leave it as an exercise to check that is a tracial von Neumann algebra. Another good case for intuition is the pair for a probability space We may view as a von Neumann algebra by identifying an essentially bounded function with its multiplication operator acting on It turns out that every tracial von Neumann algebra with abelian is of the form for some probability space .
We may use the trace to construct a representation of which may be nicer than the original Hilbert space on which is represented by following the abelian case. We define an inner product on by We use for the resulting norm given by for and we let be the completion of under this inner product. We will still use for the norm on For we sometimes use for viewed as a vector in the completion For we have
[TABLE]
[TABLE]
(see [57, Chapter V.2, Equation 8]) where is the operator norm of acting on the original Hilbert space that is defined on. It follows from the above estimates that left/right multiplication on are - uniformly continuous as maps and thus have continuous extensions to bounded operators on For we will use , for the image of under the continuous extension of the left/right multiplication operators given above. It is a consequence of faithfulness of (see [14, Theorem VIII.4.8]) that the operators have operator norm equal to operator norm of acting on the original Hilbert space that is defined on. In analogy with the abelian case, we will use for the operator norm of
This construction is relatively concrete in the group case. If and then it is direct to show that
[TABLE]
for all From this it follows that there is unique unitary which sends to and which is equivariant with respect to the natural action of on and the left multiplication action of on
One of the most important features of von Neumann algebras is the ability to apply bounded Borel functions, and not just any polynomial, to (certain) elements of For concreteness we will stick to the self-adjoint case, but this works more generally for any normal element in a von Neumann algebra. If we will use for the algebra of bounded, Borel, -valued functions on This is an algebra under pointwise multiplication, and it is also a -algebra using For we use for the supremum norm of We now recall the notion of Borel functional calculus, as well as the spectral theorem for self-adjoint operators. For we define its spectrum by
[TABLE]
by invertible we either mean in the ring or the ring (these notions are equivalent for von Neumann algebras by [14, Proposition VIII.1.14]). If is self-adjoint, then (see [14, Corollary VII.1.13]). In fact, for self-adjoint we have that (see [14, Proposition VIII.1.11 (e)]). We say that is positive, and write , if This ends up being equivalent to saying that for all (see [14, Theorem VII.3.8]). If are self-adjoint, we then say if
Theorem A.2** (Borel functional calculus, Theorem IX.8.10 of [14]).**
Let be a Hilbert space, and a von Neumann algebra. Then for every self-adjoint there is a unique -homomorphism satisfying the following axioms:
- •
* maps the identically function to *
- •
* maps the function to *
- •
* for every ,*
- •
if is a sequence in with and if converges pointwise on to , then in the strong operator topology.
Moreover, satisfies the following properties:
- •
* for every *
- •
if and then
For and we will use for This agrees with the standard notation when is a polynomial. It follows from uniqueness that the Borel functional calculus behaves well with respect to composition: if and then It is frequently of use to reduce the study of arbitrary elements of to the self-adjoint case. For (not necessarily self-adjoint) we set Here is interpreted in terms of functional calculus: we are applying the square root function defined on to the positive element . By direct computation, for every In particular, and so
[TABLE]
We also set We caution the reader that in the case of these notions do not agree with the applying the absolute value and real part operations to the coefficients. Namely, if then Similarly, if has then (indeed is typically not even self-adjoint, much less positive).
Another important consequence of Borel functional calculus is (a version of) the Spectral Theorem. Note that if is Borel, then is self-adjoint and idempotent. This implies that has closed image and is the orthogonal projection onto its image.
Theorem A.3** (The Spectral Theorem).**
Let be a Hilbert space and self-adjoint. Then for every there is a unique Borel measure on with
[TABLE]
Moreover, .
Alternatively, we can characterize as above by saying that for every Borel Perhaps more concretely, the fact that is compactly supported allows us to use the Stone-Weierstrass and Riesz representation theorems to say that is the unique measure satisfying
[TABLE]
Of particular interest is the case In this case, we will use for the unique measure satisfying
[TABLE]
for all The following is a well known result, but we isolate it because we will use it rather frequently in the appendix and because we are unable to find a short reference for it in the literature.
Proposition A.4**.**
Let be a tracial von Neumann algebra, and let Then the following are equivalent:
- (1)
* is injective as an operator on ,* 2. (2)
** 3. (3)
**
Proof.
(1) implies (2): Suppose is injective as an operator on and let Then
[TABLE]
the last equality following as the function is identically zero. By injectivity of it follows that So we have shown that
(2) implies (3): This follows from the fact that
(3) implies (2): This follows from the fact that is faithful.
(2) implies (1): Suppose Let with Let be the measure on with
[TABLE]
Since we have that Thus
[TABLE]
Since and the above integral must be positive. So has trivial kernel, and is thus injective.
∎
A.1. Noncommutative -spaces and the Proof of Lemma 3.1
For the proof of Lemma 3.1, we will use the notion of noncommutative -spaces.
Definition A.5**.**
Let be a tracial von Neumann algebra and For we define the noncommutative -norm of with respect to by
[TABLE]
It is a non-obvious fact that is indeed a norm on (see [58, Theorem IX.2.13] or [15, Theorem 2.1.6]). Given we use for the operator norm of regarded as an operator on (recall that this is the same as the operator norm of represented on the original Hilbert space is given on).
Moreover, we still have Hølder’s inequality in the noncommutative context. Namely, if with then for one has
[TABLE]
See [19, Corollaire 3] or [15, Theorem 2.1.5] for a proof.
Proposition A.6**.**
Let be a tracial von Neumann algebra. Suppose that with Suppose that has no nonzero fixed vectors when acting on Then
[TABLE]
for every
Proof.
Note that for every natural number This uniform estimate implies that
[TABLE]
is a closed, linear subspace of So it suffices to show that it contains By the estimate
[TABLE]
it suffices to show that By repeated applications of the noncommutative Hølder inequality we have
[TABLE]
The assumption that has no nonzero fixed vectors when acting on means that is injective. Since we know that So Hence by Proposition A.4, we know Thus Since we have that and so Thus
[TABLE]
by the dominated convergence theorem.
∎
As an application, we deduce Lemma 3.1.
Proof of Lemma 3.1.
Setting , and we have a canonical isomorphism which is equivariant with respect to the actions of and sends to So by Proposition A.6, it suffices to show that has no nonzero fixed vectors when acting on Let and Then and for all we have:
[TABLE]
The fact that is self-adjoint implies that for all and from this it follows that
[TABLE]
Suppose that is fixed by Then by the above equation and the fact that it follows that for all Hence for all Since is infinite and it follows that
∎
A.2. General Results on formal inverses in von Neumann algebras and the Proof of Lemma 3.2
In this section, we prove Lemma 3.2. In fact, we will show that a version of Lemma 3.2 holds in an arbitrary tracial von Neumann algebra. To do this, we first generalize the notion of formal inverses from the case of the group ring to a general tracial von Neumann algebras.
Definition A.7**.**
Let be a tracial von Neumann algebra, and We say that has an formal inverse if there is a with
We recall (see [14, VIII.3.11]) the polar decomposition. Let be a Hilbert space. We say that a is a partial isometry if for all which are orthogonal to the kernel of We leave it as an exercise to verify that if is a partial isometry, then is the orthogonal projection onto the orthogonal complement of the kernel of and is the orthogonal projection onto to the image of We call the source projection of and the range projection of If then we can write where is a partial isometry whose source projection is the orthogonal projection onto the kernel of and whose range projection is the orthogonal projection onto the closure of the image of Moreover, this decomposition is unique: if is another partial isometry whose source projection is the orthogonal projection onto the kernel of and whose range projection is the orthogonal projection onto the closure of the image of and if is any positive operator with then necessarily and See [14, VIII.3.11] for more details.
Lemma A.8**.**
Let be tracial von Neumann algebra and Then the following are equivalent:
- •
* has an formal inverse,*
- •
* is injective and *
Moreover, if has an formal inverse , then
[TABLE]
where is the polar decomposition of
We remark that the notation is mildly abusive. It should be interpreted as , where is the bounded Borel function given by We are not requiring that be invertible as a bounded operator to make sense of
Proof.
Throughout the proof, let be the polar decomposition to For let .
First, suppose that has an formal inverse By the same arguments as in [28, Proposition 2.2], this implies that is injective as a bounded operator on Let is the Polar decomposition to We compute:
[TABLE]
By the spectral theorem, this implies that
[TABLE]
As is injective, Proposition A.4 implies that So
[TABLE]
Thus
[TABLE]
Since is the polar decomposition of we know that is the orthogonal projection onto the orthogonal complement of the kernel of Since is injective, we deduce that So
[TABLE]
the last step following from the monotone convergence theorem. Thus .
Conversely, suppose that is injective and that Since is injective, we may argue as in the preceding paragraph to see that Since has a faithful, normal tracial state, it follows by [57, Theorem V.2.4] that So is a unitary. Let For we have
[TABLE]
the last equality following as is unitary. So
[TABLE]
the last line following by the fact that is tracial and is a unitary. Since the dominated convergence theorem shows that is a Cauchy net. Thus, by completeness of we may define where the limit is taken in We then have that
[TABLE]
By the spectral theorem, we know Injectivity of and functional calculus imply that So
[TABLE]
the last step following as is unitary.
∎
Corollary A.9**.**
Let be tracial von Neumann algebra and suppose that is injective as an operator on Then has an formal inverse if and only if
[TABLE]
Proof.
By direct computation
[TABLE]
∎
Note that, by definition, Recall that our overall goal is to show that if and and if has an formal inverse, then so does . The above corollary will facilitate this goal because it turns out that we may effectively estimate in terms of The main tool that helps us do this is the following, which is a rephrasing of [58, Lemma IX.2.6].
Lemma A.10**.**
Let be a tracial von Neumann algebra and orthogonal projections in If then
The following are the main estimates we will use in our proof of Lemma 3.2.
Lemma A.11**.**
Let be a tracial von Neumann algebra.
- (i)
Suppose that with Then for all 2. (ii)
Suppose that and that Then for all
Proof.
(i): Set , Suppose Let with By the spectral theorem, we may find compactly supported measures with
[TABLE]
for all bounded, Borel functions Since it follows that
[TABLE]
Since and we know that
[TABLE]
So we have
[TABLE]
a contradiction.
(ii): Set and Suppose Then we may find a with By the spectral theorem, we may choose compactly supported with
[TABLE]
[TABLE]
for all bounded, Borel Since it follows that
[TABLE]
On the other hand,
[TABLE]
the last equality following as By definition of
[TABLE]
where in the last equality we again use that So we have shown that
[TABLE]
a contradiction. ∎
We now prove the main result of this section.
Lemma A.12**.**
Let be a tracial von Neumann algebra and with If has an formal inverse, then so does
Proof.
Assume has an formal inverse. Recall that this implies that is injective. We first show that is injective. Suppose that and Then
[TABLE]
the last step following as So , and thus By injectivity of it follows that . So is injective. It thus remains to show that
[TABLE]
for every Since we just saw that is injective, we know by Proposition A.4 that So
[TABLE]
Additionally, the fact that implies that So and thus So and the Lemma now follows from the above estimate and Corollary A.9. ∎
We now prove Lemma 3.2.
Proof of Lemma 3.2.
Recall that if and then we may have a canonical identification which sends to So it is enough to show that if has an formal inverse, then has an formal inverse.
By the triangle inequality, if and then So Lemma 3.2 now follows from Lemma A.12.
∎
A.3. Fuglede-Kadison determinants of lopsided and semi-lopsided elements
We now recall the definition of Fuglede-Kadison determinants for elements in a tracial von Neumann algebra.
Definition A.13**.**
Let be a tracial von Neumann algebra, and let Define the Fuglede-Kadison determinant of by
[TABLE]
with the convention that
Let be a tracial von Neumann algebra. Given any by [11] there is a unique probability measure defined on the Borel subsets of the spectrum of so that
[TABLE]
for all In the case that is self-adjoint, this agrees with the measure defined earlier in this section. We call the Brown measure of this measure is an analogue of the eigenvalue distribution of (it may be that the support of is a proper subset of the spectrum of ). Brown showed in Theorem 3.10 of [11] that:
[TABLE]
for all
The following result is how we compute Fuglede-Kadison determinants for semi-lopsided elements. This result is surely well known, but we include the proof for completeness.
Proposition A.14**.**
Let be a tracial von Neumann algebra, and let be a contraction (i.e. ). Then:
- (a)
** 2. (b)
If is conditionally convergent, then
[TABLE]
Proof.
(a): Let be the Brown measure of By definition,
[TABLE]
and is a measure supported on For
[TABLE]
Observe that, for all and all with we have that
[TABLE]
and for all So it follows from the monotone convergence theorem that
[TABLE]
(b): It suffices to show that
[TABLE]
Let denote the branch of the complex logarithm defined on the right-half plane and which has By part we have that
[TABLE]
For the sum converges uniformly on to Hence, for
[TABLE]
the last equality following by Theorem 3.10 of [11]. By Abel’s theorem
[TABLE]
since is conditionally convergent. Thus we have that
[TABLE]
∎
Corollary A.15**.**
Let be a countable, discrete, group and suppose that has a left-invariant partial order Let and let be complex numbers. Suppose that and that Finally, set Then
[TABLE]
Proof.
Set then Since we have:
[TABLE]
Since it is not hard to see that for every integer This completes the proof.
∎
Appendix B On formal inverses
B.1. formal inverses of balanced elements
We start by addressing some of the invertibility conditions in the paper and show that in may cases they are optimal. The invertibility conditions on that occur in this paper and previous other works (in increasing order of generality) are typically the following:
- •
has an formal inverse, [8, 17, 18, 39],
- •
is invertible in the full -algebra of [32],
- •
- •
has an formal inverse ([28]).
Since they are the ones relevant to our paper, we discuss when the first, third and fourth of these invertibility hypotheses for well balanced occur in the following proposition. Compare [35, Appendix A] for a more involved discussion in the amenable case of how and when the first and second hypotheses differ.
Proposition B.1**.**
Let be a countable, discrete group and be semi-lopsided. Let Then
- (a)
if is well-balanced, it does not have an formal inverse, 2. (b)
if is well-balanced, then is invertible if and only if is amenable, 3. (c)
if is nonamenable, then is invertible.
Proof.
(a): Define by Direct computations show that for all where is convolution. So for all But then obviously there is no with
(b): Write where First suppose that is amenable. Then there is a sequence in with and by [4, Appendix G]. Since we thus have that Hence, we have that By the open mapping theorem, if were invertible we would have that there is a constant so that for all Since and we must have that is not invertible. So is not invertible.
Conversely, suppose that is not amenable. Then, by [4, Appendix G] we have that So is invertible and it inverse is given by
(c): If is lopsided, this is obvious. So we may assume that where Let be so that Then, for all we have that so So As in (b), we know that So as well, and as in (b) this implies that is invertible. So is invertible.
∎
It is easy to see that being invertible is equivalent to being invertible in the group von Neumann algebra (as used and discussed in [35, 27, 25]). By our work in Section 3.1 we know that, in the setup of the above Proposition, that if is infinite, and if either has superpolynomial growth or polynomial growth of degree at least then has an formal inverse. If is well-balanced, and is amenable, then is not invertible. So we have many examples of which have an formal inverse, but are not invertible in the group von Neumann algebra.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. K. Alexopoulos. Random walks on discrete groups of polynomial volume growth. Ann. Probab. , 30(2):723–801, 2002.
- 2[2] A. Alpeev, T. Meyerovitch, and S. Ryu. Predictability, topological entropy and invariant random orders. ar Xiv:1812.10833 .
- 3[3] T. Austin. The geometry of model spaces for probability-preserving actions of sofic groups. to appear in Anal. Geom. Metr. Spaces .
- 4[4] B. Bekka, P. de la Harpe, and A. Valette. Kazhdan’s property (T) , volume 11 of New Mathematical Monographs . Cambridge University Press, Cambridge, 2008.
- 5[5] L. Bowen. Examples in the entropy theory of countable group actions. Ergodic Theory Dynam. Systems . to appear.
- 6[6] L. Bowen. Zero entropy is generic. ar Xiv:1603.02621 .
- 7[7] L. Bowen. Measure conjugacy invariants for actions of countable sofic groups. J. Amer. Math. Soc. , 23(1):217–245, 2010.
- 8[8] L. Bowen. Entropy for expansive algebraic actions of residually finite groups. Ergodic Theory Dynam. Systems , 31(3):703–718, 2011.
