Perron's formula recovers coefficient partial sums from a Dirichlet series by the Mellin inversion formula. Suppose is absolutely convergent at a fixed real . For ,The prime on the sum means that the term with receives weight if is an integer; for noninteger it is the ordinary sum over . The integral is taken as a symmetric vertical limit, not asserted absolutely convergent on the infinite line.
The scalar truncated Perron kernel estimate tends to when , to when , and to when . Absolute convergence on the line allows the coefficient sum to be interchanged with the finite integral and justifies passing to this limit. In analytic number theory, one then shifts the contour through poles and past controlled singularities: their residues supply main terms and error terms in the summatory function. The truncated Perron formula makes the finite-height error explicit.
The Perron's formula kernel integrates to , giving the smoothed sum as an integral of . For each fixed height , a zero-free rectangle permits shifting the central contour to a real part below one; its vertical contribution is , and its horizontal contributions are when the original real part is . A bound for bounds the remaining tails by . Letting grow first and afterward proves the displayed cancellation, without uniform estimates to the left of one.
If the Dirichlet series is absolutely convergent at , thenThe scalar kernel is . This follows by Fourier inversion applied to , whose Fourier transform is . Absolute convergence of the series and of justifies interchange. The factor is essential.
Suppose and , with . For , direct subtraction givesThe last term has absolute value . Choose to obtain the displayed bound, with an additional term harmless as for fixed . This elementary finite-difference argument converts a logarithmically smoothed Perron formula bound to cancellation in its original partial sum.
Suppose the Dirichlet series converges absolutely at a fixed real . For and , putThenAs in Perron's formula, the prime denotes half weight at an integer endpoint. If , interpret the minimum as ; the sharper endpoint kernel error is .
To prove the bound, interchange the absolutely convergent coefficient sum with the finite integral and apply the truncated Perron kernel estimate term by term. The logarithmic denominator explains why coefficients near require separate control: truncating the contour cannot instantly distinguish the two sides of the endpoint. This estimate is a starting point for explicit Prime number theorem error bounds.
For , and , apply the truncated Perron formula with Von Mangoldt function coefficients at both endpoints on the same vertical line. The difference kernel is , of modulus . The usual near-integer error bound contributes . The logarithmic derivative on this line is finite because of the Euler product.
For , differs from by . Close the contour to the left for and to the right for ; horizontal sides give the logarithmic denominator and the nearby transition is bounded. At , direct integration gives . This explains the half-weight endpoint in the truncated Perron formula. The constants may be taken uniform for and .
Articles by others on the same topic
Perron's formula is a result in analytic number theory that provides a way to express the sum of the count of integer solutions to certain equations involving prime numbers. It specifically relates to the distribution of prime numbers and is often applied in studies of prime power distributions. The formula is closely associated with the theory of Dirichlet series and often comes up in the context of additive number theory.