1 Introduction
Let K be a number field of degree $n \geqslant 3$ , signature $(r_1,r_2)$ , discriminant $(-1)^{r_2}d_K$ , class number $h_K$ , regulator $\mathcal {R}_K$ , and let $w_K$ be the number of roots of unity in K. Let $\kappa _K$ be the residue at $s=1$ of the Dedekind zeta-function $\zeta _K(s)$ attached to K. Estimating $h_K$ is a long-standing problem in algebraic number theory. One of the classic way is the use of the so-called analytic class number formula stating that
and to use Hecke’s integral representation and the functional equation of the Dedekind zeta-function to majorize $\kappa _K$ . This is done in [Reference Louboutin7, Reference Louboutin8] with additional properties of log-convexity of some functions related to $\zeta _K$ which enables Louboutin to reach the following bound:
Let $r_K(m)$ be the mth coefficient of $\zeta _K$ , i.e., the number of nonzero integral ideals of $\mathcal {O}_K$ of norm m, and denote $\Delta _K(x)$ to be the error term in the Ideal Theorem, i.e.,
The aim of this work is to prove the following result.
Theorem 1.1 Let K be an algebraic number field of degree $n \geqslant 3$ , and set $\gamma _3 = 214$ and $\gamma _n = 10$ if $n \geqslant 4$ . Assume that there exist $\alpha \in \left ( 0,\frac {2}{n} \right )$ and a constant
such that, for $x \geqslant 1,$
where $\Delta _K(x)$ is given in (1.3). Then
2 Tools
The first lemma is a Titchmarsh-like generalization of [Reference Titchmarsh and Heath-Brown12, Theorem 12.5] to number fields established by Ayoub [Reference Ayoub1]. The result is stated for the quadratic case, but as it can be seen in the proof and as the author points it out, it is still true for the general case (see also [Reference Ivić5, Lemma 13.3]).
Lemma 2.1 Let $n \geqslant 3$ and $\mu _K$ be the infimum of the real numbers $\sigma $ for which the integral
converges. Then $\mu _K \leqslant 1 - \frac {2}{n}$ and, for all $\mu _K < \sigma < 1$ , we have
Proof Assume $\frac {1}{n} \leqslant \sigma \leqslant 1 - \frac {1}{n}$ . By [Reference Chandrasekharan and Narasimhan3, Theorem 4], we have, for all $\varepsilon> 0,$
The exponent of T is less than $2$ for $\sigma> 1 - \frac {2-\varepsilon }{n}$ and note that $1 - \frac {2}{n} \geqslant \frac {1}{n}$ since $n \geqslant 3$ . This implies that
for some $\eta = \eta (\varepsilon )>0$ . Now replacing T by $2^{-j}T$ and summing over $j \geqslant 1$ yields $\mu _K \leqslant 1 - \frac {2}{n}$ . For the second part of the lemma, we start by using Perron’s formula [Reference Tenenbaum11, (2.3) p. 217] yielding
where ${\sideset {^{\phantom {\prime }}}{^\prime }\sum }$ means that if x is a positive integer, then $\frac {1}{2} r_K(x)$ comes instead of $r_K(x)$ . Moving the line of integration to some $1- (600)^{-2/3} n^{-7/3} \leqslant c < 1$ sufficiently close to $1$ , we get
so that
Using [Reference Stas9] (see also [Reference Bordellès2, Theorem 7.18]), there exists an absolute constant $c_0> 0$ such that, for $1- (600)^{-2/3} n^{-7/3} \leqslant c < \sigma < 1$ and $t \geqslant e,$
so that $\zeta _K(s) s^{-1} \to 0$ uniformly in the strip $1- (600)^{-2/3} n^{-7/3} \leqslant c < \sigma < 1$ as $|t| \to \infty $ . Hence, on integrating over the rectangle $d \pm i T$ , $c \pm iT$ , with $\gamma _K < d < c < 1$ , we infer that (2.1) holds for any $\gamma _K < c < 1$ . Replacing in (2.1) x by $1/x$ , taking $\gamma _K < c < 1$ , and using Parseval’s formula [Reference Ivić5, Identity (A5)] yields
as required.
Corollary 2.2 Assume hypothesis (1.4), and let $0 < \delta < \alpha < \frac {2}{n}$ . Then
Proof Using Lemma 2.1, (1.4) and the trivial bound $\left | \Delta _K(x) \right | \leqslant \kappa _K x$ when $x \in \left [ 0,1 \right )$
and using the Cauchy–Schwarz inequality, we get
as asserted.
Lemma 2.3 Uniformly for all $x \geqslant 1$ and all $n \in {\mathbb {Z}}_{\geqslant 1}$ , we have
Proof Let $\tau _n$ be the nth Piltz–Dirichlet divisor function. We have $r_K (m) \leqslant \tau _n(m)$ and from the bound [Reference Bordellès2, Exercise 78]
so that
where we used [Reference Gould4, Identity (1.5)] in the $6$ th line, and the fact that, for $0 \leqslant k \leqslant n-3$ ,
by the GM–AM inequality stating that $\left ( a_1 \ldots a_N \right )^{1/N} \leqslant N^{-1} \left ( a_1 + \dotsb + a_N \right ) $ , where $a_k> 0$ , and this bound also holds when $k= n-2$ .
Lemma 2.4 If $n \geqslant 3$ , $0 < \alpha < \frac {2}{n}$ and $\log C_K \geqslant \gamma _n$ , then
Proof Squaring the inequality of the lemma, it is equivalent to show
The function $\alpha \in \left ( 0, \frac {2}{n} \right ) \mapsto \frac {\alpha ^{2n-5} e^{2\alpha (n-1)+2}}{1-\alpha }$ is nondecreasing, so that
and, therefore, it suffices to show
Using Stirling’s bound, the inequality of the lemma is guaranteed as soon as
and since the right-hand side is a nonincreasing function in $n \geqslant 3$ , it then suffices that $\log C_K \geqslant s_n$ , where and whenever $n \geqslant 4$ .
3 Proof of the main result
By (1.1), it is sufficient to show that
Assume $n \geqslant 3$ , and let $0 < \delta < \alpha < \frac {2}{n}$ and $x \geqslant 1$ satisfying
and
By another Perron’s formula (see, for instance, [Reference Tenenbaum11, (2.9) p. 220]), we have
Shifting the contour integration to the line $\sigma = 1 - \delta $ and picking up the residue of the integrand at the unique simple pole $s=1$ , we obtain by Cauchy’s theorem
and using Corollary 2.2, we get
Therefore, using (3.2), we derive
and Lemma 2.3 yields
whenever x and $\delta $ satisfy (3.2). Now choose
Note that (3.2) is satisfied if $\left ( \alpha \log x - 1 \right ) \left (1 + (1-\alpha ) \log x \right ) \geqslant e^2 (\log x)^2 x^{-2\alpha }$ . But using (3.3), we get
Therefore, with the choice (3.4), we derive
provided that (3.3) is fulfilled. We next choose
This yields
Now, since $\log C_K \geqslant \gamma _n \geqslant 10> 10 - \frac {10}{n} \geqslant 5 \alpha (n-1)$ , we derive using Lemma 2.4
and, therefore,
which is (3.1). Now substituting this bound into (1.1) yields the desired result.
4 Example
Improving a result in Sunley’s thesis [Reference Sunley10], Lee [Reference Lee13] proved that, for all $x> 0,$
with . Hence, one can take $\alpha = \frac {2}{n+1}$ and
The hypothesis $\log C_K \geqslant \max \left ( \gamma _n \, , \, \alpha n + \frac {1}{4 \alpha ^2}\right )$ is easily fulfilled, and noticing that, for any $n \geqslant 3,$
we infer that Theorem 1.1 yields the following result.
Corollary 4.1 Let K be an algebraic number field of degree $n \geqslant 3$ . Then
where $\left. \begin {array}{c} L_K \\ \ell _K \end {array} \right \rbrace := \tfrac {1}{4} (n^2-1) \log \log d_K + \left \lbrace \begin {array}{c} 3 n^2 \log n \\ \frac {1}{2} n^2 \log n. \end {array} \right.$
Note that Stirling’s bound yields
which may be more easily compared to (1.2). It finally should be pointed out that Lee slightly improved in [Reference Lee6] the value of $C_K$ , showing that
with $m_K = (n^2 \pi /4)^{n} (n!)^{-2}$ and, if $n> 13,$
Note that the author also gives the value of $\rho _K(n)$ in the range $2 \leqslant n \leqslant 13$ . Although an improvement over the previous value of $C_K$ , this result is somewhat irrelevant on ours, while the calculations of $L_K$ and $\ell _K$ are more tedious.
Acknowledgment
The author deeply acknowledges the anonymous referee for some corrections and remarks that have significantly enhanced the paper. The author also warmly thanks Stephan R. Garcia and Ethan S. Lee for sending him Sunley’s thesis [Reference Sunley10] and Lee’s preprint [Reference Lee13].