Connectivity of the adjacency graph of complementary components of the SLE fan
Abstract
Suppose that h is an instance of the Gaussian free field (GFF) on a simply connected domain D ⊂eq C and x,y ∈ ∂ D are distinct. Fix ∈ (0,4) and for each θ ∈ R let ηθ be the flow line of h from x to y. Recall that for θ1 < θ2 the fan F(θ1,θ2) of flow lines of h from x to y is the closure of the union of ηθ as θ varies in any fixed countable dense subset of [θ1,θ2]. We show that the adjacency graph of components of D F(θ1,θ2) is a.s. connected, meaning it a.s. holds that for every pair U,V of components there exist components U1,…,Un so that U1 = U, Un = V, and ∂ Ui ∂ Ui+1 ≠ for each 1 ≤ i ≤ n-1. We further show that F(θ1,θ2) a.s. determines the flow lines used in its construction. That is, for each θ ∈ [θ1,θ2] we prove that ηθ is a.s. determined by F(θ1,θ2) as a set.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.