Vertical crossings separate the sides of a rectangle
DefinitionVertical overlap crossings meet every horizontal crossing#✓fully proved
For the configuration ω: whenever x_B on the bottom side of the overlap
[m, m'] × [c, d] is joined to the top side inside the overlap, every open left–right path of
[α, β] × [c, d] meets the open cluster of x_B inside the overlap.
def CrossingSeparatesH (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ) : Prop :=
α ≤ m → m ≤ m' → m' ≤ β →
∀ (xB : Site 2) (hxB : xB ∈ rect m m' c d),
xB ∈ bottomSide m m' c d →
∀ (yT : Site 2) (hyT : yT ∈ topSide m m' c d),
ConnectedWithin 2 ω (rect m m' c d) ⟨xB, hxB⟩ ⟨yT, topSide_subset hyT⟩ →
∀ (x y : rect α β c d), (x : Site 2) 0 = α → (y : Site 2) 0 = β →
∀ (w : (openSubgraphInduce 2 ω (rect α β c d)).Walk x y),
∃ z ∈ w.support, (z : Site 2) ∈ overlapComp ω m m' c d xB hxB
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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 bottomSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = c}
MathlibExt/Probability/Percolation/RSW/Defs.lean:174
def topSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:177
def ConnectedWithin (d : ℕ) (ω : ConfigSpace (Sym2 (Site d))) (S : Set (Site d))
(x y : S) : Prop :=
(openSubgraphInduce d ω S).Reachable x y
MathlibExt/Combinatorics/SimpleGraph/Lattice/Clusters.lean:130
theorem topSide_subset {a b c d : ℤ} : topSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:191
def openSubgraphInduce (d : ℕ) (ω : ConfigSpace (Sym2 (Site d))) (S : Set (Site d)) :
SimpleGraph S :=
(openSubgraph d ω).induce S
MathlibExt/Combinatorics/SimpleGraph/Lattice/Clusters.lean:120
def overlapComp (ω : ConfigSpace (Sym2 (Site 2))) (m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Set (Site 2) :=
{z | ∃ hz : z ∈ rect m m' c d, ConnectedWithin 2 ω (rect m m' c d) ⟨xB, hxB⟩ ⟨z, hz⟩}
MathlibExt/Probability/Percolation/Universality/HVIntersection.lean:88
Uses 8 · Used by 1
DefinitionVertical overlap crossings separate the sides of a rectangle#✓fully proved
For the configuration ω: whenever x_B on the bottom of the overlap is joined to its top,
there is a set L containing the left side of [α, β] × [c, d] and disjoint from its right side
such that every lattice edge of the rectangle crossing the boundary of L has an endpoint in the
open cluster of x_B inside the overlap.
def CrossingArcSides (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ) : Prop :=
α ≤ m → m ≤ m' → m' ≤ β →
∀ (xB : Site 2) (hxB : xB ∈ rect m m' c d),
xB ∈ bottomSide m m' c d →
∀ (yT : Site 2) (hyT : yT ∈ topSide m m' c d),
ConnectedWithin 2 ω (rect m m' c d) ⟨xB, hxB⟩ ⟨yT, topSide_subset hyT⟩ →
∃ L : Set (Site 2),
(∀ z : Site 2, z ∈ rect α β c d → z 0 = α → z ∈ L) ∧
(∀ z : Site 2, z ∈ rect α β c d → z 0 = β → z ∉ L) ∧
(∀ u v : Site 2, u ∈ rect α β c d → v ∈ rect α β c d →
(hypercubicLattice 2).Adj u v → bdEdge L s(u, v) →
u ∈ overlapComp ω m m' c d xB hxB ∨ v ∈ overlapComp ω m m' c d xB hxB)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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 bottomSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = c}
MathlibExt/Probability/Percolation/RSW/Defs.lean:174
def topSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:177
def ConnectedWithin (d : ℕ) (ω : ConfigSpace (Sym2 (Site d))) (S : Set (Site d))
(x y : S) : Prop :=
(openSubgraphInduce d ω S).Reachable x y
MathlibExt/Combinatorics/SimpleGraph/Lattice/Clusters.lean:130
theorem topSide_subset {a b c d : ℤ} : topSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:191
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
def overlapComp (ω : ConfigSpace (Sym2 (Site 2))) (m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Set (Site 2) :=
{z | ∃ hz : z ∈ rect m m' c d, ConnectedWithin 2 ω (rect m m' c d) ⟨xB, hxB⟩ ⟨z, hz⟩}
MathlibExt/Probability/Percolation/Universality/HVIntersection.lean:88
Uses 9 · Used by 2
TheoremRSW gluing from side separation#✓fully proved
RSW gluing: for a positively associated probability measure μ, if CrossingArcSides holds
for every configuration, then μ(H_{[a, m']}) μ(V_{[m, m']}) μ(H_{[m, b]}) ≤ μ(H_{[a, b]}).
theorem rsw_strip_glue_of_crossingArcSides (μ : Measure (ConfigSpace (Sym2 (Site 2))))
[IsProbabilityMeasure μ] (hpa : PositivelyAssociated μ)
{a m m' b c d : ℤ} (ham : a ≤ m) (hmm' : m ≤ m') (hm'b : m' ≤ b)
(harcL : ∀ ω, CrossingArcSides ω a m' m m' c d)
(harcR : ∀ ω, CrossingArcSides ω m b m m' c d) :
μ.real (horizontalCrossingEvent a m' c d)
* μ.real (verticalCrossingEvent m m' c d)
* μ.real (horizontalCrossingEvent m b c d)
≤ μ.real (horizontalCrossingEvent a b c d)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def PositivelyAssociated {E : Type*} (μ : Measure (ConfigSpace E))
[IsFiniteMeasure μ] : Prop :=
∀ A B : Set (ConfigSpace E), MeasurableSet A → MeasurableSet B →
IsIncreasing A → IsIncreasing B →
μ.real A * μ.real B ≤ μ.real (A ∩ B) * μ.real Set.univ
MathlibExt/Probability/Percolation/Universality/Defs.lean:145
def CrossingArcSides (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ) : Prop :=
α ≤ m → m ≤ m' → m' ≤ β →
∀ (xB : Site 2) (hxB : xB ∈ rect m m' c d),
xB ∈ bottomSide m m' c d →
∀ (yT : Site 2) (hyT : yT ∈ topSide m m' c d),
ConnectedWithin 2 ω (rect m m' c d) ⟨xB, hxB⟩ ⟨yT, topSide_subset hyT⟩ →
∃ L : Set (Site 2),
(∀ z : Site 2, z ∈ rect α β c d → z 0 = α → z ∈ L) ∧
(∀ z : Site 2, z ∈ rect α β c d → z 0 = β → z ∉ L) ∧
(∀ u v : Site 2, u ∈ rect α β c d → v ∈ rect α β c d →
(hypercubicLattice 2).Adj u v → bdEdge L s(u, v) →
u ∈ overlapComp ω m m' c d xB hxB ∨ v ∈ overlapComp ω m m' c d xB hxB)
MathlibExt/Probability/Percolation/Universality/CrossingSeparation.lean:120
def horizontalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | HorizontalCrossing ω a b c d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:206
def verticalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | VerticalCrossing ω a b c d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:210
Uses 31
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.