Special cases of Reimer's inequality
DefinitionNegatively correlated events#✓fully proved
A and B are negatively correlated under the weight φ:
wprob φ (A ∩ B) ≤ wprob φ A * wprob φ B.
def NegativelyCorrelated [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(A B : Set (ConfigSpace E)) : Prop :=
wprob φ (A ∩ B) ≤ wprob φ A * wprob φ B
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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 2 · Used by 2
TheoremReimer's inequality for negatively correlated events#✓fully proved
Reimer's inequality for negatively correlated events (since A □ B ⊆ A ∩ B).
theorem reimer_wprob_of_negCorr [Fintype E] [DecidableEq E] {φ : E → Bool → ℝ}
(hφ0 : ∀ x b, 0 ≤ φ x b) {A B : Set (ConfigSpace E)} (h : NegativelyCorrelated φ A B) :
wprob φ (disjointOccurrence A B) ≤ wprob φ A * wprob φ B
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def NegativelyCorrelated [Fintype E] [DecidableEq E] (φ : E → Bool → ℝ)
(A B : Set (ConfigSpace E)) : Prop :=
wprob φ (A ∩ B) ≤ wprob φ A * wprob φ B
MathlibExt/Probability/CorrelationInequalities/ReimerSpecialCases.lean:66
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 6 · Used by 1
TheoremReimer's inequality for disjoint events#✓fully proved
Reimer's inequality for disjoint events under the product Bernoulli measure: both sides
are compared with P(A □ B) = 0.
theorem reimer_inequality_of_inter_empty [Fintype E] [DecidableEq E] {p : ℝ≥0} (hp : p ≤ 1)
{A B : Set (ConfigSpace E)} (h : A ∩ 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
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
Uses 10 · Used by 1
DefinitionEvent that two coordinates differ#✓fully proved
The event ω 0 ≠ ω 1 on two coordinates.
def evXor : Set (ConfigSpace (Fin 2)) := {ω | ω 0 ≠ ω 1}
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
DefinitionEvent that two coordinates agree#✓fully proved
The event ω 0 = ω 1 on two coordinates.
def evXnor : Set (ConfigSpace (Fin 2)) := {ω | ω 0 = ω 1}
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
TheoremReimer's inequality for the XOR and XNOR events#✓fully proved
Reimer's inequality for evXor and evXnor, which are neither increasing nor decreasing
(and are disjoint).
theorem reimer_xor_xnor_inequality {p : ℝ≥0} (hp : p ≤ 1) :
(bernoulliProductMeasure (E := Fin 2) p hp).real (disjointOccurrence evXor evXnor)
≤ (bernoulliProductMeasure (E := Fin 2) p hp).real evXor
* (bernoulliProductMeasure (E := Fin 2) p hp).real evXnor
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
def evXor : Set (ConfigSpace (Fin 2)) := {ω | ω 0 ≠ ω 1}
MathlibExt/Probability/CorrelationInequalities/ReimerSpecialCases.lean:102
def evXnor : Set (ConfigSpace (Fin 2)) := {ω | ω 0 = ω 1}
MathlibExt/Probability/CorrelationInequalities/ReimerSpecialCases.lean:105
TheoremSlice inequalities in the one-coordinate BK induction step#✓fully proved
The slice inequalities of the one-coordinate BK induction step, with A₀, A₁, B₀, B₁ the slices
at the first coordinate: P(A₀ □ B₀) ≤ P((A₀ □ B₁) ∩ (A₁ □ B₀)) and
P((A₀ □ B₁) ∪ (A₁ □ B₀)) ≤ P(A₁) P(B₁), for increasing events A, B.
theorem slice_disjointOccurrence_le_of_isIncreasing (n : ℕ) (ψ : Fin n → Bool → ℝ)
(hψ0 : ∀ i b, 0 ≤ ψ i b) (hψ1 : ∀ i, ψ i false + ψ i true = 1)
(A B : Set (ConfigSpace (Fin (n + 1)))) (hA : IsIncreasing A) (hB : IsIncreasing B) :
wprob ψ (disjointOccurrence (slice A false) (slice B false))
≤ wprob ψ (disjointOccurrence (slice A false) (slice B true)
∩ disjointOccurrence (slice A true) (slice B false))
∧ wprob ψ (disjointOccurrence (slice A false) (slice B true)
∪ disjointOccurrence (slice A true) (slice B false))
≤ wprob ψ (slice A true) * wprob ψ (slice B true)
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
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
def slice {n : ℕ} (C : Set (ConfigSpace (Fin (n + 1)))) (x : Bool) :
Set (ConfigSpace (Fin n)) := {ω' | Fin.cons x ω' ∈ C}
MathlibExt/Probability/CorrelationInequalities/BK.lean:163
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.