Harris inequality
TheoremHarris inequality#✓fully proved
The Harris inequality (Harris 1960): under the product Bernoulli(p) measure on a finite
configuration space, increasing events are positively correlated,
P_p(A) * P_p(B) ≤ P_p(A ∩ B). No measurability hypothesis is needed since E is finite.
See also IsUpperSet.le_card_inter_finset (Harris–Kleitman, counting form).
theorem harris_inequality [Fintype E] [DecidableEq E] {p : ℝ≥0} (hp : p ≤ 1)
{A B : Set (ConfigSpace E)} (hA : IsIncreasing A) (hB : IsIncreasing B) :
(bernoulliProductMeasure (E := E) p hp).real A
* (bernoulliProductMeasure (E := E) p hp).real B
≤ (bernoulliProductMeasure (E := E) p hp).real (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 bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
Uses 10 · Used by 1
TheoremAn event depends on the coordinates its indicator depends on#✓fully proved
If the indicator of A depends only on the coordinates in S (Mathlib's DependsOn), so
does the event A (StatMech.DependsOn).
theorem ih_event_dependsOn_of_indicator {A : Set (ConfigSpace E)} {S : Set E}
(h : _root_.DependsOn (A.indicator (fun _ => (1 : ℝ))) S) :
StatMech.DependsOn A S
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
Uses 3
TheoremIndicator of an event depends on the coordinates the event depends on#✓fully proved
If the event A depends only on S, so does its indicator function.
theorem ih_indicator_dependsOn_of_event {A : Set (ConfigSpace E)} {S : Set E}
(h : StatMech.DependsOn A S) :
_root_.DependsOn (A.indicator (fun _ => (1 : ℝ))) S
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
Uses 2 · Used by 1
TheoremEvents depending on a coordinate set are closed under intersection#✓fully proved
Events depending only on S are closed under intersection.
theorem ih_dependsOn_inter {A B : Set (ConfigSpace E)} {S : Set E}
(hA : StatMech.DependsOn A S) (hB : StatMech.DependsOn B S) :
StatMech.DependsOn (A ∩ B) S
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
Uses 3
TheoremEvents depending on a coordinate set are closed under unions#✓fully proved
Events depending only on S are closed under arbitrary unions.
theorem ih_dependsOn_iUnion {ι : Sort*} {S : Set E} {A : ι → Set (ConfigSpace E)}
(hA : ∀ i, StatMech.DependsOn (A i) S) :
StatMech.DependsOn (⋃ i, A i) S
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
Uses 3
DefinitionFilling a finite configuration with closed coordinates#✓fully proved
The configuration on E equal to η on the finite set F and closed (false) off F.
def ih_fill (F : Finset E) (eta : ConfigSpace F) : ConfigSpace E :=
fun e => if h : e ∈ F then eta ⟨e, h⟩ else false
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 6
TheoremMonotonicity of the closed filling map#✓fully proved
ih_fill F is monotone.
theorem ih_fill_mono (F : Finset E) : Monotone (ih_fill F)
def ih_fill (F : Finset E) (eta : ConfigSpace F) : ConfigSpace E :=
fun e => if h : e ∈ F then eta ⟨e, h⟩ else false
MathlibExt/Probability/CorrelationInequalities/InfiniteHarris.lean:103
Uses 2 · Used by 1
DefinitionSection of an event on a finite coordinate set#✓fully proved
The section of an event A on F: the configurations η on F with ih_fill F η ∈ A.
def ih_section (A : Set (ConfigSpace E)) (F : Finset E) : Set (ConfigSpace F) :=
{eta | ih_fill F eta ∈ A}
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def ih_fill (F : Finset E) (eta : ConfigSpace F) : ConfigSpace E :=
fun e => if h : e ∈ F then eta ⟨e, h⟩ else false
MathlibExt/Probability/CorrelationInequalities/InfiniteHarris.lean:103
Uses 2 · Used by 7
TheoremSection of an increasing event is increasing#✓fully proved
The section of an increasing event is increasing.
theorem ih_section_isIncreasing {A : Set (ConfigSpace E)} (hA : IsIncreasing A)
(F : Finset E) : IsIncreasing (ih_section A F)
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 ih_section (A : Set (ConfigSpace E)) (F : Finset E) : Set (ConfigSpace F) :=
{eta | ih_fill F eta ∈ A}
MathlibExt/Probability/CorrelationInequalities/InfiniteHarris.lean:116
Uses 5 · Used by 3
TheoremFinitely dependent event is a cylinder over its section#✓fully proved
An event depending only on the coordinates in F is the cylinder over its section on F.
theorem ih_eq_cylinder_of_dependsOn {A : Set (ConfigSpace E)} (F : Finset E)
(hA : DependsOn A (F : Set E)) :
A = MeasureTheory.cylinder F (ih_section A F)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
def ih_section (A : Set (ConfigSpace E)) (F : Finset E) : Set (ConfigSpace F) :=
{eta | ih_fill F eta ∈ A}
MathlibExt/Probability/CorrelationInequalities/InfiniteHarris.lean:116
Uses 4 · Used by 4
TheoremHarris inequality for finitely dependent increasing events#✓fully proved
The Harris inequality on a countable configuration space for increasing events that
depend on finitely many coordinates: P_p(A) * P_p(B) ≤ P_p(A ∩ B).
theorem ih_harris_of_finite_dependsOn {p : ℝ≥0} (hp : p ≤ 1)
{A B : Set (ConfigSpace E)} (F : Finset E)
(hAdep : DependsOn A (F : Set E)) (hBdep : DependsOn B (F : Set E))
(hAinc : IsIncreasing A) (hBinc : IsIncreasing B) :
(bernoulliProductMeasure (E := E) p hp).real A *
(bernoulliProductMeasure (E := E) p hp).real B ≤
(bernoulliProductMeasure (E := E) p hp).real (A ∩ B)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def DependsOn (A : Set (ConfigSpace E)) (S : Set E) : Prop :=
∀ ω ω', agreeOn S ω ω' → (ω ∈ A ↔ ω' ∈ A)
MathlibExt/Probability/CorrelationInequalities/ReimerCompression.lean:214
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def bernoulliProductMeasure (p : ℝ≥0) (hp : p ≤ 1) :
Measure (ConfigSpace E) :=
Measure.infinitePi (fun _ : E => bernoulliMeasure p hp)
MathlibExt/Probability/Configuration/ProductMeasure.lean:85
TheoremPositive correlation passes to decreasing intersections#✓fully proved
Positive correlation passes to limits of decreasing sequences of measurable events: if
μ(A n) μ(B n) ≤ μ(A n ∩ B n) for all n, the same holds for ⋂ n, A n and ⋂ n, B n.
theorem ih_harris_iInter_of_antitone
(mu : Measure (ConfigSpace E)) [IsProbabilityMeasure mu]
(A B : ℕ → Set (ConfigSpace E))
(hAanti : Antitone A) (hBanti : Antitone B)
(hAmeas : ∀ n, MeasurableSet (A n)) (hBmeas : ∀ n, MeasurableSet (B n))
(hstage : ∀ n, mu.real (A n) * mu.real (B n) ≤ mu.real (A n ∩ B n)) :
mu.real (⋂ n, A n) * mu.real (⋂ n, B n) ≤
mu.real ((⋂ n, A n) ∩ (⋂ n, B n))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1
TheoremContinuity from above of a finite measure, real-valued form#✓fully proved
Continuity from above of a finite measure, real-valued form: μ.real (A n) tends to
μ.real (⋂ n, A n) for a decreasing sequence of measurable sets.
theorem ih_tendsto_measureReal_iInter {Ω : Type*} [MeasurableSpace Ω]
(mu : Measure Ω) [IsFiniteMeasure mu]
(A : ℕ → Set Ω) (hanti : Antitone A)
(hmeas : ∀ n, MeasurableSet (A n)) :
Tendsto (fun n => mu.real (A n)) atTop (nhds (mu.real (⋂ n, A n)))
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.