Sharpness of the phase transition for Bernoulli bond percolation on ℤ^d
TheoremPositivity of the Duminil-Copin–Tassion threshold#✓fully proved
p̃_c(d) > 0 for d ≥ 1: at p = 1/(4d + 1), φ_p({0}) ≤ 2dp < 1.
theorem tildePc_pos (hd : 0 < d) : 0 < (tildePc d : ℝ)
noncomputable def tildePc (d : ℕ) : ℝ≥0 :=
sSup (tildePcSet d)
MathlibExt/Probability/Percolation/TildePc.lean:124
Uses 12 · Used by 1
DefinitionStraight path along the first coordinate axis#✓fully proved
The direction sequence of the straight path from the origin along the first coordinate axis.
Used by 1
TheoremExponential decay of the one-arm probability below the threshold#✓fully proved
Exponential decay of the one-arm probability for every p ∈ tildePcSet d, i.e. every p
admitting a finite S ∋ 0 with φ_p(S) < 1.
theorem crossProb_exp_decay_of_mem_tildePcSet :
∀ p ∈ tildePcSet d, ∀ hp : p ≤ 1,
∃ c > 0, ∃ C > 0, ∀ n, crossProb d p hp n ≤ C * Real.exp (-c * n)
def tildePcSet (d : ℕ) : Set ℝ≥0 :=
{p : ℝ≥0 | ∃ hp : p ≤ 1, ∃ S : Finset (Site d), origin d ∈ S ∧ phi d p hp S < 1}
MathlibExt/Probability/Percolation/TildePc.lean:114
noncomputable def crossProb (d : ℕ) (p : ℝ≥0) (hp : p ≤ 1) (n : ℕ) : ℝ :=
(bernoulliProductMeasure (E := Sym2 (Site d)) p hp).real (crossingEvent d n)
MathlibExt/Probability/Percolation/SubcriticalDecay.lean:71
Uses 8 · Used by 1
TheoremSharpness of the phase transition#✓fully proved
Sharpness of the phase transition for Bernoulli bond percolation on ℤ^d, d ≥ 1
(Duminil-Copin–Tassion 2016; Aizenman–Barsky 1987; Menshikov 1986):
p̃_c = p_c;- for every
p ∈ tildePcSet d(a finiteS ∋ 0hasφ_p(S) < 1),ℙ_p(0 ↔ ℤ^d \ Λ_{n-1}) ≤ C e^{-cn}for somec, C > 0; θ(q) ≥ (q - p̃_c)/(q(1 - p̃_c))forp̃_c < q < 1.
Scope of the items:
* Item 2 is stated on tildePcSet d, not on [0, p_c): passing from p < p̃_c to
p ∈ tildePcSet d needs monotonicity of p ↦ φ_p(S), and passing from p < p_c to θ(p) = 0
needs monotonicity of θ; neither is proved in MathlibExt (θ monotonicity is
theta_mono_parameter in PhyslibExt RandomCluster/PcUpperViaFK).
* Item 3 is informative only when p̃_c < 1. This file does not prove that for any d; at d = 1
it fails (p̃_c = p_c = 1) and item 3 is vacuous. For d = 2, p_c < 1 is proved in PhyslibExt
(StatMech.Percolation.pc_two_lt_one_via_fk), which with item 1 makes item 3 non-vacuous
there.
theorem sharp_phase_transition (hd : 0 < d) :
tildePc d = pc d ∧
(∀ p ∈ tildePcSet d, ∀ hp : p ≤ 1,
∃ c > 0, ∃ C > 0, ∀ n, crossProb d p hp n ≤ C * Real.exp (-c * n)) ∧
(∀ q : ℝ≥0, ∀ hq : q ≤ 1, tildePc d < q → (q : ℝ) < 1 →
theta d q hq ≥ ((q : ℝ) - (tildePc d : ℝ)) / ((q : ℝ) * (1 - (tildePc d : ℝ))))
noncomputable def tildePc (d : ℕ) : ℝ≥0 :=
sSup (tildePcSet d)
MathlibExt/Probability/Percolation/TildePc.lean:124
noncomputable def pc (d : ℕ) : ℝ≥0 :=
sSup (subcriticalSet d)
MathlibExt/Probability/Percolation/Theta.lean:76
def tildePcSet (d : ℕ) : Set ℝ≥0 :=
{p : ℝ≥0 | ∃ hp : p ≤ 1, ∃ S : Finset (Site d), origin d ∈ S ∧ phi d p hp S < 1}
MathlibExt/Probability/Percolation/TildePc.lean:114
noncomputable def crossProb (d : ℕ) (p : ℝ≥0) (hp : p ≤ 1) (n : ℕ) : ℝ :=
(bernoulliProductMeasure (E := Sym2 (Site d)) p hp).real (crossingEvent d n)
MathlibExt/Probability/Percolation/SubcriticalDecay.lean:71
noncomputable def theta (d : ℕ) (p : ℝ≥0) (hp : p ≤ 1) : ℝ :=
(bernoulliProductMeasure (E := Sym2 (Site d)) p hp).real (percolationEvent d)
MathlibExt/Probability/Percolation/Theta.lean:64
Uses 44
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.