 Reflection comparison of random-cluster connections

Choose a graph vertex $x=(n,x_2,\dots ,x_d)$ on the boundary of a cubic lattice box. Translation and reflection invariance identify the probabilities of $0\leftrightarrow x$ and $x\leftrightarrow 2n{e}_1$. Their intersection implies $0\leftrightarrow 2n{e}_1$, so positive association of random variables gives $C_{2n}\ge \varphi (0\leftrightarrow x{)}^2$. A union bound and cubic lattice symmetries choose such an $x$ with probability at least the box-boundary connection probability divided by the number of boundary graph vertices. This polynomial factor disappears in the exponential rate, identifying boundary and axial inverse correlation lengths.