Rectangles, crossings, annuli and the box-crossing property on ℤ²
DefinitionInteger rectangle in the plane lattice#✓fully proved
The rectangle [a, b] × [c, d] in ℤ².
def rect (a b c d : ℤ) : Set (Site 2) :=
{x | a ≤ x 0 ∧ x 0 ≤ b ∧ c ≤ x 1 ∧ x 1 ≤ d}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 29
TheoremMeasurability of connection inside a set#✓fully proved
The event that two vertices are connected by an open path inside S is measurable.
theorem measurableSet_connectedWithin {d : ℕ} (S : Set (Site d)) (x y : S) :
MeasurableSet {ω : ConfigSpace (Sym2 (Site d)) | ConnectedWithin d ω S x y}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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
DefinitionLeft side of a general lattice rectangle#✓fully proved
The left side {a} × [c, d] of rect a b c d.
def leftSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 0 = a}
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
Uses 2 · Used by 6
DefinitionRight side of a general lattice rectangle#✓fully proved
The right side {b} × [c, d] of rect a b c d.
def rightSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 0 = b}
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
Uses 2 · Used by 6
DefinitionBottom side of a general lattice rectangle#✓fully proved
The bottom side [a, b] × {c} of rect a b c d.
def bottomSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = c}
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
Uses 2 · Used by 7
DefinitionTop side of a general lattice rectangle#✓fully proved
The top side [a, b] × {d} of rect a b c d.
def topSide (a b c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 1 = d}
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
Uses 2 · Used by 7
DefinitionOpen left–right crossing of a general rectangle#✓fully proved
An open left–right crossing of rect a b c d by a path inside the rectangle.
def HorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : leftSide a b c d) (y : rightSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(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 c d : ℤ) : Set (Site 2) := {x | x ∈ rect a b c d ∧ x 0 = a}
MathlibExt/Probability/Percolation/RSW/Defs.lean:168
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
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
theorem leftSide_subset {a b c d : ℤ} : leftSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:188
theorem rightSide_subset {a b c d : ℤ} : rightSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:189
DefinitionOpen bottom–top crossing of a general rectangle#✓fully proved
An open bottom–top crossing of rect a b c d by a path inside the rectangle.
def VerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : bottomSide a b c d) (y : topSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(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 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
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
theorem bottomSide_subset {a b c d : ℤ} : bottomSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:190
theorem topSide_subset {a b c d : ℤ} : topSide a b c d ⊆ rect a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:191
DefinitionLeft–right crossing event of a general rectangle#✓fully proved
The event that rect a b c d has an open left–right crossing.
def horizontalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | HorizontalCrossing ω 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 HorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : leftSide a b c d) (y : rightSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(x : Site 2), leftSide_subset x.2⟩ ⟨(y : Site 2), rightSide_subset y.2⟩
MathlibExt/Probability/Percolation/RSW/Defs.lean:194
Uses 3 · Used by 3
DefinitionBottom–top crossing event of a general rectangle#✓fully proved
The event that rect a b c d has an open bottom–top crossing.
def verticalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | VerticalCrossing ω 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 VerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : bottomSide a b c d) (y : topSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(x : Site 2), bottomSide_subset x.2⟩ ⟨(y : Site 2), topSide_subset y.2⟩
MathlibExt/Probability/Percolation/RSW/Defs.lean:200
TheoremMeasurability of the left–right crossing event#✓fully proved
A left–right crossing event of a rectangle is measurable.
theorem measurableSet_horizontalCrossingEvent (a b c d : ℤ) :
MeasurableSet (horizontalCrossingEvent a b c d)
def horizontalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | HorizontalCrossing ω a b c d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:206
Uses 8 · Used by 1
TheoremMeasurability of the bottom–top crossing event#✓fully proved
A bottom–top crossing event of a rectangle is measurable.
theorem measurableSet_verticalCrossingEvent (a b c d : ℤ) :
MeasurableSet (verticalCrossingEvent a b c d)
def verticalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | VerticalCrossing ω a b c d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:210
Uses 8 · Used by 1
DefinitionDual left–right crossing of a rectangle#✓fully proved
A left–right crossing of rect a b c d in the dual configuration dualConfig ω (an open
crossing of the dual lattice, read through the primal coordinates of dualConfig).
def DualHorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
HorizontalCrossing (dualConfig ω) 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 HorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : leftSide a b c d) (y : rightSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(x : Site 2), leftSide_subset x.2⟩ ⟨(y : Site 2), rightSide_subset y.2⟩
MathlibExt/Probability/Percolation/RSW/Defs.lean:194
def dualConfig (ω : ConfigSpace (Sym2 (Site 2))) : ConfigSpace (Sym2 (Site 2)) :=
fun e => !(ω (crossEdge.symm e))
MathlibExt/Combinatorics/SimpleGraph/Lattice/PlanarDual.lean:152
Uses 4 · Used by 1
DefinitionDual bottom–top crossing of a rectangle#✓fully proved
A bottom–top crossing of rect a b c d in the dual configuration dualConfig ω.
def DualVerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
VerticalCrossing (dualConfig ω) 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 VerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
∃ (x : bottomSide a b c d) (y : topSide a b c d),
ConnectedWithin 2 ω (rect a b c d)
⟨(x : Site 2), bottomSide_subset x.2⟩ ⟨(y : Site 2), topSide_subset y.2⟩
MathlibExt/Probability/Percolation/RSW/Defs.lean:200
def dualConfig (ω : ConfigSpace (Sym2 (Site 2))) : ConfigSpace (Sym2 (Site 2)) :=
fun e => !(ω (crossEdge.symm e))
MathlibExt/Combinatorics/SimpleGraph/Lattice/PlanarDual.lean:152
Uses 4 · Used by 1
DefinitionDual left–right crossing event#✓fully proved
The event DualHorizontalCrossing.
def dualHorizontalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | DualHorizontalCrossing ω 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 DualHorizontalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
HorizontalCrossing (dualConfig ω) a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:280
DefinitionDual bottom–top crossing event#✓fully proved
The event DualVerticalCrossing.
def dualVerticalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | DualVerticalCrossing ω 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 DualVerticalCrossing (ω : ConfigSpace (Sym2 (Site 2))) (a b c d : ℤ) : Prop :=
VerticalCrossing (dualConfig ω) a b c d
MathlibExt/Probability/Percolation/RSW/Defs.lean:284
DefinitionSquare annulus in the plane lattice#✓fully proved
The annulus z + (Λ_{2n} \ Λ_n), where Λ_n = [-n, n]².
def annulus (z : Site 2) (n : ℕ) : Set (Site 2) :=
(fun x => z + x) '' (box 2 (2 * n) \ box 2 n)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
Uses 2 · Used by 1
DefinitionOpen circuit lying in an annulus#✓fully proved
The closed walk w is an open circuit all of whose vertices lie in annulus z n.
def IsAnnulusCircuit (ω : ConfigSpace (Sym2 (Site 2))) (z : Site 2) (n : ℕ)
{v : Site 2} (w : (openSubgraph 2 ω).Walk v v) : Prop :=
IsOpenCircuit 2 ω w ∧ ∀ u ∈ w.support, u ∈ annulus z n
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
def IsOpenCircuit (d : ℕ) (ω : ConfigSpace (Sym2 (Site d))) {x : Site d}
(w : (openSubgraph d ω).Walk x x) : Prop := w.IsCircuit
MathlibExt/Combinatorics/SimpleGraph/Lattice/Clusters.lean:163
def annulus (z : Site 2) (n : ℕ) : Set (Site 2) :=
(fun x => z + x) '' (box 2 (2 * n) \ box 2 n)
MathlibExt/Probability/Percolation/RSW/Defs.lean:321
DefinitionExistence of an open circuit in an annulus#✓fully proved
There is an open circuit inside annulus z n.
def AnnulusCircuit (ω : ConfigSpace (Sym2 (Site 2))) (z : Site 2) (n : ℕ) : Prop :=
∃ (v : Site 2) (w : (openSubgraph 2 ω).Walk v v), IsAnnulusCircuit ω z n w
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
def IsAnnulusCircuit (ω : ConfigSpace (Sym2 (Site 2))) (z : Site 2) (n : ℕ)
{v : Site 2} (w : (openSubgraph 2 ω).Walk v v) : Prop :=
IsOpenCircuit 2 ω w ∧ ∀ u ∈ w.support, u ∈ annulus z n
MathlibExt/Probability/Percolation/RSW/Defs.lean:337
DefinitionOpen circuit event in an annulus#✓fully proved
The event AnnulusCircuit.
def annulusCircuitEvent (z : Site 2) (n : ℕ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | AnnulusCircuit ω z n}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def AnnulusCircuit (ω : ConfigSpace (Sym2 (Site 2))) (z : Site 2) (n : ℕ) : Prop :=
∃ (v : Site 2) (w : (openSubgraph 2 ω).Walk v v), IsAnnulusCircuit ω z n w
MathlibExt/Probability/Percolation/RSW/Defs.lean:342
DefinitionOpen circuit in an annulus centered at the origin#✓fully proved
There is an open circuit inside the annulus Λ_{2n} \ Λ_n centered at the origin.
def AnnulusCircuit0 (ω : ConfigSpace (Sym2 (Site 2))) (n : ℕ) : Prop :=
AnnulusCircuit ω (fun _ => 0) n
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 AnnulusCircuit (ω : ConfigSpace (Sym2 (Site 2))) (z : Site 2) (n : ℕ) : Prop :=
∃ (v : Site 2) (w : (openSubgraph 2 ω).Walk v v), IsAnnulusCircuit ω z n w
MathlibExt/Probability/Percolation/RSW/Defs.lean:342
DefinitionLeft–right crossing event of a box with given aspect ratio#✓fully proved
The left–right open crossing of the box [0, ⌊αn⌋] × [0, n] (aspect ratio α).
noncomputable def boxCrossingEvent (α : ℝ) (n : ℕ) :
Set (ConfigSpace (Sym2 (Site 2))) :=
horizontalCrossingEvent 0 (⌊α * n⌋.toNat) 0 n
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 horizontalCrossingEvent (a b c d : ℤ) : Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | HorizontalCrossing ω a b c d}
MathlibExt/Probability/Percolation/RSW/Defs.lean:206
DefinitionBox-crossing property for a sequence of measures#✓fully proved
The box-crossing property for a sequence of set functions μ n: for every aspect ratio
α > 0 there is c > 0 with μ n (boxCrossingEvent α n) ≥ c for all n.
def P5 (μ : ℕ → Set (ConfigSpace (Sym2 (Site 2))) → ℝ) : Prop :=
∀ α : ℝ, 0 < α → ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, c ≤ μ n (boxCrossingEvent α n)
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
noncomputable def boxCrossingEvent (α : ℝ) (n : ℕ) :
Set (ConfigSpace (Sym2 (Site 2))) :=
horizontalCrossingEvent 0 (⌊α * n⌋.toNat) 0 n
MathlibExt/Probability/Percolation/RSW/Defs.lean:358
Uses 3 · Used by 1
DefinitionUniform two-sided box-crossing property#✓fully proved
The uniform two-sided box-crossing property for a family μ ξ n: for every α > 0 there is
c > 0 with c ≤ μ ξ n (boxCrossingEvent α n) ≤ 1 - c for all ξ and n.
def P5c {Ξ : Type*} (μ : Ξ → ℕ → Set (ConfigSpace (Sym2 (Site 2))) → ℝ) : Prop :=
∀ α : ℝ, 0 < α → ∃ c : ℝ, 0 < c ∧ ∀ (ξ : Ξ) (n : ℕ),
c ≤ μ ξ n (boxCrossingEvent α n) ∧ μ ξ n (boxCrossingEvent α n) ≤ 1 - c
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
noncomputable def boxCrossingEvent (α : ℝ) (n : ℕ) :
Set (ConfigSpace (Sym2 (Site 2))) :=
horizontalCrossingEvent 0 (⌊α * n⌋.toNat) 0 n
MathlibExt/Probability/Percolation/RSW/Defs.lean:358
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.