In this article, Liouville function will be addressed from different perspectives, with the aim of providing a complete and detailed view of this topic. Its origins, its development over time, as well as its implications in today's society will be analyzed. In addition, different opinions and points of view will be presented that will allow the reader to form a clear and objective idea. Through a rigorous and critical approach, the aim is to offer a global vision that invites reflection and debate. Liouville function is a highly relevant topic that deserves to be studied and understood in its entirety, which is why this article is proposed as a fundamental tool for those interested in deepening its understanding.
where are primes and the exponents are positive integers. The prime omega function counts the number of primes in the factorization of with multiplicity:
The Dirichlet inverse of the Liouville function is the absolute value of the Möbius function, , the characteristic function of the squarefree integers.
Summatory Liouville function L(n) up to n = 104. The readily visible oscillations are due to the first non-trivial zero of the Riemann zeta function.Summatory Liouville function L(n) up to n = 107. Note the apparent scale invariance of the oscillations.Logarithmic graph of the negative of the summatory Liouville function L(n) up to n = 2 × 109. The green spike shows the function itself (not its negative) in the narrow region where the Pólya conjecture fails; the blue curve shows the oscillatory contribution of the first Riemann zero.Harmonic Summatory Liouville function T(n) up to n = 103
the problem asks whether for some n > 1. The answer turns out to be yes. The smallest counter-example is n = 906150257, found by Minoru Tanaka in 1980. It has since been shown that L(n) > 0.0618672√n for infinitely many positive integers n,[1] while it can also be shown via the same methods that L(n) < −1.3892783√n for infinitely many positive integers n.[2]
For any , assuming the Riemann hypothesis, we have that the summatory function is bounded by
It was open for some time whether T(n) ≥ 0 for sufficiently big n ≥ n0 (this conjecture is occasionally—though incorrectly—attributed to Pál Turán). This was then disproved by Haselgrove (1958), who showed that T(n) takes negative values infinitely often. A confirmation of this positivity conjecture would have led to a proof of the Riemann hypothesis, as was shown by Pál Turán.
Generalizations
More generally, we can consider the weighted summatory functions over the Liouville function defined for any as follows for positive integers x where (as above) we have the special cases and [2]
These -weighted summatory functions are related to the Mertens function, or weighted summatory functions of the Möbius function. In fact, we have that the so-termed non-weighted, or ordinary, function precisely corresponds to the sum
Moreover, these functions satisfy similar bounding asymptotic relations.[2] For example, whenever , we see that there exists an absolute constant such that
which then can be inverted via the inverse transform to show that for , and
where we can take , and with the remainder terms defined such that and as .
In particular, if we assume that the Riemann hypothesis (RH) is true and that all of the non-trivial zeros, denoted by , of the Riemann zeta function are simple, then for any and there exists an infinite sequence of which satisfies that for all v such that
where for any increasingly small we define
and where the remainder term
which of course tends to 0 as . These exact analytic formula expansions again share similar properties to those corresponding to the weighted Mertens function cases. Additionally, since we have another similarity in the form of to insomuch as the dominant leading term in the previous formulas predicts a negative bias in the values of these functions over the positive natural numbers x.