Chebyshev functions

E300761

Chebyshev function arithmetic function number-theoretic function

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.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (7)

Label	Occurrences
Chebyshev function	2
Chebyshev function ψ(x)	2
Chebyshev functions canonical	2
Chebyshev	1
Chebyshev function θ(x)	1
first Chebyshev function	1
second Chebyshev function	1

How this entity was disambiguated

This entity first appeared as the object of triple T2815452 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Chebyshev functions
Context triple: [Euler product formula for the Riemann zeta function, relatedConcept, Chebyshev functions]

A. Riemann–Siegel theta function
The Riemann–Siegel theta function is a special function that appears in the study of the Riemann zeta function, used to express its values on the critical line in a form suitable for high-precision numerical computation.
B. Riemann zeta function
The Riemann zeta function is a complex-valued function central to analytic number theory, whose properties—especially the distribution of its zeros—are deeply connected to the distribution of prime numbers.
C. Riemann–Siegel formula
The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
D. Dirichlet L-functions
Dirichlet L-functions are complex analytic functions built from Dirichlet characters that generalize the Riemann zeta function and play a central role in number theory, particularly in the study of primes in arithmetic progressions.
E. Gauss’s constant
Gauss’s constant is a mathematical constant arising in number theory and complex analysis, particularly in connection with the lemniscate and elliptic functions.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Chebyshev functions
Target entity description: 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.

A. Riemann–Siegel theta function
The Riemann–Siegel theta function is a special function that appears in the study of the Riemann zeta function, used to express its values on the critical line in a form suitable for high-precision numerical computation.
B. Riemann zeta function
The Riemann zeta function is a complex-valued function central to analytic number theory, whose properties—especially the distribution of its zeros—are deeply connected to the distribution of prime numbers.
C. Riemann–Siegel formula
The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
D. Dirichlet L-functions
Dirichlet L-functions are complex analytic functions built from Dirichlet characters that generalize the Riemann zeta function and play a central role in number theory, particularly in the study of primes in arithmetic progressions.
E. Gauss’s constant
Gauss’s constant is a mathematical constant arising in number theory and complex analysis, particularly in connection with the lemniscate and elliptic functions.
F. None of above. chosen

Statements (43)

Predicate	Object
instanceOf	Chebyshev function ⓘ Chebyshev function ⓘ arithmetic function ⓘ number-theoretic function ⓘ
alsoKnownAs	first Chebyshev function ⓘ linked to: Chebyshev functions second Chebyshev function ⓘ linked to: Chebyshev functions
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 function θ(x) ⓘ linked to: Chebyshev functions Chebyshev function ψ(x) ⓘ linked to: Chebyshev functions
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 ⓘ linked to: Mertens’ theorems Riemann zeta function ζ(s) ⓘ linked to: Riemann zeta function 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