Russo's formula for percolation
DefinitionProbability of an event under Bernoulli product measure#✓fully proved
The probability ℙ_p(A) of A under the Bernoulli(p) product measure on {0, 1}^E for
p ∈ [0, 1]; outside [0, 1] it is the polynomial StatMech.prob p A, so that the function is
defined on all of ℝ.
noncomputable def measureProb (A : Set (ConfigSpace E)) (p : ℝ) : ℝ :=
if h : 0 ≤ p ∧ p ≤ 1 then
(bernoulliProductMeasure (E := E) ⟨p, h.1⟩ (by exact_mod_cast h.2)).real A
else prob p A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
Uses 3 · Used by 3
TheoremRusso's formula#✓fully proved
Russo's formula (Margulis–Russo): for an increasing event A on a finite edge set and
0 < p < 1, p ↦ ℙ_p(A) has derivative ∑_e ℙ_p(e is pivotal for A) at p.
See also StatMech.hasDerivAt_prob_eq_sum_pivotalProb (the polynomial form, for all p) and
StatMech.hasDerivAt_realProb_cylinder_pivotal (cylinder events on an infinite edge set).
theorem russo_derivative (A : Set (ConfigSpace E)) (hA : IsIncreasing A)
{p : ℝ} (h0 : 0 < p) (h1 : p < 1) :
HasDerivAt (fun p => measureProb A p) (∑ e, pivotalProb p A e) p
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def measureProb (A : Set (ConfigSpace E)) (p : ℝ) : ℝ :=
if h : 0 ≤ p ∧ p ≤ 1 then
(bernoulliProductMeasure (E := E) ⟨p, h.1⟩ (by exact_mod_cast h.2)).real A
else prob p A
MathlibExt/Probability/Percolation/CylinderDerivative.lean:54
noncomputable def pivotalProb (p : ℝ) (A : Set (ConfigSpace E)) (e : E) : ℝ :=
∑ ω, (Set.indicator {ω | IsPivotal e A ω} (fun _ => (1 : ℝ)) ω) * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:78
Uses 8 · Used by 2
TheoremRusso's formula#✓fully proved
Russo's formula, deriv form: d/dp ℙ_p(A) = ∑_e ℙ_p(e is pivotal for A) for an
increasing event A and 0 < p < 1.
theorem russo_formula (A : Set (ConfigSpace E)) (hA : IsIncreasing A)
{p : ℝ} (h0 : 0 < p) (h1 : p < 1) :
deriv (fun p => measureProb A p) p = ∑ e, pivotalProb p A e
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def measureProb (A : Set (ConfigSpace E)) (p : ℝ) : ℝ :=
if h : 0 ≤ p ∧ p ≤ 1 then
(bernoulliProductMeasure (E := E) ⟨p, h.1⟩ (by exact_mod_cast h.2)).real A
else prob p A
MathlibExt/Probability/Percolation/CylinderDerivative.lean:54
noncomputable def pivotalProb (p : ℝ) (A : Set (ConfigSpace E)) (e : E) : ℝ :=
∑ ω, (Set.indicator {ω | IsPivotal e A ω} (fun _ => (1 : ℝ)) ω) * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:78
TheoremRusso's formula for the Bernoulli product measure#✓fully proved
Russo's formula for p : ℝ≥0, packaged with the identification of measureProb A p with
(bernoulliProductMeasure p hp).real A.
theorem russo_derivative_measure (A : Set (ConfigSpace E)) (hA : IsIncreasing A)
(p : ℝ≥0) (hp : p ≤ 1) (h0 : 0 < (p : ℝ)) (h1 : (p : ℝ) < 1) :
HasDerivAt (fun q => measureProb A q) (∑ e, pivotalProb (p : ℝ) A e) (p : ℝ)
∧ measureProb A (p : ℝ) = (bernoulliProductMeasure (E := E) p hp).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def measureProb (A : Set (ConfigSpace E)) (p : ℝ) : ℝ :=
if h : 0 ≤ p ∧ p ≤ 1 then
(bernoulliProductMeasure (E := E) ⟨p, h.1⟩ (by exact_mod_cast h.2)).real A
else prob p A
MathlibExt/Probability/Percolation/CylinderDerivative.lean:54
noncomputable def pivotalProb (p : ℝ) (A : Set (ConfigSpace E)) (e : E) : ℝ :=
∑ ω, (Set.indicator {ω | IsPivotal e A ω} (fun _ => (1 : ℝ)) ω) * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:78
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
Uses 7
DefinitionReal-valued indicator that an edge is open#✓fully proved
The indicator ω_e ∈ {0, 1} (as a real number) that the edge e is open in ω.
noncomputable def openInd (ω : ConfigSpace E) (e : E) : ℝ := if ω e then 1 else 0
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
TheoremRusso's formula#✓fully proved
Russo's formula in pivotal-factor form: for increasing A and 0 < p < 1,
d/dp ℙ_p(A) = (p(1 - p))⁻¹ ∑_e 𝔼_p[1_A (ω_e - p)].
theorem hasDerivAt_prob_eq_pivotalFactor (A : Set (ConfigSpace E))
(hA : IsIncreasing A) {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) :
HasDerivAt (fun p => prob p A)
((1 / (p * (1 - p))) *
∑ e, ∑ ω, A.indicator (fun _ => (1 : ℝ)) ω *
((openInd ω e - p) * configWeight p ω)) p
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
noncomputable def openInd (ω : ConfigSpace E) (e : E) : ℝ := if ω e then 1 else 0
MathlibExt/Probability/Percolation/PivotalFactor.lean:48
noncomputable def configWeight (p : ℝ) (ω : ConfigSpace E) : ℝ :=
∏ e, edgeWeight p ω e
MathlibExt/Probability/CorrelationInequalities/Russo.lean:69
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.