A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes

summary

The gist

A new version of the Wiener-Ikehara theorem is provided that yields lower and upper bounds, which establishes new criteria for the validity of Chebyshev bounds for Beurling generalized prime number…

In short

A new Wiener-Ikehara theorem provides lower and upper bounds for functions related to strongly log-linearly slowly decreasing functions. This establishes new, weaker criteria for validating Chebyshev bounds in Beurling generalized prime number systems by analyzing the distributional boundary values of the Beurling zeta function.

Key concepts

Strongly Log-Linearly Slowly Decreasing
This is a specific condition placed on a function S(x) that dictates its rate of decrease as x gets very large. It's a controlled way to describe functions whose Laplace transform converges, which is essential for applying the Wiener-Ikehara type theorem to establish bounds.
Distributional Boundary Value Decomposition
This involves analyzing the boundary behavior of an analytic function G(s) by decomposing its distributional boundary value into three parts: g = g1 · g2 + g3. This decomposition is crucial for linking the analytic properties of G(s) to the conditions required for Chebyshev bounds.
Chebyshev Bounds
These are inequalities that provide bounds on the distribution of generalized prime numbers. The paper develops new criteria, based on the boundary behavior of the Beurling zeta function, to determine when these specific bounds hold under weaker assumptions than previously established.

Terminology used across episodes

This episode discusses

The paper

A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes · Read on arXiv

Yarne Tranoy, Jasson Vindas

Ghent University

DOI: 10.1007/s10476-026-00183-z

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes".

Emmy: Here's the gist of the paper. A new version of the Wiener-Ikehara theorem is provided that yields lower and upper bounds, which establishes new criteria for the validity of Chebyshev bounds for Beurling generalized prime number systems under weaker conditions than previously known <ref:2602.07690#pg2> The New Tauberian Theorem Theorem 3.1 states that if a function S is strongly log-linearly slowly decreasing, its Laplace transform converges for Re s > 1, and the analytic function G defined by (1.1) admits distributional boundary value g in D'(I) on the boundary line segment 1 + iI for some real bounded open interval I containing 0, then S satisfies the upper and lower bounds e x The proof involves decomposing g into g = g1 · g2 + g3, where g1 ∈ Aloc(0) and g1(0) = 0, and showing that the term Z ∞ 0 e-xS(x)ϕn(x − y)dx is bounded below by a positive constant <ref:2602.07690#pg9>.

Ada: Characterization of Tauberian Conditions The paper defines several controlled decrease notions to act as Tauberian conditions, including log-linearly boundedly decreasing and strongly log-linearly slowly decreasing.

Emmy: Lemma 2.6 establishes that S(x) = O(e x), x → ∞, if and only if S is log-linearly boundedly decreasing, its Laplace transform converges for Re s > 1, and Ls admits pseudomeasure boundary behavior at the point s = 1 <ref:2602.07690#pg7>.

Ada: Lemma 2.7 provides an iterated version of the inequality (2.4) for strongly log-linearly slowly decreasing functions.

Title and authors: Ada: So we're looking at this paper called "A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes." It sounds like they are taking a really famous theorem, the classical Wiener-Ikehara theorem, and modifying it to get tighter bounds instead of just the asymptotic behavior.

Emmy: Exactly. They're not just looking at the standard result where you get that one specific asymptotic formula, you're aiming for something much stronger with lower and upper bounds on a function S(x).

Kolya: So, what does this mean practically? Is it just a refinement of how we estimate prime numbers, or is it changing the fundamental way we characterize these generalized primes?

Ada: It's definitely about refining the characterization. They're using this new theorem to establish criteria for when those Chebyshev bounds actually hold for Beurling systems, and they claim these conditions are weaker than what was previously known.

Emmy: That's the key structural idea. They’re connecting a specific type of slow decrease in a function S, called log-linearly slowly decreasing, with the existence of these tighter bounds on prime counting functions like pi over x.

Kolya: We need to know what that log-linear slow decrease actually looks like in terms of the function's growth. Is it just a mild condition?

Ada: It is defined precisely; for every epsilon bigger than zero, you can find some delta and some starting point x zero such that the difference between S of y and S of x times e to x is greater than or equal to negative epsilon for any x less than or equal to y and greater than or equal to that starting point >

Emmy: That condition relates directly to how slowly the function grows as we move along the real number line, which is crucial for connecting it back to those analytic properties of its Laplace transform.

Kolya: So, what does this new theorem actually prove about S(x)? Is it giving us a better sense of how fast S(x) grows compared to e to x?

Ada: It gives us a lower bound and an upper bound for the function e to x times S of x. Specifically, they show you can get something like e to x is much less than this expression, and this expression is much less than e to x as you go out toward infinity >

Emmy: So, instead of just saying S(x) behaves like a constant times e to x in the limit, they are proving that there's a gap between those two bounds, which is what allows for the lower and upper bounds themselves >

Kolya: That sounds like it gives us more control over the error terms when we try to estimate prime counts. Does this new theorem simplify things or just add more complexity?

Ada: It adds structure. The new theorem connects the function's behavior directly to its Laplace transform's boundary behavior on a vertical line, which is a very specific analytic constraint >

Emmy: That's the mechanism here. They decompose that boundary value of an analytic function G into pieces, g one times g two plus g three, and this decomposition is what allows them to prove the lower bound exists >

Kolya: So, before we move on, this paper seems to be laying down a new toolkit for testing whether those Chebyshev bounds are valid under less restrictive assumptions about the underlying prime system.

Ada: Right. And that's what we'll see next when we look at how they actually use this theorem to check for those bounds >

The paper's summary: Emmy: Now let's go over what the paper summarizes in more detail regarding this Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes. Basically, they are showing how to use this new tool to get those lower and upper bounds we talked about earlier.

Ada: So, the core summary is that if a function S is log-linearly slowly decreasing, and its Laplace transform converges for real part s greater than one, then the analytic function G defined by a specific equation on page one admits a distributional boundary value on the line where the real part of s equals one >

Emmy: That distributional boundary value is what they use to say there exists this decomposition g equal to g one times g two plus g three, where g one has a zero at zero and satisfies some local pseudofunction requirements >

Kolya: What does that decomposition actually tell us about the function S(x)? Does it tell us something concrete about the tail behavior of S(x) when x gets very large?

Ada: It tells us that the term e to negative x times S of x times phi n of x minus y integrated over zero to infinity is bounded below by some positive constant >

Emmy: That's the direct result they use to establish the lower bound, which means you get that lower bound on S(x) multiplied by e to x as it goes toward infinity >

Kolya: So, if we have this positive constant bounding that integral from below, then what does that imply for the prime distribution? Is it a guarantee that those Chebyshev bounds hold?

Ada: It implies you get a lower bound on the function S of x multiplied by e to x as it goes to infinity >

Emmy: And they're using this structure to prove both the lower and upper bounds, which is what makes this version of the theorem so useful for establishing criteria for those Chebyshev bounds >

Kolya: So, in short, it’s a method that uses analytic properties of S to create quantitative statements about prime distributions. It’s a rigorous way to link slow decrease to the existence of these bounds >

The paper's improvements: Ada: The next part is where they talk about how this new version improves upon the previous Wiener-Ikehara theorem. They are showing that it yields lower and upper bounds, which is a big step up from just the classical result.

Emmy: It moves beyond just giving you that single asymptotic formula, moving toward bounding the error term itself rather than just stating what the error term is >

Kolya: So, what's the actual improvement in terms of numbers? Is it a change in constants or a new way to handle the constraints on S?

Ada: The improvement is structural. They are using log-linear slow decrease as this stronger hypothesis, which allows them to prove that e to x is much smaller than S of x, and simultaneously show that S of x is much smaller than e to x >

Emmy: That means they are providing a quantitative sandwich around the actual asymptotic behavior, rather than just pinning it down in the middle >

Kolya: So, what's the tangible consequence for someone applying this? If they were trying to check if their prime system satisfies these bounds, what do they look for?

Ada: They look for two things: first that S satisfies that log-linear slow decrease condition, and second that the analytic function G has a specific boundary value decomposition involving g one times g two plus g three >

Emmy: That decomposition is the test. If you can find that specific way to write it, you prove the upper bound exists, and they're using this as a criterion for validity >

Kolya: So, it’s like giving us a checklist based on analytic behavior of S and its related functions that tells us if we can trust those Chebyshev bounds >

Conclusion: Ada: So to wrap up the paper "A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes," the main points are that they're providing a new version of the Wiener-Ikehara theorem that gives you lower and upper bounds for S of x times e to x >

Emmy: They achieve this by using the log-linear slow decrease hypothesis combined with a specific decomposition of the analytic function G at s equals one >

Kolya: And from a practical standpoint, this means we get new criteria for when those Chebyshev bounds are valid under weaker conditions than previously thought.

Ada: So it’s about moving from just knowing the asymptotic formula to actually controlling the error terms with these bounds >

Emmy: It gives us a better framework for understanding how these analytic constraints translate into real-world prime distribution properties >

Kolya: I think the result is that we're getting a more robust way to test those conditions for Beurling generalized number theory.

Ada: Exactly. The paper "A Wiener-Ikehara type theorem and its application to Chebyshev bounds for Beurling primes" provides a new way to put those bounds on S of x times e to x >

More episodes

← Home