二項分布方差的詳細證明


前置技能

從組合數公式可以直接推出: \(k\mathrm{C}_n^k = n\mathrm{C}_{n-1}^{k-1}\)

同樣地,你可以得到 \((k-1)\mathrm{C}_{n-1}^{k-1} = (n-1)\mathrm{C}_{n-2}^{k-2}\) (禁止套娃)

你還要熟悉二項式定理:

\[(p+q)^n = \sum_{k=0}^n \mathrm{C}_n^k p^k q^{n-k} \]

你還要知道二項分布的概率和期望公式:

\(X\sim B(n,p)\),則 \(P(x = k) = C_n^k \ p^k \ (1-p)^{n- k}\)\(E(X) = np\)

回歸正題

第一步當然是定義式啦

\[\begin{aligned} D(X) &=\sum_{k=0}^{n}\left[k-E(X)\right]^{2} \cdot p_{k} \\ &=\sum_{k=0}^{n}(k-n p)^{2} \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k} \\ \end{aligned} \]

看到 \((k-np)^2\) 是不是就很想把它拆開?

\[\begin{aligned} D(X) &=\sum_{k=0}^{n}(k^2-2knp+n^2p^2) \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k} \\ & =\color{Red}{\sum_{k=0}^{n} k^{2} \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ &\quad -2np \color{Blue}{\sum_{k=0}^{n} k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ &\quad +n^2 p^2 \color{Green}{\sum_{k=0}^{n} \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \end{aligned} \]

這式子也太長了吧 (#°Д°)

首先你肯定會把魔爪伸向 \(\color{Green}{\sum_{k=0}^{n} \mathrm{C}_{n}^{k} p^{k} q^{n-k}}\) —— 他就是個二項式定理嘛!

\[\color{Green}{\sum_{k=0}^{n} \mathrm{C}_{n}^{k} p^{k} q^{n-k}} = (p+q)^n=1 \]

然后,你看到 \(\color{Blue}{\sum_{k=0}^{n} k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}}\) 里面的 \(\color{Blue}{k \cdot \mathrm{C}_{n}^{k}}\) 的時候,是不是有把 \(\color{Blue}{k\cdot \mathrm{C}_n^k}\) 換成 \(n\cdot\mathrm{C}_{n-1}^{k-1}\) 的沖動?

\[\begin{aligned} &\color{Blue}{\sum_{k=0}^{n} k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ =& \sum_{k=1}^{n} k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k} \quad \text{(第一項是 0, 丟掉)}\\ =& \sum_{k=1}^{n} n \cdot \mathrm{C}_{n-1}^{k-1} p^{k} q^{n-k} \\ =& np \cdot \sum_{k=1}^{n} \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} \\ =& np \cdot (p+q)^{n-1} \\ =& np \end{aligned} \]

現在只剩 \(\color{Red}{\sum_{k=0}^{n} k^{2} \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}}\) 了,首先你肯定會故技重施:

\[\begin{aligned} &\color{Red}{\sum_{k=0}^{n} k^{2} \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ =& \sum_{k=1}^{n} k \cdot k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k} \\ =& \sum_{k=1}^{n} kp \cdot n \cdot \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} \\ =& np\sum_{k=1}^{n} k \cdot \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} \end{aligned} \]

但是 \(\mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k}\) 前面還有個 \(k\) 啊,不能用啊 (ノ`Д)ノ

所以,怎么把這個 \(k\) 搞掉呢???(我認為這是最難的一步,讀者可以停下來思考思考)

你肯定想用 \((k-1) \mathrm{C}_{n-1}^{k-1} = (n-1) \mathrm{C}_{n-2}^{k-2}\),但人家是 \(k\mathrm{C}_{n-1}^{k-1}\) 不是 \((k-1) \mathrm{C}_{n-1}^{k-1}\)

那就……把 \(k\) 拆成 \((k-1+1)\) 吧!(我真是太機智了)

\[\begin{aligned} & \color{Red}{np\sum_{k=1}^{n} k \cdot \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k}} \\ =& np\sum_{k=1}^{n} (k-1+1) \cdot \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} \\ =& np\sum_{k=1}^{n} \left[(k-1) \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} + \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k}\right] \\ =& np \left[\sum_{k=2}^{n} (k-1) \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k} + \sum_{k=1}^n \mathrm{C}_{n-1}^{k-1} p^{k-1} q^{n-k}\right] \\ =& np \left[\sum_{k=2}^{n} (n-1)p \cdot \mathrm{C}_{n-2}^{k-2} p^{k-2} q^{n-k} + (p+q)^{n-1}\right] \\ =& np \left[(n-1)p \cdot \sum_{k=2}^{n} \mathrm{C}_{n-2}^{k-2} p^{k-2} q^{n-k} + 1\right] \\ =& np \left[(n-1)p \cdot (p+q)^{n-2} + 1\right] \\ =& np \left[(n-1)p + 1\right] \\ =& np(np-p+1) \end{aligned} \]

終於!三個部分都推完了!!

\[\begin{aligned} &D(X) \\ =&\color{Red}{\sum_{k=0}^{n} k^{2} \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ & -2np \color{Blue}{\sum_{k=0}^{n} k \cdot \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ & +n^2 p^2 \color{Green}{\sum_{k=0}^{n} \mathrm{C}_{n}^{k} p^{k} q^{n-k}} \\ =& np(np-p+1) -2np\cdot np +n^2p^2 \\ =& np(1-p) \end{aligned} \]

證畢( ̄︶ ̄)↗


免責聲明!

本站轉載的文章為個人學習借鑒使用,本站對版權不負任何法律責任。如果侵犯了您的隱私權益,請聯系本站郵箱yoyou2525@163.com刪除。



 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM