You are currently browsing the monthly archive for November 2019.
Asgar Jamneshan and I have just uploaded to the arXiv our paper “An uncountable Moore-Schmidt theorem“. This paper revisits a classical theorem of Moore and Schmidt in measurable cohomology of measure-preserving systems. To state the theorem, let be a probability space, and
be the group of measure-preserving automorphisms of this space, that is to say the invertible bimeasurable maps
that preserve the measure
:
. To avoid some ambiguity later in this post when we introduce abstract analogues of measure theory, we will refer to measurable maps as concrete measurable maps, and measurable spaces as concrete measurable spaces. (One could also call
a concrete probability space, but we will not need to do so here as we will not be working explicitly with abstract probability spaces.)
Let be a discrete group. A (concrete) measure-preserving action of
on
is a group homomorphism
from
to
, thus
is the identity map and
for all
. A large portion of ergodic theory is concerned with the study of such measure-preserving actions, especially in the classical case when
is the integers (with the additive group law).
Let be a compact Hausdorff abelian group, which we can endow with the Borel
-algebra
. A (concrete measurable)
–cocycle is a collection
of concrete measurable maps
obeying the cocycle equation
for -almost every
. (Here we are glossing over a measure-theoretic subtlety that we will return to later in this post – see if you can spot it before then!) Cocycles arise naturally in the theory of group extensions of dynamical systems; in particular (and ignoring the aforementioned subtlety), each cocycle induces a measure-preserving action
on
(which we endow with the product of
with Haar probability measure on
), defined by
This connection with group extensions was the original motivation for our study of measurable cohomology, but is not the focus of the current paper.
A special case of a -valued cocycle is a (concrete measurable)
-valued coboundary, in which
for each
takes the special form
for -almost every
, where
is some measurable function; note that (ignoring the aforementioned subtlety), every function of this form is automatically a concrete measurable
-valued cocycle. One of the first basic questions in measurable cohomology is to try to characterize which
-valued cocycles are in fact
-valued coboundaries. This is a difficult question in general. However, there is a general result of Moore and Schmidt that at least allows one to reduce to the model case when
is the unit circle
, by taking advantage of the Pontryagin dual group
of characters
, that is to say the collection of continuous homomorphisms
to the unit circle. More precisely, we have
Theorem 1 (Countable Moore-Schmidt theorem) Let
be a discrete group acting in a concrete measure-preserving fashion on a probability space
. Let
be a compact Hausdorff abelian group. Assume the following additional hypotheses:
- (i)
is at most countable.
- (ii)
is a standard Borel space.
- (iii)
is metrisable.
Then a
-valued concrete measurable cocycle
is a concrete coboundary if and only if for each character
, the
-valued cocycles
are concrete coboundaries.
The hypotheses (i), (ii), (iii) are saying in some sense that the data are not too “large”; in all three cases they are saying in some sense that the data are only “countably complicated”. For instance, (iii) is equivalent to
being second countable, and (ii) is equivalent to
being modeled by a complete separable metric space. It is because of this restriction that we refer to this result as a “countable” Moore-Schmidt theorem. This theorem is a useful tool in several other applications, such as the Host-Kra structure theorem for ergodic systems; I hope to return to these subsequent applications in a future post.
Let us very briefly sketch the main ideas of the proof of Theorem 1. Ignore for now issues of measurability, and pretend that something that holds almost everywhere in fact holds everywhere. The hard direction is to show that if each is a coboundary, then so is
. By hypothesis, we then have an equation of the form
for all and some functions
, and our task is then to produce a function
for which
for all .
Comparing the two equations, the task would be easy if we could find an for which
for all . However there is an obstruction to this: the left-hand side of (3) is additive in
, so the right-hand side would have to be also in order to obtain such a representation. In other words, for this strategy to work, one would have to first establish the identity
for all . On the other hand, the good news is that if we somehow manage to obtain the equation, then we can obtain a function
obeying (3), thanks to Pontryagin duality, which gives a one-to-one correspondence between
and the homomorphisms of the (discrete) group
to
.
Now, it turns out that one cannot derive the equation (4) directly from the given information (2). However, the left-hand side of (2) is additive in , so the right-hand side must be also. Manipulating this fact, we eventually arrive at
In other words, we don’t get to show that the left-hand side of (4) vanishes, but we do at least get to show that it is -invariant. Now let us assume for sake of argument that the action of
is ergodic, which (ignoring issues about sets of measure zero) basically asserts that the only
-invariant functions are constant. So now we get a weaker version of (4), namely
for some constants .
Now we need to eliminate the constants. This can be done by the following group-theoretic projection. Let denote the space of concrete measurable maps
from
to
, up to almost everywhere equivalence; this is an abelian group where the various terms in (5) naturally live. Inside this group we have the subgroup
of constant functions (up to almost everywhere equivalence); this is where the right-hand side of (5) lives. Because
is a divisible group, there is an application of Zorn’s lemma (a good exercise for those who are not acquainted with these things) to show that there exists a retraction
, that is to say a group homomorphism that is the identity on the subgroup
. We can use this retraction, or more precisely the complement
, to eliminate the constant in (5). Indeed, if we set
then from (5) we see that
while from (2) one has
and now the previous strategy works with replaced by
. This concludes the sketch of proof of Theorem 1.
In making the above argument rigorous, the hypotheses (i)-(iii) are used in several places. For instance, to reduce to the ergodic case one relies on the ergodic decomposition, which requires the hypothesis (ii). Also, most of the above equations only hold outside of a set of measure zero, and the hypothesis (i) and the hypothesis (iii) (which is equivalent to being at most countable) to avoid the problem that an uncountable union of sets of measure zero could have positive measure (or fail to be measurable at all).
My co-author Asgar Jamneshan and I are working on a long-term project to extend many results in ergodic theory (such as the aforementioned Host-Kra structure theorem) to “uncountable” settings in which hypotheses analogous to (i)-(iii) are omitted; thus we wish to consider actions on uncountable groups, on spaces that are not standard Borel, and cocycles taking values in groups that are not metrisable. Such uncountable contexts naturally arise when trying to apply ergodic theory techniques to combinatorial problems (such as the inverse conjecture for the Gowers norms), as one often relies on the ultraproduct construction (or something similar) to generate an ergodic theory translation of these problems, and these constructions usually give “uncountable” objects rather than “countable” ones. (For instance, the ultraproduct of finite groups is a hyperfinite group, which is usually uncountable.). This paper marks the first step in this project by extending the Moore-Schmidt theorem to the uncountable setting.
If one simply drops the hypotheses (i)-(iii) and tries to prove the Moore-Schmidt theorem, several serious difficulties arise. We have already mentioned the loss of the ergodic decomposition and the possibility that one has to control an uncountable union of null sets. But there is in fact a more basic problem when one deletes (iii): the addition operation , while still continuous, can fail to be measurable as a map from
to
! Thus for instance the sum of two measurable functions
need not remain measurable, which makes even the very definition of a measurable cocycle or measurable coboundary problematic (or at least unnatural). This phenomenon is known as the Nedoma pathology. A standard example arises when
is the uncountable torus
, endowed with the product topology. Crucially, the Borel
-algebra
generated by this uncountable product is not the product
of the factor Borel
-algebras (the discrepancy ultimately arises from the fact that topologies permit uncountable unions, but
-algebras do not); relating to this, the product
-algebra
is not the same as the Borel
-algebra
, but is instead a strict sub-algebra. If the group operations on
were measurable, then the diagonal set
would be measurable in . But it is an easy exercise in manipulation of
-algebras to show that if
are any two measurable spaces and
is measurable in
, then the fibres
of
are contained in some countably generated subalgebra of
. Thus if
were
-measurable, then all the points of
would lie in a single countably generated
-algebra. But the cardinality of such an algebra is at most
while the cardinality of
is
, and Cantor’s theorem then gives a contradiction.
To resolve this problem, we give a coarser
-algebra than the Borel
-algebra, namely the Baire
-algebra
, thus coarsening the measurable space structure on
to a new measurable space
. In the case of compact Hausdorff abelian groups,
can be defined as the
-algebra generated by the characters
; for more general compact abelian groups, one can define
as the
-algebra generated by all continuous maps into metric spaces. This
-algebra is equal to
when
is metrisable but can be smaller for other
. With this measurable structure,
becomes a measurable group; it seems that once one leaves the metrisable world that
is a superior (or at least equally good) space to work with than
for analysis, as it avoids the Nedoma pathology. (For instance, from Plancherel’s theorem, we see that if
is the Haar probability measure on
, then
(thus, every
-measurable set is equivalent modulo
-null sets to a
-measurable set), so there is no damage to Plancherel caused by passing to the Baire
-algebra.
Passing to the Baire -algebra
fixes the most severe problems with an uncountable Moore-Schmidt theorem, but one is still faced with an issue of having to potentially take an uncountable union of null sets. To avoid this sort of problem, we pass to the framework of abstract measure theory, in which we remove explicit mention of “points” and can easily delete all null sets at a very early stage of the formalism. In this setup, the category of concrete measurable spaces is replaced with the larger category of abstract measurable spaces, which we formally define as the opposite category of the category of
-algebras (with Boolean algebra homomorphisms). Thus, we define an abstract measurable space to be an object of the form
, where
is an (abstract)
-algebra and
is a formal placeholder symbol that signifies use of the opposite category, and an abstract measurable map
is an object of the form
, where
is a Boolean algebra homomorphism and
is again used as a formal placeholder; we call
the pullback map associated to
. [UPDATE: It turns out that this definition of a measurable map led to technical issues. In a forthcoming revision of the paper we also impose the requirement that the abstract measurable map be
-complete (i.e., it respects countable joins).] The composition
of two abstract measurable maps
,
is defined by the formula
, or equivalently
.
Every concrete measurable space can be identified with an abstract counterpart
, and similarly every concrete measurable map
can be identified with an abstract counterpart
, where
is the pullback map
. Thus the category of concrete measurable spaces can be viewed as a subcategory of the category of abstract measurable spaces. The advantage of working in the abstract setting is that it gives us access to more spaces that could not be directly defined in the concrete setting. Most importantly for us, we have a new abstract space, the opposite measure algebra
of
, defined as
where
is the ideal of null sets in
. Informally,
is the space
with all the null sets removed; there is a canonical abstract embedding map
, which allows one to convert any concrete measurable map
into an abstract one
. One can then define the notion of an abstract action, abstract cocycle, and abstract coboundary by replacing every occurrence of the category of concrete measurable spaces with their abstract counterparts, and replacing
with the opposite measure algebra
; see the paper for details. Our main theorem is then
Theorem 2 (Uncountable Moore-Schmidt theorem) Let
be a discrete group acting abstractly on a
-finite measure space
. Let
be a compact Hausdorff abelian group. Then a
-valued abstract measurable cocycle
is an abstract coboundary if and only if for each character
, the
-valued cocycles
are abstract coboundaries.
With the abstract formalism, the proof of the uncountable Moore-Schmidt theorem is almost identical to the countable one (in fact we were able to make some simplifications, such as avoiding the use of the ergodic decomposition). A key tool is what we call a “conditional Pontryagin duality” theorem, which asserts that if one has an abstract measurable map for each
obeying the identity
for all
, then there is an abstract measurable map
such that
for all
. This is derived from the usual Pontryagin duality and some other tools, most notably the completeness of the
-algebra of
, and the Sikorski extension theorem.
We feel that it is natural to stay within the abstract measure theory formalism whenever dealing with uncountable situations. However, it is still an interesting question as to when one can guarantee that the abstract objects constructed in this formalism are representable by concrete analogues. The basic questions in this regard are:
- (i) Suppose one has an abstract measurable map
into a concrete measurable space. Does there exist a representation of
by a concrete measurable map
? Is it unique up to almost everywhere equivalence?
- (ii) Suppose one has a concrete cocycle that is an abstract coboundary. When can it be represented by a concrete coboundary?
For (i) the answer is somewhat interesting (as I learned after posing this MathOverflow question):
- If
does not separate points, or is not compact metrisable or Polish, there can be counterexamples to uniqueness. If
is not compact or Polish, there can be counterexamples to existence.
- If
is a compact metric space or a Polish space, then one always has existence and uniqueness.
- If
is a compact Hausdorff abelian group, one always has existence.
- If
is a complete measure space, then one always has existence (from a theorem of Maharam).
- If
is the unit interval with the Borel
-algebra and Lebesgue measure, then one has existence for all compact Hausdorff
assuming the continuum hypothesis (from a theorem of von Neumann) but existence can fail under other extensions of ZFC (from a theorem of Shelah, using the method of forcing).
- For more general
, existence for all compact Hausdorff
is equivalent to the existence of a lifting from the
-algebra
to
(or, in the language of abstract measurable spaces, the existence of an abstract retraction from
to
).
- It is a long-standing open question (posed for instance by Fremlin) whether it is relatively consistent with ZFC that existence holds whenever
is compact Hausdorff.
Our understanding of (ii) is much less complete:
- If
is metrisable, the answer is “always” (which among other things establishes the countable Moore-Schmidt theorem as a corollary of the uncountable one).
- If
is at most countable and
is a complete measure space, then the answer is again “always”.
In view of the answers to (i), I would not be surprised if the full answer to (ii) was also sensitive to axioms of set theory. However, such set theoretic issues seem to be almost completely avoided if one sticks with the abstract formalism throughout; they only arise when trying to pass back and forth between the abstract and concrete categories.
In these notes we presume familiarity with the basic concepts of probability theory, such as random variables (which could take values in the reals, vectors, or other measurable spaces), probability, and expectation. Much of this theory is in turn based on measure theory, which we will also presume familiarity with. See for instance this previous set of lecture notes for a brief review.
The basic objects of study in analytic number theory are deterministic; there is nothing inherently random about the set of prime numbers, for instance. Despite this, one can still interpret many of the averages encountered in analytic number theory in probabilistic terms, by introducing random variables into the subject. Consider for instance the form
of the prime number theorem (where we take the limit ). One can interpret this estimate probabilistically as
where is a random variable drawn uniformly from the natural numbers up to
, and
denotes the expectation. (In this set of notes we will use boldface symbols to denote random variables, and non-boldface symbols for deterministic objects.) By itself, such an interpretation is little more than a change of notation. However, the power of this interpretation becomes more apparent when one then imports concepts from probability theory (together with all their attendant intuitions and tools), such as independence, conditioning, stationarity, total variation distance, and entropy. For instance, suppose we want to use the prime number theorem (1) to make a prediction for the sum
After dividing by , this is essentially
With probabilistic intuition, one may expect the random variables to be approximately independent (there is no obvious relationship between the number of prime factors of
, and of
), and so the above average would be expected to be approximately equal to
which by (2) is equal to . Thus we are led to the prediction
The asymptotic (3) is widely believed (it is a special case of the Chowla conjecture, which we will discuss in later notes; while there has been recent progress towards establishing it rigorously, it remains open for now.
How would one try to make these probabilistic intuitions more rigorous? The first thing one needs to do is find a more quantitative measurement of what it means for two random variables to be “approximately” independent. There are several candidates for such measurements, but we will focus in these notes on two particularly convenient measures of approximate independence: the “” measure of independence known as covariance, and the “
” measure of independence known as mutual information (actually we will usually need the more general notion of conditional mutual information that measures conditional independence). The use of
type methods in analytic number theory is well established, though it is usually not described in probabilistic terms, being referred to instead by such names as the “second moment method”, the “large sieve” or the “method of bilinear sums”. The use of
methods (or “entropy methods”) is much more recent, and has been able to control certain types of averages in analytic number theory that were out of reach of previous methods such as
methods. For instance, in later notes we will use entropy methods to establish the logarithmically averaged version
of (3), which is implied by (3) but strictly weaker (much as the prime number theorem (1) implies the bound , but the latter bound is much easier to establish than the former).
As with many other situations in analytic number theory, we can exploit the fact that certain assertions (such as approximate independence) can become significantly easier to prove if one only seeks to establish them on average, rather than uniformly. For instance, given two random variables and
of number-theoretic origin (such as the random variables
and
mentioned previously), it can often be extremely difficult to determine the extent to which
behave “independently” (or “conditionally independently”). However, thanks to second moment tools or entropy based tools, it is often possible to assert results of the following flavour: if
are a large collection of “independent” random variables, and
is a further random variable that is “not too large” in some sense, then
must necessarily be nearly independent (or conditionally independent) to many of the
, even if one cannot pinpoint precisely which of the
the variable
is independent with. In the case of the second moment method, this allows us to compute correlations such as
for “most”
. The entropy method gives bounds that are significantly weaker quantitatively than the second moment method (and in particular, in its current incarnation at least it is only able to say non-trivial assertions involving interactions with residue classes at small primes), but can control significantly more general quantities
for “most”
thanks to tools such as the Pinsker inequality.
Recent Comments