The square-root trick and gluing crossings through an overlap
TheoremSquare-root trick#✓fully proved
The square-root trick: for a positively associated probability measure and increasing
measurable A, B, 1 - √(1 - μ(A ∪ B)) ≤ max(μ(A), μ(B)).
theorem rsw_sqrt_trick {E : Type*} (μ : Measure (ConfigSpace E))
[IsProbabilityMeasure μ] (hpa : PositivelyAssociated μ)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsIncreasing B)
(hAm : MeasurableSet A) (hBm : MeasurableSet B) :
1 - Real.sqrt (1 - μ.real (A ∪ B)) ≤ max (μ.real A) (μ.real B)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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 IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
Uses 7
DefinitionOpen connection inside an overlap rectangle#✓fully proved
An open path inside the overlap rect m m' c d from p to q.
def OverlapConnection (ω : ConfigSpace (Sym2 (Site 2))) (m m' c d : ℤ)
(p q : Site 2) (hp : p ∈ rect m m' c d) (hq : q ∈ rect m m' c d) : Prop :=
ConnectedWithin 2 ω (rect m m' c d) ⟨p, hp⟩ ⟨q, hq⟩
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 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
DefinitionConnection event inside an overlap rectangle#✓fully proved
The event OverlapConnection.
def overlapConnectionEvent (m m' c d : ℤ) (p q : Site 2)
(hp : p ∈ rect m m' c d) (hq : q ∈ rect m m' c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | OverlapConnection ω m m' c d p q hp hq}
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 OverlapConnection (ω : ConfigSpace (Sym2 (Site 2))) (m m' c d : ℤ)
(p q : Site 2) (hp : p ∈ rect m m' c d) (hq : q ∈ rect m m' c d) : Prop :=
ConnectedWithin 2 ω (rect m m' c d) ⟨p, hp⟩ ⟨q, hq⟩
MathlibExt/Probability/Percolation/Universality/RSWStrip.lean:143
TheoremMeasurability of the overlap connection event#✓fully proved
A connection event inside a rectangular overlap is measurable.
theorem measurableSet_overlapConnectionEvent (m m' c d : ℤ) (p q : Site 2)
(hp : p ∈ rect m m' c d) (hq : q ∈ rect m m' c d) :
MeasurableSet (overlapConnectionEvent m m' c d p q hp hq)
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 overlapConnectionEvent (m m' c d : ℤ) (p q : Site 2)
(hp : p ∈ rect m m' c d) (hq : q ∈ rect m m' c d) :
Set (ConfigSpace (Sym2 (Site 2))) :=
{ω | OverlapConnection ω m m' c d p q hp hq}
MathlibExt/Probability/Percolation/Universality/RSWStrip.lean:148
DefinitionGluing horizontal crossings through a vertical overlap crossing#✓fully proved
For the configuration ω: horizontal crossings of [a, m'] × [c, d] and of [m, b] × [c, d]
together with a vertical crossing of the overlap [m, m'] × [c, d] imply a horizontal crossing
of [a, b] × [c, d].
def HVIntersectionProperty (ω : ConfigSpace (Sym2 (Site 2))) (a m m' b c d : ℤ) : Prop :=
HorizontalCrossing ω a m' c d → VerticalCrossing ω m m' c d →
HorizontalCrossing ω m b c d → 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
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
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.