alphaFeedback

You’re reading v1 — jump to latest

WorksMathematics

Large fluctuations of extended Rademacher random multiplicative functions

AI contributions
Not recorded for this paper
View details

Abstract

Let ff be an extended Rademacher random multiplicative function (RMF). We show that, for every fixed deterministic function V(x)V(x) tending to infinity, almost surely there are arbitrarily large xx for which ∑n≤xf(n)≥x(log⁡log⁡x)1/4V(x). \sum_{n\leq x}f(n) \geq \frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}. The corresponding negative fluctuation holds as well. In particular, this gives an affirmative answer to Erdős Problem~#1144. As a byproduct, our result has a direct corollary giving new almost sure lower bounds log⁡log⁡x\log\log x on the number of sign changes of partial sums up to xx for all sufficiently large xx.

Introduction

Main result

A Rademacher random completely multiplicative function f:N→{−1,1}f : \mathbb{N} \to\{-1,1\} is obtained by taking (f(p))p(f(p))_p to be independent Rademacher random variables and extending ff completely multiplicatively. Throughout the paper, we refer to this model as the extended Rademacher RMF. The more familiar Rademacher RMF is supported only on squarefree integers, and it goes back to Wintner [32], who introduced it as a probabilistic model for the Möbius function. Although it is clear nowadays that the Rademacher RMF does not capture much behavior of Möbius function, we believe that the extended Rademacher RMF is a good model to predict the typical behavior of Dirichlet quadratic characters. Write f(p)=ϵpf(p)=\epsilon_p and

Sf(x)=∑n≤xf(n).S_f(x)=\sum_{n \le x} f(n).

In this paper, our purpose is to prove a quantitative two-sided fluctuation result for Sf(x)S_f(x). One can distinguish this model from the Rademacher RMF g(n)g(n) supported on squarefree integers, by noting that g(n)=μ2(n)f(n)g(n)=\mu^2(n)f(n), where μ\mu is the Möbius function, so that g(n)=0g(n)=0 unless nn is squarefree. The distinction is substantial. The variables g(n)g(n), indexed by squarefree nn, has perfect orthogonality, whereas Ef(n)\mathbb{E}f(n) equals 11 when nn is a square and equals 00 otherwise; in particular, ESf(x)=⌊x⌋\mathbb{E}S_f(x)=\lfloor\sqrt{x}\rfloor. The two Dirichlet series are related by

∑n≥1f(n)ns=∏p(1−ϵpps)−1=ζ(2s)∏p(1+ϵpps),Re⁡s>1.(1)\sum_{n \ge1}\frac{f(n)}{n^s}=\prod_p\left(1-\frac{\epsilon_p}{p^s}\right)^{-1}=\zeta(2s)\prod_p\left(1+\frac{\epsilon_p}{p^s}\right),\qquad\operatorname{Re}s>1. \tag*{(1)}

Thus the completely multiplicative property introduces a zeta factor with a pole at s=1/2s=1/2. This pole is the analytic expression of the contribution from squares and can be a principal obstruction to transferring some results for gg directly to ff.

The study of the large fluctuations of the partial sums of RMFs has been very active. In the Rademacher case, Wintner [32] and Erdős [12] obtained some of the earliest results in

2020 Mathematics Subject Classification. Primary 11K65; Secondary 11N37, 60F15.

Key words and phrases: extended Rademacher random multiplicative functions, partial sums, multiplicative chaos, large fluctuations. this direction, and Halász [15] later obtained an important almost sure Ω\Omega-result. Harper [17] subsequently improved Halász’s result by means of Gaussian comparison. His later work proved that, for every deterministic function V(x)V(x) tending to infinity, almost surely there are arbitrarily large xx for which

∣∑n≤xg(n)∣≥x(log⁡log⁡x)1/4V(x).(2)\left|\sum_{n\le x} g(n)\right| \ge\frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}. \tag*{(2)}

He also proved the corresponding result for the Steinhaus RMF; see [20]. This was the first almost sure lower bound for the partial sums which exceeds x\sqrt{x} by a factor tending to infinity. The proof conditions on the values at the smaller primes and applies a multivariate Gaussian approximation to the contribution from the remaining large primes. Its main difficulty is to show that sufficiently many of the resulting conditional covariances are small. Although the theorem is stated in the absolute value form (1.2), in the Rademacher case the conditional symmetry of the large prime vector gives the corresponding large fluctuations of either sign.

Harper further suggested that the exponent 1/41/4 in (1.2) should be optimal. More precisely, the conjectured upper bound is that, for every ε>0\varepsilon> 0, almost surely

∑n≤xg(n)≪εx(log⁡log⁡x)1/4+ε.(3)\sum_{n\le x} g(n) \ll_{\varepsilon} \sqrt{x}(\log\log x)^{1/4+\varepsilon}. \tag*{(3)}

One heuristic for this exponent comes from the low moments of the partial sums. The results of Harper [19] show that their typical size is smaller than x\sqrt{x} by a factor of order (log⁡log⁡x)1/4(\log\log x)^{1/4}. Combining this with the usual log⁡log⁡x\sqrt{\log\log x} correction suggested by the law of the iterated logarithm leads precisely to the scale x(log⁡log⁡x)1/4\sqrt{x}(\log\log x)^{1/4}. The relevant low and high moment estimates for the underlying random Euler products are developed in [18, 19].

We give a quick summary of the substantial progress on the upper bounds: see, for example, [7, 9, 15, 26, 27] and the references therein. Very recently, Durkan and Pearce-Crump [10] obtained the matching upper bound

∑n≤xg(n)≪ε,gx(log⁡log⁡x)1/4+ε(4)\sum_{n\le x} g(n) \ll_{\varepsilon,g} \sqrt{x}(\log\log x)^{1/4+\varepsilon} \tag*{(4)}

almost surely.

They proved the same result for the Steinhaus RMF. Together with Harper’s lower bound, this determines the optimal iterated logarithmic exponent in both classical RMFs and settles Harper’s conjecture. In an independent work, Verreault [31] obtained the sharper estimate

∑n≤xg(n)≪ε,gx(log⁡2x)1/4log⁡3xlog⁡4x(log⁡5x)1/2+ε(5)\sum_{n\le x} g(n) \ll_{\varepsilon,g} \sqrt{x}(\log_2 x)^{1/4}\log_3 x\log_4 x(\log_5 x)^{1/2+\varepsilon} \tag*{(5)}

almost surely,

for both the Rademacher and Steinhaus RMFs, where log⁡k\log_k denotes the kk-fold iterated logarithm. We also note that in the weighted case, Atherfold [2] proved that almost surely

∑n≤xg(n)n≪(log⁡log⁡x)3/4+ε,\sum_{n\le x}\frac{g(n)}{\sqrt{n}} \ll(\log\log x)^{3/4+\varepsilon},

and obtained the sharper exponent 1/4+ε1/4+\varepsilon under the restriction P+(n)>xP^{+}(n)>\sqrt{x}. He conjectured that this exponent is optimal. He also showed that almost surely

Sf(x)≪x(log⁡x)1+εS_f(x)\ll\sqrt{x}(\log x)^{1+\varepsilon}

for extended Rademacher RMFs. See also the work by Hardy on the Steinhaus case [16].

It is in general the case that the three standard RMFs may exhibit different levels of difficulty and the Steinhaus case is usually the least technical among the three. So far, we in general know less in the Rademacher case, while the extended Rademacher RMF is arguably even more challenging. This is indeed the case in the fluctuation problem considered here. As we described before, large fluctuations in both the Rademacher and Steinhaus RMFs have been known since the work of Harper [20], whereas no corresponding result was previously available for the extended Rademacher RMF. In fact, even the weaker original question of Erdős remained open1. The formulation in the 1999 problem collection Some of Paul’s favorite problems asks whether lim sup⁡x→∞∣Sf(x)∣/x=+∞\limsup_{x\to\infty} |S_f(x)|/\sqrt{x}=+\infty almost surely, while the current online formulation, recorded as Erdős Problem #1144, asks the stronger one-sided question whether lim sup⁡x→∞Sf(x)/x=+∞\limsup_{x\to\infty} S_f(x)/\sqrt{x}=+\infty almost surely [8, 30]. Our main theorem gives a much stronger quantitative two-sided strengthening of both formulations.

Theorem 1.1. Let ff be an extended Rademacher RMF. Then for any fixed deterministic function V(x)→∞V(x)\to\infty, we have, almost surely

Sf(x)=Ω±(x(log⁡log⁡x)1/4V(x)).(6)S_f(x)=\Omega_{\pm}\left(\frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}\right). \tag*{(6)}

Here A(x)=Ω±(B(x))A(x)=\Omega_{\pm}(B(x)) means that lim sup⁡x→∞A(x)/B(x)>0\limsup_{x\to\infty} A(x)/B(x)>0 and lim inf⁡x→∞A(x)/B(x)<0\liminf_{x\to\infty} A(x)/B(x)<0 for an eventually positive function B(x)B(x).

In particular, the positive limsup assertion implies lim sup⁡x→∞Sf(x)/x=+∞\limsup_{x\to\infty} S_f(x)/\sqrt{x}=+\infty, answering Erdős Problem #1144 affirmatively in the stronger form.

Remark 1.2. It is worth pointing out that our argument may work for a more general model than the extended Rademacher RMF considered here. What is essentially used is the Euler product factorisation

∑n≥1P+(n)≤Xf(n)ns=FX(s)ZX(2s)RX(s),\sum_{\substack{n\geq1\\P^{+}(n)\leq X}}\frac{f(n)}{n^s}=F_X(s)Z_X(2s)R_X(s),

where FX(s)=∏p≤X(1+εpp−s)F_X(s)=\prod_{p\leq X}(1+\varepsilon_p p^{-s}) is the squarefree Rademacher Euler product, ZX(s)=∏p≤X(1−p−s)−1Z_X(s)=\prod_{p\leq X}(1-p^{-s})^{-1} and RXR_X is a “well-behaved” factor (in our case RX(s)≡1R_X(s)\equiv1). Under some suitable moment and regularity assumptions on RXR_X, the same argument applies more generally. For instance, the mm-free extended Rademacher RMF has factorisation

FX(s)ZX(2s)∏p≤X(1−εpmp−ms).F_X(s)Z_X(2s)\prod_{p\leq X}(1-\varepsilon_p^m p^{-ms}).

For m≥3m\geq3 the last product is regular on ℜs=1/2\Re s=1/2, whereas for m=2m=2 it cancels ZX(2s)Z_X(2s) completely, giving the usual Rademacher RMF. Actually, by combining Harper [20]’s original argument with our conditional symmetry observation used in Section 8, one can obtain the Rademacher RMF analogues of Theorems 1.1 and 1.4.

Another related family is obtained by taking f(p)f(p) uniformly among the kk-th roots of unity and extending completely multiplicatively. Its Euler product decomposition contains the deterministic factor ZX(ks)Z_X(ks). Thus k=2k=2 is the critical case in which the associated zeta singularity occurs at s=1/2s=1/2, while for k≥3k\geq3 it lies to the left of the critical line; as k→∞k\to\infty, the uniform distribution on the kk-th roots of unity converges weakly to the uniform distribution on the unit circle, corresponding to the Steinhaus RMF. We do not pursue the details of these extensions here.

Remark 1.3. We also remark that our bound should be sharp up to (log⁡log⁡x)o(1)(\log\log x)^{o(1)}. One might be able to prove the corresponding upper bound by combining some techniques here and arguments of Caich [9] with the recent developments [10, 31].

It is worth noting that, very recently, Atherfold, Gerspach and Hamdan [3] announced their results on low moments of extended Rademacher RMFs. They show that the typical size can behave very differently with the additional completely multiplicative property, compared with the usual Rademacher case. While our result shows that its influence on large fluctuations is more limited.

Following the general strategy of Harper [20], we first prove a conditional fluctuation estimate for X8/7≤x≤X4/3X^{8/7} \le x \le X^{4/3}. For X≥3X \ge3 let

FX=σ(f(p):p≤X),PX(⋅)=P(⋅∣FX).\mathcal{F}_X = \sigma(f(p) : p \le X), \qquad\mathbb{P}_X(\cdot) = \mathbb{P}(\cdot\mid\mathcal{F}_X).

Thus FX\mathcal{F}_X records the small prime variables, while conditional on FX\mathcal{F}_X the variables (f(p))p>X(f(p))_{p>X} remain independent Rademacher variables. Using the conditional Borel–Cantelli lemma (see Lemma 2.2 below), Theorem 1.1 follows from the following result.

Theorem 1.4. Let ff be an extended Rademacher RMF. There is an absolute constant W0>0W_0 > 0 such that for all sufficiently large XX and all W0≤W≤130log⁡log⁡log⁡XW_0 \le W \le\frac{1}{30}\log\log\log X, we have

References

  1. [1]Rodrigo Angelo and Max Wenqiang Xu. Oscillations of random multiplicative functions under initial bias. arXiv:2411.14447, 2026. URL https://arxiv.org/abs/2411.14447.
  2. [2]Christopher Atherfold. Almost sure bounds for weighted sums of Rademacher random multiplicative functions. arXiv:2501.11076, 2025. URL https://arxiv.org/abs/2501.11076.
  3. [3]Christopher Atherfold, Maxim Gerspach, and Jad Hamdan. Low moments of extended Rademacher random multiplicative functions. In preparation, 2026.
  4. [4]Marco Aymone. Sign changes of the partial sums of a random multiplicative function II. C. R. Math., 362(G8):895–901, 2024. doi: 10.5802/crmath.615.DOI
  5. [5]Marco Aymone. Sign changes of the partial sums of a random multiplicative function III: Average. Bull. Soc. Math. France, 153(4):1003–1013, 2025. doi: 10.24033/bsmf. 2915.
  6. [6]Marco Aymone, Winston Heap, and Jing Zhao. Sign changes of the partial sums of a random multiplicative function. Bull. Lond. Math. Soc., 55(1):78–89, 2023. doi: 10.1112/blms.12710.DOI
  7. [7]Joseph Basquin. Sommes friables de fonctions multiplicatives aléatoires. Acta Arith., 152(3):243–266, 2012. doi: 10.4064/aa152-3-2.DOI
  8. [8]Thomas F. Bloom. Erdős problem #1144, 2026. URL https://www.erdosproblems.com/1144. Accessed 6 September 2026.
  9. [9]Rachid Caich. Almost sure upper bound for random multiplicative functions. arXiv:2304.00943, 2023. URL https://arxiv.org/abs/2304.00943.
  10. [10]Benjamin Durkan and Andrew Pearce-Crump. A sharp almost sure upper bound for partial sums of random multiplicative functions. arXiv:2607.29429, 2026. URL https://arxiv.org/abs/2607.29429.
  11. [11]Rick Durrett. Probability: Theory and Examples, volume 49 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 5th edition, 2019.
  12. [12]Paul Erdős. Some applications of probability methods to number theory. In Proceedings of the 4th Pannonian Symposium on Mathematical Statistics, pages 1–18, Bad Tatzmannsdorf, Austria, 1985. Reidel. Mathematical Statistics and Applications, Vol. B; symposium held in 1983.DOI
  13. [13]Nick Geis and Ghaith Hiary. Counting sign changes of partial sums of random multiplicative functions. Q. J. Math., 76(1):19–45, 2025. doi: 10.1093/qmath/haae061.DOI
  14. [14]Maxim Gerspach. Low pseudomoments of the riemann zeta function and its powers. International Mathematics Research Notices, 2022(1):625–664, 2022. doi: 10.1093/imrn/rnaa159.
  15. [15]Gábor Halász. On random multiplicative functions. In Hubert Delange Colloquium (Orsay, 1982), volume 83 of Publ. Math. Orsay, pages 74–96. Univ. Paris XI, Orsay, 1983.
  16. [16]Seth Hardy. Almost sure bounds for a weighted Steinhaus random multiplicative function. J. Lond. Math. Soc. (2), 110(3):e12979, 2024. doi: 10.1112/jlms.12979.DOI
  17. [17]Adam J. Harper. Bounds on the suprema of Gaussian processes, and omega results for the sum of a random multiplicative function. Ann. Appl. Probab., 23(2):584–616, 2013. doi: 10.1214/12-AAP847.DOI
  18. [18]Adam J. Harper. Moments of random multiplicative functions, II: high moments. Algebra Number Theory, 13(10):2277–2321, 2019. doi: 10.2140/ant.2019.13.2277.DOI
  19. [19]Adam J. Harper. Moments of random multiplicative functions, I: low moments, better than squareroot cancellation, and critical multiplicative chaos. Forum Math. Pi, 8:e1, 2020. doi: 10.1017/fmp.2019.7.DOI
  20. [20]Adam J. Harper. Almost sure large fluctuations of random multiplicative functions. Int. Math. Res. Not. IMRN, 2023(3):2095–2138, 2023. doi: 10.1093/imrn/rnab299.
  21. [21]Adam J. Harper, Kannan Soundararajan, and Max Wenqiang Xu. Distribution of random multiplicative functions in short intervals, with proper normalization. arXiv:2606.29040, 2026. URL https://arxiv.org/abs/2606.29040.
  22. [22]Sigurd Høy stad. Erdős problem #1144: A lean 4 proof of almost-sure positive un-boundedness. https://github.com/saasom/Erdos1144, September 2026. Released September 6, 2026.
  23. [23]Martin N. Huxley. On the difference between consecutive primes. Invent. Math., 15:164–170, 1972. doi: 10.1007/BF01418933.DOI
  24. [24]Oleksiy Klurman, Youness Lamzouri, and Marc Munsch. Sign changes of short character sums and real zeros of Fekete polynomials. arXiv:2403.02195, 2024. URL https://arxiv.org/abs/2403.02195v2. Version 2.
  25. [25]Petr Kucheriaviy. Positivity of partial sums of a random multiplicative function and corresponding problems for the Legendre symbol. 2025. Preprint available at arxiv.org/abs/2510.25691.arxiv.org/abs/2510.25691
  26. [26]Yuk-Kam Lau, Gérald Tenenbaum, and Jie Wu. On mean values of random multiplicative functions. Proc. Amer. Math. Soc., 141(2):409–420, 2013. doi: 10.1090/S0002-9939-2012-11332-2.DOI
  27. [27]Daniele Mastros tefano. An almost sure upper bound for random multiplicative functions on integers with a large prime factor. Electron. J. Probab., 27:Paper No. 32, 21 pp., 2022. doi: 10.1214/22-EJP751.DOI
  28. [28]Hugh L. Montgomery and Robert C. Vaughan. Multiplicative Number Theory I: Classical Theory, volume 97 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2007.
  29. [29]Kannan Soundararajan. Nonvanishing of quadratic dirichlet L-functions at s = 1/2. Ann. of Math. (2), 152(2):447–488, 2000. doi: 10.2307/2661390.DOI
  30. [30]Various. Some of Paul’s favorite problems, 1999. URL https://web.math.pmf.unizg.hr/~vjekovac/EP/Some_of_Pauls_favorite_problems.pdf. Booklet produced for the conference “Paul Erdős and his mathematics”, Budapest, July 1999; see Problem 1.11.
  31. [31]William Verreault. Almost sure upper bound for sums of random multiplicative functions and critical chaos. arXiv:2608.21354, 2026. URL https://arxiv.org/abs/2608.21354.
  32. [32]Aurel Wintner. Random factorizations and Riemann’s hypothesis. Duke Math. J., 11(2):267–275, 1944. doi: 10.1215/S0012-7094-44-01122-1.DOI

Paper details

vlnc:W_75uferyw

published ·

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents