Loading [MathJax]/extensions/TeX/mathchoice.js

Saturday, June 17, 2023

Certain Inverse Sums involving Binomial Coefficients

Consider the PMF of the binomial function denoted here by f(p,k,n). We know what happens to this function when it summed over k or integrated over p in the appropriate interval. That is,

\displaystyle \sum_{k=0}^n\binom{n}{k}p^kq^{n-k}=1 and \displaystyle \int_0^1 \binom{n}{k}p^kq^{n-k} \,dp=\frac{1}{n+1}

The first by the story of the binomial and the second by Bayes' billiard argument. But what is the sum of this PMF summed over all possible n? If we let S denote the sum, we want

\displaystyle S=\sum_{n=k}^\infty \binom{n}{k}p^kq^{n-k}

This is not too hard. If we multiply the above by p, we can see that the summand becomes the PMF of the Negative binomial distribution and must therefore sum to 1 by definition.  That clearly shows S=1/p.

We can the same for the PMF of the Hypergeometric distribution as well. That is we are interested in,

\displaystyle S=\sum_{N=n+K-k}^\infty \frac{\binom{K}{k}\binom{N-K}{n-k}}{\binom{N}{n}}

I wasn't able to solve this directly but with some luck and Wolfram Alpha, I was able to guess that

\displaystyle S=\sum_{N=n+K-k}^\infty \frac{\binom{K}{k}\binom{N-K}{n-k}}{\binom{N}{n}}=\frac{nK}{k(k-1)}

At about this time, I saw the following two identities in PiMuEpsilon proved using telescoping sums.

\displaystyle \sum_{n=k}^\infty\frac{1}{\binom{n}{k}}=\frac{k}{k-1} and \displaystyle \sum_{n=m}^\infty\frac{1}{\binom{n}{k}}=\frac{k}{k-1}\binom{m-1}{k-1}^{-1}

But with these many binomials, I was sure there must be some probabilistic interpretation for the same. Am I'm gladI found we are going to solve both of these using probability in this post.

Consider a Polya Urn containing k marbles of which one is white and the rest are black. Our task is to pick up one black marble from this Urn in a maximum of m draws. Because this a Polya Urn, everytime we draw a ball, we replace with that ball back in the Urn along with an additional ball of the same color.

Let I_j (0\leq j<m)be an Indicator random variable for the event of picking a black marble in the 'j+1'th draw. Then,

\displaystyle\mathbb{P}(I_j=1)=\frac{1}{k}\cdot\frac{2}{k+1}\cdot\frac{3}{k+2}\cdots\frac{j}{k+j-1}\cdot\frac{k-1}{k+j}=\frac{k-1}{k}\binom{k+j}{j}^{-1}

Therefore,

\displaystyle\mathbb{P}(\text{picking a black marble in }m\text{ draws})=\sum_{j=0}^{m-1}\mathbb{P}(I_j=1)=\frac{k-1}{k}\sum_{j=0}^{m-1}\binom{k+j}{j}^{-1}

On the other hand, probability of picking a black marble is the complementary probability of not picking a black marble in m draws.

\displaystyle\mathbb{P}(\text{Not picking a black marble in }m\text{ draws})=\frac{1}{k}\frac{2}{k+1}\cdots\frac{m}{k+m-1}=\binom{k+m-1}{m}^{-1}

This clearly shows that

\displaystyle\sum_{j=0}^{m-1}\binom{k+j}{j}^{-1}=\frac{k}{k-1}\left[1-\binom{k+m-1}{m}^{-1}\right]

The above after suitable relabelling gives,

\displaystyle\sum_{n=k}^{k+m-1}\binom{n}{k}^{-1}=\frac{k}{k-1}\left[1-\binom{k+m-1}{k-1}^{-1}\right]

Both the PiMuEpsilon identities given above are easy corollaries of the above identity.

We could have also started with a white marbles and b black marbles. In this case we would have arrived at the following result.

\displaystyle \frac{a}{a+b}\sum_{k=0}^{c-1}\binom{b-1+k}{b-1}\binom{a+b+k}{a+b}^{-1}=1-\binom{b+c-1}{c}\binom{a+b+c-1}{c}^{-1}

The above after some relabelling can also be written as

\displaystyle \frac{a}{a+b}\sum_{n=b}^{c-1}\binom{n-1}{b-1}\binom{n+a}{a+b}^{-1}=1-\binom{c-1}{b-1}\binom{a+c-1}{a+b-1}^{-1}


Hope you enjoyed this. See ya later.

Until then
Yours Aye
Me

No comments:

Post a Comment