Reimer's inequality for an increasing and a decreasing event
TheoremHarris–FKG inequality for increasing events#✓fully proved
The Harris–FKG inequality for a product probability weight: increasing events are positively correlated.
theorem wprob_fkg_pos [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(hφ0 : ∀ x b, 0 ≤ φ x b) (hφ1 : ∀ x, φ x false + φ x true = 1)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsIncreasing B) :
wprob φ A * wprob φ B ≤ wprob φ (A ∩ B)
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 wprob [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(S : Set (ConfigSpace E)) : ℝ :=
∑ ω, S.indicator (fun _ => (1 : ℝ)) ω * pweight φ ω
MathlibExt/Probability/CorrelationInequalities/BK.lean:101
Uses 9 · Used by 1
TheoremHarris–FKG inequality for an increasing and a decreasing event#✓fully proved
The Harris–FKG inequality for an increasing and a decreasing event: they are negatively correlated.
theorem wprob_fkg_neg [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(hφ0 : ∀ x b, 0 ≤ φ x b) (hφ1 : ∀ x, φ x false + φ x true = 1)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsDecreasing B) :
wprob φ (A ∩ B) ≤ wprob φ A * wprob φ B
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
def IsDecreasing (A : Set (ConfigSpace E)) : Prop := IsLowerSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:59
noncomputable def wprob [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(S : Set (ConfigSpace E)) : ℝ :=
∑ ω, S.indicator (fun _ => (1 : ℝ)) ω * pweight φ ω
MathlibExt/Probability/CorrelationInequalities/BK.lean:101
Uses 8 · Used by 1
TheoremDisjoint occurrence of an increasing and a decreasing event#✓fully proved
For A increasing and B decreasing, A □ B = A ∩ B.
theorem disjointOccurrence_eq_inter_of_mixed {A B : Set (ConfigSpace E)}
(hA : IsIncreasing A) (hB : IsDecreasing B) :
disjointOccurrence A B = A ∩ B
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
def IsDecreasing (A : Set (ConfigSpace E)) : Prop := IsLowerSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:59
def disjointOccurrence (A B : Set (ConfigSpace E)) : Set (ConfigSpace E) :=
{ω | ∃ K L : Set E, Disjoint K L ∧ OccursOn A K ω ∧ OccursOn B L ω}
MathlibExt/Probability/CorrelationInequalities/DisjointOccurrence.lean:92
Uses 7 · Used by 1
TheoremReimer's inequality for mixed monotone events, product weights#✓fully proved
Reimer's inequality for an increasing and a decreasing event under a product probability weight.
theorem reimerMixed_wprob [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(hφ0 : ∀ x b, 0 ≤ φ x b) (hφ1 : ∀ x, φ x false + φ x true = 1)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsDecreasing B) :
wprob φ (disjointOccurrence A B) ≤ wprob φ A * wprob φ B
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
def IsDecreasing (A : Set (ConfigSpace E)) : Prop := IsLowerSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:59
noncomputable def wprob [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(S : Set (ConfigSpace E)) : ℝ :=
∑ ω, S.indicator (fun _ => (1 : ℝ)) ω * pweight φ ω
MathlibExt/Probability/CorrelationInequalities/BK.lean:101
def disjointOccurrence (A B : Set (ConfigSpace E)) : Set (ConfigSpace E) :=
{ω | ∃ K L : Set E, Disjoint K L ∧ OccursOn A K ω ∧ OccursOn B L ω}
MathlibExt/Probability/CorrelationInequalities/DisjointOccurrence.lean:92
Uses 7 · Used by 1
TheoremReimer's inequality for mixed monotone events, Bernoulli measure#✓fully proved
Reimer's inequality for an increasing and a decreasing event under the product Bernoulli measure.
theorem reimerMixed_inequality [Fintype E] [DecidableEq E] {p : ℝ≥0} (hp : p ≤ 1)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsDecreasing B) :
(bernoulliProductMeasure (E := E) p hp).real (disjointOccurrence A B)
≤ (bernoulliProductMeasure (E := E) p hp).real A
* (bernoulliProductMeasure (E := E) p hp).real B
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
def IsDecreasing (A : Set (ConfigSpace E)) : Prop := IsLowerSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:59
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
def disjointOccurrence (A B : Set (ConfigSpace E)) : Set (ConfigSpace E) :=
{ω | ∃ K L : Set E, Disjoint K L ∧ OccursOn A K ω ∧ OccursOn B L ω}
MathlibExt/Probability/CorrelationInequalities/DisjointOccurrence.lean:92
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.