We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.
This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows in a few lines. We believe this to be the most transparent of the elementary proofs of the PNT.
We provide several Tauberian theorems for Laplace transforms with local pseudofunction boundary behavior. Our results generalize and improve various known versions of the Ingham-Fatou-Riesz theorem and the Wiener-Ikehara theorem. Using local pseudofunction boundary behavior enables us to relax boundary requirements to a minimum. Furthermore, we allow possible null sets of boundary singularities and remove unnecessary uniformity conditions occurring in earlier works; to this end, we obtain a useful characterization of local pseudofunctions. Most of our results are proved under one-sided Tauberi…
It is well known that there is an absolute constant $\mathfrak{C}>0$ such that if the Laplace transform $G(s)=\int_{0}^{\infty}ρ(x)e^{-s x}\:\mathrm{d}x$ of a bounded function $ρ$ has analytic continuation through every point of the segment $(-iλ,iλ)$ of the imaginary axis, then $$ \limsup_{x\to\infty} \left|\int_{0}^{x}ρ(u)\:\mathrm{d}u - G(0)\right|\leq \frac{ \mathfrak{C}}λ \: \limsup_{x\to\infty} |ρ(x)|. $$ The best known value of the constant $\mathfrak{C}$ was so far $\mathfrak{C}=2$. In this article we show that the inequality holds with $\mathfrak{C}=π/2$ and that this value is best po…
This is a new proof of the tauberian theorem of complex Laplace transformation for getting a simple proof of the prime numbers theorem $π(x) \sim \frac{x}{\log(x)}$ for a largest real $x$.
Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is also quite adaptable, and it is readily combined with well-known results from prime number theory. We demonstrate this by proving a version of the theorem for primes in arithmetic progressions with uniformity in the modulus, as well as a non-abelian analogue of this.
In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of operator theory.
Associated with a given suitable function, or a measure, on $\mathbb{R}$, we introduce a correlation function, so that the Wronskian of the Fourier transform of the function is the Fourier transform of the corresponding correlation function, and the same holds for the Laplace transform. We obtain two types of results. First, we show that Wronskians of the Fourier transform of a nonnegative function on $\mathbb{R}$ are positive definite functions and the Wronskians of the Laplace transform of a nonnegative function on $\mathbb{R}_+$ are completely monotone functions. Then we establish necessary…
For each prime $p\equiv 1\pmod{4}$ consider the Legendre character $χ=(\frac{\cdot}{p})$. Let $p_\pm(n)$ be the number of partitions of $n$ into parts $λ>0$ such that $χ(λ)=\pm 1$. Petersson proved a beautiful limit formula for the ratio of $p_+(n)$ to $p_-(n)$ as $n\to\infty$ expressed in terms of important invariants of the real quadratic field $\mathbb{Q}(\sqrt{p})$. But his proof is not illuminating and Grosswald conjectured a more natural proof using a Tauberian converse of the Stolz-Cesàro theorem. In this paper we suggest an approach to address Grosswald's conjecture. We discuss a monot…
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic partition function of primes, in number theory called the generating function of the distinct prime partitions, in the saddle-point approximation. We find that our result of $Q_{as}(n)$, which includes two higher-order corrections to the leading term in its exponent and a pre-exponential correction factor, approximates the exact $Q(n)$ far better than its simple l…
In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of quantum statistical mechanics. First, the bosonic partition function of primes, or the generating function of unrestricted prime partitions in number theory, is constructed. Next, the density of states is obtained using the saddle-point method for Laplace inversion of the partition function in the limit of large n. This directly gives the asymptotic number of …