This is a note concentrate on the log average Sarnak conjecture, after the work of Matomaki and Raziwill on the estimate of multiplication function of short interval. Given a overview of the presented tools and method dealing with this conjectue.
1. Introduction
Sarnak conjecture [1] assert that for any obersevable $latex {\{f(T^n(x_0))\}_{n=1}^{\infty}}&fg=000000$ come from a determination systems $latex {(T,X),T:X\rightarrow X}&fg=000000$, where $latex {h(T)=0}&fg=000000$, $latex {x_0\in X, f\in C(X)}&fg=000000$. The correlation of it and the Liuvillou function is 0, i.e. they are orthongonal to each other, more preseicesly it is just to say,
$latex \displaystyle \sum_{n<x}\mu(x)f(T^n(x_0))=o(x) \ \ \ \ \ (1)&fg=000000$
This is a very natural raised conjecture, Liuville function is the presentation of primes, due to we always believe the distribution of primes in $latex {\mathbb N}&fg=000000$ should be randomness.
It has been known as observed by Landau [1] that the simplest case,
$latex \displaystyle \sum_{n<x}\mu(n)=o(x)&fg=000000$
already equivalent to the prime number theorem. It is not difficult to deduce the spetial case of Sarnak conjecture when with the obersevation in $latex {(1)}&fg=000000$ come from finite dynamic system is equivalent to the prime number theorem in athremetic progress by the similar argument. Besides this two classical result, may be the first new result was established by Davenport,
Theorem 1 Let $latex {T:S_1\rightarrow S_1, T(x)=x+\alpha}&fg=000000$, $latex {\alpha}&fg=000000$ is a inrational, then the obersevation come from $latex {(T,S_1)}&fg=000000$ is orthogonal to Mobius function. due to $latex {\{e^{2\pi ikx}\}_{k\in \mathbb Z}}&fg=000000$ is a basis of $latex {C(S_1)}&fg=000000$, suffice to proof,
$latex \displaystyle \sum_{n<x}e^{2\pi ikn\alpha}\mu(n)=o(x), \forall k\in \mathbb N&fg=000000$
There is a lots of spetial situations of Sarnak’s conjecture have been established, The parts I mainly cared is the following:
- Interval exchange map.
- Skew product flow.
- Obersevable come from One dimensional zero entropy flow.
- Nilsequences.
But in this note, I do not want to explain the tecnical and tools to establish this result, but considering an equivalent conjecture of Sarnak conjecture, named Chowla conjecture, and explain the underlying insight of the suitable weak statement, i.e. the log average Chowla conjecture and the underlying insight of it.
The note is organized as following way, in the next section $latex {(2)}&fg=000000$, we give a self-contained introduction on the tools called Bourgain-Sarnak-Ziegler critation, explain the relationship of this critation and the sum-product phenomenon, also given some more general critation along the philosephy use in establish the Bourgain-Sarnak-Ziegler critation, which maybe useful in following development combine with some other tools. The key point is transform the sum from linear sum to bilinear sum and decomposition the bilinear sum into diagonal part and off-diagonal part, use the assume in the critation to argue the off-diagonal part is small and on the orther hand the diagonal part is also small by the trivial estimate and the volume of diogonal is small, this is very similar to a suitable Caderon-Zugmund decomposition.
In section $latex {(4)}&fg=000000$, I try to give a proof sketch of the result of Matomaki and Raziwill, which is also a key tools to understanding the Sarnak conjecture, or equivalent the Chowla conjecture. The key points of the proof contains following:
- Find a suitable fourier indentity
- Construct a multiplication-addition dense subset $latex {S}&fg=000000$, and proof that the theorem MR hold we need only to proof it hold for $latex {S\cap [1,2,…,n]}&fg=000000$ instead of $latex {[1,2,…,n]}&fg=000000$
- Involve the power of euler product formula. divide the whole interval into a lot of small interval with smaller and smaller scale and a residue part. We look the part come from every small scale as a major term and look the residue part as minor term.
- Deal with the major term at every scale, by a combitorios identity and second moments method.
- find a enough decay estimate from a scale to the next smaller scale.
- Deal with the minor term by the H… lemma.
Due to the theorem of MR do not exausted the method they developed, we trying to make some more result with their method, Tao and Matomaki attain the average version of Chowla conjecture is true by this way, and combine this argument and the entropy decresment argument they established the 2 partten of the log average Chowla conjecture is true. Very recently Tao and his coperator proved the odd partten case of log average chowla conjecture is true, combine an argument of frustenberg crresponding principle and entopy decresment argument. But it seems the even and large than 2 case is much difficult and seems need something new to combine with the method of MR and entropy decresment and frunstenberg corresponfing principle to make some progress.
So, in section $latex {(5)}&fg=000000$, we give a self-contain introduction to the entropy decresment argument of Tao, and combine with the frustenberg corresponding principle.
In the last section $latex {(6)}&fg=000000$, I state some result and method and phylosphy of them I get on nilsequences and wish to combine them with the previous method to make some progress on log average Chowla conjecture on the even partten case.
\newpage
2. Bourgain-Sarnak-Zieglar creation
We begin with the easiest one, this is the main result established in [1], I try to give the main ideal under the proof, but with a no quantitative version is the following,
Theorem 2 (Bourgain-Sarnak-Zieglar creation, not quantitative version) if for all primes $latex {p,q>>1}&fg=000000$ we have:
$latex \displaystyle \sum_{n=1}^Nf(T^{pn}(x))\overline{f(T^{qn}(x))}=o(N) \ \ \ \ \ (2)&fg=000000$
Then for multiplication function $latex {g(n)}&fg=000000$ we have
$latex \displaystyle \sum_{n=1}^Ng(n)\overline{ f(T^n(x))}=o(N) \ \ \ \ \ (3)&fg=000000$
Remark 1 For simplify we identify $latex {f(T^n(x)):=F(n)}&fg=000000$.
The idea is following, break the sum into a bilinear one, so, of course, we multiplication it with itself. i.e. we consider to control,
$latex \displaystyle |\sum_{i=1}^Ng(n)\overline{ F(n)}|^2=\sum_{n=1}^N\sum_{m=1}^Ng(n)g(m)\overline{F(n)F(m)} \ \ \ \ \ (4)&fg=000000$
To control 4, we need exhausted the mutiplication property of $latex {g(n)}&fg=000000$, we have $latex {g(mn)=g(n)g(m),\forall\ m,n\in {\mathbb N}}&fg=000000$. We can not get good estimate for all term,
$latex \displaystyle g(n)g(m)\overline{F(n)F(m)} \ \ \ \ \ (5)&fg=000000$
The condition in our hand if following,
$latex \displaystyle \sum_{n=1}^NF(pn)\overline{F(qn)}=o(N), \forall \ p,q\in \mathop{\mathbb P} \ \ \ \ \ (6)&fg=000000$
So, just like the situation of Cotlar-Stein lemma [1], we wish to estimate like following:
$latex \displaystyle \begin{array}{rcl} |\sum_{p\in W}\sum_{n\in V}F(pn)g(pn)| & \leq & \sum_{n\in V}|g(n)|\cdot |\sum_{p\in W}F(pn)g(p)| \\ & \leq &\sum_{n\in V}|\sum_{p \in W}F(pn)g(p)|\\ & \overset{Cauchy-Schwarz}\leq & |V|^{\frac{1}{2}}[\sum_{n\in V}|\sum_{p\in W}F(pn)g(p)|^2]^{\frac{1}{2}}\\ & = & |V|^{\frac{1}{2}}[\sum_{p_1,p_2\in W}\sum_{n\in V}F(p_1n)\overline{F(p_2n)}g(p_1)\overline{g(p_2)}]^{\frac{1}{2}}\\ \end{array} &fg=000000$
Then we consider divide the sum into diagonal part and non-diagonal part, as following,
$latex \displaystyle |V|^{\frac{1}{2}}[\sum_{p_1\neq p_2\in W}\sum_{n\in V}F(p_1n)\overline{F(p_2n)}g(p_1)\overline{g(p_2)}]^{\frac{1}{2}}+|V|^{\frac{1}{2}}[\sum_{p\in W}\sum_{n\in V}|F(pn)|^2]^{\frac{1}{2}} \ \ \ \ \ (7)&fg=000000$
But the first part is small, i.e.
$latex \displaystyle |V|^{\frac{1}{2}}[\sum_{p_1\neq p_2\in W}\sum_{n\in V}F(p_1n)\overline{F(p_2n)}g(p_1)\overline{g(p_2)}]^{\frac{1}{2}} =o(|W||V|) \ \ \ \ \ (8)&fg=000000$
Because of
$latex \displaystyle \sum_{n\in V}F(p_1n)\overline{F(p_2n)}=o(V), \forall p_1\neq p_2\in W \ \ \ \ \ (9)&fg=000000$
and the second part is small, i.e.
$latex \displaystyle |V|^{\frac{1}{2}}[\sum_{p\in W}\sum_{n\in V}|F(pn)|^2]^{\frac{1}{2}}=o(|W||V|) \ \ \ \ \ (10)&fg=000000$
Because diagonal part is small in $latex {W\times W}&fg=000000$ and trivial inequality
$latex \displaystyle \sqrt{\sum_{n\in V}|F(pn)|^2}\leq |V|^{\frac{1}{2}} \ \ \ \ \ (11)&fg=000000$
But the method in remark 2 is not always make sense in any situation, we need to construct two suitable sets $latex {W,V}&fg=000000$ and then break up $latex {\{1,2,…,n{\mathbb N}\}}&fg=000000$ into $latex {W\times V}&fg=000000$, this mean,
$latex \displaystyle \{1,2,…,N\}\sim W\times V+o(N) \ \ \ \ \ (12)&fg=000000$
But this $latex {W,V}&fg=000000$ could be construct in this situation, thanks to the prime number theorem,
Theorem 3 (Prime number theorem)
$latex \displaystyle \pi(n)\sim \frac{n}{ln(n)} \ \ \ \ \ (13)&fg=000000$
Morally speaking, this is the statement that the primes, which is the generator of multiplication function, is not very sparse.
3. Van der curpurt trick
There is the statement of Van der carport theorem:
Theorem 4 (Van der curpurt trick) Given a sequences $latex { \{x_n\}_{n=1}^{\infty}}&fg=000000$ in $latex { S_1}&fg=000000$, if $latex { \forall k\in N^*}&fg=000000$, $latex { \{x_{n+k}-x_n\}}&fg=000000$ is uniformly distributed, then $latex { \{x_n\}_{n=1}^{\infty}}&fg=000000$ is uniformly distributed.
I do not know how to establish this theorem with no extra condition, but this result is true at least for polynomial flow. \newpage Proof:
$latex \displaystyle \begin{array}{rcl} |\sum_{n=1}^Ne^{2\pi imQ(n)}|& = &\sqrt{(\sum_{n=1}^Ne^{2\pi imQ(n)})(\overline{\sum_{n=1}^Ne^{2\pi imQ(n)}})}\\ & = &\sqrt{\sum_{h_1=1}^N\sum_{n=1}^{N-h_1}e^{2\pi imQ(n+h_1)-Q(n)}}\\ & = &\sqrt{\sum_{h_1=1}^N\sum_{n=1}^{N-h_1}e^{2\pi im \partial^1_{h_1}Q(n)}}\\ & \leq & \sqrt{\sum_{h_1=1}^N|\sum_{n=1}^{N-h_1}e^{2\pi \partial^1_{h_1}Q(n)}|}\\ & = &\sqrt{\sum_{h_1=1}^N\sqrt{ (\sum_{n=1}^{N-h_1}e^{2\pi \partial^1_{h_1}Q(n)} )(\overline{\sum_{n=1}^{N-h}e^{2\pi \partial^1_{h_1}Q(n)})}}}\leq\sqrt{\sum_{h_1=1}^N\sqrt{ \sum_{h_2=1}^N|\sum_{n=1}^{N-h_1}e^{2\pi\partial^1_{h_2} \partial^1_hQ(n)} |}}\\ & \leq ….\leq & \\ & = & \sqrt{\sum_{h_1=1}^N\sqrt{ \sum_{h_2=1}^N \sqrt{….\sqrt{\sum_{h_{k-1}=1}^{N-h_{k-2}}|\sum_{n=1}^{N-h_{k-1}}e^{2\pi\partial_{h_1h_2…h_{k-1}Q(n)}}|}}}} =o(1) \end{array} &fg=000000$
$latex \Box&fg=000000$
This type of trick could also establish the following result, which could be understand as a discretization of the Vinegradov lemma.
Remark 3
Uniformly distribution result of $latex { F_p}&fg=000000$: Given $latex {Q(n)=a_kn^k+…+a_1n+a_0}&fg=000000$, $latex {\{Q(0),Q(1),…,Q(p-1)\}}&fg=000000$ coverages to a uniformly distribution in $latex {\{0,1,…,p-1\}}&fg=000000$ as $latex {p \rightarrow \infty}&fg=000000$.
Remark 4 But I definitely do not know how to establish the similar result when $latex {Q(n)=n^{-1}}&fg=000000$.
Remark 5
This trick could also help to establish estimate of correlation of low complexity sequences and multiplicative function, such as result:
$latex \displaystyle S(x)=\sum_{n\le x}\left(\frac{n}{p}\right)\mu(n)=o(n)&fg=000000$
Maybe with the help of B-Z-S theorem.
\newpage
4. Matomaki and Raziwill’s work
In this section we explain the main idea underlying the paper [1]. But play with a toy model, i.e. the corresponding corollary of the original result on Liouville鈥檚 function.
Definition 5 (Lioville’s function)
$latex \displaystyle \lambda(n)=(-1)^{\alpha_1+\alpha_2+…+\alpha_k}, \forall \ n=p_1^{\alpha_1}…p_k^{\alpha_k}. \ \ \ \ \ (14)&fg=000000$
Remark 6
$latex \displaystyle |\int_{X}^{2X}\lambda(n)dx|=o(x) \ \ \ \ \ (15)&fg=000000$
is equivalent to the prime number theorem 3.
The most important beakgrouth of analytic number theory is the new understanding of multiplication function on share interval, this result is established by Kaisa Matom盲ki and Maksym Radziwill. Two very young and intelligent superstars.
The main theorem in them article is :
Theorem 6 (Matomaki,Radziwill) As soon as $latex {H\rightarrow \infty}&fg=000000$ when $latex {x\rightarrow \infty}&fg=000000$, one has:
$latex \displaystyle \sum_{x\leq n\leq x+H}\lambda(n)= o(H) \ \ \ \ \ (16)&fg=000000$
for almost all $latex {1\leq x\leq X}&fg=000000$ .
In my understanding of the result, the main strategy is:
- Parseval indetity, transform to Dirchelet polynomial.
- Involved by multiplication property, spectral decomposition.
- From linear to multilinear , Cauchy schwarz inequality.
- major term estimate.
- Estimate the contribution of area which is not filled.
4.1. Parseval indetity, transform to Dirchelet polynomial
We wish to establish the equality,
$latex \displaystyle \frac{1}{X}\int_{X}^{2X}|\sum_{x\leq n\leq x+H}\lambda(n)|dx=o(H) \ \ \ \ \ (17)&fg=000000$
This is the $latex {L^1}&fg=000000$ norm, by Chebyschev inequality, this could be control by $latex {L^2}&fg=000000$ norm, so we only need to establish the following,
$latex \displaystyle \frac{1}{X}\int_X^{2 X}|\sum_{x\leq n\leq x+H}\lambda(n)|^2dx=o(H^2) \ \ \ \ \ (18)&fg=000000$
We wish to transform from the discretization sum to a continue sum, that is,
$latex \displaystyle \int_{{\mathbb R}}|\sum_{xe^{-\frac{1}{T}}\leq n\leq xe^{\frac{1}{T}}}\lambda(n)1_{X\leq n\leq 2X}|^2\frac{dx}{x} \ \ \ \ \ (19)&fg=000000$
Remark 7 There are two points to understand why 19 and 18 are the same.
- $latex {[xe^{-\frac{1}{T}},xe^{\frac{1}{T}}]\sim [x-H,x+H]}&fg=000000$.
- $latex {1_{x\leq n\leq 2x}}&fg=000000$ and $latex {\frac{1}{x}}&fg=000000$ is to make that $latex {x=O(X)}&fg=000000$.
So the Magnitude of 18 and 19 are the same. i.e.
$latex \displaystyle \int_{{\mathbb R}}|\sum_{xe^{-\frac{1}{T}}\leq n\leq xe^{\frac{1}{T}}}\lambda(n)1_{X\leq n\leq 2X}|^2\frac{dx}{x}\sim \frac{1}{X}\int_X^{2 X}|\sum_{x\leq n\leq x+H}\lambda(n)|^2dx \ \ \ \ \ (20)&fg=000000$
Now we try to transform 19 by Parseval indetity, this is something about the $latex {L^2}&fg=000000$ norms of the quality we wish to charge. It is just trying to understanding 19 as a quantity in physical space by a more chargeable quality in frequency space. Image,
$latex \displaystyle \int_{{\mathbb R}}|\sum_{xe^{-\frac{1}{T}}\leq n\leq xe^{\frac{1}{T}}}\lambda(n)1_{X\leq n\leq 2X}|^2\frac{dx}{x}:=\int_{{\mathbb R}}|f_X(x)|^2dx \ \ \ \ \ (21)&fg=000000$
Then $latex {f_X(x)=\int_{xe^{-\frac{1}{T}}\leq n\leq xe^{\frac{1}{T}}}\lambda(x)1_{X\leq n\leq 2X}}&fg=000000$. Note that,
$latex \displaystyle \begin{array}{rcl} \widehat{f_X(\xi)} & = & \int_{{\mathbb R}}f_X(x)e^{2\pi ix\xi}dx\\ & = & \sum_{x\leq n\leq 2x}\lambda(x)\int_{logn-\frac{1}{T}}^{logn+\frac{1}{T}}e^{2\pi ix\xi}dx, \ T=\frac{X}{H}\\ & = & \sum_{X\leq n\leq 2X}\lambda(x)e^{2\pi ilog(n)\cdot \xi}\cdot\frac{e^{2\pi i\frac{\xi}{T}}-e^{2\pi i-\frac{\xi}{T}}}{2\pi i\xi}\\ \end{array} &fg=000000$
So by Parseval identity, we have,
$latex \displaystyle \begin{array}{rcl} \int_{{\mathbb R}}|f_X(x)|^2dx & = & \int_{{\mathbb R}}|\widehat{f_X(\xi)}|^2d\xi \\ & = & \int_{{\mathbb R}}|\sum_{X\leq n\leq 2X}\lambda(n)\cdot n^{2\pi i\xi}|^2(\frac{e^{2\pi i\frac{\xi}{T}}-e^{2\pi i\frac{-\xi}{T}}}{2\pi i\xi})^2d\xi\\ & \sim & \int_{{\mathbb R}}|\sum_{X\leq n\leq 2X}\lambda(n)\cdot n^{2\pi i\xi}|^2\frac{1}{T^2}1_{|\xi|^2\leq T}\\ \end{array} &fg=000000$
Remark 8 We know the Fejer kernel satisfied,
$latex \displaystyle (\frac{e^{2\pi i\frac{\xi}{T}}-e^{2\pi i\frac{-\xi}{T}}}{2\pi i\xi})^2\sim \frac{1}{T^2}1_{|\xi|\leq T} \ \ \ \ \ (22)&fg=000000$
So morally speaking, we get the following identity.
$latex \displaystyle \frac{1}{X}\int_{X}^{2X}|\sum_{x\leq n\leq x+H}\lambda(n)|^2dx\sim \frac{1}{(x/H)^2}\int_{0}^{\frac{X}{H}}|\sum_{x\leq n\leq 2x}\lambda(x)x^{2\pi i\xi}|^2d\xi \ \ \ \ \ (23)&fg=000000$
In fact we do a cutoff, the quality we really consider is just:
$latex \displaystyle \frac{1}{X^2}\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt \ \ \ \ \ (24)&fg=000000$
established the monotonically inequality:
Theorem 7 (Paserval type identity)
$latex \displaystyle \frac{1}{X}\int_{X}^{2X}|\frac{1}{H}\sum_{x\leq n\leq x+H}\lambda(n)|^2dx \sim聽\frac{1}{X^2}\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt \ \ \ \ \ (25)&fg=000000$
Remark 9
In my understanding, This is a perspective of the quality, due to the quality is a multiplicative function integral on a domain $latex { \mathbb N^*}&fg=000000$ with additive structure, it could be looked as a lots of wave with the periodic given by primes, so we could do a orthogonal decomposition in the fractional space, try to prove the cutoff is a error term and we get such a monotonically inequality.
But at once we get the monotonically inequality, we could look it as a聽compactification process and this process still carry most of the information so lead to the inequality.
It seems something similar occur in the attack of the moments estimate of zeta function by the second author. And it is also could be looked as something similar to the 聽spectral decomposition with some basis come from multiplication generators, i.e. primes.
4.2. Involved by multiplication property, spectral decomposition
I called it is “spectral decomposition”, but this is not very exact. Anyway, the thing I want to say is that for multiplication function $latex {\lambda(n)}&fg=000000$, we have Euler-product formula:
$latex \displaystyle \Pi_{p,prime}(\frac{1}{1-\frac{\lambda(p)}{p^s}})=\sum_{n=1}^{\infty} \frac{\lambda(n)}{n^s} \ \ \ \ \ (26)&fg=000000$
But anyway, we do not use the whole power of multiplication just use it on primes, i.e. $latex {\lambda(pn)=\lambda(p)\lambda(n)}&fg=000000$ leads to following result:
$latex \displaystyle \lambda(n)=\sum_{n=pm,p\in I}\frac{\lambda(p)\lambda(m)}{\# \{p|m, p\in I\}+1}+\lambda(n)1_{p|n;p\notin I} \ \ \ \ \ (27)&fg=000000$
This is a identity about the function $latex {\lambda(n)}&fg=000000$, the point is it is not just use the multiplication at a point,i.e. $latex {\lambda(mn)=\lambda(m)\lambda(n)}&fg=000000$, but take average at a area which is natural generated and compatible with multiplication, this identity carry a lot of information of the multiplicative property. Which is crucial to get a good estimate for the quality we consider about.
4.3. From linear to multilinear , Cauchy schwarz
Now, we do not use one sets $latex {I}&fg=000000$, but use several sets $latex {I_1,…,I_n }&fg=000000$ which is carefully chosen. And we do not consider [X,2X] with linear structure anymore , instead reconsider the decomposition:
$latex {[X,2X]=\amalg_{i=1}^n (I_i\times J_i) \amalg U}&fg=000000$
On every $latex {I_i\times J_i}&fg=000000$ it equipped with a bilinear structure. And $latex {U}&fg=000000$ is a very small set, $latex {|U|=o(X)}&fg=000000$ which is in fact have much better estimate.
$latex {\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt =\sum_{i=1}^n\int_{I_i\times J_i}聽聽\frac{1}{X^2}\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt +\int_N |\sum_{n\leq X}\lambda(n)n^{it}|^2dt}&fg=000000$
Now we just use a Cauchy-Schwarz:
$latex {\sum_{i=1}^n\int_{I_i\times J_i}聽聽\frac{1}{X^2}\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt +\int_N |\sum_{n\leq X}\lambda(n)n^{it}|^2dt}&fg=000000$
4.4. major term estimate
$latex {=\sum_{i=1}^n\int_{I_i\times J_i}聽聽\frac{1}{X^2}\int_{|log(X)|^{100}}^{\frac{X}{H}}|\sum_{n\leq X}\lambda(n)n^{it}|^2dt}&fg=000000$
$latex {\int_N |\sum_{n\leq X}\lambda(n)n^{it}|^2dt}&fg=000000$
4.5. estimate the contribution of area which is not filled
\newpage
5. Entropy dcrement argument
\newpage
6. Correlation with nilsequences
I wish to establish the following estimate: $latex {\lambda(n)}&fg=000000$ is the liouville function we wish the following estimate is true.
$latex \displaystyle \int_{0\leq x\leq X}|\sup_{f\in \Omega^m}\sum_{x\leq n\leq x+H}\lambda(n)e^{2\pi if(x)}|dx =o(XH). \ \ \ \ \ (28)&fg=000000$
Where we have $latex { H\rightarrow \infty}&fg=000000$ as $latex { x\rightarrow \infty}&fg=000000$,
$latex \displaystyle \Omega^m=\{a_mx^m+a_{m-1}x^{m-1}+…+a_1x+a_0 | a_m,…,a_1,a_0\in [0,1]\}&fg=000000$
is a compact space.
I do not know how to prove this but this is result is valuable to consider, because by a Fourier identity we could transform the difficulty of (log average) Chowla conjecture to this type of result.
There is some clue to show this type of result could be true, the first one is the result established by Matomaki and Raziwill in 2015:
Theorem 8 (multiplication function in short interval)
$latex {f(n): \mathbb N\rightarrow \mathbb C}&fg=000000$ is a multiplicative function, i.e. $latex { f(mn)=f(n)f(m), \forall m,n\in \mathbb N}&fg=000000$. $latex {H\rightarrow \infty}&fg=000000$ as $latex {x\rightarrow \infty}&fg=000000$, then we have the following result,
$latex \displaystyle \int_{1\leq x\leq X}|\sum_{x\leq n\leq x+H}f(n)|=o(XH). \ \ \ \ \ (29)&fg=000000$
And there also exists the result which could be established by Vinagrodov estimate and B-S-Z critation :
Theorem 9 (correlation of multiplication function and nil-sequences in long interval)
$latex {f(n): \mathbb N\rightarrow \mathbb C}&fg=000000$ is a multiplicative function, i.e. $latex { f(mn)=f(n)f(m), \forall m,n\in \mathbb N}&fg=000000$. $latex {g(n)=a_n^m+…+a_1n+a_0}&fg=000000$ is a polynomial function then we have the following result,
$latex \displaystyle \int_{1\leq n \leq X}|f(n)e^{2\pi i g(n)}|=o(X) \ \ \ \ \ (30)&fg=000000$
\newpage {9} \bibitem{Sarnak} Peter Sarnak, Mobius Randomness and Dynamics.
\texttt{https://publications.ias.edu/sites/default/files/Mahler }. \bibitem{Laudau} JA 虂NOS PINTZ (BUDAPEST). LANDAU鈥橲 PROBLEMS ON PRIMES.
\texttt{https://users.renyi.hu/~pintz/pjapr.pdf} \bibitem{BSZ} Knuth: Computers and Typesetting,
\texttt{http://www-cs-faculty.stanford.edu/\~{}uno/abcde.html}
\bibitem{Cotlar-Stein lemma} Almost orthogonality
\texttt{https://hxypqr.wordpress.com/2017/12/18/almost-orthogonality/}
\bibitem{KAISA MATOMA 虉KI AND MAKSYM RADZIWILL} KAISA MATOMA 虉KI AND MAKSYM RADZIWIL, MULTIPLICATIVE FUNCTIONS IN SHORT INTERVALS.
\texttt{https://arxiv.org/abs/1501.04585v4/}.