Euler–Maclaurin formula

Euler–Maclaurin formula is an asymptotic summation formula connecting discrete sums and continuous integrals. It expresses the difference between a finite sum of values of a smooth function and the integral of that function in terms of derivatives evaluated at the endpoints and Bernoulli number corrections. The formula underlies techniques used by Leonhard Euler and Colin Maclaurin in problems related to series acceleration, numerical integration, and analytic continuation.

Statement

Let f be sufficiently smooth on the interval [a,b]. The Euler–Maclaurin relationship writes the finite sum Σ_{k=a}^{b} f(k) in terms of the integral ∫_{a}^{b} f(x) dx, endpoint derivative evaluations f^{(m)}(a), f^{(m)}(b), and a series involving Bernoulli numbers B_{2m}. In its standard truncated form the equality includes a remainder term R_N expressible with higher derivatives or via an integral involving the periodic Bernoulli function. Variants specialize to half-integer shifts, alternating sums, and one-sided sums used by James Stirling in derivations of Stirling's approximation and by Adrien-Marie Legendre in analytic studies.

Proofs and derivations

One classical derivation integrates repeated application of integration by parts to the identity f(x)=∫ f'(x) dx and uses the generating function for Bernoulli numbers obtained by expanding t/(e^t-1). Euler's approach combined power series manipulations with finite difference calculus and appeals to results known to Joseph-Louis Lagrange and Brook Taylor. Modern proofs employ the Poisson summation formula associated with Joseph Fourier transforms and complex contour integrals used by Augustin-Louis Cauchy and Bernhard Riemann; these proofs connect the remainder term to the analytic continuation of the Riemann zeta function and use residue calculus in the style of Karl Weierstrass. Alternative constructive proofs use spline interpolation and the theory of periodic distributions developed after Sofia Kovalevskaya and Paul Dirac.

Applications

The formula accelerates convergence of slowly convergent series encountered by Leonhard Euler in work on the Basel problem and by Niels Henrik Abel in studies of series summation. It supplies rigorous derivations of asymptotic expansions such as Stirling's approximation for factorials used by Pierre-Simon Laplace in probability and by Carl Friedrich Gauss in number theory. In numerical analysis it underpins composite quadrature rules and error estimates used in algorithms attributed to John von Neumann and Alan Turing. Analytic number theory applications include evaluation of explicit formulas linking prime-counting functions considered by Bernhard Riemann and later refined by Atle Selberg and G. H. Hardy. In mathematical physics the technique appears in regularization of divergent sums, as in computations by Enrico Fermi and Richard Feynman involving zero-point energies and quantum field theoretic Casimir-type calculations.

Generalizations and extensions

Extensions replace Bernoulli number corrections with Euler–Maclaurin analogues for periodic and multi-dimensional lattices, connecting with the Poisson summation formula and the Ehrhart polynomial theory studied by Eugène Ehrhart and Mikhail Gromov. Multivariate forms appear in the analysis of lattice-point enumeration problems addressed in works by Hermann Minkowski and George Pólya. p-adic and adelic analogues link to methods used by Alexander Grothendieck and Jean-Pierre Serre in arithmetic geometry; microlocal and distributional extensions draw on the pseudodifferential operator framework developed by Lars Hörmander. Analytic continuations and resurgent transseries reinterpret the remainder in the language of Écalle's resurgence theory and have been used in exact WKB analysis popularized by Kiyoshi Ito and Barry Simon.

History and attribution

The formula emerged from investigations in the 18th century when Leonhard Euler published treatments using power series and finite difference techniques and Colin Maclaurin offered an independent development in the context of interpolation and summation. Historical accounts trace antecedents to earlier work on series by Jakob Bernoulli and to methods circulated in the Royal Society correspondence of the period involving figures such as Isaac Newton and Brook Taylor. Scholarly disputes over priority reflect the collaborative and competitive milieu of Enlightenment mathematics; later historiography credits both Euler and Maclaurin for promulgating the identity and its systematic use in analytic and numerical practice by successors including Joseph Fourier, Carl Friedrich Gauss, and Bernhard Riemann.

Category:Mathematical analysis