— 1. Introduction —
On my previous post about recurrent theorems I stated Khintchine’s theorem and Sarkozy’s theorem. There I classified Khintchine’s theorem as a theorem about large intersections and Sarkozy’s theorem as a theorem about large recurrent times.
This will be the first in a series of two posts where I will prove the following result, which I would classify as a theorem about large recurrent times for large intersections. Recall that a measure preserving system (shortened to m.p.s.) is a quadruple , where
is a probability space and
preserves the measure, i.e. for each
we have
.
Theorem 1 Let
be a m.p.s. and let
have positive measure. Let
be a polynomial such that
. Then for any
, the set
is syndetic, i.e. has bounded gaps.
It turns out we just need the polynomial to be divisible, i.e., for each
there is some
such that
is divisible by
(If
, or actually if
for some
then
is automatically divisible). Also, in order to prove that the set is syndetic we prove the stronger fact that it is indeed IP
.
The main tool to prove theorem 1 is that of limits along ultrafilters (which I mentioned in the end of my previous post on different ways of taking limits). We denote this as -lim, where
is an ultrafilter on
(which explains why the polynomial was given the name “
“). The proof follows this survey by Bergelson (it’s Theorem 3.11 there), where there is much more information about this and similar results.
In this post I define and prove (most of) the results about ultrafilters that we will need. I will complete the proof of theorem 1 in my next post.
Definition 2 (Ultrafilter) An ultrafilter on
is a collection
of subsets of
satisfying the following
conditions.
.
- If
and
then
.
- If
and
are in
then also
.
- If
then
.
Given a natural number , it is not hard to check that the collection of all subsets of
that contains
form an ultrafilter. Such ultrafilters are called principal. However this are rather uninteresting ultrafilters, so we will only consider non-principal ultrafilters. The existence of a non-principal ultrafilter requires the axiom of choice (under the form of the Zorn’s lemma): one considers some non-principal collection of subsets satisfying the first
conditions (such a collection is called a filter, for instance all sets of the form
) and then consider the family of all filters that contain the first given filter. It’s not hard to check that we are in conditions of the Zorn’s lemma and that the maximal element will be a filter that also satisfies the fourth axiom of ultrafilter. This explains why ultrafilters are sometimes called maximal filters.
Another way to think about ultrafilters is to see them as finitely additive probability measures on that only give the value
and
. More precisely
and
. This motivates the following definition:
Definition 3 (Convolution of ultrafilters) Let
and
be ultrafilters. We define their convolution as
One can check that this corresponds to the usual convolution of measures. One type of ultrafilters that are of special interest are the idempotent ultrafilters:
Definition 4 (Idempotent Ultrafilters) An ultrafilter
is called idempotent if
.
The fact that idempotent ultrafilters exist is a consequence of a theorem of Ellis and uses topological properties of the set of all ultrafilters, namely that this set with the convolution is a compact left continuous semigroup.
Given an ultrafilter , and a sequence
in a topological space, one can consider the limit of
along
:
Definition 5 (Convergence along an ultrafilter) Let
be an ultrafilter and let
be a sequence in some topological space
. Let
. We say that
converges to
along
(or that
-
) if for each neighborhood
of
, the set
is in
.
The most fascinating aspect of this method of convergence is that if the topological space is compact, then any sequence has limit along
:
Proposition 6 Let
be an ultrafilter, let
be a compact Hausdorff space and let
be any sequence taking values on
. Then there exists exactly one point
such that
-
.
Proof: First we prove existence, if no such exists, then for each point
there is an open neighborhood
of
such that
. The cover
will have a finite subcover by compactness, and so we can partition
into finitely many disjoint pieces, according to which atom of the subcover contains
(if
belongs to more than one atom of the finite subcover, choose any of those atoms arbitrarily). Also by constructions, no piece in this partition is in
, and we can easily see that this contradicts the fact that
is an ultrafilter.
To prove uniqueness, let be two distinct points in
. Choose two disjoint neighborhoods
of
and
of
. The sets
and
are also disjoint and so they can’t both be in
, so
and
can’t both be a
-
of
.
We will use this fact on spheres in the space (which are compact in the weak topology by the Banach-Alaoglu theorem). Finally we need the following result, relating
-
with the convolution of ultrafilters:
Proposition 7 Let
and
be ultrafilters, let
be a compact Hausdorff space and let
be a sequence taking values in
. Then
Proof: Let and let
. Then for each neighborhood
of
, we have
Since this happens for every neighborhood of we conclude that
-
.
We will also need another fact about convergence along ultrafilters, roughly speaking it says that passing to certain “subsequences” doesn’t change the limit. First let’s make a definition
Definition 8 Let
be an ultrafilter, and let
. Let
be some sequence taking values in a topological space. We denote the
-
over
to be
and this means that for each neighborhood
of
, the set
.
Note that if then
-
-
and if
then the
-
over
doesn’t exist.
Corollary 9 Let
be an idempotent ultrafilter and let
. Also let
be a sequence in a compact Hausdorff space. We have:
- If
then
.
-
-
.
Proof:
- We can partition
, so by the condition (4) in the definition of ultrafilters and a simple induction we conclude that exactly one of the sets
is in
, we now will prove that
. Since
is idempotent we have that
. But the set
is in
exactly when
, and so the set
as desired. Now the intersection
as well.
- This follows from part (1) and the comment before this corollary.
Shouldn’t the second post on this series have happened sometime yesterday?
Pingback: Convergence along ultrafilters – part II | YAMB
Pingback: Weak Mixing | YAMB
Pingback: Sets of nice recurrence | YAMB
Pingback: YAMB