Related Searches
Definitions

# Binomial series

In mathematics, the binomial series generalizes the purely algebraic formula of the binomial theorem to complex values of α. It is also a special case of a Newton series. The binomial series is the series

$\left(1 + x\right)^alpha = sum_\left\{k=0\right\}^\left\{infty\right\} ; \left\{alpha choose k\right\} ; x^k$

where α is a complex number and

$\left\{alpha choose k\right\} = frac\left\{alpha \left(alpha-1\right) \left(alpha-2\right) cdots \left(alpha-k+1\right)\right\}\left\{k!\right\}$

is the (generalized) binomial coefficient (if α is a non negative integer, then the (α + 1) th term and all later terms in the series are zero, since each one contains a factor equal to (α − α): thus, in that case, the summation reduces to the algebraic binomial formula).

The following holds for any complex number α:

$\left\{alpha choose 0\right\} = 1,$

$\left\{alpha choose k+1\right\} = \left\{alphachoose k\right\},frac\left\{alpha-k\right\}\left\{k+1\right\}, qquadqquad\left(1\right)$

$\left\{alpha choose k-1\right\} + \left\{alphachoose k\right\} = \left\{alpha+1 choose k\right\}. qquadqquad\left(2\right)$

When α is not a natural number a useful asymptotic relationship for the binomial coefficients is, in Landau notation:

$\left\{alpha choose k\right\} = frac\left\{\left(-1\right)^k\right\} \left\{Gamma\left(-alpha\right)k^ \left\{1+alpha\right\} \right\} ,\left(1+o\left(1\right)\right)=;$

as $ktoinfty;$, which is essentially equivalent to Euler's definition of the Gamma function given by the formula


Gamma(z) = lim_{k to infty} frac{k! ; k^z}{z ; (z+1)cdots(z+k)}. ,qquad

The first results concerning convergence of the binomial series were discovered by Sir Isaac Newton, and it is therefore sometimes referred to as Newton's binomial theorem. Later, Niels Henrik Abel also treated the subject in a memoir.

## A few facts about convergence of the binomial series

Whether the series converges depends on the values of the complex numbers α and x. More precisely:

(i) If |x| < 1, the series converges for any complex number α.

(ii) If |x| = 1, the series converges absolutely if and only if either Re(α) > 0 or α = 0.

(iii) If |x| = 1 and x ≠ −1, the series converges if and only if Re(α) > −1.

Sketch of a proof of these facts. (i) in fact, the radius of convergence is exactly 1 whenever α is not a natural number : in this case the binomial coefficients never vanish, and the radius of convergence can be easily computed by the ratio test, starting from formula (1) above. The absolute convergence (ii) follows from formula (3), just by comparison with the test series

$sum_\left\{k=1\right\}^\left\{infty\right\} ; frac \left\{1\right\} \left\{k^s \right\}, qquad$

with s=1+Re(α). To prove the convergence result (iii), first write the following algebraic identity, which is a plain consequence of formula (2)

$\left(1 + x\right) sum_\left\{k=0\right\}^n ; \left\{alpha choose k\right\} ; x^k =sum_\left\{k=0\right\}^n ; \left\{alpha+1choose k\right\} ; x^k + \left\{alpha choose n\right\} ;x^\left\{n+1\right\},$

then use (ii) and formula (3) again to prove convergence of the right-hand side when Re(α)> −1 is assumed. On the other hand the series does not converge if |x| = 1 and Re(α) ≤ −1, for in that case there holds, for all k

$left|\left\{alpha choose k\right\}; x^k right| geq 1. qquad$

### Summation of the binomial series

The usual argument to compute the sum of the binomial series goes as follows. Differentiating term-wise the binomial series within the convergence disk |x| < 1 and using formula (1), one has that the sum of the series is an analytic function solving the ordinary differential equation (1 + x)u'(x) = α u(x) with initial data u(0) = 1. The unique solution of this problem is the function u(x) = (1 + x)α, which is therefore the sum of the binomial series, at least for |x| < 1. The equality extends to |x| = 1 whenever the series converges, as a consequence of Abel's theorem and by continuity of (1 + x)α.