binomial series

Uses your system voice; voice and rate in settings.

Q833480Snapshot

≈ 6 min read

Names in other languages

  • العربيةمتسلسلة ذات حدين
  • Deutschbinomische Reihe
  • Englishbinomial series
  • EnglishBinomial series
  • EnglishBinomial series
  • RomânăSerie binomială
  • MagyarBinomiális sor
  • slbinomska vrsta

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the binomial series is a generalization of the binomial formula to cases where the exponent is not a positive integer: where \alpha is any complex number, and the power series on the right-hand side is expressed in terms of the (generalized) binomial coefficients : \binom{\alpha}{k} = \frac{\alpha (\alpha-1) (\alpha-2) \cdots (\alpha-k+1)}{k!}. The binomial series is the MacLaurin series for the function f(x)=(1+x)^\alpha .

It converges when |x| . If is a nonnegative integer then the term and all later terms in the series are , since each contains a factor of . In this case, the series is a finite polynomial, equivalent to the binomial formula.

In mathematics, the binomial series is a generalization of the binomial formula to cases where the exponent is not a positive integer: where \alpha is any complex number, and the power series on the right-hand side is expressed in terms of the (generalized) binomial coefficients \binom{\alpha}{k} = \frac{\alpha (\alpha-1) (\alpha-2) \cdots (\alpha-k+1)}{k!}. The binomial series is the MacLaurin series for the function f(x)=(1+x)^\alpha .

It converges when |x| . If is a nonnegative integer then the term and all later terms in the series are , since each contains a factor of .

In this case, the series is a finite polynomial, equivalent to the binomial formula. {\alpha \choose 0} \!= 1, Unless \alpha is a nonnegative integer (in which case the binomial coefficients vanish as k is larger than \alpha ), a useful asymptotic relationship for the binomial coefficients is, in Landau notation: {{NumBlk|:| {\alpha \choose k} \!= \frac{(-1)^k} {\Gamma(-\alpha)k^ {1+\alpha} } \,(1+o(1)), \quad\text{as }k\to\infty. | }} This is essentially equivalent to Euler's definition of the Gamma function: \Gamma(z) = \lim_{k \to \infty} \frac{k! \,k^z}{z(z+1)\cdots(z+k)}, and implies immediately the coarser bounds {{NumBlk|:| \frac {m} {k^{1+\operatorname{Re}\,\alpha}}\le \left|{\alpha \choose k}\right| \le \frac {M} {k^{1+\operatorname{Re}\alpha}}, | }} for some positive constants and . Formula ( ) for the generalized binomial coefficient can be rewritten as \sum_{k=1}^\infty \frac1{k^p}, with p=1+\operatorname{Re}(\alpha) .

To prove (iii), first use formula ( ) to obtain and then use (ii) and formula ( ) again to prove convergence of the right-hand side when \operatorname{Re}(\alpha)> - 1 is assumed. On the other hand, the series does not converge if |x|=1 and \operatorname{Re}(\alpha) \le - 1 , again by formula ( ).

Alternatively, we may observe that for all j , \left| \frac{\alpha + 1}j - 1 \right| \ge 1 - \frac{\operatorname{Re} (\alpha) + 1}j \ge 1 . Thus, by formula ( ), for all k, \left|{\alpha \choose k} \right| \ge 1 . This completes the proof of (iii).

Turning to (iv), we use identity ( ) above with x=-1 and \alpha-1 in place of \alpha , along with formula ( ), to obtain \sum_{k=0}^n \!{\alpha\choose k} (-1)^k = \!{\alpha-1 \choose n} (-1)^n= \frac1{\Gamma(-\alpha+1)n^\alpha} (1+o(1)) as n\to\infty . Assertion (iv) now follows from the asymptotic behavior of the sequence n^{-\alpha} = e^{-\alpha \log(n)} .

(Precisely, \left|e^{-\alpha\log n}\right| = e^{-\operatorname{Re}(\alpha) \log n} certainly converges to 0 if \operatorname{Re}(\alpha)>0 and diverges to +\infty if \operatorname{Re}(\alpha) . If \operatorname{Re}(\alpha)=0 , then n^{-\alpha} = e^{-i \operatorname{Im}(\alpha)\log n} converges if and only if the sequence \operatorname{Im}(\alpha)\log n converges \bmod{2\pi} , which is certainly true if \alpha=0 but false if \operatorname{Im}(\alpha) \ne 0 : in the latter case the sequence is dense \!\bmod{2\pi} , due to the fact that \log n diverges and \log (n+1)-\log n converges to zero).

0=(1+x)^{-\alpha}u'(x) - \alpha (1+x)^{-\alpha-1} u(x)= \big[(1+x)^{-\alpha}u(x)\big]'\,, so the function is a constant, which the initial condition tells us is . That is, is the sum of the binomial series for . The equality extends to whenever the series converges, as a consequence of Abel's theorem and by continuity of .

Closely related is the negative binomial series defined by the MacLaurin series for the function g(x)=(1-x)^{-\alpha} , where \alpha \in \Complex and |x| . Explicitly, \begin{align} \frac{1}{(1 - x)^\alpha} &= \sum_{k=0}^{\infty} \; \frac{g^{(k)}(0)}{k!} \; x^k \\ &= 1 + \alpha x + \frac{\alpha(\alpha+1)}{2!} x^2 + \frac{\alpha(\alpha+1)(\alpha+2)}{3!} x^3 + \cdots, \end{align} which is written in terms of the multiset coefficient \left(\!\!{\alpha\choose k}\!\!\right) = {\alpha+k-1 \choose k} = \frac{\alpha (\alpha+1) (\alpha+2) \cdots (\alpha+k-1)}{k!}\,.

When is a positive integer, several common sequences are apparent. The case gives the series , where the coefficient of each term of the series is simply . The case gives the series , which has the counting numbers as coefficients.

The case gives the series , which has the triangle numbers as coefficients. The case gives the series , which has the tetrahedral numbers as coefficients, and similarly for higher integer values of .

The negative binomial series includes the case of the geometric series, the power series \frac{1}{1-x} = \sum_{n=0}^\infty x^n (which is the negative binomial series when \alpha=1 , convergent in the disc |x| ) and, more generally, series obtained by differentiation of the geometric power series: \frac{1}{(1-x)^n} = \frac{1}{(n-1)!}\frac{d^{n-1}}{dx^{n-1}}\frac{1}{1-x} with \alpha=n , a positive integer. (1-x^2)^{1/2}=1-\frac{x^2}2-\frac{x^4}8-\frac{x^6}{16}\cdots (1-x^2)^{3/2}=1-\frac{3x^2}2+\frac{3x^4}8+\frac{x^6}{16}\cdots (1-x^2)^{1/3}=1-\frac{x^2}3-\frac{x^4}9-\frac{5x^6}{81}\cdots The binomial series is therefore sometimes referred to as Newton's binomial theorem.

Newton gives no proof and is not explicit about the nature of the series. Later, on 1826 Niels Henrik Abel discussed the subject in a paper published on Crelle's Journal, treating notably questions of convergence.

See also

Binomial approximation Binomial theorem Table of Newtonian series Lambert W function

Text derived from https://en.wikipedia.org/w/index.php?oldid=1370488513 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot binomial-series-095843-128834121e4cc6c6 · hash 128834121e4cc6c60b53d659dc3aae967a2aebe3a70d239e1dd272f56168551d · captured 1787304884.0 · version history

Cite this page as: encyclopegia.org, “binomial series”, snapshot binomial-series-095843-128834121e4cc6c6. https://encyclopegia.org/a/binomial-series

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.