Open main menu

The Liouville function, denoted by λ(n) and named after Joseph Liouville, is an important function in number theory.

If n is a positive integer, then λ(n) is defined as:

where Ω(n) is the number of prime factors of n, counted with multiplicity (sequence A008836 in the OEIS). If n is squarefree, i.e., if where is prime for all i and where , then we have the following alternate formula for the function expressed in terms of the Moebius function and the distinct prime factor counting function :

λ is completely multiplicative since Ω(n) is completely additive, i.e.: Ω(ab) = Ω(a) + Ω(b). The number 1 has no prime factors, so Ω(1) = 0 and therefore λ(1) = 1. The Liouville function satisfies the identity:

The Dirichlet inverse of Liouville function is the absolute value of the Möbius function, which is equivalently the characteristic function of the squarefree integers. We also have that , and that for all natural numbers n:

Contents

SeriesEdit

The Dirichlet series for the Liouville function is related to the Riemann zeta function by

 

The Lambert series for the Liouville function is

 

where   is the Jacobi theta function.

Conjectures on weighted summatory functionsEdit

 
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 Pólya conjecture is a conjecture made by George Pólya in 1919. Defining

  (sequence A002819 in the OEIS),

the conjecture states that   for n > 1. This turned out to be false. The smallest counter-example is n = 906150257, found by Minoru Tanaka in 1980. It has since been shown that L(n) > 0.0618672n for infinitely many positive integers n,[1] while it can also be shown via the same methods that L(n) < -1.3892783n for infinitely many positive integers n.[2]

For any  , assuming the Riemann hypothesis, we have that the summatory function   is bounded by

 

where the   is some absolute limiting constant [3].

Define the related sum

 

It was open for some time whether T(n) ≥ 0 for sufficiently big nn0 (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.

GeneralizationsEdit

More generally, we can consider the weighted summatory functions over the Lioville function defined for any   as follows for positive integers x where (as above) we have the special cases   and   [3]

 

These  -weighted summatory functions are related to the Mertens function, or weighted summatory functions of the Moebius function. In fact, we have that the so-termed non-weigthed, or ordinary function   precisely corresponds to the sum

 

Moreover, as noted in [3] these functions satisfy similar bounding asymptotic relations. For example, whenever  , we see that there exists an absolute constant   such that

 

By an application of Perron's formula, or equivalently by a key (inverse) Mellin transform, we have 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   in so much 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.

ReferencesEdit

  1. ^ P. Borwein, R. Ferguson, and M. J. Mossinghoff, Sign Changes in Sums of the Liouville Function, Mathematics of Computation 77 (2008), no. 263, 1681–1694.
  2. ^ Peter Humphries, The distribution of weighted sums of the Liouville function and Pólya’s conjecture, Journal of Number Theory 133 (2013), 545–582.
  3. ^ a b c Humphries, Peter (2013). "The distribution of weighted sums of the Liouville function and Pólyaʼs conjecture". Journal of Number Theory. 133 (2): 545–582. arXiv:1108.1524. doi:10.1016/j.jnt.2012.08.011.