betaFeedback

WorksMathematics

Two almost sure upper bounds for sums of random multiplicative functions

Abstract

Let f,gf,g be a squarefree and extended Rademacher random multiplicative functions, respectively. We prove that, for every ε>0\varepsilon>0, almost surely ∣∑n≤xf(n)n∣≪(log⁡log⁡x)1/4+ε,∣∑n≤xg(n)∣≪x(log⁡log⁡x)1/4+ε.\big|\sum_{n \le x}\frac{f(n)}{\sqrt{n}}\big| \ll (\log\log x)^{1/4+\varepsilon}, \qquad \big|\sum_{n\le x}g(n)\big|\ll\sqrt{x}(\log\log x)^{1/4+\varepsilon}. We also show that almost surely, there exist arbitrarily large values of xx such that ∑n≤xf(n)n≫(log⁡log⁡x)1/4+o(1)\sum_{n \le x}\frac{f(n)}{\sqrt{n}} \gg (\log\log x)^{1/4+o(1)}. We follow Caich and Durkan and Pearce-Crump by using a version of the Azuma–Hoeffding inequality for martingale difference sequences.

Introduction

Motivation and Results

Let f(n)f(n) be a Rademacher random multiplicative function, so we consider the sequence (f(p))(f(p)) to be a sequence of independent identically distributed Rademacher random variables on {±1}\{\pm1\} and extend these multiplicatively to all squarefree natural numbers, and set f(n)=0f(n)=0 otherwise. We also define g(n)g(n) to be an extended Rademacher random multiplicative function if instead the f(p)f(p) are extended completely multiplicatively to all natural numbers instead (note f(n)=g(n)f(n)=g(n) when nn is squarefree). We denote E\mathbb{E} as the expectation taken over all possible realisations of ff (which are determined purely by the values of f(p)f(p)).

In this paper we are concerned with upper bounds of the large fluctuations of the partial sums

∑n≤xf(n)n,∑n≤xg(n).\sum_{n\le x}\frac{f(n)}{\sqrt{n}}, \qquad\sum_{n\le x}g(n).

The Rademacher random multiplicative function was proposed by Wintner [Win44] as a random model for the Möbius function, with further developments due to Halász in [10] and Lau–Tenenbaum–Wu [16]. The recent developments in this area have been spearheaded by Harper, in particular the striking resolution of Helson’s conjecture in [14], which showed that

E∣∑n≤xf(n)∣≍x(log⁡log⁡x)1/4.\mathbb{E}\left|\sum_{n\le x}f(n)\right| \asymp\frac{\sqrt{x}}{(\log\log x)^{1/4}}.

through a connection to critical Gaussian multiplicative chaos. In particular, such sums have very heavy tails and are not distributed in a Gaussian sense. Despite these heavy tails, Harper proved in [15] that for function V(x)→∞V(x)\to\infty that there almost surely exist arbitrarily large values of xx such that

∣∑n≤xf(n)∣≥x(log⁡log⁡x)1/4V(x)\left|\sum_{n\le x} f(n)\right| \ge\frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}

showing that for large fluctuations, the Gaussian heuristic was not too far from the truth. There has been significant progress made on the upper bounds of the large fluctuations as well recently. Caich proved in [5] that for any ε>0\varepsilon>0, then almost surely

∑n≤xf(n)≪x(log⁡log⁡x)3/4+ε\sum_{n\le x} f(n) \ll\sqrt{x}(\log\log x)^{3/4+\varepsilon}

Following Caich’s method, Durkan and Pearce-Crump refined this to 1/4+ε1/4+\varepsilon in [6], and the state of the art is due to Verreault in [21], where he shows that for any ε>0\varepsilon>0, then almost surely

∑n≤xf(n)≪x(log⁡log⁡x)1/4(log⁡log⁡log⁡x)1+ε.\sum_{n\le x} f(n) \ll\sqrt{x}(\log\log x)^{1/4}(\log\log\log x)^{1+\varepsilon}.

Verreault’s method is adapted far more closely to the multiplicative chaos object connected to the sum, whereas Caich’s method only requires a sufficiently strong bound on the low fractional moments of integrals involving random Euler products.

Weighted Rademacher and extended Rademacher expressions have been significantly less explored until recently in their moment and large fluctuation statistics. The author with Gerspach and Hamdan proved in [1] that one has both

E∣∑n≤xg(n)∣2q≍(xlog⁡log⁡x)q,E∣∑n≤xg(n)∣≍x(log⁡log⁡x)3/4\mathbb{E}\left|\sum_{n\le x}g(n)\right|^{2q}\asymp\left(\frac{x}{\sqrt{\log\log x}}\right)^q,\qquad\mathbb{E}\left|\sum_{n\le x}g(n)\right|\asymp\sqrt{x}(\log\log x)^{3/4}

where q∈(0,1/2)q\in(0,1/2) fixed (with similar results obtained in the weighted case). This is rather surprising given that from the contributions of the square numbers alone, one has expectation E[∑n≤xg(n)]=⌊x⌋\mathbb{E}\left[\sum_{n\le x}g(n)\right]=\lfloor\sqrt{x}\rfloor. We note that the weighted Steinhaus sums were studied in the work of Gerspach for moments [Ger22] and Hardy for large fluctuations [Har24] respectively. Separately, Gou–Xu [8] (and independently Hardy–Klurman [12]) proved that for any V(x)→∞V(x)\to\infty, there exist arbitrarily large values of xx such that

∑n≤xg(n)≥x(log⁡log⁡x)1/4V(x).\sum_{n\le x}g(n)\ge\frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}.

In this paper, we show that the exponent of 1/41/4 obtained in [8] and [12] is sharp.

Theorem 1. Let gg be an extended Rademacher random multiplicative function. Then for any ε>0\varepsilon>0, almost surely

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

By a very similar method, one can prove the following theorem.

Theorem 2. Let ff be a squarefree Rademacher random multiplicative function. Then for any ε>0\varepsilon>0, almost surely

∑n≤xf(n)n≪(log⁡log⁡x)1/4+ε.\sum_{n\le x}\frac{f(n)}{\sqrt{n}}\ll(\log\log x)^{1/4+\varepsilon}.

We also have an immediate corollary of Theorem 1 in [15] for existence of large values in the weighted Rademacher sum.

Theorem 3. Let ff be a squarefree Rademacher random multiplicative function. Then for any V(x)→∞V(x)\to\infty, there almost surely exist arbitrarily large xx such that

∣∑n≤xf(n)n∣≥(log⁡log⁡x)1/4V(x).\left|\sum_{n\le x}\frac{f(n)}{\sqrt{n}}\right|\ge\frac{(\log\log x)^{1/4}}{V(x)}.

Proof. This is almost immediate. Indeed, we have

1N∑n≤Nf(n)=∑n≤Nf(n)n−∑n≤N−1n+1−nN(∑m≤nf(m)m).\frac{1}{\sqrt{N}}\sum_{n\le N}f(n)=\sum_{n\le N}\frac{f(n)}{\sqrt{n}}-\sum_{n\le N-1}\frac{\sqrt{n+1}-\sqrt{n}}{\sqrt{N}}\left(\sum_{m\le n}\frac{f(m)}{\sqrt{m}}\right).

Noting that n+1−n\sqrt{n+1}-\sqrt{n} is positive and provides a telescoping sum, we can take absolute values on both sides, and apply the triangle inequality and take the maximum value of the weighted sum. Consequently, we have

∣1N∑n≤Nf(n)∣≤max⁡n≤N∣∑m≤nf(m)m∣(1+∑n=1N−1n+1−nN)≤2max⁡n≤N∣∑m≤nf(m)m∣.\left|\frac{1}{\sqrt{N}}\sum_{n\le N}f(n)\right|\le\max_{n\le N}\left|\sum_{m\le n}\frac{f(m)}{\sqrt{m}}\right|\left(1+\sum_{n=1}^{N-1}\frac{\sqrt{n+1}-\sqrt{n}}{\sqrt{N}}\right)\le2\max_{n\le N}\left|\sum_{m\le n}\frac{f(m)}{\sqrt{m}}\right|.

Applying Harper’s Theorem 1 in [15] with U(x)=V(x)/2U(x)=V(x)/2 yields the result. □

Using our upper bounds, we obtain the following using Theorem 1 in [8] and Theorem 3.

Corollary 1. Suppose gg is an extended Rademacher random multiplicative function. Then almost surely

lim sup⁡x→∞log⁡(1+∣∑n≤xg(n)∣)log⁡log⁡log⁡x=14.\limsup_{x\to\infty}\frac{\log\left(1+\left|\sum_{n\le x}g(n)\right|\right)}{\log\log\log x}=\frac{1}{4}.

Similarly, if ff is a squarefree Rademacher random multiplicative function, then almost surely

lim sup⁡x→∞log⁡(1+∣∑n≤xf(n)n∣)log⁡log⁡log⁡x=14.\limsup_{x\to\infty}\frac{\log\left(1+\left|\sum_{n\le x}\frac{f(n)}{\sqrt{n}}\right|\right)}{\log\log\log x}=\frac{1}{4}.

Proof. The upper bound is provided by Theorem 1. As for the lower bound, choosing V(x)=(log⁡log⁡x)δV(x)=(\log\log x)^\delta for δ∈(0,1/4)\delta\in(0,1/4) in [8] Theorem 1.1 shows that almost surely, there exist arbitrarily large xx such that

∣∑n≤xg(n)∣x≥(log⁡log⁡x)1/4−δ.\frac{\left|\sum_{n\le x}g(n)\right|}{\sqrt{x}}\ge(\log\log x)^{1/4-\delta}.

Taking δ\delta through the countable sequence 2−n−22^{-n-2} yields the corollary. An identical argument follows in the weighted Rademacher case, replacing the upper and lower bound inputs accordingly. □

Our second corollary follows from combining Theorems 1 and 2 to obtain another large fluctuation result. To see this, we have the following identity

References

  1. [1][AGH26] Christopher Atherfold, Maxim Gerspach, and Jad Hamdan. Low moments of sums of extended Rademacher random multiplicative functions. 2026. arXiv: 2611 . 05492 [math.NT]. URL: https://arxiv.org/abs/2611.05492.
  2. [2][Bas12] Joseph Basquin. “Sommes friables de fonctions multiplicatives aléatoires”. In: Acta Arithmetica 152 (2012), pp. 243–266.arxiv.org/abs/1712.02147
  3. [3]Jacques Benatar, Alon Nishry, and Brad Rodgers. “Moments of polynomials with random multiplicative coefficients”. In: Mathematika 68.1 (2022), pp. 191–216.DOI
  4. [4]Aline Bonami. “Étude des coefficients de Fourier des fonctions de Lp(G)”. In: Annales de l’Institut Fourier. Vol. 20. 2. 1970, pp. 335–402.
  5. [5]Rachid Caich. “Almost sure upper bound for random multiplicative functions”. In: Acta Arithmetica 224.4 (2026), pp. 297–325. DOI: 10.4064/aa250225-20-2.DOI
  6. [6]Benjamin Durkan and Andrew Pearce-Crump. “A sharp almost sure upper bound for partial sums of random multiplicative functions”. In: arXiv preprint arXiv:2607.29429 (2026).arxiv.org/abs/2607.29429
  7. [8]Haozhe Gou and Max Wenqiang Xu. Large fluctuations of extended Rademacher random multiplicative functions. 2026. arXiv: 2609.12940 [math.NT].arxiv.org/abs/2609.12940
  8. [9]Allan Gut. Probability: a graduate course. Vol. 200. 5. Springer, 2006.
  9. [10]Gábor Halász. “On random multiplicative functions”. In: Publ. Math. Orsay 83.4 (1983), pp. 74–96.
  10. [12]Seth Hardy and Oleksiy Klurman. Private communication.
  11. [13]Adam J. Harper. “Moments of random multiplicative functions, II: High moments”. In: Algebra & Number Theory 13.10 (2019), pp. 2277–2321.DOI
  12. [14]Adam J. Harper. “Moments of random multiplicative functions, I: Low moments, better than squareroot cancellation, and critical multiplicative chaos”. In: Forum of Mathematics, Pi. Vol. 8. Cambridge University Press. 2020, e1.arxiv.org/abs/1703.06654
  13. [15]Adam J. Harper. “Almost sure large fluctuations of random multiplicative functions”. In: International Mathematics Research Notices 2023.3 (2023), pp. 2095–2138.
  14. [16]Yuk-Kam Lau, Gérald Tenenbaum, and Jie Wu. “On mean values of random multiplicative functions”. In: Proceedings of the American Mathematical Society 141.2 (2013), pp. 409–420.DOI
  15. [17]Daniele Mastrostefano. “An almost sure upper bound for random multiplicative functions on integers with a large prime factor”. In: Electronic Journal of Probability 27 (2022).arxiv.org/abs/2105.09565
  16. [18]Hugh L Montgomery and Robert C Vaughan. Multiplicative number theory I: Classical theory. 97. Cambridge University Press, 2007.
  17. [19]Peter Shiu. “A Brun–Titchmarsh theorem for multiplicative functions”. In: J. Reine Angew. Math. 313 (1980), pp. 161–170.DOI
  18. [21]William Verreault. Almost sure upper bound for sums of random multiplicative functions and critical chaos. 2026. arXiv: 2608.21354 [math.NT].arxiv.org/abs/2608.21354

Paper details

vlnc:W_4uv38uwt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

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

  • Mathematics

GPT-6 Astra (bare)

View statement
Looking for related papers…
Contents