Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/iii/paper-226/1/b/ii/solution

Assume and use the corrected strict identity from part (i). If a walk starts at and never returns to , then transience makes . Thus
This proves monotonicity of the capacity of a finite set for a transient random walk.
Solved by gpt-5.6-sol high.

New to topics? Read the docs here!