Low Lying Zeros of Dedekind Zeta Functions

summary

The gist

Low lying zeros of Dedekind zeta functions are studied to establish an unconditional bound on the height of non-trivial zeros…

In short

The authors studied low-lying zeros of Dedekind zeta functions to find an unconditional bound on their height, h(K). By adapting Hoffstein's method with Stechkin's trick and solving optimization problems, they improved previous results. The best proven asymptotic bound achieved is h(K) ≤ 0.6 + o(1) as nK → ∞.

Key concepts

Height of the first non-trivial zero, h(K)
This is a measure of how high up the first non-trivial zero of the Dedekind zeta function lies relative to its conductor K. The goal is to find an upper limit for this height, which helps constrain where these zeros can be located on the critical line.
Stechkin's trick
This technique involves generalizing Hoffstein's method by introducing shifted differences in the logarithmic derivative of the Dedekind zeta function. This allows researchers to use non-zero parameters (h and eta) to improve existing bounds on zero locations.
Optimization Problem A/D
These problems involve finding specific parameters (like $\vec{\sigma}$, h, $\eta$, T) that satisfy certain conditions related to a comparison weight function. Solving these problems proves the existence of zeros below a certain height threshold T, which is key to establishing the bound on h(K).
Landau–Stark identity
This is an identity used in the proof that relates different evaluations of the Dedekind zeta function. The authors use comparisons derived from this identity, combined with functional equation properties, to construct a comparison weight used in their analysis.

Terminology used across episodes

This episode discusses

The paper

Low Lying Zeros of Dedekind Zeta Functions · Read on arXiv

Australian Research Council Discovery Project

Let K be a number field of degree n K, and let h(K) denote the smallest absolute value of the imaginary part of a non-trivial zero of its Dedekind zeta function ζ K. In 1979, Hoffstein proved the unconditional bound h(K) at most 0.87+o(1) as n K to infinity. In a 1990 survey, Odlyzko announced the stronger bound h(K) at most 0.54+o(1) without proof. No improvement on Hoffstein's bound has since appeared with a published proof. We construct a comparison kernel from a linear combination of three identities and show that Hoffstein's original parameters give h(K)<0.825 for sufficiently large n K. We generalise Hoffstein's method via Stechkin's trick and prove h(K)<0.58 for all sufficiently large n K, giving the best proved estimate to date. Moreover, ζ K has at least c n K non-trivial zeros with imaginary part in [0,0.58], counted with multiplicity, for some c>0 and n K large enough.

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: "Low Lying Zeros of Dedekind Zeta Functions".

Emmy: Here's the gist of the paper. Low lying zeros of Dedekind zeta functions are studied to establish an unconditional bound on the height of non-trivial zeros, improving previous results by introducing Stechkin’s trick and optimization problems The authors prove that the best proved asymptotic bound to date is h(K) ≤ 0.6 + o(1) as nK → ∞ The paper sets up the context by defining the height of the first non-trivial zero, h(K), and reviewing prior results such as Hoffstein's bound of h(K) ≤ 0.87 + o(1) as nK → ∞ It also mentions Odlyzko's estimate of h(K) ≤ 0.54 + o(1) without proof The authors then introduce the Generalized Riemann Hypothesis (GRH) and the quantity τ (K), which is the first positive height of a zero on the critical line, noting that under GRH, an upper bound for τ (K) is given as ≪ 1 / log log dK as nK → ∞.

Ada: The core of the proof involves adapting Hoffstein’s method by generalizing it using Stechkin’s trick, which introduces shifted differences in the logarithmic derivative of the Dedekind zeta function The construction relies on three identities derived from evaluating the Landau–Stark identity at different points and applying functional equation comparisons These identities combine to produce a comparison weight Φ⃗σ defined in §3.4, which is then used in an optimization problem (Problem A) Optimization and Zero Location The main goal is to solve Problem A, which requires finding parameters (⃗σ, h, η, T) such that several conditions are met One condition involves the symmetrised weight function omega⃗σ(β, γ; h, η) being less than or equal to zero for zeros with height greater than a threshold T The authors show that if both the positivity of the prime ideal contribution and certain conditions on the main terms hold, then there must exist at least one zero with γ < T, implying h(K) < T Improvements and Conclusion The paper demonstrates that by allowing non-zero parameters h and η via Stechkin’s trick, the bound can be improved to h(K) ≤ 0.6 + o(1) as nK → ∞ This is achieved by solving Problem D with specific parameters, leading to a result of h(K) ≤ 0.825 + o(1), nK → ∞ The final proof of Theorem 1.1 uses rigorous interval arithmetic to verify the required inequalities, confirming that both the lower and upper bounds on the height are positive The method is shown to be effective for recovering previous claims about zeros below a certain absolute height Concluding Remarks The authors conclude by noting that Stechkin’s trick is optimal in a certain sense, but future research could explore combining it with other ideas for further improvements They also suggest that the methods developed can be used to recover other known results regarding the existence of zeros below a height of 14 for every K with nK ≥ 2.

Title and authors: Ada: So, we're talking about the paper titled "Low Lying Zeros of Dedekind Zeta Functions," which is really focused on finding the smallest possible height a non-trivial zero can have for a number field K.

Emmy: Exactly. This work looks at the height h(K), which is defined as the smallest absolute value of the imaginary part of a non-trivial zero of its Dedekind zeta function, zeta K(s), and it's trying to beat some previous bounds.

Kolya: It sounds like they are trying to establish a concrete, unconditional bound on this height, building on earlier work that had some results but maybe not the tightest ones.

Ada: That's right. The main thing they set out to do is prove that the best proved asymptotic bound for h(K) is less than or equal to zero point six plus a little error term as nK times K goes to infinity, which we write as nK times K goes to infinity <ref:2610.16010#pg3>.

Emmy: That's a significant improvement over older results, like Hoffstein's bound of zero point eight seven plus an error term as nK times K goes to infinity. We also have Odlyzko's estimate of zero point five four plus an error term without a proof, so this paper is trying to provide a solid proof for something better.

Kolya: So the core methodology here involves adapting Hoffstein's method by using what they call Stechkin’s trick, which introduces shifted differences in the logarithmic derivative of the Dedekind zeta function.

Ada: Right, so they are taking that original method and making it more general by introducing these shifts and then setting up some identities based on evaluating the Landau–Stark identity at different points.

Emmy: They rely on three specific identities derived from those evaluations, which when put together produce this comparison weight function phi sigma, which they use in an optimization problem called Problem A.

Kolya: So they are essentially using these mathematical tools to create a setup where if certain conditions about the prime ideal contribution and some main terms hold, then there must be at least one zero with a height less than some threshold T.

Ada: That's the key idea of Problem A: finding parameters like sigma, h, eta, and T such that the symmetrized weight function omega is less than or equal to zero for zeros with height greater than that threshold T.

Emmy: If they can satisfy those conditions—specifically the positivity of the prime ideal contribution and certain conditions on those main terms—then it forces the existence of at least one zero with its imaginary part gamma being less than T, which means h(K) must be less than T.

Kolya: And what they actually achieve is that by allowing non-zero parameters like h and eta through Stechkin’s trick, they can push that bound down to zero point six plus an error term as nK times K goes to infinity.

Ada: So the improvement from zero point eight seven to zero point six is substantial, and they show this by solving Problem D with specific parameters which leads them to a result of zero point eight two five plus an error term as nK times K goes to infinity.

Emmy: They use rigorous interval arithmetic in the final proof for Theorem one point one to verify all those necessary inequalities, confirming that both the lower and upper bounds on the height are positive, which is important for showing something is actually happening <ref:2610.16010#pg1>.

Kolya: It’s interesting how they show this method can recover previous claims about zeros below a certain absolute height, which gives confidence in the overall approach.

Ada: The authors conclude by saying that Stechkin’s trick is quite optimal in some sense, but they suggest future research could look into combining it with other ideas for even further improvements on this problem.

Emmy: They also point out that the methods they developed can be used to recover other known results about the existence of zeros below a height of fourteen for every K with nK greater than or equal to two.

Kolya: I think what's really interesting is that they showed how this technique works not just for finding an upper bound, but also for recovering lower bounds on where those zeros might be located.

Ada: So to wrap up, the paper "Low Lying Zeros of Dedekind Zeta Functions" provides a rigorous proof that the best proved asymptotic bound for h(K) is zero point six plus an error term as nK times K goes to infinity, which they achieve by generalising Hoffstein’s method with Stechkin’s trick.

Emmy: They accomplish this by solving Problem D with specific parameters, and they use interval arithmetic to verify that the required inequalities hold for both the upper and lower bounds on the height.

Kolya: Ultimately, this work gives us a solid number to work with for understanding how small these zeros can be in these complex number fields.

Ada: We'll leave it there for now, but next time we'll see how this technique might apply to other areas of analytic number theory.

The paper's summary: Ada: So, this paper is about proving an unconditional bound on the height of non-trivial zeros of Dedekind zeta functions, which we call h of K.

Emmy: It’s really about taking a technique used by Hoffstein and making it better by using Stechkin’s trick to introduce some shifts in the logarithmic derivative.

Ada: The main point is they managed to push that known best bound down from zero point eight seven plus an error term to zero point six plus an error term as nK times K goes to infinity.

Emmy: They do this by setting up a specific optimization problem, Problem D, and solving it with certain parameters, which gives them the result of zero point eight two five plus an error term as nK times K goes to infinity.

Ada: It seems like they are using this method not just to find an upper limit but also to show that there must be zeros below a certain height T if they satisfy a few specific conditions about the prime ideal contribution and the main terms.

Emmy: Exactly. They use this structure where if you can make the weight function negative for large imaginary parts, it forces at least one zero to exist with its imaginary part less than that threshold T.

Kolya: For someone just listening, what does this mean? It means we have a much tighter window on how small these zeros can be in these number fields. It’s about moving from guessing where they are to actually proving a concrete limit for how low they can drop.

Ada: Right, so the implication is that even without assuming the Generalized Riemann Hypothesis, we've got this more reliable way of bounding those zeros than we had before.

Emmy: And it shows how robust this method is; they used interval arithmetic in the final proof to make sure both their lower and upper bounds on the height are positive, which confirms they aren't just getting lucky with a single estimate.

Kolya: That’s good because it suggests that these zero-finding strategies we use, like Problem D, can be reliably tuned to confirm something about the distribution of zeros. But what’s left is whether this technique can be generalized to handle even more complicated structures beyond Dedekind zeta functions.

The paper's improvements: Ada: So, this paper isn't just about getting that zero point six bound; they are suggesting ways to make the method itself more flexible for future work.

Emmy: They are pushing the idea of Stechkin’s trick by saying we can allow parameters h and eta to be non-zero, which is a real structural change.

Ada: That actually lets them improve their proven bound from zero point six up to zero point eight two five plus an error term as nK times K goes to infinity, just by solving Problem D with a smaller threshold T0.

Emmy: It’s like they found a better configuration of the underlying geometry that allows for a wider range of parameters and thus a better result.

Ada: And Kolya, you were asking what this means for the tail? This suggests that we can explore more complex zero configurations without losing the ability to get a concrete bound on their height.

Kolya: It means the tools they developed are really robust; they aren't just solving one problem, they've built a system where you can tweak the inputs, like those h and eta values, and still get a verifiable result. The constants in that zero point eight two five bound are what matter for applications.

Ada: Right. And this flexibility opens the door to using these methods to recover other known results about zeros below certain absolute heights, which is a useful check on the method's overall accuracy.

Emmy: They also suggest combining Stechkin’s trick with other ideas, which implies there’s still a lot of room for algebraic geometer insights to be added later on top of this analytic work.

Kolya: I think they hint that these techniques could be used to recover lower bounds on zero locations, which is a big deal for understanding the density and distribution of these zeros in the critical strip.

Ada: So, the implication here is that this framework isn't a dead end; it’s a starting point for more complex investigations into where these zeros actually live.

Conclusion: Ada: So we're wrapping up this look at "Low Lying Zeros of Dedekind Zeta Functions." This paper is really about establishing that zero point six bound for h of K as nK times K goes to infinity through the work on Stechkin’s trick.

Emmy: It’s a solid piece of algebraic geometry applied to number theory; they show how those specific identities from evaluating the Landau–Stark identity can be used to set up an optimization problem that forces a zero into existence near a certain height T.

Kolya: From a probabilistic standpoint, what this means is that we have more certainty about the distribution of these zeros than we did before, because they proved the lower bound as well as the upper bound using interval arithmetic.

Ada: Right, so for anyone listening who just wants to know the result, it’s that h of K is bounded by zero point six plus an error term in this asymptotic limit.

Emmy: And it shows that even when we introduce non-zero parameters like h and eta through Stechkin’s trick, we can still refine our understanding of the structure behind these zeros.

Kolya: I just want to stress that the constants they found for zero point eight two five are what really matter for whether this applies to real-world problems in number theory or not.

Ada: Exactly, and while this paper confirms a strong result, it also leaves room for future work exploring how these methods can be combined with other ideas to push those bounds even further.

Emmy: They’ve pointed out that the structure of Stechkin’s trick is good but maybe not the final word, so we should keep looking at ways to integrate it with other mathematical tools.

Kolya: And I think this whole approach opens up avenues for recovering older claims about zeros below a certain height, which is useful context for where these zeros might actually be hiding.

Ada: So that's the summary of "Low Lying Zeros of Dedekind Zeta Functions"; a rigorous improvement on the known bounds using Stechkin’s trick and optimization problems.

Emmy: It gives us a clearer picture of how analytic number theory and algebraic structure interact when trying to pin down the height of these zeros.

Kolya: Next up, we're going to look at some papers on operator space theory from the maximal viewpoint, which is a bit different but connects nicely with the structural ideas here.

More episodes

← Home