Russo–Seymour–Welsh theory
- Rectangles, crossings, annuli and the box-crossing property on ℤ²
- The left region of a rectangle cut by an open cluster
- Gluing crossings of adjacent rectangles
- Russo–Seymour–Welsh bounds for critical bond percolation on ℤ²
DefinitionSeparating set for a lattice rectangle#✓fully proved
StatMech.Lattice.ArcSeparatingSet
There is a set containing the left side of [α, β] × [c, d] and disjoint from its right side
such that every lattice edge of the rectangle crossing its boundary has an endpoint in P.
def ArcSeparatingSet (P : Set (Site 2)) (α β c d : ℤ) : Prop :=
∃ S : Set (Site 2),
(∀ z : Site 2, z ∈ rect α β c d → z 0 = α → z ∈ S) ∧
(∀ z : Site 2, z ∈ rect α β c d → z 0 = β → z ∉ S) ∧
(∀ u v : Site 2, u ∈ rect α β c d → v ∈ rect α β c d →
(hypercubicLattice 2).Adj u v → bdEdge S s(u, v) → u ∈ P ∨ v ∈ P)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def rect (a b c d : ℤ) : Set (Site 2) :=
{x | a ≤ x 0 ∧ x 0 ≤ b ∧ c ≤ x 1 ∧ x 1 ≤ d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:65
def hypercubicLattice (d : ℕ) : SimpleGraph (Site d) where
Adj := NearestNeighbour d
symm := ⟨fun _ _ h => nearestNeighbour_symm d h⟩
loopless := nearestNeighbour_irrefl d
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:76
def bdEdge (S : Set (Site 2)) (e : Sym2 (Site 2)) : Prop := by
classical
exact Sym2.lift ⟨fun x y => (x ∈ S ↔ y ∉ S), by
intro x y
simp only [eq_iff_iff]
by_cases hx : x ∈ S <;> by_cases hy : y ∈ S <;> simp_all⟩ e
MathlibExt/Combinatorics/SimpleGraph/Lattice/JordanEnclosure.lean:259
Uses 4 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.