Rectangle crossings on the square lattice
DefinitionRectangle at the origin in the plane lattice#✓fully proved
The rectangle [0, a] × [0, b] in ℤ².
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 6
DefinitionLeft side of a rectangle at the origin#✓fully proved
The left side {0} × [0, b] of rectangle a b.
def leftSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 0 = 0}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
Uses 2 · Used by 1
DefinitionRight side of a rectangle at the origin#✓fully proved
The right side {a} × [0, b] of rectangle a b.
def rightSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 0 = a}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
Uses 2 · Used by 1
DefinitionBottom side of a rectangle at the origin#✓fully proved
The bottom side [0, a] × {0} of rectangle a b.
def bottomSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 1 = 0}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
Uses 2 · Used by 1
DefinitionTop side of a rectangle at the origin#✓fully proved
The top side [0, a] × {b} of rectangle a b.
def topSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 1 = b}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
Uses 2 · Used by 1
DefinitionOpen left–right crossing of a rectangle at the origin#✓fully proved
ω has an open left–right crossing of rectangle a b: an open path inside the rectangle from
its left side to its right side.
def HorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b : ℤ) : Prop :=
∃ (x : leftSide a b) (y : rightSide a b),
ConnectedWithin 2 ω (rectangle a b)
⟨(x : Site 2), leftSide_subset x.2⟩ ⟨(y : Site 2), rightSide_subset y.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 leftSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 0 = 0}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:66
def rightSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 0 = a}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:69
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
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
theorem leftSide_subset : leftSide a b ⊆ rectangle a b
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:86
theorem rightSide_subset : rightSide a b ⊆ rectangle a b
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:87
DefinitionLeft–right crossing event of a rectangle at the origin#✓fully proved
The event that rectangle a b has an open left–right crossing.
def horizontalCrossingEvent (a b : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | HorizontalCrossing ω a b}
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 HorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b : ℤ) : Prop :=
∃ (x : leftSide a b) (y : rightSide a b),
ConnectedWithin 2 ω (rectangle a b)
⟨(x : Site 2), leftSide_subset x.2⟩ ⟨(y : Site 2), rightSide_subset y.2⟩
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:93
Uses 3 · Used by 1
DefinitionOpen bottom–top crossing of a rectangle at the origin#✓fully proved
ω has an open bottom–top crossing of rectangle a b: an open path inside the rectangle from
its bottom side to its top side.
def VerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b : ℤ) : Prop :=
∃ (x : bottomSide a b) (y : topSide a b),
ConnectedWithin 2 ω (rectangle a b)
⟨(x : Site 2), bottomSide_subset x.2⟩ ⟨(y : Site 2), topSide_subset y.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 bottomSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 1 = 0}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:72
def topSide (a b : ℤ) : Set (Site 2) := {x | x ∈ rectangle a b ∧ x 1 = b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:75
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
def rectangle (a b : ℤ) : Set (Site 2) :=
{x | 0 ≤ x 0 ∧ x 0 ≤ a ∧ 0 ≤ x 1 ∧ x 1 ≤ b}
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:50
theorem bottomSide_subset : bottomSide a b ⊆ rectangle a b
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:88
theorem topSide_subset : topSide a b ⊆ rectangle a b
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:89
DefinitionBottom–top crossing event of a rectangle at the origin#✓fully proved
The event that rectangle a b has an open bottom–top crossing.
def verticalCrossingEvent (a b : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | VerticalCrossing ω a b}
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 VerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b : ℤ) : Prop :=
∃ (x : bottomSide a b) (y : topSide a b),
ConnectedWithin 2 ω (rectangle a b)
⟨(x : Site 2), bottomSide_subset x.2⟩ ⟨(y : Site 2), topSide_subset y.2⟩
MathlibExt/Probability/Percolation/TwoDimensional/Crossings.lean:108
Uses 3 · Used by 1
TheoremMonotonicity of the open subgraph in the plane#✓fully proved
The open subgraph is monotone in the configuration (d = 2 case of
StatMech.Universality.openSubgraph_mono_dim).
theorem openSubgraph_mono {ω ω' : ConfigSpace (Sym2 (Site 2))} (h : ω ≤ ω') :
openSubgraph 2 ω ≤ openSubgraph 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 openSubgraph (d : ℕ) (ω : ConfigSpace (Sym2 (Site d))) : SimpleGraph (Site d) where
Adj x y := IsOpenEdge d ω x y
symm := ⟨fun _ _ h => isOpenEdge_symm h⟩
loopless := ⟨fun x h => isOpenEdge_irrefl x h⟩
MathlibExt/Combinatorics/SimpleGraph/Lattice/Clusters.lean:61
Uses 4 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.