WorksMathematics
Tightness of bulk crossing heights for the planar discrete Gaussian free field
Abstract
Let be the planar discrete Gaussian free field in , with zero boundary condition imposed by killing the associated simple random walk on exit. We consider the least height at which the two-sided level set contains a nearest-neighbor left–right crossing of . We prove that is tight, uniformly over all box sizes. More precisely, for every and , where is the standard normal distribution function. The upper bound yields uniform polynomial moments and a uniform exponential moment of . For the upper bound, we compare a marked loop-soup exploration with a graph in which independent site variables open incoming edges. We then estimate connections in a massive field using two auxiliary vertices and bound the Gaussian remainder when the mass is removed. The lower bound uses a Gaussian translation inequality and a square-shell estimate for the Dirichlet energy, without using the massive-field argument. In particular, a height independent of gives any prescribed crossing probability below one, whereas every fixed finite height has a uniformly positive failure probability.