Chapter 3 – Linear Combinations of Random Variables
Overview
- Chapter focus: Linear combinations of random variables and their impact on expectation (mean), variance and probability calculations.
- Why it matters:
- Real-world metrics often aggregate several independent random quantities (e.g. monthly stock portfolio profit, triathlon time, weight of jars of honey).
- Understanding linear combinations lets us derive overall distributions and associated probabilities instead of analysing each component separately.
Expectation & Variance for Translating/Scaling One Random Variable
- Translation by constant b
- E(X+b)=E(X)+b
- Var(X+b)=Var(X)
- Scaling by constant a
- E(aX)=aE(X)
- Var(aX)=a2Var(X)
- Combined rule (Key Point 3.3):
E(aX+b)=aE(X)+b
Var(aX+b)=a2Var(X)
Illustrative Dice Examples (Section 3.1)
- Xing’s die values: 1,1,2,2,2,4
- E(X)=2; Var(X)=1
- Yaffa’s die values: 4,4,5,5,5,7=X+3
- E(Y)=E(X)+3=5
- Var(Y)=Var(X)=1 (shift does not alter variance)
- Quenby’s die values: 2,2,4,4,4,8=2X
- E(Q)=2E(X)=4
- Var(Q)=4Var(X)=4 (variance quadruples because a2=4)
- Exploratory Tasks: add/subtract constants to Mo’s die 0,0,1,1,1,3 or create a rule like 3X+1 to confirm general results.
Worked Example 3.1 (Table → 2X+3)
- Given discrete P(X) table, first compute raw E(X)=4 and Var(X)=3.8.
- Then: E(2X+3)=2×4+3=11
- Var(2X+3)=4×3.8=15.2
Binomial Link (Worked Example 3.2)
- For X∼B(3,21) : E(X)=1.5, Var(X)=0.75.
- Same rules apply: E(2X+1)=2(1.5)+1=4, Var(2X+1)=4(0.75)=3.
Linear Combinations of Two Independent RVs (Key Point 3.4)
- For independent X,Y:
E(X+Y)=E(X)+E(Y)
Var(X+Y)=Var(X)+Var(Y) - Difference: E(X−Y)=E(X)−E(Y) but variance still adds:
Var(X−Y)=Var(X)+Var(Y)
Multiples Before Summation (Key Point 3.5)
- For constants a,b and independent X,Y:
E(aX+bY)=aE(X)+bE(Y)
Var(aX+bY)=a2Var(X)+b2Var(Y) - Extends to any finite sum of independent variables.
Dice Illustration (Green vs Blue tetrahedral dice)
- Green G: E=34, Var=1611
- Blue B: E=23, Var=41
- Sum W=G+B → E(W)=41+23=47, Var(W)=1615 (matches explicit enumerated distribution).
Scaled Combination Example
- If we redefine D=2G+3B then:
- E(D)=2E(G)+3E(B)=2(34)+3(23)=8
- Var(D)=41611+941=5 (again matches table).
Distinguishing 2X vs X<em>1+X</em>2
- 2X: double a single observation (same sample) → variance 4Var(X).
- X<em>1+X</em>2: sum of two independent observations → variance 2Var(X).
- Example with Xing’s die validates:
E(2X)=4, Var(2X)=4 vs
E(X<em>1+X</em>2)=4, Var(X<em>1+X</em>2)=2.
Normal Distributions (Key Point 3.6)
- If X∼N(μ,σ2) then any linear form aX+b∼N(aμ+b,a2σ2).
- If independent X∼N(μ<em>1,σ</em>12) and Y∼N(μ<em>2,σ</em>22) then aX+bY∼N(aμ<em>1+bμ</em>2,a2σ<em>12+b2σ</em>22).
Normal Examples
- Four Thrift batteries T∼N(7,2.32) → Sum S has
E(S)=28, Var(S)=4(2.32)=21.16, S∼N(28,21.16).
Probability P(S>30)=0.332. - Large vs small rice bags: Y∼N(6.6,0.42), X∼N(2.1,0.22).
Want P(Y>3X). Define Z=Y−3X∼N(0.3,0.52) then P(Z>0)=0.661. - Worktop thickness:
- Top only: 37+1⇒N(38,0.09).
- Top & bottom: 37+1+1⇒N(39,0.0902).
- Gift package: Total mass 3S+T∼N(240,132), cheap-rate probability ≈0.779 for mass <250 g.
Poisson Combinations (Key Point 3.7)
- Independent X∼Po(λ), Y∼Po(μ) ⇒ X+Y∼Po(λ+μ).
- Important: only sums preserve Poisson; differences or scaling do not stay Poisson.
Rescue-centre Story
- Lions L∼Po(5), Tigers T∼Po(3) → Total A=L+T∼Po(8).
- Probability of rescuing exactly 2 animals: P(A=2)=e−82!82=0.0107 (far quicker than enumerating each lion/tiger combination).
Text-message Example
- Josh λ=3.2, Reuben λ=2.5 ⇒ T∼Po(5.7).
P(T>5)=1−P(T≤4)=0.327.
Non-Poisson after Linear Ops
- If T=2X−Y where X∼Po(2.4),Y∼Po(3.6):
- E(T)=1.2, Var(T)=13.2.
- Since mean ≠ variance, T is not Poisson.
Ethical/Practical Implications & Real-World Links
- Finance: Portfolio profit as sum of independent share returns.
- Manufacturing: Jar of honey weight = jar + honey + lid; tolerance analysis uses variance formulas.
- Sports: Triathlon or relay times are sums of event times; probability of finishing under target uses normal combination.
- Quality control: Worktop thickness, rice packages, and soaps rely on aggregated normal models for compliance thresholds.
- Communication planning: Text-message Poisson combo informs network capacity.
Connections to Prior Learning
- Relies on discrete expectation/variance (P&S 1 Chapters 6–7).
- Uses Binomial, Poisson, Normal models from earlier chapters and coursebooks.
- Standardisation z=σx−μ remains foundational for probability lookup.
- Single RV, constants a,b:
- E(aX+b)=aE(X)+b
- Var(aX+b)=a2Var(X)
- Independent X,Y:
- E(aX+bY)=aE(X)+bE(Y)
- Var(aX+bY)=a2Var(X)+b2Var(Y)
- Normal closure:
- X∼N(μ,σ2)⇒aX+b∼N(aμ+b,a2σ2)
- X,Y independent normals ⇒ aX+bY also normal.
- Poisson closure:
- X∼Po(λ),Y∼Po(μ) (independent) ⇒ X+Y∼Po(λ+μ).
Worked-Example Shortcuts & Tips
- When summing n identical independent RVs X:
E(sum)=nE(X), Var(sum)=nVar(X). - For differences, variance always adds: Var(X−Y)=Var(X)+Var(Y).
- Use standardisation for normal probabilities:
P(X>k)=1−Φ(σk−μ). - For Poisson ‘greater than’, compute complement with cumulative sum of small k values to reduce computations.
Worked & Exercise References
- Exercise sets 3A–3D reinforce computing expectations & variances, distinguishing 2X vs X<em>1+X</em>2, normal combination probabilities, Poisson sums, and practical conversions (°C→°F).
- End-of-chapter review questions apply concepts to temperatures, egg boxes, triathlon times, cycling hire cost, mining value, etc.