Liouville function: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
imported>LucasBrown
top: Removed incorrect statement.
 
imported>JJMC89 bot III
 
Line 1: Line 1:
{{Short description|Arithmetic function}}
{{Short description|Arithmetic function}}
The '''Liouville lambda function''', denoted by {{math|1=λ(''n'')}} and named after [[Joseph Liouville]], is an important [[arithmetic function]].  
In [[number theory]], the '''Liouville function''', named after [[French people|French]] mathematician [[Joseph Liouville]] and denoted <math>\lambda(n)</math>, is an important [[arithmetic function]]. Its value is <math>1</math> if <math>n</math> is the product of an [[Parity (mathematics)|even number]] of [[prime number]]s, and <math>-1</math> if it is the product of an odd number of prime numbers.
Its value is {{math|1=+1}} if {{mvar|n}} is the product of an even number of [[prime number]]s, and {{math|1=−1}} if it is the product of an odd number of primes.  


Explicitly, the [[fundamental theorem of arithmetic]] states that any positive [[integer]] {{mvar|n}} can be represented uniquely as a product of powers of primes: {{math|1=''n'' = ''p''<sub>1</sub><sup>''a''<sub>1</sub></sup> &ctdot; ''p''<sub>''k''</sub><sup>''a''<sub>''k''</sub></sup>}}, where  {{math|1=''p''<sub>1</sub> < ''p''<sub>2</sub> < ... < ''p''<sub>''k''</sub>}} are primes and the {{math|1=''a<sub>j</sub>''}} are positive integers. ({{math|1=1}} is given by the empty product.) The [[prime omega function]]s  count the number of primes,  with ({{mvar|Ω}}) or without ({{mvar|ω}}) multiplicity:
== Definition ==  


: <math> \omega(n) = k, </math>
By the [[fundamental theorem of arithmetic]], any positive [[integer]] <math>n</math> can be represented uniquely as a product of powers of primes:
: <math> \Omega(n) = a_1 + a_2 + \cdots + a_k. </math>


{{math|1=λ(''n'')}} is defined by the formula
:<math>n=p_1^{a_1}\cdots p_k^{a_k}</math>,


: <math> \lambda(n) = (-1)^{\Omega(n)} </math>
where <math>p_1,\dots,p_k</math> are primes and the exponents <math>a_1,\dots,a_k</math> are positive integers. The [[prime omega function]] <math>\Omega(n)</math> counts the number of primes in the factorization of <math>n</math> with multiplicity:
 
:<math>\Omega(n) = a_1 + a_2 + \cdots + a_k</math>.
 
Thus, the Liouville function is defined by
 
: <math> \lambda(n) = (-1)^{\Omega(n)}</math>


{{OEIS|A008836}}.
{{OEIS|A008836}}.


{{mvar|λ}} is [[multiplicative function|completely multiplicative]] since {{math|1=Ω(''n'')}} is completely [[additive function|additive]], i.e.: {{math|1=Ω(''ab'') = Ω(''a'') + Ω(''b'')}}. Since {{math|1}} has no prime factors, {{math|1=Ω(1) = 0}}, so {{math|1=λ(1) = 1}}.
== Properties ==
 
Since <math>\Omega(n)</math> is completely [[additive function|additive]]; i.e., <math>\Omega(ab)=\Omega(a)+\Omega(b)</math>, then <math>\lambda(n)</math> is [[multiplicative function|completely multiplicative]]. Since <math>1</math> has no prime factors, <math>\Omega(1)=0</math>, so <math>\lambda(1)=1</math>.


It is related to the [[Möbius function]] {{math|1=μ(''n'')}}. Write {{mvar|n}} as {{math|1=''n'' = ''a''<sup>2</sup>''b''}}, where {{mvar|b}} is [[squarefree]], i.e., {{math|1=ω(''b'') = Ω(''b'')}}.  Then
<math>\lambda(n)</math> is also related to the [[Möbius function]] <math>\mu(n)</math>: if we write <math>n</math> as <math>n=a^2b</math>, where <math>b</math> is [[squarefree]], then


: <math> \lambda(n) = \mu(b). </math>
: <math> \lambda(n) = \mu(b). </math>


The sum of the Liouville function over the [[divisor]]s of {{mvar|n}} is the [[indicator function|characteristic function]] of the [[square (algebra)|squares]]:
The sum of the Liouville function over the [[divisor]]s of <math>n</math> is the [[indicator function|characteristic function]] of the [[square (algebra)|squares]]:


:<math>
:<math>
Line 33: Line 39:
:<math>\lambda(n) = \sum_{d^2|n} \mu\left(\frac{n}{d^2}\right).</math>
:<math>\lambda(n) = \sum_{d^2|n} \mu\left(\frac{n}{d^2}\right).</math>


The [[Dirichlet inverse]] of Liouville function is the absolute value of the Möbius function, {{math|1=&lambda;<sup>–1</sup>(''n'') = &vert;&mu;(''n'')&vert; = &mu;<sup>2</sup>(''n'')}}, the characteristic function of the squarefree integers.
The [[Dirichlet inverse]] of the Liouville function is the [[absolute value]] of the Möbius function, <math>\lambda^{-1}(n)=|\mu(n)|=\mu^2(n)</math>, the characteristic function of the squarefree integers.


==Series==
==Series==
Line 64: Line 70:
: <math>L(n) = \sum_{k=1}^n \lambda(k)</math> {{OEIS|id=A002819}},
: <math>L(n) = \sum_{k=1}^n \lambda(k)</math> {{OEIS|id=A002819}},


the problem asks whether <math>L(n)\leq 0</math> for ''n''&nbsp;>&nbsp;1. The answer turns out to be no.  The smallest counter-example is ''n''&nbsp;=&nbsp;906150257, found by Minoru Tanaka in 1980. It has since been shown that ''L''(''n'')&nbsp;>&nbsp;0.0618672{{radic|''n''}} for infinitely many positive integers ''n'',<ref>{{cite journal |first=P. |last=Borwein |first2=R. |last2=Ferguson |first3=M. J. |last3=Mossinghoff |title=Sign Changes in Sums of the Liouville Function |journal=Mathematics of Computation |volume=77 |year=2008 |issue=263 |pages=1681&ndash;1694 |doi=10.1090/S0025-5718-08-02036-X |doi-access=free }}</ref> while it can also be shown via the same methods that ''L''(''n'')&nbsp;<&nbsp;−1.3892783{{radic|''n''}} for infinitely many positive integers ''n''.<ref name="HUMPHRIES-WEIGHTED-SUMFUNCS" />
the problem asks whether <math>L(n)\leq 0</math> for some ''n''&nbsp;>&nbsp;1. The answer turns out to be yes.  The smallest counter-example is ''n''&nbsp;=&nbsp;906150257, found by Minoru Tanaka in 1980. It has since been shown that ''L''(''n'')&nbsp;>&nbsp;0.0618672{{radic|''n''}} for infinitely many positive integers ''n'',<ref>{{cite journal |first=P. |last=Borwein |first2=R. |last2=Ferguson |first3=M. J. |last3=Mossinghoff |title=Sign Changes in Sums of the Liouville Function |journal=Mathematics of Computation |volume=77 |year=2008 |issue=263 |pages=1681&ndash;1694 |doi=10.1090/S0025-5718-08-02036-X |doi-access=free }}</ref> while it can also be shown via the same methods that ''L''(''n'')&nbsp;<&nbsp;−1.3892783{{radic|''n''}} for infinitely many positive integers ''n''.<ref name="HUMPHRIES-WEIGHTED-SUMFUNCS" />


For any <math>\varepsilon > 0</math>, assuming the Riemann hypothesis, we have that the summatory function <math>L(x) \equiv L_0(x)</math> is bounded by  
For any <math>\varepsilon > 0</math>, assuming the Riemann hypothesis, we have that the summatory function <math>L(x) \equiv L_0(x)</math> is bounded by  
Line 76: Line 82:
: <math>T(n) = \sum_{k=1}^n \frac{\lambda(k)}{k}.</math>
: <math>T(n) = \sum_{k=1}^n \frac{\lambda(k)}{k}.</math>


It was open for some time whether ''T''(''n'')&nbsp;≥&nbsp;0 for sufficiently big ''n'' ≥ ''n''<sub>0</sub> (this conjecture is occasionally–though incorrectly–attributed to [[Pál Turán]]).  This was then disproved by {{harvtxt|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]].  
It was open for some time whether ''T''(''n'')&nbsp;≥&nbsp;0 for sufficiently big ''n'' ≥ ''n''<sub>0</sub> (this conjecture is occasionally—though incorrectly—attributed to [[Pál Turán]]).  This was then disproved by {{harvtxt|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===
===Generalizations===
Line 84: Line 90:
:<math>L_{\alpha}(x) := \sum_{n \leq x} \frac{\lambda(n)}{n^{\alpha}}.</math>  
:<math>L_{\alpha}(x) := \sum_{n \leq x} \frac{\lambda(n)}{n^{\alpha}}.</math>  


These <math>\alpha^{-1}</math>-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-weighted, or ordinary function <math>L(x)</math> precisely corresponds to the sum  
These <math>\alpha^{-1}</math>-weighted summatory functions are related to the [[Mertens function]], or weighted summatory functions of the [[Moebius function|Möbius function]]. In fact, we have that the so-termed non-weighted, or ordinary, function <math>L(x)</math> precisely corresponds to the sum  


:<math>L(x) = \sum_{d^2 \leq x} M\left(\frac{x}{d^2}\right) = \sum_{d^2 \leq x} \sum_{n \leq \frac{x}{d^2}} \mu(n).</math>  
:<math>L(x) = \sum_{d^2 \leq x} M\left(\frac{x}{d^2}\right) = \sum_{d^2 \leq x} \sum_{n \leq \frac{x}{d^2}} \mu(n).</math>  
Line 103: Line 109:
where we can take <math>\sigma_0 := 1-\alpha+1 / \log(x)</math>, and with the remainder terms defined such that <math>E_{\alpha}(x) = O(x^{-\alpha})</math> and <math>R_{\alpha}(x, T) \rightarrow 0</math> as <math>T \rightarrow \infty</math>.  
where we can take <math>\sigma_0 := 1-\alpha+1 / \log(x)</math>, and with the remainder terms defined such that <math>E_{\alpha}(x) = O(x^{-\alpha})</math> and <math>R_{\alpha}(x, T) \rightarrow 0</math> as <math>T \rightarrow \infty</math>.  


In particular, if we assume that the  
In particular, if we assume that the [[Riemann hypothesis]] (RH) is true and that all of the non-trivial zeros, denoted by <math>\rho = \frac{1}{2} + \imath\gamma</math>, of the [[Riemann zeta function]] are [[simple zero|simple]], then for any <math>0 \leq \alpha < \frac{1}{2}</math> and <math> x \geq 1</math> there exists an infinite sequence of <math>\{T_v\}_{v \geq 1}</math> which satisfies that <math>v \leq T_v \leq v+1</math> for all ''v'' such that  
[[Riemann hypothesis]] (RH) is true and that all of the non-trivial zeros, denoted by <math>\rho = \frac{1}{2} + \imath\gamma</math>, of the [[Riemann zeta function]] are [[simple zero|simple]], then for any <math>0 \leq \alpha < \frac{1}{2}</math> and <math> x \geq 1</math> there exists an infinite sequence of <math>\{T_v\}_{v \geq 1}</math> which satisfies that <math>v \leq T_v \leq v+1</math> for all ''v'' such that  


:<math>L_{\alpha}(x) = \frac{x^{1/2-\alpha}}{(1-2\alpha) \zeta(1/2)} + \sum_{|\gamma| < T_v} \frac{\zeta(2\rho)}{\zeta^{\prime}(\rho)} \cdot  
:<math>L_{\alpha}(x) = \frac{x^{1/2-\alpha}}{(1-2\alpha) \zeta(1/2)} + \sum_{|\gamma| < T_v} \frac{\zeta(2\rho)}{\zeta^{\prime}(\rho)} \cdot  
Line 118: Line 123:
:<math>R_{\alpha}(x, T) \ll x^{-\alpha} + \frac{x^{1-\alpha} \log(x)}{T} + \frac{x^{1-\alpha}}{T^{1-\varepsilon} \log(x)}, </math>  
:<math>R_{\alpha}(x, T) \ll x^{-\alpha} + \frac{x^{1-\alpha} \log(x)}{T} + \frac{x^{1-\alpha}}{T^{1-\varepsilon} \log(x)}, </math>  


which of course tends to ''0'' as <math>T \rightarrow \infty</math>. These exact analytic formula expansions again share similar properties to those corresponding to the weighted [[Mertens function]] cases. Additionally, since <math>\zeta(1/2) < 0</math> we have another similarity in the form of <math>L_{\alpha}(x)</math> to <math>M(x)</math> 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''.
which of course tends to ''0'' as <math>T \rightarrow \infty</math>. These exact analytic formula expansions again share similar properties to those corresponding to the weighted [[Mertens function]] cases. Additionally, since <math>\zeta(1/2) < 0</math> we have another similarity in the form of <math>L_{\alpha}(x)</math> to <math>M(x)</math> 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==
==References==

Latest revision as of 22:42, 9 November 2025

Template:Short description 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

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

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

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

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.0618672Template:Radic for infinitely many positive integers n,[1] while it can also be shown via the same methods that L(n) < −1.3892783Template:Radic 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 Template:Harvtxt, 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 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

Template:Reflist

  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Template wrapper".
  • Template:Springer
  1. Script error: No such module "Citation/CS1".
  2. a b c d Script error: No such module "Citation/CS1".