Bernoulli polynomials - Alchetron, The Free Social Encyclopedia

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 ( x ) = ∑ k = 0 n ( n k ) b n − k x k ,

for n ≥ 0, where b_k are the Bernoulli numbers.

Generating functions

The generating function for the Bernoulli polynomials is

t e x t e t − 1 = ∑ n = 0 ∞ B n ( x ) t n n ! .

The generating function for the Euler polynomials is

2 e x t e t + 1 = ∑ n = 0 ∞ E n ( x ) t n n ! .

Representation by a differential operator

The Bernoulli polynomials are also given by

B n ( x ) = D e D − 1 x n

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

∫ a x B n ( u ) d u = B n + 1 ( x ) − B n + 1 ( a ) n + 1 .

cf. integrals below.

Representation by an integral operator

The Bernoulli polynomials are the unique polynomials determined by

∫ x x + 1 B n ( u ) d u = x n .

The integral transform

( T f ) ( x ) = ∫ x x + 1 f ( u ) d u

on polynomials f, simply amounts to

( T f ) ( x ) = e D − 1 D f ( x ) = ∑ n = 0 ∞ D n ( 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

B m ( x ) = ∑ n = 0 m 1 n + 1 ∑ k = 0 n ( − 1 ) k ( n k ) ( x + k ) m .

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

B n ( x ) = − n ζ ( 1 − n , x )

where ζ(s, q) 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 nth forward difference of x^m; that is,

Δ n x m = ∑ k = 0 n ( − 1 ) n − k ( n k ) ( x + k ) m

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

B m ( x ) = ∑ n = 0 m ( − 1 ) n n + 1 Δ n x m .

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

Δ = e D − 1

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

D e D − 1 = log ⁡ ( Δ + 1 ) Δ = ∑ n = 0 ∞ ( − Δ ) n n + 1 .

As long as this operates on an mth-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 ( x ) = ∑ n = 0 m 1 2 n ∑ k = 0 n ( − 1 ) k ( n k ) ( x + k ) m .

This may also be written in terms of the Euler numbers E_k as

E m ( x ) = ∑ k = 0 m ( m k ) E k 2 k ( x − 1 2 ) m − k .

Sums of pth powers

We have

∑ k = 0 x k p = B p + 1 ( x + 1 ) − B p + 1 ( 0 ) p + 1

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

The Bernoulli and Euler numbers

The Bernoulli numbers are given by B n = B n ( 0 ) .

This definition gives ζ ( − n ) = − 1 n + 1 B n + 1 for n = 0 , 1 , 2 , … .

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

The two conventions differ only for n = 1 since B 1 ( 1 ) = 1 2 = − B 1 ( 0 ) .

The Euler numbers are given by E n = 2 n E n ( 1 2 ) .

Explicit expressions for low degrees

The first few Bernoulli polynomials are:

B 0 ( x ) = 1 B 1 ( x ) = x − 1 2 B 2 ( x ) = x 2 − x + 1 6 B 3 ( x ) = x 3 − 3 2 x 2 + 1 2 x B 4 ( x ) = x 4 − 2 x 3 + x 2 − 1 30 B 5 ( x ) = x 5 − 5 2 x 4 + 5 3 x 3 − 1 6 x B 6 ( x ) = x 6 − 3 x 5 + 5 2 x 4 − 1 2 x 2 + 1 42 .

The first few Euler polynomials are:

E 0 ( x ) = 1 E 1 ( x ) = x − 1 2 E 2 ( x ) = x 2 − x E 3 ( x ) = x 3 − 3 2 x 2 + 1 4 E 4 ( x ) = x 4 − 2 x 3 + x E 5 ( x ) = x 5 − 5 2 x 4 + 5 2 x 2 − 1 2 E 6 ( x ) = x 6 − 3 x 5 + 5 x 3 − 3 x .

Maximum and minimum

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

B 16 ( x ) = x 16 − 8 x 15 + 20 x 14 − 182 3 x 12 + 572 3 x 10 − 429 x 8 + 1820 3 x 6 − 1382 3 x 4 + 140 x 2 − 3617 510

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 showed that the maximum value of B_n(x) between 0 and 1 obeys

M n < 2 n ! ( 2 π ) n

unless n is 2 modulo 4, in which case

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

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

m n > − 2 n ! ( 2 π ) n

unless n is 0 modulo 4, in which case

m n = − 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:

Δ B n ( x ) = B n ( x + 1 ) − B n ( x ) = n x n − 1 , Δ E n ( x ) = E n ( x + 1 ) − E n ( x ) = 2 ( x n − E n ( x ) ) .

(Δ is the forward difference operator).

These polynomial sequences are Appell sequences:

B n ′ ( x ) = n B n − 1 ( x ) , E n ′ ( x ) = n E n − 1 ( x ) .

Translations

B n ( x + y ) = ∑ k = 0 n ( n k ) B k ( x ) y n − k E n ( x + y ) = ∑ k = 0 n ( n k ) E k ( x ) y n − k

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

Symmetries

B n ( 1 − x ) = ( − 1 ) n B n ( x ) , n ≥ 0 , E n ( 1 − x ) = ( − 1 ) n E n ( x ) ( − 1 ) n B n ( − x ) = B n ( x ) + n x n − 1 ( − 1 ) n E n ( − x ) = − E n ( x ) + 2 x n B n ( 1 2 ) = ( 1 2 n − 1 − 1 ) B n , n ≥ 0 from the multiplication theorems below.

Zhi-Wei Sun and Hao Pan 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 = 0 n ( − 1 ) k ( s k ) ( t n − k ) B n − k ( x ) B k ( y ) .

Fourier series

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

B n ( x ) = − n ! ( 2 π i ) n ∑ k ≠ 0 e 2 π i k x k n = − 2 n ! ∑ k = 1 ∞ cos ⁡ ( 2 k π x − n π 2 ) ( 2 k π ) 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

B n ( x ) = − Γ ( n + 1 ) ∑ k = 1 ∞ exp ⁡ ( 2 π i k x ) + e i π n exp ⁡ ( 2 π i k ( 1 − x ) ) ( 2 π i k ) 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 = 0 ∞ cos ⁡ ( ( 2 k + 1 ) π x ) ( 2 k + 1 ) ν

and

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

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

C 2 n ( x ) = ( − 1 ) n 4 ( 2 n − 1 ) ! π 2 n E 2 n − 1 ( x )

and

S 2 n + 1 ( x ) = ( − 1 ) n 4 ( 2 n ) ! π 2 n + 1 E 2 n ( x ) .

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

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

and

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

They are related to the Legendre chi function χ ν as

C ν ( x ) = Re χ ν ( e i x )

and

S ν ( x ) = Im χ ν ( e i x ) .

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 #Representation by an integral operator, it follows that

x n = 1 n + 1 ∑ k = 0 n ( n + 1 k ) B k ( x )

and

x n = E n ( x ) + 1 2 ∑ k = 0 n − 1 ( n k ) E k ( x ) .

Relation to falling factorial

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

B n + 1 ( x ) = B n + 1 + ∑ k = 0 n n + 1 k + 1 { n k } ( x ) k + 1

where B n = B n ( 0 ) and

{ n k } = 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 = 0 n n + 1 k + 1 [ n k ] ( B k + 1 ( x ) − B k + 1 )

where

[ n k ] = 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,

B n ( m x ) = m n − 1 ∑ k = 0 m − 1 B n ( x + k m ) E n ( m x ) = m n ∑ k = 0 m − 1 ( − 1 ) k E n ( x + k m ) for m = 1 , 3 , … E n ( m x ) = − 2 n + 1 m n ∑ k = 0 m − 1 ( − 1 ) k B n + 1 ( x + k m ) for m = 2 , 4 , …

Integrals

Indefinite integrals

∫ a x B n ( t ) d t = B n + 1 ( x ) − B n + 1 ( a ) n + 1 ∫ a x E n ( t ) d t = E n + 1 ( x ) − E n + 1 ( a ) n + 1

Definite integrals

∫ 0 1 B n ( t ) B m ( t ) d t = ( − 1 ) n − 1 m ! n ! ( m + n ) ! B n + m for m , n ≥ 1 ∫ 0 1 E n ( t ) E m ( t ) d t = ( − 1 ) n 4 ( 2 m + n + 2 − 1 ) m ! n ! ( m + n + 2 ) ! B n + m + 2

Periodic Bernoulli polynomials

A periodic Bernoulli polynomial P_n(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.

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

P k ( x ) is continuous for all k ≠ 1 P k ′ ( x ) exists and is continuous for k = 0 , k ≥ 3 P k ′ ( x ) = k P k − 1 ( x ) , k ≥ 3

References

Bernoulli polynomials Wikipedia

(Text) CC BY-SA

Contents