Gluing crossings of adjacent rectangles
DefinitionOpen path from the left side of a rectangle to a point#✓fully proved
An open path inside rect a m c d from its left side to the point z (on its right side).
def LeftHalfCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a m c d : ℤ) (z : Site 2)
(hz : z ∈ rect a m c d) : Prop :=
∃ xL : leftSide a m c d,
ConnectedWithin 2 ω (rect a m c d) ⟨xL, leftSide_subset xL.2⟩ ⟨z, hz⟩
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 leftSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 0 = a}
MathlibExt/Probability/Percolation/RSW/Defs.lean:168
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 leftSide_subset {a b c d : ℤ} : leftSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:188
DefinitionOpen path from a point to the right side of a rectangle#✓fully proved
An open path inside rect m b c d from the point z (on its left side) to its right side.
def RightHalfCrossing (ω : ConfigSpace (Sym2 (Site 2))) (m b c d : ℤ) (z : Site 2)
(hz : z ∈ rect m b c d) : Prop :=
∃ yR : rightSide m b c d,
ConnectedWithin 2 ω (rect m b c d) ⟨z, hz⟩ ⟨yR, rightSide_subset yR.2⟩
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 rightSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 0 = b}
MathlibExt/Probability/Percolation/RSW/Defs.lean:171
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 rightSide_subset {a b c d : ℤ} : rightSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:189
DefinitionLeft half-crossing event#✓fully proved
The event LeftHalfCrossing.
def leftHalfCrossingEvent (a m c d : ℤ) (z : Site 2) (hz : z ∈ rect a m c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | LeftHalfCrossing ω a m c d z hz}
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
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def LeftHalfCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a m c d : ℤ) (z : Site 2)
(hz : z ∈ rect a m c d) : Prop :=
∃ xL : leftSide a m c d,
ConnectedWithin 2 ω (rect a m c d) ⟨xL, leftSide_subset xL.2⟩ ⟨z, hz⟩
MathlibExt/Probability/Percolation/RSW/Strip.lean:229
DefinitionRight half-crossing event#✓fully proved
The event RightHalfCrossing.
def rightHalfCrossingEvent (m b c d : ℤ) (z : Site 2) (hz : z ∈ rect m b c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | RightHalfCrossing ω m b c d z hz}
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
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def RightHalfCrossing (ω : ConfigSpace (Sym2 (Site 2))) (m b c d : ℤ) (z : Site 2)
(hz : z ∈ rect m b c d) : Prop :=
∃ yR : rightSide m b c d,
ConnectedWithin 2 ω (rect m b c d) ⟨z, hz⟩ ⟨yR, rightSide_subset yR.2⟩
MathlibExt/Probability/Percolation/RSW/Strip.lean:235
TheoremMeasurability of the left half-crossing event#✓fully proved
A left half-crossing event is measurable.
theorem measurableSet_leftHalfCrossingEvent (a m c d : ℤ) (z : Site 2)
(hz : z ∈ rect a m c d) :
MeasurableSet (leftHalfCrossingEvent a m c d z hz)
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 leftHalfCrossingEvent (a m c d : ℤ) (z : Site 2) (hz : z ∈ rect a m c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | LeftHalfCrossing ω a m c d z hz}
MathlibExt/Probability/Percolation/RSW/Strip.lean:241
TheoremMeasurability of the right half-crossing event#✓fully proved
A right half-crossing event is measurable.
theorem measurableSet_rightHalfCrossingEvent (m b c d : ℤ) (z : Site 2)
(hz : z ∈ rect m b c d) :
MeasurableSet (rightHalfCrossingEvent m b c d z hz)
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 rightHalfCrossingEvent (m b c d : ℤ) (z : Site 2) (hz : z ∈ rect m b c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | RightHalfCrossing ω m b c d z hz}
MathlibExt/Probability/Percolation/RSW/Strip.lean:246
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.