Chebyshev functions

E300761

Chebyshev functions are arithmetic functions in number theory that encode information about the distribution of prime numbers and play a key role in analytic approaches to the prime number theorem.

All labels observed (7)

How this entity was disambiguated

Statements (43)

Predicate Object
instanceOf Chebyshev function
Chebyshev function
arithmetic function
number-theoretic function
alsoKnownAs Chebyshev functions
surface form: first Chebyshev function

Chebyshev functions
surface form: second Chebyshev function
appearsIn explicit formulas involving zeros of ζ(s)
proofs of equivalence between various forms of the prime number theorem
asymptoticBehavior θ(x) ~ x as x → ∞
ψ(x) ~ x as x → ∞
codomain real numbers
definition θ(x) = ∑_{p ≤ x} log p, where the sum is over primes p
ψ(x) = ∑_{n ≤ x} Λ(n)
ψ(x) = ∑_{p^k ≤ x} log p, where the sum is over prime powers p^k
domain positive real numbers
encodes information about the distribution of prime numbers
equivalentTo prime number theorem
expressibleVia von Mangoldt function Λ(n)
field number theory
growthOrder O(x)
historicalUse early proofs of results close to the prime number theorem
includes Chebyshev functions self-linksurface differs
surface form: Chebyshev function θ(x)

Chebyshev functions self-linksurface differs
surface form: Chebyshev function ψ(x)
monotonicity non-decreasing in x
namedAfter Pafnuty Chebyshev
property encode weighted counts of primes and prime powers
step function with jumps of size log p at prime powers p^k
step function with jumps of size log p at primes p
relatedConcept Dirichlet series and Euler products
logarithmic integral li(x)
prime number theorem error term
relatedTo Mertens’ theorems
surface form: Mertens theorems

Riemann zeta function
surface form: Riemann zeta function ζ(s)

partial summation techniques
prime-counting function π(x)
subfield analytic number theory
toolFor connecting prime distribution with complex analysis
studying zeros of the Riemann zeta function via explicit formulas
usedFor bounding the prime-counting function π(x)
formulating equivalent statements of the prime number theorem
studying error terms in the prime number theorem
usedIn analytic approaches to the prime number theorem
usedToProve prime number theorem

How these facts were elicited

Referenced by (9)

Full triples — surface form annotated when it differs from this entity's canonical label.

prime number theorem involvesFunction Chebyshev functions
this entity surface form: Chebyshev function ψ(x)
Pafnuty Chebyshev familyName Chebyshev functions
this entity surface form: Chebyshev
Pafnuty Chebyshev notableWork Chebyshev functions
this entity surface form: Chebyshev function
Chebyshev functions includes Chebyshev functions self-linksurface differs
this entity surface form: Chebyshev function θ(x)
Chebyshev functions includes Chebyshev functions self-linksurface differs
this entity surface form: Chebyshev function ψ(x)
Chebyshev functions alsoKnownAs Chebyshev functions
subject surface form: Chebyshev function θ(x)
this entity surface form: first Chebyshev function
Chebyshev functions alsoKnownAs Chebyshev functions
subject surface form: Chebyshev function ψ(x)
this entity surface form: second Chebyshev function
Ramanujan prime relatedConcept Chebyshev functions
this entity surface form: Chebyshev function