Concentration of measure, classification of submeasures, and dynamics of $L_{0}$
Friedrich Martin Schneider, S{\l}awomir Solecki

TL;DR
This paper introduces a new measure concentration phenomenon for Lipschitz functions on product spaces, classifies diffuse submeasures into geometric types, and explores implications for topological $L_{0}$-groups.
Contribution
It provides a novel uniform concentration bound using Herbst's argument and Shearer's lemma, along with a geometric classification of submeasures and their dynamical consequences.
Findings
Established a new measure concentration bound for Lipschitz functions.
Classified diffuse submeasures into elliptic, parabolic, and hyperbolic types.
Proved non-elliptic submeasures exhibit covering concentration.
Abstract
Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set of the product. Our proof combines the Herbst argument with an analogue of Shearer's lemma for differential entropy. We give a quantitative "geometric" classification of diffuse submeasures into elliptic, parabolic, and hyperbolic. We prove that any non-elliptic submeasure (for example, any measure, or any pathological submeasure) has a property that we call covering concentration. Our results have strong consequences for the dynamics of the corresponding topological -groups.
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.
Concentration of measure, classification of submeasures, and dynamics of
Friedrich Martin Schneider
F.M. Schneider, Institute of Discrete Mathematics and Algebra, TU Bergakademie Freiberg, 09596 Freiberg, Germany
and
Sławomir Solecki
S. Solecki, Department of Mathematics, Cornell University, Ithaca, NY 14853, USA
(Date: 17th March 2024)
Abstract.
Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set of the product. Our proof combines the Herbst argument with an analogue of Shearer’s lemma for differential entropy. We give a quantitative “geometric” classification of diffuse submeasures into elliptic, parabolic, and hyperbolic. We prove that any non-elliptic submeasure (for example, any measure, or any pathological submeasure) has a property that we call covering concentration. Our results have strong consequences for the dynamics of the corresponding topological -groups.
Key words and phrases:
Concentration of measure, submeasure, extreme amenability
2010 Mathematics Subject Classification:
60E15, 28A60, 43A07, 54H15
The first-named author acknowledges funding of the Excellence Initiative by the German Federal and State Governments. The second-named author acknowledges funding of NSF grant DMS-1800680.
Contents
1. Introduction
The present paper makes contributions to three areas: the probabilistic theme of concentration of measure in product spaces; the set theoretic and measure theoretic theme of submeasures; and the topological dynamical theme of extreme amenability.
Concentration of measure in products. We introduce a generalization of the Hamming metric on product spaces and prove concentration of measure for it. (The book [Led01] is a rich source of information on concentration of measure.) Generalizations of the Hamming metric in the context of concentration of measure were considered by Talagrand [Tal95, Tal96]. Our approach appears to be orthogonal to Talagrand’s. We start with a sequence of sets covering a non-empty set together with a sequence of positive real numbers, weights, . The sequences and will be the parameters determining the metric. Given a family of sets , , we define a metric on as follows: for two points and in the product, let
[TABLE]
where runs over all with
[TABLE]
Note that if the sets , , form a partition of into one-element sets (so ) and for each , then coincides with the normalized Hamming metric.
We prove a concentration of measure theorem in product spaces for the above metric . Our interest in such a concentration of measure theorem comes from applications in topological dynamics in proving extreme amenability of certain Polish groups. To state the concentration of measure theorem, we extract a natural number from the sequence ; we call a -cover of if each element of belongs to at least entries of the sequence . We consider now a family of standard Borel probability spaces indexed by the set : . Let be the product measure on . Assuming that is a -cover of , we prove in Theorem 3.11 that for each measurable function that is -Lipschitz with respect to and for every ,
[TABLE]
The advancement consists of the presence of in the exponent on the right-hand side of the above inequality. Our proof of concentration of measure uses the entropy method developed by Ledoux [Led95, Led96, Led99] building on the so-called Herbst argument, which originates in an unpublished letter by Herbst to Gross. The second main ingredient of our proof is a result by Madiman–Tetali [MT10, Corollary VIII] (Lemma 3.8 in the present paper), which relates differential entropy on product spaces with covering numbers of covers of the underlying index sets and in turn constitutes an analogue of Shearer’s lemma for Shannon entropy of discrete random variables [CGFS86, Section V, page 33, item (22)]. For a broader background on concentration of measure, the reader may consult [Led01].
Submeasures as pseudo-metrics. A real-valued function on a Boolean algebra is a submeasure if it is subadditive, monotone with respect to the natural ordering of , and assigns the value [math] to the zero element of . For some background on submeasures the reader may consult, for example, the papers [HC75, KR83, Sol99, Tod04, Tal80, Tal08]. For concreteness, let us make use of Stone’s representation theorem for Boolean algebras [Sto36] and assume that is a Boolean algebra of subsets of some set . A submeasure can be viewed as a metric, or a pseudo-metric, on an algebra of sets that respects the structure of the algebra, namely, induces a pseudo-metric on by the formula
[TABLE]
Of course, is a metric precisely when is strictly positive on non-empty sets in . Seeing submeasures as pseudo-metrics yields connections between submeasures and nets of -spaces, on the one hand, and submeasures and Polish topological groups, on the other, which, in turn, connects the concentration of measure result above with extreme amenability of certain Polish groups. Before we explain these relationships, we describe our classification of submeasures, which will be important in our considerations.
Classification of submeasures. With each submeasure defined on a Boolean algebra of subsets of a set , we associate a function , whose value at measures how thickly, relative to , the family of elements of with submeasure not exceeding covers the underlying set . More precisely, we consider the covering number of a family of sets as introduced by Kelley [Kel59]: for a family of subsets of , the covering number of is the supremum of the ratios
[TABLE]
where varies over all sequence of elements of with . Now, is defined to be equal to the covering number of the family
[TABLE]
divided by . In Theorem 4.7, we show that the asymptotic behavior of at [math] is rather restricted, for example, the quantity tends to a limit, possibly infinite, as tends to [math]. A key point in this proof is Lemma 4.10, which is analogous to certain convergence results on subadditive sequences, but appears not to be derivable from these results. We classify submeasures into hyperbolic, parabolic, and elliptic according to the asymptotic behavior of ; using Landau’s big notation, the submeasure is hyperbolic if as , elliptic if as , and parabolic otherwise. In Theorem 4.7, we relate this classification to the two well-studied classes of submeasures: measures and pathological submeasures. In particular, using a result of Christensen [Chr78], we show that a submeasure is hyperbolic precisely when it is pathological. (Recall that a submeasure that is additive on pairs of disjoint sets is called a measure; a submeasure is called pathological if it does not have a non-zero measure below it.)
Submeasures as functors from probability spaces to nets of -spaces. An -space, or a metric measure space, is a standard Borel space equipped with a probability measure and a pseudo-metric that are compatible with each other. Assume we have a submeasure defined on an algebra of subsets of some set . The family of all partitions of the underlying set into sets in with the relation of refinement forms a directed partial order. Given a standard Borel probability space , we associate with each such partition an -space by equipping the product space of all function from to with the product measure arising from and a pseudo-metric that naturally extends formula (1) by setting
[TABLE]
This procedure associates with a net of -spaces indexed by finite partitions of into elements of . A natural question arises whether the nets of -spaces obtained this way are Lévy, that is, whether they exhibit concentration of measure. Using our concentration of measure result, we prove in Theorem 5.6 that the nets of -spaces associated with hyperbolic and parabolic submeasures are Lévy. On the other hand, in Example 5.7, we exhibit an elliptic submeasure such that the net of -spaces associated with it is not Lévy, showing that Theorem 5.6 is essentially sharp.
Submeasures as functors from topological groups to topological groups. Given a topological group , we consider the topological group of all functions from to that are constant on the elements of a finite partition of , with depending on . The group is equipped with pointwise multiplication. The topology on it is defined again by extending formula (1). Given and a neighborhood of the neutral element in , a basic neighborhood of in consists of all such that
[TABLE]
A construction of this type was first carried out by Hartman–Mycielski [HM58], in the case of being a measure, and by Herer–Christensen [HC75], in the case of a general submeasure. We ask when is extremely amenable, that is, for what and , does each continuous actions of on a compact Hausdorff space have a fixed point? Results pertaining to this questions were obtained by Herer–Christensen [HC75], Glasner [Gla98], Pestov [Pes02], Farah–Solecki [FS08], Sabok [Sab12], and Pestov–Schneider [PS17]. For a broader background on extreme amenability the reader may consult [Pes06]. Our classification of submeasures plays a role here, too. In Theorem 7.5, we connect covering concentration of submeasures and extreme amenability of groups for amenable . Using this theorem and our result on Lévy nets described above, we show in Corollary 7.6 that if is hyperbolic or parabolic and is amenable, then is extremely amenable, in fact, it is even whirly amenable. This gives a common strengthening of the results from [HC75, Gla98, Pes02, PS17] and also of a large portion of the results from [FS08, Sab12]. In the other direction, by extending an argument from [PS17], we show in Proposition 7.7 that if is parabolic or elliptic and is not amenable, then is not extremely amenable, in fact, it is not even amenable.
2. Measure concentration and entropy
The purpose of this preliminary section is to provide the background material necessary for stating and proving the results of Section 3. This will include both a quick review of generalities concerning concentration of measure (Section 2.1) and a discussion of a specific information-theoretic method for establishing concentration inequalities (Section 2.2).
2.1. A review of measure concentration
Let us briefly recall some of the general background concerning the phenomenon of measure concentration [Lév22, Mil67, MS86, GM83]. For more details, the reader is referred to [Led01, Mas07]. For a start, let us clarify some pieces of notation. If is a pseudo-metric space, then, for any and , we let
[TABLE]
Let us note that, if is a standard Borel space and is a Borel measurable pseudo-metric on , then for any Borel measurable and , the set is -measurable for every probability measure on ; see [Cra02, Theorem 2.12].
From this point on, when talking about subsets of a standard Borel space or functions on such a space, we will say measurable for Borel measurable and use -measurable if we mean measurability with respect to a measure .
Definition 2.1**.**
Let be a metric measure space, that is, is a standard Borel space, is a measurable pseudo-metric on , and is a probability measure on . The mapping defined by
[TABLE]
is called the concentration function of . A net of metric measure spaces is said to be a Lévy net if, for every family of measurable sets (),
[TABLE]
Let us recollect some basic facts about concentration. Given two measurable spaces and as well as a measure on , the push-forward measure of along a measurable map will be denoted by , that is, is the measure on defined by for every measurable subset .
Remark 2.2**.**
The following hold.
For every metric measure space , the map is monotonically decreasing. 2.
Let and be metric measure spaces. If there exists a measurable -Lipschitz map with , then
[TABLE]
(see [Pes06, Lemma 2.2.5]). 3.
A net of metric measure spaces is a Lévy net if and only if
[TABLE]
for every (see [Pes06, Remark 1.3.3]).
In this work, we deduce concrete estimates for concentration functions of a large family of metric measure spaces by bounding the measure-theoretic entropy of their -Lipschitz functions. Fundamental to this approach is the following elementary observation, where we let for a probability space and a -integrable function .
Proposition 2.3** ([Led01], Proposition 1.7).**
Let be a metric measure space and consider any function . Suppose that, for every bounded measurable -Lipschitz function and every ,
[TABLE]
Then for all .
The concentration results to be proved in Section 3 will be shown to have interesting applications in topological dynamics (see Section 7). As this will require us to connect concentration of measure with the study of general topological groups, we conclude this section by briefly recollecting and commenting on the concept of measure concentration in uniform spaces, as introduced by Pestov [Pes02, Definition 2.6]. To clarify some terminology, let be a uniform space, in the usual sense of Bourbaki [Bou66, Chapter II]. An entourage of will be called open if constitutes an open subset of with respect to the product topology generated from the topology induced by the uniformity of (see [Bou66, Chapter II, §1.2] for details). It is easy to see that, for any open entourage of and any subset ,
[TABLE]
is an open (in particular, Borel measurable) subset of . Moreover, let us recall that the collection of all open entourages of forms a fundamental system of entourages of , that is, a filter base of the uniformity of ([Bou66, Chapter II, §1.2, Corollary 2]).
Definition 2.4** ([Pes02], Definition 2.6).**
Let be a uniform space. A net of Borel probability measures on is said to concentrate in (or called a Lévy net in ) if, for every family of Borel subsets of and any open entourage of ,
[TABLE]
Remark 2.5** ([GM83], 2.1; [Pes02], Lemma 2.7).**
Let be a Lévy net of metric measure spaces, let be a uniform space, and let for each . If the family is uniformly equicontinuous, that is, for every entourage of there exists such that
[TABLE]
then the net concentrates in .
2.2. The entropy method and the Herbst argument
The idea of applying information-theoretic arguments to derive concentration inequalities has its origin in the pioneering work of Marton [Mar86, Mar96] and Ledoux [Led95, Led96]. The presentation here will focus on the so-called Herbst argument developed by Ledoux building on an idea of Herbst. For a comprehensive introduction to this method, the reader is referred to [Mas07, Section 1.2.3]. We start off with a definition.
Definition 2.6** ([Mas07], Definition 2.11; or [Led01], page 91).**
Let be a probability space and let be -integrable. The entropy of with respect to is defined as
[TABLE]
For an arbitrary probability space and a -integrable function with , the quantity coincides, up to a normalizing constant, with the Kullback–Leibler divergence or relative entropy of the probability measure with respect to , where for every measurable subset . For more details on relative entropy, we refer to [MT10, Section IX].
We recall the following dual characterization of entropy, where .
Proposition 2.7** ([Mas07], Proposition 2.12; or [Led01], page 98).**
Let be a probability space and let be -integrable. Then
[TABLE]
We note a slight variation of Proposition 2.7.
Corollary 2.8**.**
Let be a probability space and let be -integrable. Then
[TABLE]
Proof.
Clearly, if , then and for -almost every , so that the desired equality holds trivially. Therefore, we may and will assume that . Moreover, thanks to Proposition 2.7, it suffices to verify that
[TABLE]
For this, let . Put for the measurable set . Choose any with and then such that . Consider the measurable function defined by
[TABLE]
for all . We observe that
[TABLE]
and
[TABLE]
This proves (2) and hence completes the argument. ∎
When estimating entropy in Section 3, we will moreover make use of the following.
Lemma 2.9** ([Led01], Corollary 5.8).**
Let be a probability space and be -integrable. Then
[TABLE]
Proof.
Applying Jensen’s inequality and Fubini’s theorem, we see that
[TABLE]
Furthermore, a straightforward application of the mean value theorem shows that, if and , then , thus
[TABLE]
Combining this inequality with Fubini’s theorem, we conclude that
[TABLE]
Our interest in entropy is due to the following fact, known as the Herbst argument.
Proposition 2.10** (Herbst argument, [Mas07], Proposition 2.14).**
Let be a probability space, let be -integrable, and let . Suppose that, for each ,
[TABLE]
Then, for each ,
[TABLE]
The Herbst argument provides a technique for proving concentration of measure, via combining it with Proposition 2.3 and the following well-known fact.
Proposition 2.11**.**
Let be a probability space, let be -integrable, and let . Suppose that for each
[TABLE]
Then, for each ,
[TABLE]
Proof.
Let . By Markov’s inequality, our hypothesis implies that
[TABLE]
for every . Choosing , we conclude that
[TABLE]
3. Covering concentration
In this section, we prove concentration of measure for a new class of metric measure spaces, namely for products of probability spaces equipped with a pseudo-metric naturally arising from any weighted covering of the underlying index set (Theorem 3.11 and Corollary 3.12). In addition to the tools outlined in Section 2.2, the main technical ingredient is given by Lemma 3.8 below. Our concentration inequalities will be formulated in terms of Kelley’s covering number [Kel59] – a concept we recall in Definition 3.3. For convenience in later considerations, we choose an abstract approach via Boolean algebras. The more concrete situation for covers of sets will be clarified in Definition 3.6 and Remark 3.7. For a start, we set up some notation concerning finite partitions of unity in Boolean algebras.
Definition 3.1**.**
Let be a Boolean algebra. A finite partition of unity in is a finite subset such that
- —
, and 2. —
for any two distinct .
Denote by the set of all finite partitions of unity in . For any ,
[TABLE]
Moreover, for any finite subset , let
[TABLE]
Remark 3.2**.**
Let be a Boolean algebra. If is a finite subset of , then is a finite partition of unity in .
We proceed to the definition of Kelley’s covering number [Kel59].
Definition 3.3**.**
Let be a Boolean algebra. Let and . We define and call
[TABLE]
the covering multiplicity of in . Let . Then is said to be
- —
a -cover in if , 2. —
a cover in if a -cover in , and 3. —
uniform (in ) if for every .
The covering number of a subset is defined to be
[TABLE]
The definition above is stable under partition refinement in the following sense.
Remark 3.4**.**
Let be a Boolean algebra. Let and . Consider any with . Then
[TABLE]
Moreover, is uniform in if and only if for each .
Furthermore, let us point out the following simple, but useful observation about uniform refinements of covers.
Lemma 3.5**.**
Let be a Boolean algebra. Let and let be a cover in . Then there exists a uniform -cover in such that for each .
Proof.
Let and let us denote by the set of all -element subsets of . Consider . Since is a -cover in , there exists a map such that
[TABLE]
For each , let . Clearly, and whenever . Since is a partition of unity in , the definition of moreover entails that
[TABLE]
for each . According to Remark 3.4, as , this implies that is a uniform -cover in . ∎
We are going to clarify the concepts introduced above in the concrete setting of set covers. Given a set , let us denote by the power set of , which constitutes a Boolean algebra with respect to the usual set-theoretic operations.
Definition 3.6**.**
Let be a set, . A sequence is called
- —
a -cover of if is a -cover in , 2. —
a cover of if is a cover in , and 3. —
uniform (over ) if is uniform in .
Of course, a finite sequence of subsets of a set constitutes a cover of in the sense of Definition 3.6 if and only if its union coincides with . Let us mention some additional elementary observations.
Remarks 3.7**.**
(1) Let be a set and let with . Then
[TABLE]
Furthermore, the sequence is uniform over if and only if, for every ,
[TABLE]
(2) Let be a Boolean algebra. Let and let . Consider any with . Then is a (uniform) -cover in if and only if the sequence is a (uniform) -cover of the set .
Let us now proceed to an analogue of Shearer’s lemma [CGFS86, p. 33, item (22)] for differential entropy due to Madiman–Tetali [MT10, Corollary VIII], which simultaneously generalizes earlier work of Han [Han78]. This result (Lemma 3.8 below) was proved by Madiman–Tetali extending an argument by Massart [Mas00, Section 2.1.1] proving Han’s inequality for differential entropy. For the sake of convenience, we will include another proof of Lemma 3.8, which is based on Ledoux’s proof of Han’s inequality for differential entropy [Led01, Proposition 5.6].
To clarify some notation, let be a finite set and let be a family of measurable spaces. If and for disjoint subsets , then we will write for the unique element of that projects to and . Furthermore, if is a measurable function, then, for any subset and , the map
[TABLE]
is measurable, too. (Note that can be recovered from , so there is no ambiguity about the domain of .) Now, for each , let be a probability measure on . Set . Given a subset , we consider the probability measure
[TABLE]
on the measurable space . We set
[TABLE]
With this notation, Fubini’s theorem states that, for every -integrable function and every , the map is -integrable for -almost every , and
[TABLE]
By a standard Borel probability space, we mean a pair consisting of a standard Borel space and a probability measure on .
Lemma 3.8** (Madiman–Tetali [MT10], Corollary VIII).**
Let be a finite non-empty set. Let and suppose that is a uniform -cover of . Consider any family of standard Borel probability spaces and let . Then, for every bounded measurable function ,
[TABLE]
Proof.
We include a proof for the sake of convenience. Without loss of generality, we may assume that for some . We abbreviate , and for any . We use Corollary 2.8. To this end, let be measurable such that . Since takes only positive values, for all and . Furthermore, invoking Fubini’s theorem, we find some measurable subset with such that for all and . For each , consider the measurable map given by
[TABLE]
for all and for all . Note that, by Fubini’s theorem, for each and -almost every ,
[TABLE]
Given any non-empty subset , define the measurable function
[TABLE]
Note that does not depend on the -th coordinates with . We claim that, for every non-empty and -almost every ,
[TABLE]
The proof of (4) proceeds by induction. For a start, let with , that is, for some . Then, for -almost every ,
[TABLE]
For the inductive step, let with and suppose that (4) holds for every non-empty proper subset of . Denote by the smallest element of and let . Then there exists a measurable subset with such that, for every ,
[TABLE]
Thanks to the Measurable Projection Theorem, see [Cra02, Theorem 2.12], the set is a -measurable subset of . For each , there exists some with , so that Fubini’s theorem yields that
[TABLE]
where the third equality follows from not depending on the -th coordinate. Since , this completes our induction and therefore proves (4).
Thanks to Proposition 2.7, our assertion (4) implies that, for every non-empty and -almost every ,
[TABLE]
Furthermore, for each ,
[TABLE]
Since is a uniform -cover of , this entails that
[TABLE]
for every , that is, -almost everywhere. Combining this with Fubini’s theorem and (6), we conclude that
[TABLE]
By Proposition 2.7, the conclusion follows. ∎
Corollary 3.9**.**
Let be a finite non-empty set. Let and suppose that is a uniform -cover of . Consider any family of standard Borel probability spaces and let . Then, for every bounded measurable function ,
[TABLE]
Proof.
This is an immediate consequence of Lemma 3.8 and Lemma 2.9. ∎
Next up, we introduce a pseudo-metric on the product of a family of sets naturally associated with any weighted covering of the underlying index set.
Definition 3.10**.**
Let be a finite non-empty set. Let and suppose that is a cover of . Moreover, let be a sequence of non-negative reals. For a family of sets , we define the pseudo-metric
[TABLE]
by setting
[TABLE]
for all .
Now everything is prepared to state and prove our first main result.
Theorem 3.11**.**
Let be a finite non-empty set. Let and suppose that is a -cover of . Let be a sequence of non-negative reals. Consider any family of standard Borel probability spaces and set . Let be measurable and -Lipschitz with respect to . Then, for every ,
[TABLE]
Proof.
Of course, the desired statement holds trivially if . Therefore, we may and will assume that . Due to Lemma 3.5, there exists a uniform -cover of such that for each . Since is -Lipschitz with respect to ,
[TABLE]
whenever , and . As the pseudo-metric is bounded, being -Lipschitz with respect to moreover implies that is bounded. By Corollary 3.9 and Fubini’s theorem, it follows that, for every ,
[TABLE]
Using Proposition 2.10 and Proposition 2.11 with gives the conclusion. ∎
Corollary 3.12**.**
Let be a finite non-empty set. Let and suppose that is a -cover of . Let be a sequence of non-negative reals. Consider any family of standard Borel probability spaces . Let and . Then, for every ,
[TABLE]
Proof.
This is an immediate consequence of Theorem 3.11 and Proposition 2.3. ∎
4. A classification of submeasures
Our objective in this section is to give a quantitative classification of diffuse submeasures in terms of the asymptotics of weighted covering ratios (as detailed in Definition 4.6 and Theorem 4.7). We start with recalling the notion of submeasure and various standard definitions concerning this concept.
Definition 4.1**.**
Let be a Boolean algebra. A function is called a submeasure if
- —
, 2. —
is monotone, that is, for all with , and 3. —
is subadditive, that is, for all .
Let be a submeasure. Then is called a measure if for any two with . The submeasure is called pathological if there does not exist a non-zero measure with . Furthermore, is said to be diffuse if, for every , there exists a finite subset such that and for each .
Our classification of diffuse submeasures will be formulated in terms of the asymptotic behavior of a certain function associated with any such submeasure. The definition of the function relies on the notion of covering number (Definition 3.3).
Definition 4.2**.**
Let be a Boolean algebra and let be a diffuse submeasure. For , let
[TABLE]
Define by
[TABLE]
Clearly, for any diffuse submeasure , the function is well defined, that is, only takes values in . In the definition of , the covering number measures how thickly covers the unit of the Boolean algebra . This quantity is then divided by a normalizing factor to compensate for the fact that the elements of become smaller as approaches [math]. (For an application in a different context of the covering number of the family , see [Hru17].)
By Lemma 3.5, we have the following reformulation in terms of uniform covers.
Corollary 4.3**.**
Let be a Boolean algebra and let be a diffuse submeasure. Then, for every ,
[TABLE]
Furthermore, an application of the Hahn–Banach extension theorem yields the subsequent description, where . For the proof of Proposition 4.4 and for the statement of Theorem 4.8, we fix one more piece of notation: given two sets , let denote the corresponding indicator function defined by for all and for all .
Proposition 4.4**.**
Let be a Boolean algebra and let be a diffuse submeasure. For every ,
[TABLE]
Proof.
Let be fixed.
() Consider any measure with . If for some , then
[TABLE]
and thus . Therefore, as desired.
() Appealing to Stone’s representation theorem for Boolean algebras [Sto36], we may and will assume that is a Boolean subalgebra of for some set . Consider the seminorm defined by
[TABLE]
for every . Since is dense in , it follows that
[TABLE]
Concerning the linear functional , we note that
[TABLE]
for all . Therefore, the Hahn–Banach extension theorem asserts the existence of a linear functional such that and for every . Let us define
[TABLE]
and observe that and , and moreover for any two disjoint . Straightforward calculations now show that
[TABLE]
constitutes a measure (we refer to [RR83, Theorem 2.2.1(4)] for the details). Furthermore, since for any , it follows that
[TABLE]
for every . Therefore, if , then , hence . Finally, let us observe that , which means that . This completes the proof. ∎
The asymptotic behavior of as will be fundamental to our considerations. As it turns out, this behavior is quite rigid, as partly indicated by the following immediate consequence of points (i), (ii), and (iii) of Theorem 4.7, which is proved later.
Corollary 4.5**.**
Let be a diffuse submeasure. Then the limit , possibly infinite, exists.
Informed by the corollary above, in Definition 4.6, we divide the class of diffuse submeasures according to their asymptotic behavior at [math]. Our choice of this division is further justified by its interactions with concentration of measure (see Theorem 5.6 Example 5.7) and dynamics of -groups (see Corollary 7.6, and Proposition 7.7). We recall Landau’s big notation: for two functions ,
[TABLE]
Definition 4.6**.**
A diffuse submeasure is called
- —
elliptic if as , 2. —
hyperbolic if as , 3. —
parabolic if is neither elliptic, nor hyperbolic.
Evidently, the three notions defined above are mutually exclusive. We note that a diffuse submeasure is elliptic if and only if
[TABLE]
Clearly, the latter implies the former. Conversely, for all , so that
[TABLE]
The subsequent theorem is the main result of this section. It gives initial justification to the importance of the function introduced in Definition 4.6.
Theorem 4.7**.**
Let be a diffuse submeasure.
- (i)
* is hyperbolic if and only if it is pathological, in which case .* 2. (ii)
If is parabolic, then exists and is finite. 3. (iii)
If is elliptic, then . 4. (iv)
If is a measure, then , where .
Note that the obvious estimate and (ii) and (iii) of Theorem 4.7 imply that is hyperbolic precisely when is unbounded. Also, it follows immediately from points (i), (ii), and (iv) that every non-zero diffuse measure is a parabolic submeasure. Of course, a zero measure is hyperbolic. The converses to (ii) and (iii) do not hold. A family of elliptic submeasures, the existence of which witnesses that the implication in (ii) cannot be reversed, is constructed in Example 5.7. For an example of a parabolic submeasure with , illustrating the failure of the converse to (iii), see Example 4.11.
We remark here that (i) in Theorem 4.7 is essentially a reformulation of the following characterization of pathological submeasures due to Christensen [Chr78].
Theorem 4.8** ([Chr78], Theorem 5).**
Let be a set and be a Boolean subalgebra of . If is a pathological submeasure, then for every there exist , and such that and .
Christensen’s Theorem 4.8 immediately entails the following corollary, which constitutes the essential ingredient in the proof of (i) in Theorem 4.7.
Corollary 4.9**.**
Let be a Boolean algebra. If is a pathological submeasure, then for every there exist and such that .
Proof.
Again, thanks to Stone’s representation theorem for Boolean algebras [Sto36], we may and will assume that is a Boolean subalgebra of for some set . Consider any pathological submeasure and let . Since is dense in , Christensen’s Theorem 4.8 entails the existence of as well as such that and . Let us consider the sequence defined by setting
[TABLE]
for any and . Then
[TABLE]
hence as desired. ∎
The proof of (ii) in Theorem 4.7 relies on the following general convergence result.
Lemma 4.10**.**
Let . If and, for all ,
[TABLE]
then exists and is finite.
Proof.
Let . For a start, we prove that
[TABLE]
Let . We prove the inequality by induction over . Clearly, if , then the desired statement holds trivially. Furthermore, if for some , then
[TABLE]
that is, . This completes our induction and therefore proves (7).
Let . Clearly, . We prove that as . Of course, this holds trivially if . So, assume that . Fix . It will suffice to show that
[TABLE]
By definition of , there exists such that and . Let , so that for some . Note that . It follows that
[TABLE]
This proves (8) and thus completes our proof. ∎
Proof of Theorem 4.7.
Let be a diffuse submeasure on a Boolean algebra .
(i) For a start, let us note that for every . Now, if is pathological, then Corollary 4.9 yields that
[TABLE]
for all , which therefore entails that as . The latter condition clearly implies that is hyperbolic. Furthermore, if is hyperbolic, then must be unbounded. It only remains to argue that, if is unbounded, then will be pathological. To this end, let us assume that is non-pathological, that is, there exists a measure with . Then Proposition 4.4 entails that for all . In particular, is bounded. This proves (i).
(ii) Suppose that is parabolic. Since is not hyperbolic, is bounded by (i). Consider the function
[TABLE]
We prove that, for all ,
[TABLE]
For this purpose, fix . Due to Lemma 3.5, there exist , some uniform -cover in , as well as some uniform -cover in such that
[TABLE]
Put and consider
[TABLE]
Furthermore, let us define a sequence by setting, for each pair ,
[TABLE]
As is a submeasure, belongs to . Since is a uniform -cover in and is a uniform -cover in , it follows that, for each ,
[TABLE]
By Remark 3.4, as , this shows that . Thus, appealing to (10), we conclude that
[TABLE]
This proves (9). Since the function is bounded, assertion (9) and Lemma 4.10 together imply the desired conclusion.
(iii) is obvious.
(iv) Of course, if , then is pathological, thus hyperbolic by (i), and therefore
[TABLE]
Suppose now that is a non-zero measure. In particular, is non-pathological. This implies, by (ii) and (iii), the existence of the limit . We will prove that . By Proposition 4.4, we have for every . Hence, . To prove the reverse inequality, we will show that
[TABLE]
To this end, let and . Since is diffuse, admits a finite partition of the unity, , such that for every . Note that, if and , then
[TABLE]
for any . Using this observation, one can select a sequence of pairwise disjoint subsets such that and for each . Consider the sequence given by for each . As for all ,
[TABLE]
This proves (11). From (11), we now infer that
[TABLE]
for every . Thus, as desired. ∎
Below, we describe an example of a diffuse submeasure that shows that the converse to the implication in (iii) of Theorem 4.7 fails to hold. It is a parabolic submeasure that is far from being a measure.
Example 4.11**.**
There exists a diffuse submeasure such that
- (i)
is parabolic, and 2. (ii)
.
The submeasure will be defined on the Boolean algebra of all clopen subsets of the topological product space for an appropriate choice of positive integers . To guarantee that is not elliptic, as implied by point (i), we need to make sure that
[TABLE]
which will follow if we find a sequence of partitions of into clopen sets and a sequence of positive real numbers such that
[TABLE]
Note that the above condition implies that and, in turn, that will be diffuse. To furthermore guarantee point (ii) and, in turn, prove the remaining part of point (i), by Proposition 4.4 and the convergence established in Theorem 4.7, it will suffice to find a sequence of measures on such that, for the sequence as above,
[TABLE]
We take a sequence of natural numbers such that, for each ,
[TABLE]
So, for example, letting for each will work. We set
[TABLE]
in the above definition of . We also set
[TABLE]
For and , let
[TABLE]
Furthermore, consider the set of finite sequences
[TABLE]
We define by setting
[TABLE]
for every . Clearly, is a submeasure and . We have the following claim that asserts that the infimum in (15) is attained.
Claim. Let . There exists such that
[TABLE]
Proof of Claim. Since is clopen, there exists a natural number such that, for , if for all , then if and only if . Fix such an for the remainder of the proof of the claim.
If , it suffices to take and . So, let us assume . It will suffice to show that, for every sequence , if
[TABLE]
then
[TABLE]
Assume, towards a contradiction, that there is a sequence for which the above implication fails. By the choice of , we can find such that
[TABLE]
where . Note that there is such that
[TABLE]
Otherwise, we can produce such that
[TABLE]
which, by (17), implies that and , leading to a contradiction with (16). So, fix such that (18) holds. Then, by (14), we have
[TABLE]
contradicting (16). The claim follows.
We claim that satisfies conditions (12) and (13), and therefore (i) and (ii). To see (12), for each , note that
[TABLE]
is a finite partition of into elements of and that for all , and moreover
[TABLE]
To see (13), for each , we consider the product measure
[TABLE]
where for , is the measure on assigning weight to each singleton for , while is the measure on assigning weight to each singleton for . So, for , is a probability measure, while the total mass of is equal to
[TABLE]
It follows that
[TABLE]
so .
It only remains to see that, for each and each , if , then ; we will actually show that
[TABLE]
To this end, fix , which will remain fixed for the remainder of the example. First, we point out that since is a measure, it follows from (19) that, for all and ,
[TABLE]
Now, let us call a sequence tight if
[TABLE]
We claim that, for every tight sequence ,
[TABLE]
We prove (22) by induction on , with the usual convention for : the sequence is empty, it is tight, and the implication (22) holds since . So, fix and assume that (22) holds for ; we prove it for . Let be a tight sequence. Set
[TABLE]
Suppose that . We observe that is tight since otherwise, and , so
[TABLE]
a contradiction. Thus, by inductive assumption, it follows that
[TABLE]
Note that since
[TABLE]
we have . Using and (14), we see that
[TABLE]
Thus, continuing with (23) and using (21), we get
[TABLE]
The inductive argument for (22) is completed.
Now, we prove (20). Fix any with . By our Claim above, there exists a sequence such that and . It is clear that this sequence is tight. Therefore, by (22), we have
[TABLE]
as required.
5. Lévy nets from submeasures
In this section, we combine the quantitative classification from Section 4 with the results of Section 3 to exhibit new examples of Lévy nets: we prove that any non-elliptic submeasure gives rise to a Lévy net (Theorem 5.6). For this purpose, let us introduce the following family of pseudo-metrics, the definition of which may be compared with Definition 3.10
Definition 5.1**.**
Let be a Boolean algebra and let be a submeasure. For and a set , we define a pseudo-metric
[TABLE]
by setting
[TABLE]
Given a standard Borel probability space , we let
[TABLE]
Let denote the Lebesgue measure on the standard Borel space .
Remark 5.2**.**
Let be a Boolean algebra. Consider a submeasure and let . If and are two standard Borel probability spaces and is a measurable map with , then
[TABLE]
is a -Lipschitz map and \widehat{\pi}_{\ast}\bigl{(}\mu_{0}^{\otimes\mathcal{B}}\bigr{)}=\mu_{1}^{\otimes\mathcal{B}}, thus Remark 2.2(2) asserts that
[TABLE]
In particular, since for every standard Borel probability space there exists a measurable map with (for instance, see [Shi16, Lemma 4.2]), this entails that
[TABLE]
Definition 5.3**.**
Let be a Boolean algebra. We say that a submeasure has covering concentration if, for every , there exists such that
[TABLE]
Remark 5.4**.**
Let be a Boolean algebra. It follows from Remark 2.2(1) that a submeasure has covering concentration if and only if there exists a sequence such that, for every ,
[TABLE]
For clarification, let us point out the following.
Lemma 5.5**.**
Every submeasure having covering concentration is diffuse.
Proof.
Let be a Boolean algebra. Suppose that is a submeasure with covering concentration. Let . By assumption, there exists with . We claim that for each . To see this, let . Note that for the measurable subset
[TABLE]
Now, if , then , which implies that , so , contradicting our choice of . Hence, as desired. ∎
By force of Corollary 3.12, we arrive at our third main result.
Theorem 5.6**.**
Every hyperbolic or parabolic submeasure has covering concentration.
Proof.
Let be a Boolean algebra and consider any non-elliptic diffuse submeasure . Let . Fix any with . By our assumption, there exists some such that
[TABLE]
Now, we find and a sequence such that
[TABLE]
Let with . By Remark 3.7(2), the sequence , defined by
[TABLE]
for all , constitutes a -cover of the set . Furthermore, note that, by subadditivity of the submeasure , we have on . (For the definition of the latter pseudo-metric, see Definition 3.10, page 3.10.) Consequently, combined with (25) and (24), Corollary 3.12 asserts that
[TABLE]
We conclude this section by exhibiting a family of elliptic submeasures without covering concentration: in fact, we construct a diffuse submeasure that does not have concentration and is such that does not converge to [math] fast, as . The example involves an application of the Berry–Esseen theorem [Ber41, Ess42] (see also [Fel71, Chapter XVI.5]). A precise statement is given below.
Example 5.7**.**
Fix any function such that . There exists a diffuse submeasure such that
- (i)
does not have covering concentration, and 2. (ii)
.
We split our description of the example and the arguments associated with them into several parts.
A general claim. Assume we are given positive integers . Define
[TABLE]
For each , we define an extension recursively as follows: let
[TABLE]
and if and is defined for all with , then, for with , put
[TABLE]
Let
[TABLE]
Assume, additionally, we are given positive real numbers . For each , define another extension recursively as follows: we let
[TABLE]
and if and is defined for all with , then, for with , put
[TABLE]
Let
[TABLE]
Finally, define a binary relation as follows. For , we write precisely if there exists a subset such that
[TABLE]
The relation is symmetric and reflexive.
We point out that the two operations and , the sets , , and the relation defined above depend on the sequences and . We do not reflect this dependence in our notation as we do not want to burden the symbols with subscripts. However, the reader should keep this dependence in mind.
Claim 5.8**.**
. 2.
.
Proof of Claim 5.8. To see (i), consider the bijection
[TABLE]
where, for each , . Now (i) is an immediate consequence (with ) of the implication
[TABLE]
which holds for all and is proved by induction on .
The inclusion in point (ii) is proved by induction on , that is, on the length of the sequence .
Assume first that . In this case, we can identify with . We have
[TABLE]
and
[TABLE]
On the other hand, if , then there is such that
[TABLE]
and (ii) for follows immediately.
We show now the inductive step: given sequence and with , we consider the sequences and and, assuming the inclusion in point (ii) holds for them, we prove the inclusion for and . Define
[TABLE]
Let the operations , , the sets , , and the relation be defined in the manner analogous to , , , , and , but for the sequences and instead of and . By induction, we assume that
[TABLE]
For and , let be defined by
[TABLE]
We note two essentially tautologous equations, justification of which we leave to the reader:
[TABLE]
The following three implications hold for all :
[TABLE]
Implication (36) follows from the definitions of and and from the first equation of (35). Similarly, implication (37) follows from the definitions of and and from the second equation of (35). To get (38), observe that if witnesses that , then, for , if the one-element sequence whose only entry is is not in , then the set
[TABLE]
witnesses that ; therefore, (38) follows since the set satisfies the first clause of (33) (for ).
Now we aim to prove assuming that and . By (36) and (38),
[TABLE]
Applying our inductive assumption (34) to this inequality, we get
[TABLE]
which yields by (37), as required. Therefore, the claim is proved.
A consequence of the Berry–Esseen theorem. As a result of the Berry–Esseen theorem, there exists an increasing function with the following property: for all with and , for every , and for every finite sequence of independent random variables such that
[TABLE]
we have
[TABLE]
It follows from (39) that, if and , then
[TABLE]
where . Indeed, assuming that and substituting
[TABLE]
in (39), we obtain
[TABLE]
A quick calculation shows that the condition
[TABLE]
is equivalent to
[TABLE]
which, in turn, is equivalent to the condition
[TABLE]
Putting the above equivalences together with (41), we arrive at (40).
Defining a submeasure. For any sequence of positive integers and any sequence of positive reals , we define the submeasure
[TABLE]
by setting
[TABLE]
where for any with .
Choosing the parameters. To determine the submeasure we only need to specify the two sequences and . We pick and in agreement with the following four conditions:
[TABLE]
and there exists a sequence of positive reals such that
[TABLE]
Note that the equation in (45) determines from . So, given , we can define the whole sequence ; the only issue in question is whether for all .
The sequences and are constructed as follows. The constant was defined above. Let . Since , for each , we find a positive real so that
[TABLE]
with the usual convention that the product equals if . Then, using (46) and the fact that for all , we find a positive integer so that
[TABLE]
Let us check that the chosen sequences and meet the four conditions stated above. Evidently, (42) is satisfied due to the first assertion of (46). Also, the first inequality in (47) gives (43). To get (44), note that the first inequality in (44) is obvious since . To see the second inequality of (44), observe that, since , (46) implies
[TABLE]
This inequality, when applied to the second inequality in (47), gives
[TABLE]
which immediately yields the remainder of (44). The second inequality in (47), together with (46), guarantees that, for each , the series
[TABLE]
converges, and that , again with the usual convention that the product is equal to if . It is clear that for each . It is also easy to check that the sequence satisfies the equation in (45).
Let and be sequences as above. Consider the Boolean algebra of all clopen subsets of topological product space , and note that the submeasure
[TABLE]
is diffuse due to (42). Additionally, for each , let
[TABLE]
and consider the partition
[TABLE]
Checking (i), that is, lack of covering concentration. Denote by the normalized counting measure on . We will prove that, for each ,
[TABLE]
By Remark 5.2 and being cofinal in , this will imply that does not have covering concentration. Inequality (49) will be witnessed by the sets and defined below. The idea for the definitions of these two sets comes from [FS08, Theorem 4.2].
To prove (49), let . Let and be as in (26) for chosen as above. For chosen as in (48), set
[TABLE]
and define the operations
[TABLE]
as in (27), (28), (30), and (31) for the sequences and described above. Furthermore, let , and be as in (29), (32), and (33). Recall that, by Claim 5.8(i),
[TABLE]
Let and consider the bijection . We will prove that
[TABLE]
where
[TABLE]
We will also prove that
[TABLE]
Formula (51) together with (52) and (50) will show (49).
We start with showing (51). Recall first that, by Claim 5.8(ii),
[TABLE]
We claim that
[TABLE]
To see this, let be such that
[TABLE]
Set
[TABLE]
and note that (55) implies that there exists such that
[TABLE]
and
[TABLE]
Now, (56) implies that
[TABLE]
The second clause of (58) gives such that
[TABLE]
Since, by (44), , the above inequality contradicts (57). Thus, the first clause of (58) holds. In particular, we have that since . Furthermore, together with from (44) would also contradict (57). Thus, .
To sum up, we have such that
[TABLE]
and for which (57) holds. Now note that if , then, by (57), for each with , we have
[TABLE]
which implies that
[TABLE]
Thus, witnesses that . This proves (54). Clearly, from (54) together with (53), the inclusion (51) follows immediately.
Now we prove (52). To this end, choose any family of independent random variables defined on a common domain such that, for each , we have
[TABLE]
We define a family of random variables on the same domain recursively as follows. For each , let . Furthermore, if and is defined for all with , then, for each with , we define
[TABLE]
for all . Define also, for , the set
[TABLE]
We leave it to the reader to verify by induction on that, for each ,
[TABLE]
Since , the equation above gives
[TABLE]
Therefore, to prove (52), it remains to show that . In fact, we will prove that
[TABLE]
which will suffice by (45). To this end, let us note that, for every , there are real numbers with and such that, for all ,
[TABLE]
Evidently, . Furthermore, for each , is a family of independent random variables. Observe now that, by (45), the sequence is decreasing from , so that in particular
[TABLE]
Using (40), (45), (48) and (60), we see by induction on that
[TABLE]
Now, (61) and (60) together imply that
[TABLE]
which gives (59) for , as required.
Checking (ii), that is, the submeasure is elliptic (by (i)), but barely. For every , considering the partition of into the sets with , we conclude that
[TABLE]
From (43) and (42), it follows that
[TABLE]
as required.
6. Dynamical background
The purpose of this section is to provide some background material necessary for the topological applications of our concentration results, which are given in the subsequent Section 7. These applications will concern topological dynamics, that is, the structure of topological groups reflected by their flows. To be more precise, if is a topological group, then a -flow is any non-empty compact Hausdorff space together with a continuous action of on . The study of such objects is intimately linked with properties of certain function spaces naturally associated with the acting group. Some aspects of this correspondence, in particular concerning amenability, extreme amenability, and the connection with measure concentration, will be summarized below. For more details, we refer to [Pes06, Pac13].
Now let be a topological group. Denote by the neighborhood filter of the neutral element in and endow with its right uniformity defined by the basic entourages
[TABLE]
where . In particular, a function is called right-uniformly continuous if for every there exists such that
[TABLE]
The set of all right-uniformly continuous, bounded real-valued functions on , equipped with the pointwise operations and the supremum norm, constitutes a commutative unital real Banach algebra. A subset is called UEB (short for uniformly equicontinuous, bounded) if is -bounded and right-uniformly equicontinuous, that is, for every there is such that
[TABLE]
The set of all UEB subsets of forms a convex vector bornology on . The UEB topology on the dual Banach space is defined as the topology of uniform convergence on the members of . This is a locally convex linear topology on the vector space containing the weak-∗ topology, that is, the initial topology generated by the maps where . More detailed information on the UEB topology is to be found in [Pac13]. Furthermore, let us recall that the set
[TABLE]
of all means on constitutes a compact Hausdorff space with respect to the weak-∗ topology. The set of all (necessarily positive, linear) unital ring homomorphisms from to is a closed subspace of , called the Samuel compactification of . For , let and . Note that admits an affine continuous action on given by
[TABLE]
where , and that constitutes a -invariant subspace of . Let us recall that is amenable (resp., extremely amenable) if (resp., ) admits a -fixed point. It is well known that is amenable (resp., extremely amenable) if and only if every continuous action of on a non-void compact Hausdorff space admits a -invariant regular Borel probability measure (resp., a -fixed point). For a comprehensive account on (extreme) amenability of topological groups, the reader is referred to [Pes06]. Below we recollect two specific results in that direction (Theorem 6.1 and Theorem 6.5), relevant for Section 7.
First, regarding amenability of topological groups, we recall the following result from [ST18], which will be used in the proof of Theorem 7.5. Given a measurable space , let us denote by the set of all probability measures on and by the convex envelope of the set of Dirac measures in .
Theorem 6.1** ([ST18], Theorem 3.2).**
A topological group is amenable if and only if, for every , every and every finite subset , there exists such that, for and ,
[TABLE]
The result above suggests the following definition.
Definition 6.2**.**
Let be a topological group. A net of Borel probability measures on is said to UEB-converge to invariance (over ) if, for all and ,
[TABLE]
For readers primarily interested in metrizable topological groups, we include the subsequent clarifying remark. Let us recall that, by well-known work of Birkhoff [Bir36] and Kakutani [Kak36], a topological group is first-countable if and only if is metrizable, in which case admits a metric both generating the topology of and being right-invariant, in the sense that for all .
Remark 6.3**.**
Let be a metrizable topological group and let be a right-invariant metric on generating the topology of . Consider the set
[TABLE]
Then a net of Borel probability measures on UEB-converges to invariance over if and only if, for every ,
[TABLE]
A proof of this fact is to be found in [Sch19, Corollary 3.6].
Second, let us recall that concentration of measure (Section 2.1) provides a very prominent method for proving extreme amenability of topological groups. This approach goes back to the seminal work of Gromov and Milman [GM83] and has since been used in establishing extreme amenability for many concrete examples of Polish groups (see [Pes06, Chapter 4] for an overview). Below we mention a refined version of this method, as developed in [Pes10, PS17]. As usual, we define the support of a Borel probability measure on a topological space to be
[TABLE]
which is easily seen to constitute a closed subset of . The following notion first appeared in [Pes10], but originates in [GTW05, GW05].
Definition 6.4**.**
A topological group is called whirly amenable if
- —
is amenable, and 2. —
any -invariant regular Borel probability measure on a -flow has support contained in the set of -fixed points.
Of course, whirly amenability implies extreme amenability. Note that the converse does not hold: the Polish group , carrying the topology of pointwise convergence, is extremely amenable [Pes98], but not whirly amenable [GTW05, Remark 1.3].
In order to establish whirly (hence extreme) amenability of topological groups of measurable maps the next section, we will combine the results of Section 5 with the strategy provided by the following theorem, which generalizes earlier results by Pestov [Pes10, Theorem 5.7] and Glasner–Tsirelson–Weiss [GTW05, Theorem 1.1].
Theorem 6.5** ([PS17], Theorem 3.9).**
Let be a topological group. If there exists a net of Borel probability measures on such that
- —
* concentrates in (with respect to the right uniformity),* 2. —
* UEB-converges to invariance over ,*
then is whirly amenable.
For a quantitative generalization of Theorem 6.5 in the context of Gromov’s observable diameters [Gro99, Chapter 3], the reader is referred to [Sch19, Theorem 1.2].
7. Topological groups of measurable maps
This final section is devoted to applications of our results in topological dynamics. More precisely, we establish whirly amenability (thus, extreme amenability) of topological groups of measurable maps over parabolic or hyperbolic submeasures, with coefficients in any amenable topological group. Such groups, introduced for the Lebesgue measure by Hartman–Mycielski [HM58] and later studied for pathological submeasures by Herer–Christensen [HC75], have more recently attracted growing attention in the context of extreme amenability [Gla98, Pes02, FS08, Pes10, Sab12, PS17], representation theory [Sol14], and ample generics [KLM15, KM19].
We choose an abstract approach to topological groups of measurable maps, following Fremlin [Fre06, 493A]. A more concrete description based on Stone’s representation theorem for Boolean algebras [Sto36] will be given in Remark 7.1. Let be a submeasure on a Boolean algebra and let be a topological group. By a finite -partition of unity in we mean a family such that
- —
is finite, 2. —
, and 3. —
for any two distinct .
Consider the topological group consisting of all finite -partitions of unity in , equipped with the multiplication defined by
[TABLE]
for and , and endowed with the topology of convergence in . To be precise about the topology, let
[TABLE]
for any , and . Then a subset is open if and only if
[TABLE]
In turn, a neighborhood basis at the neutral element , determined by and whenever , is given by the family of sets
[TABLE]
where and . For every , a straightforward computation reveals that the map
[TABLE]
is a continuous homomorphism.
Thanks to Stone’s representation theorem [Sto36], every Boolean algebra is isomorphic to a Boolean subalgebra of for some set . In the subsequent remark, we recast the abstract construction above for such concrete algebras of sets.
Remark 7.1**.**
Let be a set and let be a Boolean subalgebra of . Moreover, let be a submeasure and let be a topological group. Consider the topological group
[TABLE]
with the pointwise multiplication, that is, the subgroup structure inherited from , and the topology defined as follows: a subset is open if and only if
[TABLE]
Then the map
[TABLE]
is an isomorphism of topological groups. Furthermore, for every , denoting by the associated projection, we observe that
[TABLE]
for all .
In general—in fact, in most interesting cases—the topological groups resulting from the construction outlined above will not be Hausdorff, let alone Polish. However, starting from a standard probability space and a Polish group, one may equivalently study the topological dynamics of a corresponding Polish group described in the following remark.
Remark 7.2**.**
Let be a standard probability space and let be a Polish group. The topological group consisting of all equivalence classes of -measurable functions from to up to equality -almost everywhere, endowed with the pointwise multiplication (of representatives of equivalence classes) and the usual topology of convergence in measure with respect to , is Polish [Moo76, Proposition 7]. It is not difficult to see that the Hausdorff quotient of , that is, the topological quotient group
[TABLE]
is isomorphic to a dense topological subgroup of . Consequently, from a dynamical perspective, there is no essential difference between the topological groups and : their flows are in natural one-to-one correspondence.
We proceed to studying whirly amenability for groups of measurable maps, which will be the content of Theorem 7.5. Preparing the proof of Theorem 7.5, we need to establish some additional notation. To this end, let be a topological group. If is a set, and , then we define by
[TABLE]
for all and . Furthermore, if is a submeasure on a Boolean algebra , then, for any subset , we let
[TABLE]
The following two lemmata are straightforward adaptations of the corresponding results in [PS17]. We include the proofs for the sake of convenience.
Lemma 7.3** (cf. [PS17], Lemma 4.3).**
If is a submeasure on a Boolean algebra and is a topological group, then, for each ,
[TABLE]
Proof.
Consider any . Of course, is norm-bounded as the set is. In order to prove that is right-uniformly equicontinuous, let . Since , there exists such that for all and with . According to the definition of the topology of , we find and such that . We are going to verify that for all and all with . To this end, let , , and . Then, for any with , we observe that
[TABLE]
and therefore . Hence, . ∎
Lemma 7.4** (cf. [PS17], Lemma 4.4).**
Let be a submeasure on a non-zero Boolean algebra and let be a topological group. If is a net in such that
- —
,
- —
,
then the net \bigl{(}(\gamma_{\mathcal{B}_{i}})_{\ast}\bigl{(}\mu_{i}^{\otimes\mathcal{B}_{i}}\bigr{)}\bigr{)}_{i\in I} UEB-converges to invariance over .
Proof.
For each , let us consider the corresponding push-forward Borel probability measure \nu_{i}\mathrel{\mathop{:}}=(\gamma_{\mathcal{B}_{i}})_{\ast}\bigl{(}\mu_{i}^{\otimes\mathcal{B}_{i}}\bigr{)} on . We will show that UEB-converges to invariance over . For this, let , and . Note that
[TABLE]
and put . According to Lemma 7.3 and our assumptions, there exists such that, for every with , we have and
[TABLE]
We claim that
[TABLE]
To prove this, let with . Since , we find with . Let and pick an enumeration . For each , let us define by
[TABLE]
for each , and let . Furthermore, let us define . For all and , note that and . Combining these observations with (62) and Fubini’s theorem, we conclude that
[TABLE]
for all and . For every , it follows that
[TABLE]
which proves (63) and hence completes the argument. ∎
We arrive at our fourth and final main result.
Theorem 7.5**.**
Let be a submeasure and let be a topological group. If has covering concentration and is amenable, then is whirly amenable.
Proof.
Let be defined on the Boolean algebra . Since the desired conclusion is trivial if , we may and will assume that . According to Theorem 6.1, we find a net in such that
- —
,
- —
.
Suppose that has covering concentration. By Remark 5.4, we find such that, for every ,
[TABLE]
Consider the directed set where and
[TABLE]
For every , define and . For each , let us consider
[TABLE]
By Lemma 7.4, the net UEB-converges to invariance over .
Thanks to Theorem 6.5, it remains to show that concentrates in . For each , we find a finite subset and a probability measure on the discrete measurable space such that equals the push-forward measure of along the map . According to (64), Remark 5.2 and Remark 2.2(3), the net constitutes a Lévy net. Thus, by Remark 2.5, it suffices to verify that the family is uniformly equicontinuous. For this purpose, let and . For all and , we have
[TABLE]
and therefore
[TABLE]
Hence, due to Remark 2.5, the net concentrates in , so that is whirly amenable by Theorem 6.5. ∎
Corollary 7.6**.**
Let be a parabolic or hyperbolic submeasure. If is an amenable topological group, then is whirly amenable.
Proof.
This is an immediate consequence of Theorem 5.6 and Theorem 7.5. ∎
We conclude with a partial converse of Corollary 7.6.
Proposition 7.7**.**
Let be a topological group. If is an elliptic or parabolic submeasure and is amenable, then is amenable.
Proof.
We generalize an argument from [PS17, Theorem 1.1 (2)(1)]. Let be defined on the Boolean algebra . Since is not pathological, we find a non-zero measure such that . Define by
[TABLE]
where and . To check that is well defined, let . Since
[TABLE]
it follows that . In order to show that , let . As , there exists such that
[TABLE]
Consider
[TABLE]
Then constitutes a neighborhood of the neutral element in . Let with . Then for
[TABLE]
Since is a measure, we conclude that
[TABLE]
which, as , readily implies that
[TABLE]
This shows that . Therefore, is well-defined. It is straightforward to check that is linear, positive, and unital. Furthermore, if and , then
[TABLE]
for every , that is, . Assuming that is amenable and considering a left-invariant mean , we deduce from the properties of that is a left-invariant mean, whence is amenable. ∎
The subsequent corollary generalizes the main result of [PS17] from non-zero diffuse measures to arbitrary parabolic submeasures.
Corollary 7.8**.**
Let be a parabolic submeasure and let be a topological group. Then the following are equivalent.
- —
* is amenable.* 2. —
* is amenable.* 3. —
* is whirly amenable.*
Acknowledgment. We thank Paul Larson for several remarks that helped improve the presentation of our arguments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ber 41] Andrew C. Berry, The accuracy of the Gaussian approximation to the sum of independent variates , Trans. Amer. Math. Soc. 49 (1941), pp. 122–136.
- 2[Bir 36] Garret Birkhoff, A note on topological groups , Compositio Math. 3 (1936), pp. 427–430.
- 3[Bou 66] Nicolas Bourbaki, Elements of Mathematics. General Topology. Part 1 , Hermann, Paris; Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont. 1966.
- 4[Chr 78] Jens P. R. Christensen, Some results with relation to the control measure problem , in Vector Space Measures and Applications II , Lecture Notes in Math. 645 , Springer, 1978, pp. 27–34.
- 5[CGFS 86] Fan R. K. Chung, Ronald L. Graham, Peter Frankl and James B. Shearer, Some intersection theorems for ordered sets and graphs , J. Combin. Theory Ser. A 43 (1986), no. 1, pp. 23–37.
- 6[Cra 02] Hans Crauel, Random probability measures on Polish spaces , Stochastics Monographs 11 , Taylor & Francis, London, 2002.
- 7[Ess 42] Carl-Gustav Esseen, On the Liapounoff limit of error in the theory of probability , Ark. Mat. Astr. Fys. 28A (1942), no. 9, 19 pp.
- 8[FS 08] Ilijas Farah and Sławomir Solecki, Extreme amenability of L 0 subscript 𝐿 0 L_{0} , a Ramsey theorem, and Lévy groups , J. Funct. Anal. 255 (2008), no. 2, pp. 471–493.
