Binomial theorem
From Freepedia
- For other topics using the name "binomial", see binomial (disambiguation).
In mathematics, the binomial theorem is an important formula giving the expansion of powers of sums. Its simplest version reads
- <math>(x+y)^n=\sum_{k=0}^n{n \choose k}x^ky^{n-k}\quad\quad\quad(1)</math>
whenever n is any non-negative integer, the numbers
- <math>{n \choose k}=\frac{n!}{k!(n-k)!}</math>
are the binomial coefficients, and <math>n!</math> denotes the factorial of n.
This formula, and the triangular arrangement of the binomial coefficients, are often attributed to Blaise Pascal who described them in the 17th century. It was, however, known to Chinese mathematician Yang Hui in the 13th century.
For example, here are the cases n = 2, n = 3 and n = 4:
- <math>(x + y)^2 = x^2 + 2xy + y^2\,</math>
- <math>(x + y)^3 = x^3 + 3x^2y + 3xy^2 + y^3\,</math>
- <math>(x + y)^4 = x^4 + 4x^3y + 6x^2y^2 + 4xy^3 + y^4.\,</math>
Formula (1) is valid for all real or complex numbers x and y, and more generally for any elements x and y of a semiring as long as xy = yx.
Contents |
Newton's generalized binomial theorem
Isaac Newton generalized the formula to other exponents by considering an infinite series:
- <math>{(x+y)^r=\sum_{k=0}^\infty {r \choose k} x^k y^{r-k}\quad\quad\quad(2)}</math>
where r can be any complex number (in particular r can be any real number, not necessarily positive and not necessarily an integer), and the coefficients are given by
- <math>{r \choose k}={1 \over k!}\prod_{n=0}^{k-1}(r-n)=\frac{r(r-1)(r-2)\cdots(r-(k-1))}{k!}\,</math>
In case k = 0, this is a product of no numbers at all and therefore equal to 1, and in case k = 1 it is equal to r, as the additional factors (r − 1), etc., do not appear.
Another way to express this quantity is
- <math>{r \choose k}=\frac{(-1)^k}{k!}(-r)_k,</math>
which is important when one is working with infinite series and would like to represent them in terms of generalized hypergeometric functions. The notation <math>(\cdot)_k</math> is the Pochhammer symbol. This form is vital in applied mathematics, for example, when evaluating the formulas that model the statistical properties of the phase-front curvature of a light wave as it propagates through optical atmospheric turbulence.
A particularly handy but non-obvious form holds for the reciprocal power:
- <math>\frac{1}{(1-x)^r}=\sum_{k=0}^\infty {r+k-1 \choose k} x^k \equiv \sum_{k=0}^\infty {r+k-1 \choose r-1} x^k.</math>
For a more extensive account of Newton's generalized binomial theorem, see binomial series.
The sum in (2) converges and the equality is true whenever the real or complex numbers x and y are "close together" in the sense that the absolute value | x/y | is less than one.
The geometric series is a special case of (2) where we choose y = 1 and r = −1.
Formula (2) is also valid for elements x and y of a Banach algebra as long as xy = yx, y is invertible and ||x/y|| < 1.
"Binomial type"
The binomial theorem can be stated by saying that the polynomial sequence
- <math>\left\{\,x^k:k=0,1,2,\dots\,\right\}\,</math>
is of binomial type.
Proof (inductive)
When <math>n=1</math>,
- <math> (a+b)^1 = \sum_{k=0}^1 { 1 \choose k } a^{1-k}b^k = { 1 \choose 0 }a^1b^0+{ 1 \choose 1 }a^0b^1 = a+b</math>.
For the inductive step, assume it holds for <math>m</math>. Then for n = <math>m+1</math>,
- <math> (a+b)^{m+1}</math> <math> =</math> <math> a(a+b)^m + b(a+b)^m</math>
- <math> =</math> <math> a \sum_{k=0}^m { m \choose k } a^{m-k} b^k + b \sum_{j=0}^m { m \choose j } a^{m-j} b^j</math> by the inductive hypothesis
- <math> =</math> <math> \sum_{k=0}^m { m \choose k } a^{m-k+1} b^k + \sum_{j=0}^m { m \choose j } a^{m-j} b^{j+1}</math> by multiplying through by <math>a</math> and <math>b</math>
- <math> =</math> <math> a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1} b^k + \sum_{j=0}^m { m \choose j } a^{m-j} b^{j+1}</math> by pulling out the <math>k=0</math> term
- <math> =</math> <math> a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1} b^k + \sum_{k=1}^{m+1} { m \choose k-1 }a^{m-k+1}b^{k}</math> by letting <math> j = k-1</math>
- <math> =</math> <math> a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1}b^k + \sum_{k=1}^{m} { m \choose k-1 }a^{m+1-k}b^{k} + b^{m+1}</math> by pulling out the <math> k=m+1</math> term from the RHS
- <math> =</math> <math> a^{m+1} + b^{m+1} + \sum_{k=1}^m \left[ { m \choose k } + { m \choose k-1 } \right] a^{m+1-k}b^k</math> by combining the sums
- <math> =</math> <math> a^{m+1} + b^{m+1} + \sum_{k=1}^m { m+1 \choose k } a^{m+1-k}b^k</math> from Pascal's rule
- <math> =</math> <math> \sum_{k=0}^{m+1} { m+1 \choose k } a^{m+1-k}b^k</math> by adding in the <math> m+1</math> terms,
as desired.
See also
This article incorporates material from inductive proof of binomial theorem on PlanetMath, which is licensed under the GFDL.
