The hitting probability of a set is one on that set and transition-harmonic elsewhere by the Markov property. Finite-horizon hitting probabilities begin at the boundary indicator and increase through the same positive transition recursion. Any nonnegative solution dominates every iterate; monotone passage to infinite time shows that it dominates the hitting probability. This proves minimality without requiring almost-sure hitting.
Past exam of the mathematics course of the University of Cambridge 2004 ib Paper 2 22H Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 2 26I b Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 2 20H a Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 2 20H b Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 2 11F a Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 2 11F d Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 2 11F e Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2014 ib Paper 2 20H Solution Created 2026-09-24 Updated 2026-10-06
Write . For , . For , conditioning on the first step and using the Markov property gives . This establishes the required equations for the hitting probability.
To prove the hitting probability is the minimal nonnegative harmonic extension, let . Then andIf is any nonnegative solution of the same boundary equations, . Positivity of the transition probabilities implies by induction for every . The events increase to , so and . Therefore is the minimal nonnegative solution.
For the tournament won by two consecutive victories, a transient pair , with and third player , moves with equal probabilities to the absorbing state or the transient pair . Thus the two transient cycles arewith probability of absorption at each step. A full cycle without absorption has probability , so absorption occurs almost surely.
Starting from , the successive absorption winners are , with first-cycle probabilities . Summing the geometric repetitions givesStarting from , the order is , giving .
Because the first game is between and , the initial ordered pair of winners is , each with probability . Combining the immediate wins with the transient hitting probabilities,Their sum is one, consistent with almost-sure absorption.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 201 4 c Solution Created 2026-10-03 Updated 2026-10-05
Put . By independence of the two Brownian motions, is a standard Brownian motion: its independent increments have the normal distribution with variance equal to elapsed time. The stopping time is the first time hits or .
To justify finiteness without presupposing the desired hitting probability, each unit-time increment of has the normal distribution . An increment of absolute value greater than forces exit from if the path was inside at its start. These independent increments give , where . Hence almost surely.
The stopped martingale lies in . The optional stopping theorem at gives , and the bounded convergence theorem gives . Writing , path continuity gives . Therefore, as in Brownian exit from an interval,
Past exam of the mathematics course of the University of Cambridge 2023 ib Paper 4 7H b Solution Created 2026-09-24 Updated 2026-09-25
Let be the probability of reaching state before state . The boundary values are and . First-step analysis at states and givesTherefore , so the requested hitting probability is