Proofs for the Expectation and Variance (VCE SSCE Mathematical Methods): Revision Notes
Proofs for the Expectation and Variance
This note presents rigorous mathematical proofs of three fundamental results about the binomial distribution. Understanding these proofs will deepen your knowledge of why the expected value and variance formulas work.
Introduction
The binomial distribution has several important properties that can be proven mathematically. In this note, we establish three key results:
- All probabilities in a binomial distribution sum to 1
- The expected value is E(X) = np
- The variance is Var(X) = np(1-p)
Each proof uses algebraic manipulation and the binomial theorem as a foundation.
The binomial theorem is the cornerstone of these proofs. It allows us to recognize patterns in the probability formulas that simplify to known results, making seemingly complex expressions collapse into elegant conclusions.
Proof 1: The probabilities sum to 1
Result: The probabilities of a binomial distribution sum to 1.
The binomial theorem
The binomial theorem states that:
This theorem is the key tool we use to prove that probabilities sum to 1.
Proof:
For a binomial random variable with parameters and , we need to show:
Starting with the left-hand side:
Notice that this sum has the same form as the binomial theorem with and :
This confirms that all the probabilities in a binomial distribution sum to 1, as required.
The key insight here is recognizing that , which means the entire expression simplifies to . This elegant result shows that the binomial probability formula is properly normalized.
Proof 2: Expected value
Result: If is a binomial random variable with parameters and , then .
Proof:
By the definition of expected value:
Expand the binomial coefficient:
Notice that when , the term equals zero, so we can start the sum from :
Since , we can write:
Cancel the terms:
Key strategy: Factor out n and p from the expression.
Let . When , ; when , :
Important insight: This sum represents all the probabilities for a binomial random variable with trials and probability of success . Therefore, the sum equals 1.
This completes the proof that the expected value of a binomial distribution is .
The clever substitution transforms our complex sum into a recognizable binomial probability distribution with trials. Since all probabilities must sum to 1 (from Proof 1), we immediately know the value of this sum.
Proof 3: Variance
Result: If is a binomial random variable with parameters and , then .
Proof:
We use the formula: , where
To find the variance, we first need to determine :
Problem: The term is not a factor of , so we cannot proceed as in the previous proof.
Strategy: Instead, we determine E[X(X-1)] first:
When or , the term , so we start from :
Factor out and let :
This sum represents all probabilities for a binomial random variable with trials and probability , which equals 1.
Therefore:
Now we can find . Since :
This gives us in terms of and . Now we can calculate the variance:
This completes the proof that .
The technique of finding instead of directly is a common strategy in probability theory. It works because divides evenly by , allowing us to simplify the factorials and recognize the binomial pattern.
Key Points to Remember:
-
All probabilities in a binomial distribution sum to 1, proven using the binomial theorem with and .
-
The expected value E(X) = np is derived by factoring out from the expectation formula and recognising that the remaining sum equals 1.
-
The variance Var(X) = np(1-p) requires finding first, then using .
-
All three proofs rely on recognising patterns that match the binomial probability formula, which sums to 1.
-
The variance formula shows that maximum variance occurs when p = 0.5 (since at this point).