﻿

# Bernoulli polynomials

In mathematics, the Bernoulli polynomials occur in the study of many special functions and in particular the Riemann zeta function and the Hurwitz zeta function. This is in large part because they are an Appell sequence, i.e. a Sheffer sequence for the ordinary derivative operator. Unlike orthogonal polynomials, the Bernoulli polynomials are remarkable in that the number of crossings of the "x"-axis in the unit interval does not go up as the degree of the polynomials goes up. In the limit of large degree, the Bernoulli polynomials, appropriately scaled, approach the sine and cosine functions.

Representations

The Bernoulli polynomials "B""n" admit a variety of different representations. Which among them should be taken to be the definition may depend on one's purposes.

Explicit formula

:$B_n\left(x\right) = sum_\left\{k=0\right\}^n \left\{n choose k\right\} b_k x^\left\{n-k\right\},$

for "n" &ge; 0, where "b""k" are the Bernoulli numbers.

Generating functions

The generating function for the Bernoulli polynomials is

:$frac\left\{t e^\left\{xt\left\{e^t-1\right\}= sum_\left\{n=0\right\}^infty B_n\left(x\right) frac\left\{t^n\right\}\left\{n!\right\}.$

The generating function for the Euler polynomials is :$frac\left\{2 e^\left\{xt\left\{e^t+1\right\}= sum_\left\{n=0\right\}^infty E_n\left(x\right) frac\left\{t^n\right\}\left\{n!\right\}.$

Representation by a differential operator

The Bernoulli polynomials are also given by

:$B_n\left(x\right)=\left\{D over e^D -1\right\} x^n$

where "D" = "d"/"dx" is differentiation with respect to "x" and the fraction is expanded as a formal power series.

Representation by an integral operator

The Bernoulli polynomials are the unique polynomials determined by

:$int_x^\left\{x+1\right\} B_n\left(u\right),du = x^n.$

The integral operator

:$\left(Tf\right)\left(x\right) = int_x^\left\{x+1\right\} f\left(u\right),du$

on polynomials "f", is the same as

:

Another explicit formula

An explicit formula for the Bernoulli polynomials is given by

:$B_m\left(x\right)= sum_\left\{n=0\right\}^m frac\left\{1\right\}\left\{n+1\right\}sum_\left\{k=0\right\}^n \left(-1\right)^k \left\{n choose k\right\} \left(x+k\right)^m.$

Note the remarkable similarity to the globally convergent series expression for the Hurwitz zeta function. Indeed, one has

:$B_n\left(x\right) = -n zeta\left(1-n,x\right)$

where $zeta\left(s,q\right)$ is the Hurwitz zeta; thus, in a certain sense, the Hurwitz zeta generalizes the Bernoulli polynomials to non-integer values of "n".

The inner sum may be understood to be the "n"th forward difference of $x^m$; that is,

:$Delta^n x^m = sum_\left\{k=0\right\}^n \left(-1\right)^\left\{n-k\right\} \left\{n choose k\right\} \left(x+k\right)^m$

where &Delta; is the forward difference operator. Thus, one may write

:$B_m\left(x\right)= sum_\left\{n=0\right\}^m frac\left\{\left(-1\right)^n\right\}\left\{n+1\right\} Delta^n x^m.$

This formula may be derived from an identity appearing above as follows: since the forward difference operator &Delta; is equal to

:$Delta = e^D - 1,$

where "D" is differentiation with respect to "x", we have

:$\left\{D over e^D - 1\right\} = \left\{log\left(Delta + 1\right) over Delta\right\} = sum_\left\{n=0\right\}^infty \left\{\left(-Delta\right)^n over n+1\right\}.$

As long as this operates on an "m"th-degree polynomial such as "x""m", one may let "n" go from 0 only up to "m".

An integral representation for the Bernoulli polynomials is given by the Nörlund-Rice integral, which follows from the expression as a finite difference.

An explicit formula for the Euler polynomials is given by:$E_m\left(x\right)= sum_\left\{n=0\right\}^m frac\left\{1\right\}\left\{2^n\right\}sum_\left\{k=0\right\}^n \left(-1\right)^k \left\{n choose k\right\} \left(x+k\right)^m.$

This may also be written in terms of the Euler numbers $E_k$ as:$E_m\left(x\right)= sum_\left\{k=0\right\}^m \left\{m choose k\right\}left\left(frac\left\{1\right\}\left\{2\right\} ight\right)^k left\left(x-frac\left\{1\right\}\left\{2\right\} ight\right)^\left\{m-k\right\} E_k,.$

ums of "p"th powers

We have

:$sum_\left\{k=0\right\}^\left\{x\right\} k^p = frac\left\{B_\left\{p+1\right\}\left(x+1\right)-B_\left\{p+1\right\}\left(0\right)\right\}\left\{p+1\right\}.$

See Faulhaber's formula for more on this.

The Bernoulli and Euler numbers

The Bernoulli numbers are given by $B_n=B_n\left(0\right).$

The Euler numbers are given by $E_n=2^nE_n\left(1/2\right).$

Explicit expressions for low degrees

The first few Bernoulli polynomials are::$B_0\left(x\right)=1,$:$B_1\left(x\right)=x-1/2,$:$B_2\left(x\right)=x^2-x+1/6,$:$B_3\left(x\right)=x^3-frac\left\{3\right\}\left\{2\right\}x^2+frac\left\{1\right\}\left\{2\right\}x,$:$B_4\left(x\right)=x^4-2x^3+x^2-frac\left\{1\right\}\left\{30\right\},$:$B_5\left(x\right)=x^5-frac\left\{5\right\}\left\{2\right\}x^4+frac\left\{5\right\}\left\{3\right\}x^3-frac\left\{1\right\}\left\{6\right\}x,$:$B_6\left(x\right)=x^6-3x^5+frac\left\{5\right\}\left\{2\right\}x^4-frac\left\{1\right\}\left\{2\right\}x^2+frac\left\{1\right\}\left\{42\right\}.,$

The first few Euler polynomials are:$E_0\left(x\right)=1,$:$E_1\left(x\right)=x-1/2,$:$E_2\left(x\right)=x^2-x,$:$E_3\left(x\right)=x^3-frac\left\{3\right\}\left\{2\right\}x^2+frac\left\{1\right\}\left\{4\right\},$:$E_4\left(x\right)=x^4-2x^3+x,$:$E_5\left(x\right)=x^5-frac\left\{5\right\}\left\{2\right\}x^4+frac\left\{5\right\}\left\{2\right\}x^2-frac\left\{1\right\}\left\{2\right\},$:$E_6\left(x\right)=x^6-3x^5+5x^3-3x.,$

Differences and derivatives

The Bernoulli and Euler polynomials obey many relations from umbral calculus:

:$Delta B_n\left(x\right) = B_n\left(x+1\right)-B_n\left(x\right)=nx^\left\{n-1\right\},$

:$Delta E_n\left(x\right) = E_n\left(x+1\right)-E_n\left(x\right)=2x^n.$

(&Delta; is the forward difference operator).

These polynomial sequences are Appell sequences:

:$B_n\text{'}\left(x\right)=nB_\left\{n-1\right\}\left(x\right),,$

:$E_n\text{'}\left(x\right)=nE_\left\{n-1\right\}\left(x\right).,$

Translations

:$B_n\left(x+y\right)=sum_\left\{k=0\right\}^n \left\{n choose k\right\} B_k\left(x\right) y^\left\{n-k\right\}$

:$E_n\left(x+y\right)=sum_\left\{k=0\right\}^n \left\{n choose k\right\} E_k\left(x\right) y^\left\{n-k\right\}$

These identities are also equivalent to saying that these polynomial sequences are Appell sequences. (Hermite polynomials are another example.)

ymmetries

:$B_n\left(1-x\right)=\left(-1\right)^nB_n\left(x\right),quad n ge 0,$

:$E_n\left(1-x\right)=\left(-1\right)^n E_n\left(x\right),$

:$\left(-1\right)^n B_n\left(-x\right) = B_n\left(x\right) + nx^\left\{n-1\right\},$

:$\left(-1\right)^n E_n\left(-x\right) = -E_n\left(x\right) + 2x^n,$

Zhi-Wei Sun and Hao Pan [http://arxiv.org/abs/math/0409035] established the following surprising symmetric relation: If "r" + "s" + "t" = "n" and "x" + "y" + "z" = 1, then

:$r \left[s,t;x,y\right] _n+s \left[t,r;y,z\right] _n+t \left[r,s;z,x\right] _n=0,$

where

:$\left[s,t;x,y\right] _n=sum_\left\{k=0\right\}^n\left(-1\right)^k\left\{s choose k\right\}\left\{tchoose \left\{n-kB_\left\{n-k\right\}\left(x\right)B_k\left(y\right).$

Fourier series

The Fourier series of the Bernoulli polynomials is also a Dirichlet series, given by the expansion

:$B_n\left(x\right) = -frac\left\{n!\right\}\left\{\left(2pi i\right)^n\right\}sum_\left\{k ot=0 \right\}frac\left\{e^\left\{2pi i x\left\{k^n\right\}.$

This is a special case of the analogous form for the Hurwitz zeta function

:$B_n\left(x\right) = -Gamma\left(n+1\right) sum_\left\{k=1\right\}^infty frac\left\{ exp \left(2pi ikx\right) + e^\left\{ipi n\right\} exp \left(2pi ik\left(1-x\right)\right) \right\} \left\{ \left(2pi ik\right)^n \right\}.$

This expansion is valid only for 0 &le; "x" &le; 1 when "n" &ge; 2 and is valid for 0 < "x" < 1 when "n" = 1.

The Fourier series of the Euler polynomials may also be calculated. Defining the functions

:$C_ u\left(x\right) = sum_\left\{k=0\right\}^infty frac \left\{cos\left(\left(2k+1\right)pi x\right)\right\} \left\{\left(2k+1\right)^ u\right\}$

and

:$S_ u\left(x\right) = sum_\left\{k=0\right\}^infty frac \left\{sin\left(\left(2k+1\right)pi x\right)\right\} \left\{\left(2k+1\right)^ u\right\}$

for $u > 1$, the Euler polynomial has the Fourier series

:$C_\left\{2n\right\}\left(x\right) = frac\left\{\left(-1\right)^n\right\}\left\{4\left(2n-1\right)!\right\} pi^\left\{2n\right\} E_\left\{2n-1\right\} \left(x\right)$

and

:$S_\left\{2n+1\right\}\left(x\right) = frac\left\{\left(-1\right)^n\right\}\left\{4\left(2n\right)!\right\} pi^\left\{2n+1\right\} E_\left\{2n\right\} \left(x\right).$

Note that the $C_ u$ and $S_ u$ are odd and even, respectively:

:$C_ u\left(x\right) = -C_ u\left(1-x\right)$

and

:$S_ u\left(x\right) = S_ u\left(1-x\right).$

They are related to the Legendre chi function $chi_ u$ as

:$C_ u\left(x\right) = mbox\left\{Re\right\} chi_ u \left(e^\left\{ix\right\}\right)$

and

:$S_ u\left(x\right) = mbox\left\{Im\right\} chi_ u \left(e^\left\{ix\right\}\right).$

Inversion

The Bernoulli polynomials may be inverted to express the monomial in terms of the polynomials. Specifically, one has

:$x^n = frac \left\{1\right\}\left\{n+1\right\} sum_\left\{k=0\right\}^n \left\{n+1 choose k\right\} B_k \left(x\right).$

Relation to falling factorial

The Bernoulli polynomials may be expanded in terms of the falling factorial $\left(x\right)_k$ as

:where $B_n=B_n\left(0\right)$ and

:

denotes the Stirling number of the second kind. The above may be inverted to express the falling factorial in terms of the Bernoulli polynomials:

:

where :

denotes the Stirling number of the first kind.

Multiplication theorems

The multiplication theorems were given by Joseph Ludwig Raabe in 1851:

:$B_n\left(mx\right)= m^\left\{n-1\right\} sum_\left\{k=0\right\}^\left\{m-1\right\} B_n left\left(x+frac\left\{k\right\}\left\{m\right\} ight\right)$

:$E_n\left(mx\right)= m^n sum_\left\{k=0\right\}^\left\{m-1\right\} \left(-1\right)^k E_n left\left(x+frac\left\{k\right\}\left\{m\right\} ight\right)quad mbox\left\{ for \right\} m=1,3,dots$

:$E_n\left(mx\right)= frac\left\{-2\right\}\left\{n+1\right\} m^n sum_\left\{k=0\right\}^\left\{m-1\right\} \left(-1\right)^k B_\left\{n+1\right\} left\left(x+frac\left\{k\right\}\left\{m\right\} ight\right)quad mbox\left\{ for \right\} m=2,4,dots$

Integrals

Indefinite integrals:$int_a^x B_n\left(t\right),dt = frac\left\{B_\left\{n+1\right\}\left(x\right)-B_\left\{n+1\right\}\left(a\right)\right\}\left\{n+1\right\}$

:$int_a^x E_n\left(t\right),dt = frac\left\{E_\left\{n+1\right\}\left(x\right)-E_\left\{n+1\right\}\left(a\right)\right\}\left\{n+1\right\}$

Definite integrals:$int_0^1 B_n\left(t\right) B_m\left(t\right),dt = \left(-1\right)^\left\{n-1\right\} frac\left\{m! n!\right\}\left\{\left(m+n\right)!\right\} B_\left\{n+m\right\}quad mbox \left\{ for \right\} m,n ge 1$

:$int_0^1 E_n\left(t\right) E_m\left(t\right),dt = \left(-1\right)^\left\{n\right\} 4 \left(2^\left\{m+n+2\right\}-1\right)frac\left\{m! n!\right\}\left\{\left(m+n+2\right)!\right\} B_\left\{n+m+2\right\}$

Periodic Bernoulli polynomials

A periodic Bernoulli polynomial "P""n"("x") is a Bernoulli polynomial evalated at the fractional part of the argument "x". These functions are used to provide the remainder term in the Euler–Maclaurin formula relating sums to integrals. The first polynomial is a sawtooth function.

References

* Milton Abramowitz and Irene A. Stegun, eds. "Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables", (1972) Dover, New York. "(See [http://www.math.sfu.ca/~cbm/aands/page_804.htm Chapter 23] )"

* See chapter 12.11 of Apostol IANT

* Djurdje Cvijović and Jacek Klinowski, "New formulae for the Bernoulli and Euler polynomials at rational arguments", Proceedings of the American Mathematical Society123"' (1995), 1527-1535.

* Jesus Guillera and Jonathan Sondow, " [http://arxiv.org/abs/math.NT/0506319 Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent] " (2005) "(Reviews relationship to the Hurwitz zeta function and Lerch transcendent.)"

* [http://upload.wikimedia.org/wikipedia/en/9/9f/Bernoulli_Polynomials_and_Their_Applications.pdf Kurtulan, Ali Burak "Bernoulli Polynomials and Their Applications"]

*

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Bernoulli — can refer to: *any one or more of the Bernoulli family of Swiss mathematicians in the eighteenth century, including: ** Daniel Bernoulli (1700–1782), developer of Bernoulli s principle ** Jakob Bernoulli (1654–1705), also known as Jean or Jacques …   Wikipedia

• Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

• Bernoulli process — In probability and statistics, a Bernoulli processis a discrete time stochastic process consisting ofa sequence of independent random variables taking values over two symbols. Prosaically, a Bernoulli process is coin flipping, possibly with an… …   Wikipedia

• Bernoulli family — The Bernoullis were a family of traders and scholars from Basel, Switzerland. The founder of the family, Leon Bernoulli, immigrated to Basel from Antwerp in the Flanders in the 16th century.The Bernoulli family has produced many notable artists… …   Wikipedia

• Euler–Worpitzky–Chen polynomials — Introduction = The Euler Worpitzky Chen polynomials are closely related to the family of Euler Bernoulli polynomials and numbers. The coefficients of the polynomialsare integers, in contrast to the coefficients of the Euler and Bernoulli… …   Wikipedia

• Euler–Maclaurin formula — In mathematics, the Euler–Maclaurin formula provides a powerful connection between integrals (see calculus) and sums. It can be used to approximate integrals by finite sums, or conversely to evaluate finite sums and infinite series using… …   Wikipedia

• Faulhaber's formula — In mathematics, Faulhaber s formula, named after Johann Faulhaber, expresses the sum:sum {k=1}^n k^p = 1^p + 2^p + 3^p + cdots + n^pas a ( p + 1)th degree polynomial function of n , the coefficients involving Bernoulli numbers.Note: By the most… …   Wikipedia

• Multiplication theorem — In mathematics, the multiplication theorem is a certain type of identity obeyed by many special functions related to the gamma function. For the explicit case of the gamma function, the identity is a product of values; thus the name. The various… …   Wikipedia

• Polylogarithm — Not to be confused with polylogarithmic. In mathematics, the polylogarithm (also known as Jonquière s function) is a special function Lis(z) that is defined by the infinite sum, or power series: It is in general not an elementary function, unlike …   Wikipedia

• List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia