 Weighted BK boundary-splitting estimate

For independent bond percolation on the cubic lattice, define ${\tau }_p(x,y)={\mathbb{P}}_p(x\leftrightarrow y)$ and $g_n={\mathbb{P}}_p(0\leftrightarrow \partial {\Lambda }_n)$, with $g_0=1$. Split an open self-avoiding walk at its first radius-$m$ boundary vertex $y$. The remaining segment reaches distance at least $n-m$ from $y$, using disjoint edges. The BK inequality, translation invariance and the union bound yield the displayed estimate. Keeping the individual connection weights can be stronger than replacing their sum by $|\partial {\Lambda }_m|g_m$.