The Arithmetic Ceiling: How Sum-of-Divisors Functions Bound the Riemann Hypothesis

Download Full Article

This article is available as a downloadable PDF with complete code listings and syntax highlighting.

Introduction

The Riemann Hypothesis (RH) is traditionally framed within the context of complex analysis and spectral theory, yet a profound and parallel discourse exists within elementary number theory. This discourse translates the analytic properties of the Riemann zeta function into concrete inequalities involving arithmetic functions. The source paper hal-04299243 represents a pivotal refinement of this translation, specifically focusing on the behavior of the sum-of-divisors function and its relationship to the distribution of prime numbers.

The specific problem addressed in this analysis is the Robin Criterion, an equivalence for the Riemann Hypothesis established by Guy Robin in 1984. Robin proved that the Riemann Hypothesis is true if and only if the inequality sigma(n) < e^gamma * n * log(log(n)) holds for all n > 5040, where gamma is the Euler-Mascheroni constant. The work in hal-04299243 extends this by examining primorials and extremely abundant numbers, providing a sharper lens through which the transition from the critical line to the integers can be viewed.

Mathematical Background

To understand the implications of hal-04299243, we must first define the primary mathematical objects. The sum-of-divisors function, sigma(n), is the sum of all positive divisors of n. For a prime power p^a, sigma(p^a) is calculated as (p^(a+1) - 1) / (p - 1). Because sigma is a multiplicative function, it can be computed across the prime factorization of any integer.

The connection to the zeta function arises through the Euler product formula. As the complex variable s approaches 1 from the right, the behavior of the zeta function is intimately linked to the distribution of primes via Mertens' Third Theorem. In hal-04299243, the focus is on the function f(n) = sigma(n) / (n * log(log(n))). The paper utilizes the properties of primorial numbers, which are the products of the first k primes. These numbers are highly composite in a sense that maximizes the value of sigma(n) relative to the size of n.

Main Technical Analysis

The Primorial Bound and Nicolas's Theorem

The core of the analysis revolves around the comparison between general integers and primorials. Nicolas identifies that the "worst-case" candidates for violating the Robin bound are the primorials. The Riemann Hypothesis is equivalent to the assertion that for all k > 1, the Robin inequality holds specifically for these primorial structures.

The source paper hal-04299243 analyzes the error term in Mertens' theorem. The fluctuations in the sum of reciprocal primes are governed by the Chebyshev function. Specifically, the difference between the Chebyshev function and the linear x-term is what determines if the ratio exceeds the e^gamma threshold. If the Riemann Hypothesis were false, the resulting oscillations in prime density would eventually push the sum-of-divisors ratio above the permitted ceiling.

Oscillatory Behavior and the Critical Line

A major technical contribution is the mapping of the zeta zeros to the oscillations of sigma(n). According to the explicit formula of prime number theory, if the Riemann Hypothesis is true, the sum over zeros is dominated by the square root of x, leading to small, controlled oscillations. However, if a zero exists off the critical line, it would create an oscillation of greater magnitude. Nicolas demonstrates that such an oscillation would eventually push the value of sigma(n) above the log(log(n)) threshold.

The paper evaluates the Nicolas function, which relates the product of (1 - 1/p) to the logarithm of the Chebyshev function. The Riemann Hypothesis is shown to be equivalent to this function remaining greater than 1 for all x. This transforms a problem of complex analysis into a study of the lower bounds of arithmetic products.

Novel Research Pathways

Generalized Robin Criteria for L-functions: A promising direction is the formulation of a Robin-style inequality for Dirichlet L-functions. By defining a generalized sum-of-divisors function, one could find arithmetic criteria that verify the Generalized Riemann Hypothesis without complex integration.
The Nicolas Gap and High-Precision Oscillations: Investigating the gap between e^gamma and the primorial ratio using the explicit formula could link the positivity of this gap to the Li criterion, potentially leading to a new proof of RH if the gap remains bounded away from zero.
Arithmetic Dynamics of Abundant Numbers: Defining a transformation that maps an integer to the next "extremely abundant" number allows for the study of the ratio's evolution as a dynamical system, characterizing the density of potential counterexamples.

Computational Implementation

The following Wolfram Language code implements the analysis of the Robin ratio for primorial numbers, comparing it against the e^gamma bound as discussed in hal-04299243.

Module[{maxK, primorials, robinRatios, eGamma},
  maxK = 200; 
  eGamma = Exp[EulerGamma];
  
  (* Generate the first maxK primorials *)
  primorials = Table[Product[Prime[i], {i, 1, k}], {k, 1, maxK}];
  
  (* Calculate the ratio f(N_k) = sigma(N_k) / (N_k * log(log(N_k))) *)
  robinRatios = Table[
    {k, DivisorSigma[1, primorials[[k]]] / (primorials[[k]] * Log[Log[primorials[[k]]]])},
    {k, 3, maxK}
  ];
  
  (* Visualize the results against the e^gamma constant *)
  ListLinePlot[{robinRatios, Table[{k, eGamma}, {k, 3, maxK}]},
    PlotRange -> All,
    PlotStyle -> {Blue, {Red, Dashed}},
    PlotLegends -> {"f(N_k)", "Exp[gamma]"},
    AxesLabel -> {"k (Prime Index)", "Ratio"},
    PlotLabel -> "Robin Ratio for Primorials vs. Riemann Bound"
  ]
]

Conclusions

The research in hal-04299243 reinforces the connection between the distribution of primes and the growth of the sum-of-divisors function. By focusing on primorials, the paper provides a concrete arithmetic framework for the Riemann Hypothesis, moving the problem from abstract complex zeros to tangible integer inequalities. The most promising avenue for further research lies in the refinement of error terms in Mertens' product formula, as the validity of the Robin criterion is essentially a question of the magnitude of oscillations in prime density. Future steps should involve high-precision computational verification of the Nicolas gap for extremely large primorial indices.

References

Source Paper: hal-04299243

Robin, G. (1984). Grandes valeurs de la fonction somme des diviseurs et hypothese de Riemann.
Gronwall, T. H. (1913). Some asymptotic expressions in the theory of numbers.
Lagarias, J. C. (2002). An elementary problem equivalent to the Riemann Hypothesis.