Liouville function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In number theory, the Liouville function, named after French mathematician Joseph Liouville and denoted λ(n), is an important arithmetic function. Its value is 1 if n is the product of an even number of prime numbers, and 1 if it is the product of an odd number of prime numbers.

Definition

[edit | edit source]

By the fundamental theorem of arithmetic, any positive integer n can be represented uniquely as a product of powers of primes:

n=p1a1pkak,

where p1,,pk are primes and the exponents a1,,ak are positive integers. The prime omega function Ω(n) counts the number of primes in the factorization of n with multiplicity:

Ω(n)=a1+a2++ak.

Thus, the Liouville function is defined by

λ(n)=(1)Ω(n)

(sequence A008836 in the OEIS).

Properties

[edit | edit source]

Since Ω(n) is completely additive; i.e., Ω(ab)=Ω(a)+Ω(b), then λ(n) is completely multiplicative. Since 1 has no prime factors, Ω(1)=0, so λ(1)=1.

λ(n) is also related to the Möbius function μ(n): if we write n as n=a2b, where b is squarefree, then

λ(n)=μ(b).

The sum of the Liouville function over the divisors of n is the characteristic function of the squares:

d|nλ(d)={1if n is a perfect square,0otherwise.

Möbius inversion of this formula yields

λ(n)=d2|nμ(nd2).

The Dirichlet inverse of the Liouville function is the absolute value of the Möbius function, λ1(n)=|μ(n)|=μ2(n), the characteristic function of the squarefree integers.

Series

[edit | edit source]

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

ζ(2s)ζ(s)=n=1λ(n)ns.

Also:

n=1λ(n)lnnn=ζ(2)=π26.

The Lambert series for the Liouville function is

n=1λ(n)qn1qn=n=1qn2=12(ϑ3(q)1),

where ϑ3(q) is the Jacobi theta function.

Conjectures on weighted summatory functions

[edit | edit source]
File:Liouville.svg
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.
File:Liouville-big.svg
Summatory Liouville function L(n) up to n = 107. Note the apparent scale invariance of the oscillations.
File:Liouville-log.svg
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.
File:Liouville-harmonic.svg
Harmonic Summatory Liouville function T(n) up to n = 103

The Pólya problem is a question raised made by George Pólya in 1919. Defining

L(n)=k=1nλ(k) (sequence A002819 in the OEIS),

the problem asks whether L(n)0 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.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 ε>0, assuming the Riemann hypothesis, we have that the summatory function L(x)L0(x) is bounded by

L(x)=O(xexp(Clog1/2(x)(loglogx)5/2+ε)),

where the C>0 is some absolute limiting constant.[2]

Define the related sum

T(n)=k=1nλ(k)k.

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.

Generalizations

[edit | edit source]

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 L(x):=L0(x) and T(x)=L1(x) [2]

Lα(x):=nxλ(n)nα.

These α1-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 L(x) precisely corresponds to the sum

L(x)=d2xM(xd2)=d2xnxd2μ(n).

Moreover, these functions satisfy similar bounding asymptotic relations.[2] For example, whenever 0α12, we see that there exists an absolute constant Cα>0 such that

Lα(x)=O(x1αexp(Cα(logx)3/5(loglogx)1/5)).

By an application of Perron's formula, or equivalently by a key (inverse) Mellin transform, we have that

ζ(2α+2s)ζ(α+s)=s1Lα(x)xs+1dx,

which then can be inverted via the inverse transform to show that for x>1, T1 and 0α<12

Lα(x)=12πıσ0ıTσ0+ıTζ(2α+2s)ζ(α+s)xssds+Eα(x)+Rα(x,T),

where we can take σ0:=1α+1/log(x), and with the remainder terms defined such that Eα(x)=O(xα) and Rα(x,T)0 as T.

In particular, if we assume that the Riemann hypothesis (RH) is true and that all of the non-trivial zeros, denoted by ρ=12+ıγ, of the Riemann zeta function are simple, then for any 0α<12 and x1 there exists an infinite sequence of {Tv}v1 which satisfies that vTvv+1 for all v such that

Lα(x)=x1/2α(12α)ζ(1/2)+|γ|<Tvζ(2ρ)ζ(ρ)xρα(ρα)+Eα(x)+Rα(x,Tv)+Iα(x),

where for any increasingly small 0<ε<12α we define

Iα(x):=12πıxαε+αıε+α+ıζ(2s)ζ(s)xs(sα)ds,

and where the remainder term

Rα(x,T)xα+x1αlog(x)T+x1αT1εlog(x),

which of course tends to 0 as T. These exact analytic formula expansions again share similar properties to those corresponding to the weighted Mertens function cases. Additionally, since ζ(1/2)<0 we have another similarity in the form of Lα(x) to M(x) 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.

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b c d Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).