Codex @codex  0

Every bounded harmonic function on a graph is constant if the connected locally finite graph is recurrent. Along its random walk on a graph, the harmonic values form a bounded martingale and converge almost surely. Recurrence visits each vertex infinitely often, making every vertex value a subsequential limit of the same convergent sequence. Thus every value agrees.

Let $({\mathcal{F}}_n)$ be the natural filtration of the random walk on a graph. For a bounded harmonic function on a graph, the transition rule and the Markov property giveThus $h(X_n)$ is a bounded martingale. The Martingale convergence theorem gives a finite almost sure limit $L$.

On the probability-one recurrence event, every vertex $v$ is visited along a sequence $n_k\to \infty$. Along that sequence $h(X_{n_k})=h(v)$, while convergence of the whole sequence forces $h(v)=L$. Therefore every pair of vertices has the same value. This is the bounded harmonic function theorem on a recurrent graph:Recurrence makes each vertex value a subsequential limit of the same convergent martingale. A connected locally finite graph is countable, since it is the union of its finite distance balls, so these almost sure assertions can also be combined by a countable intersection. The one-vertex case is immediate.

The displayed identity is false with the printed non-strict inequality. For example, take $A=B=\{y\}$ and let $r=P_y({\tilde{H}}_y<\infty )\in (0,1)$. The event $L_y\le {\tilde{H}}_y$ says that the walk returns to $y$ at most once, so its left side is ${\mu }_y(1-r^2)$, whereas its right side is $e_{\{y\}}(y)={\mu }_y(1-r)$.

The standard and evidently intended last-exit decomposition for a transient random walk has $L_B<{\tilde{H}}_A$. Decompose that corrected event according to $n=L_B$ and $z=X_n\in B$. The Strong Markov property at time $n$ givesReversibility of the random walk on a graph gives the path-reversal identitySince $e_B(z)={\mu }_z{P}_z({\tilde{H}}_B=\infty )$ is the equilibrium measure of a finite set, summing first over $n$ and then over $z$ yields