Topological dynamics formulation
From Polymath1Wiki
Define a topological dynamical system over the rationals to be a pair (X,T), where X is a compact metrisable space, and
is a continuous action of the positive rationals (as a multiplicative group) on X. In other words, for each positive rational q,
is a homeomorphism such that Tqr = TqTr for all positive rationals q, r. In particular, the Tq all commute. For any function
, we write Tqf for
.
The Erdos discrepancy problem is then equivalent to
- Conjecture 1. Let (X,T) be a topological dynamical system over the positive rationals, and let
be a continuous function. Then the quantity
is unbounded as x ranges over X and n ranges over the natural numbers.
Proof of Conjecture 1 assuming EDP Suppose for contradiction that
for some C and all x, n. Pick a point x0 in X, and consider the function
defined by
-
(1)
Then
has discrepancy at most C, contradicting EDP. QED
Proof of EDP assuming Conjecture 1 It suffices to show EDP for the positive rationals. Suppose for contradiction that this failed, then there exists
with discrepancy bounded by some finite C. Let Ω be the compact metrisable space
with shift :
;
observe that this is a continuous action of the rationals. Let
be the point
and let X be the orbit closure of x0, i.e. the topological closure of
. This is a compact metrisable space, and T restricts to a continuous action on this space.
Set
to be the function
;
observe that this is a continuous function. By Conjecture 1, we can find
and n such that
. But x can be approximated to arbitrary accuracy by a shift of x0. Unpacking all the definitions, we conclude that f has discrepancy greater than C, a contradiction. QED.
We say that a topological system X is minimal if it contains no proper non-empty compact shift-invariant subset. An easy application of Zorn's lemma shows that every topological system contains a minimal system. Thus, to prove Conjecture 1, it suffices to do so for minimal systems.
Given a non-empty open set in a minimal system, one must be able to cover that system by the shifts of the open set, since otherwise the complement of that cover would be a proper compact shift-invariant subset, contradicting minimality. By compactness, this implies that a minimal system can be covered by finitely many translates of the open set.
In terms of sequences, this means that the sequences
associated to a minimal system (by (1)) have the following almost periodicity property: given any finite set of equations of the form
-
(*)
for some positive rationals
and
, the set of solutions x to (*) is either empty or syndetic, which means that there is a finite set of positive rationals
such that for every positive rational x, at least one of
solves (*).
The Krylov-Bogolubov theorem asserts that X supports a probability measure that is shift-invariant. The reason for this is that the positive rationals are amenable, and thus admit a Folner sequence F_n. Now start with your favourite probability measure (e.g. a Dirac mass) and average it over the Folner sequences. Then use Prokhorov's theorem to take a weak limit, which will be automatically invariant by construction.
Once we have a shift-invariant measure, ergodic theory comes into play. For instance, the Birkhoff ergodic theorem will assert that for all rationals, and all continuous functions F, the limit
exists for almost every x in X (with respect to the invariant measure). Because there are only countably many rationals, and the space of continuous functions is separable, we can thus find an x which is generic, in the sense that the above limits exist for all F and all q. In particular, this implies that if EDP fails, we can find a minimal sequence f of bounded discrepancy such that the limit
exists for all positive rationals
and all functions
.
Note also that if
has bounded discrepancy on a measure preserving system, then its mean must be zero, as can be seen by averaging
with respect to x, and then sending n to infinity. Thus, f equals 1 exactly half of the time, and -1 half the time.
