First take . The forward object reaches at its th move, while the reverse object reaches that label at its th move. If the forward object wins after reverse moves, then . The final choice is forward; among the preceding choices, exactly are reverse. By the negative binomial stopping argument, this case has probability .
Sum these mutually exclusive cases and equate the result to part (e), using parts (b) and (d). This proves the success-failure stopping identity here:The right side splits the same race into a special meeting at and all meetings beyond ; the left side splits it according to the number of reverse moves at the winning time.
At , both sides are zero with an empty sum and . At , the event has probability one; the right side equals . The printed left side includes and is outside the usual nonnegative-upper-index combinatorial definition. With the explicit generalized convention , its term is one and all terms vanish, so the identity also holds at that endpoint. Without this convention the displayed sum is undefined there; the zero-target race must instead be stated separately. All identities extend to by their polynomial forms.
Articles by others on the same topic
There are currently no matching articles.