Bernoulli product measures and cylinder events
DefinitionBernoulli distribution on the Booleans#✓fully proved
The Bernoulli distribution on Bool with success probability p: mass p on true and
1 - p on false. This is Mathlib's ProbabilityTheory.bernoulliMeasure true false p, with the
parameter given as an ℝ≥0 bounded by 1.
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
Used by 50
p̃_c · Exploration independence of a cluster inside a set · Exponential decay from a one-step recursion · Bernoulli weight of a single edge · Sharpness of the phase transition, conditional form · Equality of the Duminil-Copin–Tassion threshold and \(p_c\) · Sharpness of the phase transition · Positivity of the Duminil-Copin–Tassion threshold · Mass of a configuration under a finite Bernoulli product measure · Bernoulli distribution agrees with the library Bernoulli measure · Point masses of the Bernoulli distribution · Bernoulli product measure on configuration space · Bernoulli product measure of a cylinder event · Probability of an event as a sum of configuration masses · Mass of a configuration under a finite Bernoulli product measure, real form · Mass of a configuration on a finite index set is its product weight · Log-modularity of Bernoulli product weights · Configuration masses sum to one · Bernoulli zero-one law for infinite groups acting finite-to-one · Independence of coordinates under the Bernoulli product measure · FK critical point is less than one for \(d \ge 2\), \(q \ge 1\) · Inf-based and sup-based Ising critical points agree for \(d \ge 2\) · Sup-based \(\beta_c\) equals \(-\tfrac{1}{2}\log(1 - p_c)\) for \(d \ge 2\) · Existence of the Ising phase transitionLemmaBernoulli distribution agrees with the library Bernoulli measure#✓fully proved
bernoulliMeasure p hp is Mathlib's ProbabilityTheory.bernoulliMeasure true false p.
lemma bernoulliMeasure_eq (p : ℝ≥0) (hp : p ≤ 1) :
bernoulliMeasure p hp = ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
MathlibExt/Probability/Configuration/ProductMeasure.lean:54
Uses 1
DefinitionBernoulli product measure on configuration space#✓fully proved
The Bernoulli product measure on ConfigSpace E: the coordinates are independent and each is
true with probability p (Measure.infinitePi of bernoulliMeasure p hp). See also Mathlib's
ProbabilityTheory.setBernoulli, the same product measure on Set E.
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
MathlibExt/Probability/Configuration/ProductMeasure.lean:54
Uses 2 · Used by 69
p̃_c · Exploration independence of a cluster inside a set · Exponential decay from a one-step recursion · Probability of an event under Bernoulli product measure · Russo's formula · Russo's formula for the Bernoulli product measure · Sharpness of the phase transition, conditional form · Equality of the Duminil-Copin–Tassion threshold and \(p_c\) · Sharpness of the phase transition · Positivity of the Duminil-Copin–Tassion threshold · Probability of connection inside a set · Mass of a configuration under a finite Bernoulli product measure · Bernoulli product measure of a cylinder event · Bernoulli product measure on bonds is the bond percolation law · Bernoulli product measure of an event on a finite index set · Probability of an event as a sum of configuration masses · Bernoulli product measure of a cylinder event, real-valued form · Probability of a finitely dependent event as a polynomial in \(p\) · Probability of a finitely dependent event as a finite weight · Mass of a configuration under a finite Bernoulli product measure, real form · Mass of a configuration on a finite index set is its product weight · Log-modularity of Bernoulli product weights · Nonnegativity of configuration masses · Configuration masses sum to one · Bernoulli zero-one law for infinite groups acting finite-to-one · Independence of coordinates under the Bernoulli product measure · Ergodicity of Bernoulli measures under free infinite-group actions · FK critical point is less than one for \(d \ge 2\), \(q \ge 1\) · Inf-based and sup-based Ising critical points agree for \(d \ge 2\) · Sup-based \(\beta_c\) equals \(-\tfrac{1}{2}\log(1 - p_c)\) for \(d \ge 2\) · Existence of the Ising phase transitionLemmaBernoulli product measure on bonds is the bond percolation law#✓fully proved
On bond configurations Sym2 V → Bool, bernoulliProductMeasure is the bond percolation law
MathlibExt.Probability.ProductBondPercolation.gbernoulliLaw.
lemma bernoulliProductMeasure_eq_gbernoulliLaw {V : Type*} (p : ℝ≥0) (hp : p ≤ 1) :
bernoulliProductMeasure (E := Sym2 V) p hp
= MathlibExt.Probability.ProductBondPercolation.gbernoulliLaw (p : ℝ) p.2 hp
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
noncomputable def gbernoulliLaw (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
Measure (Sym2 V → Bool) :=
Measure.infinitePi fun _ => ProbabilityTheory.bernoulliMeasure true false ⟨p, hp0, hp1⟩
MathlibExt/Probability/ProductBondPercolation.lean:109
TheoremMass of a configuration under a finite Bernoulli product measure#✓fully proved
For finite E, the mass of a configuration is the product of its coordinate masses.
theorem apply_singleton [Fintype E] (ω : ConfigSpace E) :
bernoulliProductMeasure (E := E) p hp {ω} = ∏ e, bernoulliMeasure p hp {ω e}
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
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
MathlibExt/Probability/Configuration/ProductMeasure.lean:54
TheoremMass of a configuration under a finite Bernoulli product measure, real form#✓fully proved
For finite E, the mass of a configuration is the product of its coordinate masses.
theorem real_singleton [Fintype E] (ω : ConfigSpace E) :
(bernoulliProductMeasure (E := E) p hp).real {ω}
= ∏ e, (bernoulliMeasure p hp).real {ω e}
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
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
MathlibExt/Probability/Configuration/ProductMeasure.lean:54
Uses 4 · Used by 7
p̃_c · Exploration independence of a cluster inside a set · Mass of a configuration on a finite index set is its product weight · Log-modularity of Bernoulli product weightsTheoremProbability of an event as a sum of configuration masses#✓fully proved
For finite E, the probability of an event is the sum of the masses of its configurations.
theorem real_eq_sum [Fintype E] [DecidableEq E] (S : Set (ConfigSpace E)) :
(bernoulliProductMeasure (E := E) p hp).real S
= ∑ ω : ConfigSpace E,
S.indicator (fun _ => (1 : ℝ)) ω * (bernoulliProductMeasure (E := E) p hp).real {ω}
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 6
TheoremNonnegativity of configuration masses#✓fully proved
Configuration masses are nonnegative.
theorem real_singleton_nonneg (ω : ConfigSpace E) :
0 ≤ (bernoulliProductMeasure (E := E) p hp).real {ω}
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 2 · Used by 1
TheoremConfiguration masses sum to one#✓fully proved
For finite E, the configuration masses sum to 1.
theorem sum_real_singleton [Fintype E] [DecidableEq E] :
∑ ω : ConfigSpace E, (bernoulliProductMeasure (E := E) p hp).real {ω} = 1
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 1
TheoremLog-modularity of Bernoulli product weights#✓fully proved
The configuration weights of a Bernoulli product measure are log-modular:
w(a) w(b) = w(a ⊔ b) w(a ⊓ b). In particular they satisfy the FKG lattice condition.
theorem real_singleton_logModular [Fintype E] (a b : ConfigSpace E) :
(bernoulliProductMeasure (E := E) p hp).real {a}
* (bernoulliProductMeasure (E := E) p hp).real {b}
= (bernoulliProductMeasure (E := E) p hp).real {a ⊔ b}
* (bernoulliProductMeasure (E := E) p hp).real {a ⊓ b}
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 4 · Used by 1
LemmaPoint masses of the Bernoulli distribution#✓fully proved
The mass of a point under the Bernoulli distribution: p at true, 1 - p at false.
lemma bernoulliMeasure_real_singleton (p : ℝ≥0) (hp : p ≤ 1) (b : Bool) :
(bernoulliMeasure p hp).real {b} = if b then (p : ℝ) else 1 - p
noncomputable def bernoulliMeasure (p : ℝ≥0) (hp : p ≤ 1) : Measure Bool :=
ProbabilityTheory.bernoulliMeasure true false ⟨p, p.2, hp⟩
MathlibExt/Probability/Configuration/ProductMeasure.lean:54
Uses 1 · Used by 1
LemmaMass of a configuration on a finite index set is its product weight#✓fully proved
On a finite index set, the mass of a configuration is its product weight configWeight.
lemma realSingleton_eq_configWeight [Fintype E] (p : ℝ≥0) (hp : p ≤ 1)
(ω : ConfigSpace E) :
(bernoulliProductMeasure (E := E) p hp).real {ω} = configWeight (p : ℝ) ω
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
noncomputable def configWeight (p : ℝ) (ω : ConfigSpace E) : ℝ :=
∏ e, edgeWeight p ω e
MathlibExt/Probability/CorrelationInequalities/Russo.lean:69
Uses 7 · Used by 1
LemmaBernoulli product measure of an event on a finite index set#✓fully proved
On a finite index set, the Bernoulli product measure of an event is its weight prob p.
lemma finiteRealProb_eq_prob [Fintype E] (p : ℝ≥0) (hp : p ≤ 1)
(S : Set (ConfigSpace E)) :
(bernoulliProductMeasure (E := E) p hp).real S = prob (p : ℝ) S
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
noncomputable def prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
Uses 6 · Used by 2
DefinitionConfiguration patched from one configuration on a finite set and another off it#✓fully proved
The configuration that agrees with η on the finite set F and with ω off F.
noncomputable def extendOff (F : Finset E) (ω : ConfigSpace E) (η : ConfigSpace ↥F) :
ConfigSpace E := fun j => if h : j ∈ F then η ⟨j, h⟩ else ω j
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
LemmaEvents depending on finitely many coordinates are cylinders#✓fully proved
An event whose indicator depends only on the coordinates in F is the cylinder over its
projection onto F.
lemma eq_cylinder_restrict_image (A : Set (ConfigSpace E)) (F : Finset E)
(hA : DependsOn (A.indicator (fun _ => (1 : ℝ))) (F : Set E)) :
A = cylinder F (F.restrict '' A)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 5
LemmaBernoulli product measure of a cylinder event#✓fully proved
The infinite Bernoulli product measure of a cylinder over F is the finite Bernoulli product
measure of its base.
lemma bernoulliProductMeasure_cylinder (p : ℝ≥0) (hp : p ≤ 1) (F : Finset E)
(S : Set (ConfigSpace ↥F)) :
bernoulliProductMeasure (E := E) p hp (cylinder F S)
= bernoulliProductMeasure (E := ↥F) p hp S
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 1
LemmaBernoulli product measure of a cylinder event, real-valued form#✓fully proved
Real-valued form of bernoulliProductMeasure_cylinder.
lemma realProb_cylinder (p : ℝ≥0) (hp : p ≤ 1) (F : Finset E)
(S : Set (ConfigSpace ↥F)) :
(bernoulliProductMeasure (E := E) p hp).real (cylinder F S)
= (bernoulliProductMeasure (E := ↥F) p hp).real S
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 6
p̃_c · Exploration independence of a cluster inside a set · Probability of a finitely dependent event as a finite weightTheoremProbability of a finitely dependent event as a finite weight#✓fully proved
The probability of an event depending only on the coordinates in F is the finite weight
prob p of its projection onto F.
theorem realProb_cylinder_eq_prob (p : ℝ≥0) (hp : p ≤ 1)
(A : Set (ConfigSpace E)) (F : Finset E)
(hA : DependsOn (A.indicator (fun _ => (1 : ℝ))) (F : Set E)) :
(bernoulliProductMeasure (E := E) p hp).real A
= prob (p : ℝ) (F.restrict '' 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
noncomputable def prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
Uses 6 · Used by 5
TheoremProbability of a finitely dependent event as a polynomial in \(p\)#✓fully proved
The probability of an event depending only on the coordinates in F, as an explicit
polynomial in p.
theorem realProb_cylinder_eq_finsum (p : ℝ≥0) (hp : p ≤ 1)
(A : Set (ConfigSpace E)) (F : Finset E)
(hA : DependsOn (A.indicator (fun _ => (1 : ℝ))) (F : Set E)) :
(bernoulliProductMeasure (E := E) p hp).real A
= ∑ η : ConfigSpace ↥F,
(F.restrict '' A).indicator (fun _ => (1 : ℝ)) η
* ∏ e : ↥F, (if η e then (p : ℝ) else 1 - p)
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 6 · Used by 3
TheoremDifferentiability in \(p\) of the probability of a cylinder event#✓fully proved
The weight of the projection of an event onto finitely many coordinates is differentiable
in p.
theorem differentiable_realProb_cylinder
(A : Set (ConfigSpace E)) (F : Finset E) :
Differentiable ℝ (fun q => prob q (F.restrict '' A))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
Uses 4 · Used by 3
LemmaFinite projections of increasing events are increasing#✓fully proved
The projection of an increasing event onto finitely many coordinates is increasing.
lemma isIncreasing_restrict_image (A : Set (ConfigSpace E)) (hA : IsIncreasing A)
(F : Finset E) : IsIncreasing (F.restrict '' 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
Uses 3 · Used by 2
TheoremRusso's formula#✓fully proved
Russo's formula for an increasing event A projected onto finitely many coordinates F:
the derivative in p of its weight is the sum over e ∈ F of the weight of the event that e
is pivotal (L. Russo, 1981).
theorem hasDerivAt_realProb_cylinder_pivotal
(A : Set (ConfigSpace E)) (hA : IsIncreasing A) (F : Finset E) (q : ℝ) :
HasDerivAt (fun q => prob q (F.restrict '' A))
(∑ e : ↥F, pivotalProb q (F.restrict '' A) e) q
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 pivotalProb (p : ℝ) (A : Set (ConfigSpace E)) (e : E) : ℝ :=
∑ ω, (Set.indicator {ω | IsPivotal e A ω} (fun _ => (1 : ℝ)) ω) * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:78
Uses 6 · Used by 1
TheoremRusso's formula#✓fully proved
Russo's formula, deriv form of hasDerivAt_realProb_cylinder_pivotal.
theorem deriv_realProb_cylinder_pivotal
(A : Set (ConfigSpace E)) (hA : IsIncreasing A) (F : Finset E) (q : ℝ) :
deriv (fun q => prob q (F.restrict '' A)) q
= ∑ e : ↥F, pivotalProb q (F.restrict '' 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 prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
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 5 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.