Question
Let with . Define with . Let . Prove that .
Step-by-step solution
Step 1. Define the generating function and analyze the first-step decomposition. Let (generating function, domain ), where is the first hitting time of 1. Decompose by conditioning on the first increment : - If , then , , contributing . - If , then . By symmetry, the time from to return to has the same distribution as , and then from to reach is another independent copy . So the total time is , with and independent and each distributed as .
Step 2. Establish the functional equation for the generating function. By the product property of generating functions for independent sums: . The second case contributes . Combining:
Step 3. Solve the quadratic equation and select the valid root. . By the quadratic formula (): Select the root using boundary behavior: as , so , hence . - Positive sign: , invalid. - Negative sign: , valid.
Step 4. Verify existence of the generating function. Since the symmetric random walk is recurrent, , and for , . By dominated convergence, is finite and continuous, confirming the selected root.
Final answer
QED.
Marking scheme
The following is the grading rubric. Based on the official solution (first-step analysis), but also allowing a valid combinatorial/series approach.
1. Checkpoints (max 7 pts total)
Score exactly one chain (Chain A is expected / Chain B is alternate).
Chain A: First Step Analysis
- State decomposition and probability analysis (3 pts)
- Correctly write the contribution from : . [1 pt]
- Analyze the case: identify the two phases and . [1 pt]
- Key step: Use homogeneity and independence to show the time from to equals the sum of two independent copies of , giving contribution . [1 pt]
- Establish the functional equation (1 pt)
- Write (or equivalently ). [1 pt]
- Algebraic solution (1 pt)
- Solve via the quadratic formula to get . [1 pt]
- Root selection and boundary verification (2 pts)
- Core logic: State that the generating function properties (e.g., as ) determine the sign. [1 pt]
- Correctly verify the negative-sign root satisfies the condition and the positive-sign root does not. [1 pt]
- *Note: If only "discard the positive root" is stated without any reason, this section gets 0 pts.*
Chain B: Combinatorics/Series Summation
- Distribution derivation (3 pts): Use the reflection principle or combinatorial methods to derive (typically involving Catalan number forms). [3 pts]
- Series construction (1 pt): Write and substitute. [1 pt]
- Series summation (3 pts): Use the generalized binomial theorem ( Taylor expansion) to compute the sum and derive the target formula. [3 pts]
Total (max 7)
2. Zero-credit items
- Only copying known conditions, definitions, or the final conclusion without derivation.
- Not establishing the functional equation or series, directly claiming satisfies the formula.
- Using to select the root ( gives , both roots coincide at 1, so this cannot distinguish them; this is a logical error).
3. Deductions
- Missing root selection or wrong reason: Solving both roots then circling the correct answer without any selection justification. (-2 pts)
- Logical gap: In Chain A, not mentioning " equals two independent identically distributed processes" and directly writing . (-1 pt)
- Sign error: Coefficient sign error in the quadratic but subsequent logic correct. (-1 pt)