Chebyshev function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
The Chebyshev function ψ(x), with x < 50
The function ψ(x) − x, for x < 104
The function ψ(x) − x, for x < 107

In mathematics, the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function ϑ(x) or θ(x) is given by

where denotes the natural logarithm, with the sum extending over all prime numbers p that are less than or equal to x.

The second Chebyshev function ψ(x) is defined similarly, with the sum extending over all prime powers not exceeding x

where Λ is the von Mangoldt function. The Chebyshev functions, especially the second one ψ(x), are often used in proofs related to prime numbers, because it is typically simpler to work with them than with the prime-counting function, π(x) (See the exact formula, below.) Both Chebyshev functions are asymptotic to x, a statement equivalent to the prime number theorem.

Tchebycheff function, Chebyshev utility function, or weighted Tchebycheff scalarizing function is used when one has several functions to be minimized and one wants to "scalarize" them to a single function:


By minimizing this function for different values of , one obtains every point on a Pareto front, even in the nonconvex parts.[1] Often the functions to be minimized are not but for some scalars . Then [2]

All three functions are named in honour of Pafnuty Chebyshev.


The second Chebyshev function can be seen to be related to the first by writing it as

where k is the unique integer such that pkx and x < pk + 1. The values of k are given in OEISA206722. A more direct relationship is given by

Note that this last sum has only a finite number of non-vanishing terms, as

The second Chebyshev function is the logarithm of the least common multiple of the integers from 1 to n.

Values of lcm(1,2,...,n) for the integer variable n is given at OEISA003418.

Asymptotics and bounds[edit]

The following bounds are known for the Chebyshev functions:[1][2] (in these formulas pk is the kth prime number p1 = 2, p2 = 3, etc.)

Furthermore, under the Riemann hypothesis,

for any ε > 0.

Upper bounds exist for both ϑ(x) and ψ(x) such that,[3] [3]

for any x > 0.

An explanation of the constant 1.03883 is given at OEISA206431.

The exact formula[edit]

In 1895, Hans Carl Friedrich von Mangoldt proved[4] an explicit expression for ψ(x) as a sum over the nontrivial zeros of the Riemann zeta function:

(The numerical value of ζ(0)/ζ(0) is log(2π).) Here ρ runs over the nontrivial zeros of the zeta function, and ψ0 is the same as ψ, except that at its jump discontinuities (the prime powers) it takes the value halfway between the values to the left and the right:

From the Taylor series for the logarithm, the last term in the explicit formula can be understood as a summation of xω/ω over the trivial zeros of the zeta function, ω = −2, −4, −6, ..., i.e.

Similarly, the first term, x = x1/1, corresponds to the simple pole of the zeta function at 1. It being a pole rather than a zero accounts for the opposite sign of the term.


A theorem due to Erhard Schmidt states that, for some explicit positive constant K, there are infinitely many natural numbers x such that

and infinitely many natural numbers x such that


In little-o notation, one may write the above as

Hardy and Littlewood[7] prove the stronger result, that

Relation to primorials[edit]

The first Chebyshev function is the logarithm of the primorial of x, denoted x#:

This proves that the primorial x# is asymptotically equal to e(1 + o(1))x, where "o" is the little-o notation (see big O notation) and together with the prime number theorem establishes the asymptotic behavior of pn#.

Relation to the prime-counting function[edit]

The Chebyshev function can be related to the prime-counting function as follows. Define


The transition from Π to the prime-counting function, π, is made through the equation

Certainly π(x) ≤ x, so for the sake of approximation, this last relation can be recast in the form

The Riemann hypothesis[edit]

The Riemann hypothesis states that all nontrivial zeros of the zeta function have real part 1/2. In this case, |xρ| = x, and it can be shown that

By the above, this implies

Good evidence that the hypothesis could be true comes from the fact proposed by Alain Connes and others, that if we differentiate the von Mangoldt formula with respect to x we get x = eu. Manipulating, we have the "Trace formula" for the exponential of the Hamiltonian operator satisfying


where the "trigonometric sum" can be considered to be the trace of the operator (statistical mechanics) eiuĤ, which is only true if ρ = 1/2 + iE(n).

Using the semiclassical approach the potential of H = T + V satisfies:

with Z(u) → 0 as u → ∞.

solution to this nonlinear integral equation can be obtained (among others) by

in order to obtain the inverse of the potential:

Smoothing function[edit]

The difference of the smoothed Chebyshev function and x2/2 for x < 106

The smoothing function is defined as

Obviously :

Variational formulation[edit]

The Chebyshev function evaluated at x = et minimizes the functional



  1. ^ a b Joshua Knowles (2 May 2014). "Multiobjective Optimization Concepts, Algorithms and Performance Measures" (PDF). The University of Manchester. p. 34.
  2. ^ Ho-Huu, V.; Hartjes, S.; Visser, H. G.; Curran, R. (2018). "An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization" (PDF). Delft University of Technology. Page 6 equation (2). doi:10.1016/j.eswa.2017.09.051.{{cite web}}: CS1 maint: multiple names: authors list (link)
  3. ^ Rosser, J. Barkley; Schoenfeld, Lowell (1962). "Approximate formulas for some functions of prime numbers". Illinois J. Math. 6: 64–94.
  • ^ Pierre Dusart, "Estimates of some functions over primes without R.H.". arXiv:1002.0442
  • ^ Pierre Dusart, "Sharper bounds for ψ, θ, π, pk", Rapport de recherche no. 1998-06, Université de Limoges. An abbreviated version appeared as "The kth prime is greater than k(log k + log log k − 1) for k ≥ 2", Mathematics of Computation, Vol. 68, No. 225 (1999), pp. 411–415.
  • ^ Erhard Schmidt, "Über die Anzahl der Primzahlen unter gegebener Grenze", Mathematische Annalen, 57 (1903), pp. 195–204.
  • ^ G .H. Hardy and J. E. Littlewood, "Contributions to the Theory of the Riemann Zeta-Function and the Theory of the Distribution of Primes", Acta Mathematica, 41 (1916) pp. 119–196.
  • ^ Davenport, Harold (2000). In Multiplicative Number Theory. Springer. p. 104. ISBN 0-387-95097-4. Google Book Search.


External links[edit]