The left region of a rectangle cut by an open cluster
DefinitionRectangle lattice with an open cluster removed#✓fully proved
The square lattice restricted to the rectangle [α, β] × [c, d], with the open cluster of
x_B in the overlap rectangle removed.
noncomputable def boxMinusP (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : SimpleGraph (Site 2) where
Adj u v := (hypercubicLattice 2).Adj u v ∧ u ∈ rect α β c d ∧ v ∈ rect α β c d ∧
u ∉ overlapComp ω m m' c d xB hxB ∧ v ∉ overlapComp ω m m' c d xB hxB
symm := ⟨by intro u v ⟨h1, h2, h3, h4, h5⟩; exact ⟨h1.symm, h3, h2, h5, h4⟩⟩
loopless := ⟨fun u h => (hypercubicLattice 2).irrefl h.1⟩
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 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 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
DefinitionSites reachable from the left side of a rectangle#✓fully proved
The sites reachable from the left side of [α, β] × [c, d] inside the rectangle without
touching the open cluster of x_B in the overlap.
def floodFromLeft (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Set (Site 2) :=
{z | ∃ x : Site 2, x ∈ rect α β c d ∧ x 0 = α ∧ x ∉ overlapComp ω m m' c d xB hxB ∧
(boxMinusP ω α β m m' c d xB hxB).Reachable x z}
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 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
noncomputable def boxMinusP (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : SimpleGraph (Site 2) where
Adj u v := (hypercubicLattice 2).Adj u v ∧ u ∈ rect α β c d ∧ v ∈ rect α β c d ∧
u ∉ overlapComp ω m m' c d xB hxB ∧ v ∉ overlapComp ω m m' c d xB hxB
symm := ⟨by intro u v ⟨h1, h2, h3, h4, h5⟩; exact ⟨h1.symm, h3, h2, h5, h4⟩⟩
loopless := ⟨fun u h => (hypercubicLattice 2).irrefl h.1⟩
MathlibExt/Combinatorics/SimpleGraph/Lattice/ArcSides.lean:56
Uses 5 · Used by 1
DefinitionLeft region of a rectangle cut by an open cluster#✓fully proved
The left region: the left side of [α, β] × [c, d] together with floodFromLeft.
def arcS_leftRegion (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Set (Site 2) :=
{z | z ∈ rect α β c d ∧ (z 0 = α ∨ z ∈ floodFromLeft ω α β 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 floodFromLeft (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Set (Site 2) :=
{z | ∃ x : Site 2, x ∈ rect α β c d ∧ x 0 = α ∧ x ∉ overlapComp ω m m' c d xB hxB ∧
(boxMinusP ω α β m m' c d xB hxB).Reachable x z}
MathlibExt/Combinatorics/SimpleGraph/Lattice/ArcSides.lean:84
DefinitionCondition that every left-right crossing meets the open cluster#✓fully proved
Every lattice path inside [α, β] × [c, d] from the left side to the right side meets the
open cluster of x_B in the overlap [m, m'] × [c, d]. This fails for some configurations
(StatMech.Lattice.tpc_arcS_twoPathsCross_false).
def ArcS_TwoPathsCross (ω : ConfigSpace (Sym2 (Site 2))) (α β m m' c d : ℤ)
(xB : Site 2) (hxB : xB ∈ rect m m' c d) : Prop :=
α ≤ m → m ≤ m' → m' ≤ β →
∀ (x y : Site 2), x ∈ rect α β c d → y ∈ rect α β c d → x 0 = α → y 0 = β →
∀ (γ : (hypercubicLattice 2).Walk x y),
(∀ z ∈ γ.support, z ∈ rect α β c d) →
∃ z ∈ γ.support, z ∈ 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 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 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
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.