Given a function on the natural numbers taking values in , one can invoke the Furstenberg correspondence principle to locate a measure preserving system – a probability space together with a measure-preserving shift (or equivalently, a measure-preserving -action on ) – together with a measurable function (or “observable”) that has essentially the same statistics as in the sense that

for any integers . In particular, one has

whenever the limit on the right-hand side exists. We will refer to the system together with the designated function as a *Furstenberg limit* ot the sequence . These Furstenberg limits capture some, but not all, of the asymptotic behaviour of ; roughly speaking, they control the typical “local” behaviour of , involving correlations such as in the regime where are much smaller than . However, the control on error terms here is usually only qualitative at best, and one usually does not obtain non-trivial control on correlations in which the are allowed to grow at some significant rate with (e.g. like some power of ).

The correspondence principle is discussed in these previous blog posts. One way to establish the principle is by introducing a Banach limit that extends the usual limit functional on the subspace of consisting of convergent sequences while still having operator norm one. Such functionals cannot be constructed explicitly, but can be proven to exist (non-constructively and non-uniquely) using the Hahn-Banach theorem; one can also use a non-principal ultrafilter here if desired. One can then seek to construct a system and a measurable function for which one has the statistics

for all . One can explicitly construct such a system as follows. One can take to be the Cantor space with the product -algebra and the shift

with the function being the coordinate function at zero:

(so in particular for any ). The only thing remaining is to construct the invariant measure . In order to be consistent with (2), one must have

for any distinct integers and signs . One can check that this defines a premeasure on the Boolean algebra of defined by cylinder sets, and the existence of then follows from the Hahn-Kolmogorov extension theorem (or the closely related Kolmogorov extension theorem). One can then check that the correspondence (2) holds, and that is translation-invariant; the latter comes from the translation invariance of the (Banach-)Césaro averaging operation . A variant of this construction shows that the Furstenberg limit is unique up to equivalence if and only if all the limits appearing in (1) actually exist.

One can obtain a slightly tighter correspondence by using a smoother average than the Césaro average. For instance, one can use the logarithmic Césaro averages in place of the Césaro average , thus one replaces (2) by

Whenever the Césaro average of a bounded sequence exists, then the logarithmic Césaro average exists and is equal to the Césaro average. Thus, a Furstenberg limit constructed using logarithmic Banach-Césaro averaging still obeys (1) for all when the right-hand side limit exists, but also obeys the more general assertion

whenever the limit of the right-hand side exists.

In a recent paper of Frantizinakis, the Furstenberg limits of the Liouville function (with logarithmic averaging) were studied. Some (but not all) of the known facts and conjectures about the Liouville function can be interpreted in the Furstenberg limit. For instance, in a recent breakthrough result of Matomaki and Radziwill (discussed previously here), it was shown that the Liouville function exhibited cancellation on short intervals in the sense that

In terms of Furstenberg limits of the Liouville function, this assertion is equivalent to the assertion that

for all Furstenberg limits of Liouville (including those without logarithmic averaging). Invoking the mean ergodic theorem (discussed in this previous post), this assertion is in turn equivalent to the observable that corresponds to the Liouville function being orthogonal to the invariant factor of ; equivalently, the first Gowers-Host-Kra seminorm of (as defined for instance in this previous post) vanishes. The Chowla conjecture, which asserts that

for all distinct integers , is equivalent to the assertion that all the Furstenberg limits of Liouville are equivalent to the Bernoulli system ( with the product measure arising from the uniform distribution on , with the shift and observable as before). Similarly, the logarithmically averaged Chowla conjecture

is equivalent to the assertion that all the Furstenberg limits of Liouville with logarithmic averaging are equivalent to the Bernoulli system. Recently, I was able to prove the two-point version

of the logarithmically averaged Chowla conjecture, for any non-zero integer ; this is equivalent to the perfect strong mixing property

for any Furstenberg limit of Liouville with logarithmic averaging, and any .

The situation is more delicate with regards to the Sarnak conjecture, which is equivalent to the assertion that

for any zero-entropy sequence (see this previous blog post for more discussion). Morally speaking, this conjecture should be equivalent to the assertion that any Furstenberg limit of Liouville is disjoint from any zero entropy system, but I was not able to formally establish an implication in either direction due to some technical issues regarding the fact that the Furstenberg limit does not directly control long-range correlations, only short-range ones. (There are however ergodic theoretic interpretations of the Sarnak conjecture that involve the notion of generic points; see this paper of El Abdalaoui, Lemancyk, and de la Rue.) But the situation is currently better with the logarithmically averaged Sarnak conjecture

as I was able to show that this conjecture was equivalent to the logarithmically averaged Chowla conjecture, and hence to all Furstenberg limits of Liouville with logarithmic averaging being Bernoulli; I also showed the conjecture was equivalent to local Gowers uniformity of the Liouville function, which is in turn equivalent to the function having all Gowers-Host-Kra seminorms vanishing in every Furstenberg limit with logarithmic averaging. In this recent paper of Frantzikinakis, this analysis was taken further, showing that the logarithmically averaged Chowla and Sarnak conjectures were in fact equivalent to the much milder seeming assertion that all Furstenberg limits with logarithmic averaging were ergodic.

Actually, the logarithmically averaged Furstenberg limits have more structure than just a -action on a measure preserving system with a single observable . Let denote the semigroup of affine maps on the integers with and positive. Also, let denote the profinite integers (the inverse limit of the cyclic groups ). Observe that acts on by taking the inverse limit of the obvious actions of on .

Proposition 1 (Enriched logarithmically averaged Furstenberg limit of Liouville)Let be a Banach limit. Then there exists a probability space with an action of the affine semigroup , as well as measurable functions and , with the following properties:

- (i) (Affine Furstenberg limit) For any , and any congruence class , one has
- (ii) (Equivariance of ) For any , one has
for -almost every .

- (iii) (Multiplicativity at fixed primes) For any prime , one has
for -almost every , where is the dilation map .

- (iv) (Measure pushforward) If is of the form and is the set , then the pushforward of by is equal to , that is to say one has
for every measurable .

Note that can be viewed as the subgroup of consisting of the translations . If one only keeps the -portion of the action and forgets the rest (as well as the function ) then the action becomes measure-preserving, and we recover an ordinary Furstenberg limit with logarithmic averaging. However, the additional structure here can be quite useful; for instance, one can transfer the proof of (3) to this setting, which we sketch below the fold, after proving the proposition.

The observable , roughly speaking, means that points in the Furstenberg limit constructed by this proposition are still “virtual integers” in the sense that one can meaningfully compute the residue class of modulo any natural number modulus , by first applying and then reducing mod . The action of means that one can also meaningfully multiply by any natural number, and translate it by any integer. As with other applications of the correspondence principle, the main advantage of moving to this more “virtual” setting is that one now acquires a probability measure , so that the tools of ergodic theory can be readily applied.

** — 1. Proof of proposition — **

We adapt the previous construction of the Furstenberg limit. The space will no longer be the Cantor space , but will instead be taken to be the space

The action of here is given by

this can easily be seen to be a semigroup action. The observables and are defined as

and

where is the identity element of . Property (ii) is now clear. Now we have to construct the measure . In order to be consistent with property (i), the measure of the set

for any distinct , signs , and congruence class , must be equal to

One can check that this requirement uniquely defines a premeasure on the Boolean algebra on generated by the sets (4), and can then be constructed from the Hahn-Kolmogorov theorem as before. Property (i) follows from construction. Specialising to the case , for a prime we have

the left-hand side is , which gives (iii).

It remains to establish (iv). It will suffice to do so for sets of the form (4). The claim then follows from the dilation invariance property

for any bounded function , which is easily verified (here is where it is essential that we are using logarithmically averaged Césaro means rather than ordinary Césaro means).

Remark 2One can embed this -system as a subsystem of a -system , however this larger system is only -finite rather than a probability space, and also the observable now takes values in the larger space . This recovers a group action rather than a semigroup action, but I am not sure if the added complexity of infinite measure is worth it.

** — 2. Two-point logarithmic Chowla — **

We now sketch how the proof of (3) in this paper can be translated to the ergodic theory setting. For sake of notation let us just prove (3) when . We will assume familiarity with ergodic theory concepts in this sketch. By taking a suitable Banach limit, it will suffice to establish that

for any Furstenberg limit produced by Proposition 1, where denotes the operation of translation by . By property (iii) of that proposition, we can the left-hand side as

for any prime , and then by property (iv) we can write this in turn as

Averaging, we thus have

for any , where denotes the primes between and .

On the other hand, the Matomaki-Radziwill theorem (twisted by Dirichlet characters) tells us that for any congruence class , one has

which on passing to the Furstenberg limit gives

Applying the mean ergodic theorem, we conclude that is orthogonal to the *profinite factor* of the -action, by which we mean the factor generated by the functions that are periodic (-invariant for some ). One can show from Fourier analysis that the profinite factor is characteristic for averaging along primes, and in particular that

as . (This is not too difficult given the usual Vinogradov estimates for exponential sums over primes, but I don’t know of a good reference for this fact. This paper of Frantzikinakis, Host, and Kra establishes the analogous claim that the Kronecker factor is characteristic for triple averages , and their argument would also apply here, but this is something of an overkill.) Thus, if we define the quantities

it will suffice to show that .

Suppose for contradiction that for all sufficiently large . We can write as an expectation

where is the -valued random variable

with drawn from with law , is the -valued random variable

with as before, and is the function

As , we have

with probability at least . On the other hand, an application of Hoeffding’s inequality and the prime number theorem shows that if is drawn uniformly from and independently of , that one has the concentration of measure bound

for some . Using the Pinsker-type inequality from this previous blog post, we conclude the lower bound

on the mutual information between and . Using Shannon entropy inequalities as in my paper, this implies the entropy decrement

for any natural number , which on iterating (and using the divergence of ) shows that eventually becomes negative for sufficiently large , which is absurd. (See also this previous blog post for a sketch of a slightly different way to conclude the argument from entropy inequalities.)

## 9 comments

Comments feed for this article

5 March, 2017 at 12:16 pm

Will SawinOne could ask whether there exist dynamical systems satisfying (2), (3), (4), and a weaker version of axiom (1) other than the obvious ones. Obviously a full understanding of the “obvious ones” requires some deep number theory, but it might still be possible to reach a conjectural understanding.

In particular, can we construct any “exotic” dynamical systems satisfying (2), (3), (4) at all?

PS You left some extra dots in Equation (3), where they are unneeded.

5 March, 2017 at 6:00 pm

Terence TaoThanks for the correction! Yes, there are additional dynamical systems obeying (2), (3), (4). Here is one. Consider the space formed by quotienting by the diagonal copy of the integers; this is also the inverse limit of for natural numbers . This is a compact abelian group that is also a vector space over (multiplication by comes from taking inverse limits of the scaling maps from to ). One can take to be the compact abelian group with Haar measure, with an affine map acting on this space by where is the number of prime factors of counting multiplicity), with and . (This is basically the system that is blocking us from establishing local Fourier uniformity of the Liouville function.)

5 March, 2017 at 2:34 pm

AnonymousIs it possible to extend (3) to other completely multiplicative functions?

5 March, 2017 at 6:09 pm

Terence TaoYes; one replaces the minus sign here by the value of the multiplicative function at the given prime.

5 March, 2017 at 2:49 pm

Lucas A BrownIn your second paragraph, you dropped a word right after “capture”.

[Corrected, thanks – T.]7 March, 2017 at 7:45 am

AulaTwo typesetting comments. First, you shouldn’t use \dots in math mode; in the rare contexts where you really need the dots down on the baseline (eg. comma-separated lists) you should use \ldots, but in most cases \cdots is better. Second, typing Aff in math mode results in two separate f glyphs that are too far apart; instead you should use {\it Aff} to get a proper double-f ligature.

7 March, 2017 at 11:44 am

AnonymousWell, you should indeed use \dots and not \ldots or \cdots. (TeX takes care of the correct placement of the ellipses.)

7 March, 2017 at 9:28 pm

MichaelIs n missing from the denominators of two displayed equations just after (4)?

[Corrected, thanks – T.]10 March, 2017 at 4:57 am

Romain ViguierFirst mathematical article from prof Tao i read, very very high level, specially when you have not the required background.