Question
Let be a branching process with and . Define if . Set , and let . Prove that a.s., and also in the sense. Finally, prove that .
Step-by-step solution
A branching process starting with would have for all , making convergence trivial but yielding and , contradicting the requirement . Therefore the standard setting is . All proofs below assume .
Step 1. Prove that is a martingale with respect to . Integrability: Since and , , so . By the branching property: . Hence , giving and . Martingale property: .
Step 2. Prove a.s. Since is a nonneg martingale, by the martingale convergence theorem, there exists such that a.s.
Step 3. Prove convergence. By the martingale convergence theorem, an -bounded martingale converges in . We need . Using the variance decomposition: . Setting : , with . So . Since , this geometric series converges: . Therefore . Hence in .
Step 4. Prove . convergence implies convergence, so .
Final answer
QED.
Marking scheme
This rubric is based on the official solution, total 7 points.
1. Checkpoints (max 7 pts total)
Part 1: Martingale Property and Almost Sure Convergence (2 pts)
- Prove the martingale property [1 pt]
- Correctly compute and derive .
- *Note: If only is verified without using , award 0 pts.*
- Conclude a.s. convergence [1 pt]
- Explicitly cite the nonneg martingale convergence theorem.
Part 2: Boundedness and Convergence (4 pts)
- Establish the variance/second moment recursion [1 pt]
- Correctly use the total variance formula to obtain .
- Series summation/solve the recursion [1 pt]
- Express or as a geometric series sum.
- Prove boundedness [1 pt]
- Use to show the series converges, hence .
- Conclude convergence [1 pt]
- State that an -bounded martingale converges in .
Part 3: Expected Value (1 pt)
- Prove [1 pt]
- Use (or ) convergence to justify exchanging limit and expectation.
Total (max 7)
2. Zero-credit items
- Only copying definitions or restating 's formula.
- Claiming is a constant sequence.
- Asserting convergence without proving boundedness.
- If the student assumes leading to all-zero terms without discussing the nontrivial case (), the entire solution gets 0 pts.
3. Deductions
- [-2 pts] Logical error in variance computation: Treating as a constant instead of a random variable.
- [-1 pt] Missing convergence justification: Not mentioning convergence guarantees when computing .
- [-1 pt] Series convergence error: Not explicitly using when judging convergence.