Bernoulli polynomials

From LaTeX CAS translator demo
Jump to navigation Jump to search

In mathematics, the Bernoulli polynomials, named after Jacob Bernoulli, combine the Bernoulli numbers and binomial coefficients. They are used for series expansion of functions, and with the Euler–MacLaurin formula.

These polynomials occur in the study of many special functions and, in particular the Riemann zeta function and the Hurwitz zeta function. They are an Appell sequence (i.e. a Sheffer sequence for the ordinary derivative operator). For the Bernoulli polynomials, the number of crossings of the x-axis in the unit interval does not go up with the degree. In the limit of large degree, they approach, when appropriately scaled, the sine and cosine functions.

Bernoulli polynomials

A similar set of polynomials, based on a generating function, is the family of Euler polynomials.

Representations

The Bernoulli polynomials Bn can be defined by a generating function. They also admit a variety of derived representations.

Generating functions

The generating function for the Bernoulli polynomials is

textet1=n=0Bn(x)tnn!.

The generating function for the Euler polynomials is

2extet+1=n=0En(x)tnn!.

Explicit formula

Bn(x)=k=0n(nk)Bnkxk,
Em(x)=k=0m(mk)Ek2k(x12)mk.

for n ≥ 0, where Bk are the Bernoulli numbers, and Ek are the Euler numbers.

Representation by a differential operator

The Bernoulli polynomials are also given by

Bn(x)=DeD1xn

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

axBn(u)du=Bn+1(x)Bn+1(a)n+1.

cf. integrals below. By the same token, the Euler polynomials are given by

En(x)=2eD+1xn.

Representation by an integral operator

The Bernoulli polynomials are also the unique polynomials determined by

xx+1Bn(u)du=xn.

The integral transform

(Tf)(x)=xx+1f(u)du

on polynomials f, simply amounts to

(Tf)(x)=eD1Df(x)=n=0Dn(n+1)!f(x)=f(x)+f(x)2+f(x)6+f(x)24+.

This can be used to produce the inversion formulae below.

Another explicit formula

An explicit formula for the Bernoulli polynomials is given by

Bm(x)=n=0m1n+1k=0n(1)k(nk)(x+k)m.

That is similar to the series expression for the Hurwitz zeta function in the complex plane. Indeed, there is the relationship

Bn(x)=nζ(1n,x)

where ζ(sq) is the Hurwitz zeta function. The latter generalizes the Bernoulli polynomials, allowing for non-integer values of n.

The inner sum may be understood to be the nth forward difference of xm; that is,

Δnxm=k=0n(1)nk(nk)(x+k)m

where Δ is the forward difference operator. Thus, one may write

Bm(x)=n=0m(1)nn+1Δnxm.

This formula may be derived from an identity appearing above as follows. Since the forward difference operator Δ equals

Δ=eD1

where D is differentiation with respect to x, we have, from the Mercator series,

DeD1=log(Δ+1)Δ=n=0(Δ)nn+1.

As long as this operates on an mth-degree polynomial such as xm, 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

Em(x)=n=0m12nk=0n(1)k(nk)(x+k)m.

The above follows analogously, using the fact that

2eD+1=11+Δ/2=n=0(Δ2)n.

Sums of pth powers

Using either the above integral representation of xn or the identity Bn(x+1)Bn(x)=nxn1, we have

k=0xkp=0x+1Bp(t)dt=Bp+1(x+1)Bp+1p+1

(assuming 00 = 1). See Faulhaber's formula for more on this.

The Bernoulli and Euler numbers

The Bernoulli numbers are given by Bn=Bn(0).

This definition gives ζ(n)=(1)nn+1Bn+1 for n=0,1,2,.

An alternate convention defines the Bernoulli numbers as Bn=Bn(1).

The two conventions differ only for n=1 since B1(1)=12=B1(0).

The Euler numbers are given by En=2nEn(12).

Explicit expressions for low degrees

The first few Bernoulli polynomials are:

B0(x)=1B1(x)=x12B2(x)=x2x+16B3(x)=x332x2+12xB4(x)=x42x3+x2130B5(x)=x552x4+53x316xB6(x)=x63x5+52x412x2+142.

The first few Euler polynomials are:

E0(x)=1E1(x)=x12E2(x)=x2xE3(x)=x332x2+14E4(x)=x42x3+xE5(x)=x552x4+52x212E6(x)=x63x5+5x33x.

Maximum and minimum

At higher n, the amount of variation in Bn(x) between x = 0 and x = 1 gets large. For instance,

B16(x)=x168x15+20x141823x12+5723x10429x8+18203x613823x4+140x23617510

which shows that the value at x = 0 (and at x = 1) is −3617/510 ≈ −7.09, while at x = 1/2, the value is 118518239/3342336 ≈ +7.09. D.H. Lehmer[1] showed that the maximum value of Bn(x) between 0 and 1 obeys

Mn<2n!(2π)n

unless n is 2 modulo 4, in which case

Mn=2ζ(n)n!(2π)n

(where ζ(x) is the Riemann zeta function), while the minimum obeys

mn>2n!(2π)n

unless n is 0 modulo 4, in which case

mn=2ζ(n)n!(2π)n.

These limits are quite close to the actual maximum and minimum, and Lehmer gives more accurate limits as well.

Differences and derivatives

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

ΔBn(x)=Bn(x+1)Bn(x)=nxn1,
ΔEn(x)=En(x+1)En(x)=2(xnEn(x)).

(Δ is the forward difference operator). Also,

En(x+1)+En(x)=2xn.

These polynomial sequences are Appell sequences:

Bn(x)=nBn1(x),
En(x)=nEn1(x).

Translations

Bn(x+y)=k=0n(nk)Bk(x)ynk
En(x+y)=k=0n(nk)Ek(x)ynk

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

Symmetries

Bn(1x)=(1)nBn(x),n0,
En(1x)=(1)nEn(x)
(1)nBn(x)=Bn(x)+nxn1
(1)nEn(x)=En(x)+2xn
Bn(12)=(12n11)Bn,n0 from the multiplication theorems below.

Zhi-Wei Sun and Hao Pan [2] established the following surprising symmetry relation: If r + s + t = n and x + y + z = 1, then

r[s,t;x,y]n+s[t,r;y,z]n+t[r,s;z,x]n=0,

where

[s,t;x,y]n=k=0n(1)k(sk)(tnk)Bnk(x)Bk(y).

Fourier series

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

Bn(x)=n!(2πi)nk=0e2πikxkn=2n!k=1cos(2kπxnπ2)(2kπ)n.

Note the simple large n limit to suitably scaled trigonometric functions.

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

Bn(x)=Γ(n+1)k=1exp(2πikx)+eiπnexp(2πik(1x))(2πik)n.

This expansion is valid only for 0 ≤ x ≤ 1 when n ≥ 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ν(x)=k=0cos((2k+1)πx)(2k+1)ν

and

Sν(x)=k=0sin((2k+1)πx)(2k+1)ν

for ν>1, the Euler polynomial has the Fourier series

C2n(x)=(1)n4(2n1)!π2nE2n1(x)

and

S2n+1(x)=(1)n4(2n)!π2n+1E2n(x).

Note that the Cν and Sν are odd and even, respectively:

Cν(x)=Cν(1x)

and

Sν(x)=Sν(1x).

They are related to the Legendre chi function χν as

Cν(x)=χν(eix)

and

Sν(x)=χν(eix).

Inversion

The Bernoulli and Euler polynomials may be inverted to express the monomial in terms of the polynomials.

Specifically, evidently from the above section on integral operators, it follows that

xn=1n+1k=0n(n+1k)Bk(x)

and

xn=En(x)+12k=0n1(nk)Ek(x).

Relation to falling factorial

The Bernoulli polynomials may be expanded in terms of the falling factorial (x)k as

Bn+1(x)=Bn+1+k=0nn+1k+1{nk}(x)k+1

where Bn=Bn(0) and

{nk}=S(n,k)

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

(x)n+1=k=0nn+1k+1[nk](Bk+1(x)Bk+1)

where

[nk]=s(n,k)

denotes the Stirling number of the first kind.

Multiplication theorems

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

For a natural number m≥1,

Bn(mx)=mn1k=0m1Bn(x+km)
En(mx)=mnk=0m1(1)kEn(x+km) for m=1,3,
En(mx)=2n+1mnk=0m1(1)kBn+1(x+km) for m=2,4,

Integrals

Two definite integrals relating the Bernoulli and Euler polynomials to the Bernoulli and Euler numbers are:[citation needed]

Periodic Bernoulli polynomials

A periodic Bernoulli polynomial Pn(x) is a Bernoulli polynomial evaluated 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.

Strictly these functions are not polynomials at all and more properly should be termed the periodic Bernoulli functions, and P0(x) is not even a function, being the derivative of a sawtooth and so a Dirac comb.

The following properties are of interest, valid for all x:

Pk(x) is continuous for all k>1Pk(x) exists and is continuous for k>2P'k(x)=kPk1(x),k>2

See also

References

  1. D.H. Lehmer, "On the Maxima and Minima of Bernoulli Polynomials", American Mathematical Monthly, volume 47, pages 533–538 (1940)
  2. Zhi-Wei Sun; Hao Pan (2006). "Identities concerning Bernoulli and Euler polynomials". Acta Arithmetica. 125: 21–39. arXiv:math/0409035. Bibcode:2006AcAri.125...21S. doi:10.4064/aa125-1-3.

External Links