Weak and monotone limits on configuration space
DefinitionWeak convergence of probability measures on configuration space#✓fully proved
Weak convergence of a sequence of probability measures on ConfigSpace E: convergence in the
topology of ProbabilityMeasure (ConfigSpace E), whose open sets are generated by the integrals of
bounded continuous functions.
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 47
TheoremWeak convergence implies convergence of integrals#✓fully proved
Under weak convergence, the integral of every bounded continuous function converges.
theorem WeakConvergesTo.tendsto_integral
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
(h : WeakConvergesTo μ ν) (f : (ConfigSpace E) →ᵇ ℝ) :
Tendsto (fun n => ∫ x, f x ∂(μ n : Measure (ConfigSpace E))) atTop
(𝓝 (∫ x, f x ∂(ν : Measure (ConfigSpace E))))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
Uses 2 · Used by 14
TheoremConvergence of integrals implies weak convergence#✓fully proved
If the integral of every bounded continuous function converges, the measures converge weakly.
theorem weakConvergesTo_of_forall_tendsto_integral
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
(h : ∀ f : (ConfigSpace E) →ᵇ ℝ,
Tendsto (fun n => ∫ x, f x ∂(μ n : Measure (ConfigSpace E))) atTop
(𝓝 (∫ x, f x ∂(ν : Measure (ConfigSpace E))))) :
WeakConvergesTo μ ν
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
Uses 2 · Used by 3
TheoremCylinder events are clopen#✓fully proved
A cylinder event of ConfigSpace E, determined by finitely many coordinates, is clopen.
theorem isClopen_cylinderEvent (s : Finset E) (S : Set (∀ _i : s, Bool)) :
IsClopen (cylinder (α := fun _ : E => Bool) s S)
Used by 1
TheoremPortmanteau theorem for clopen events#✓fully proved
Under weak convergence on ConfigSpace E, the probability of every clopen event converges
(portmanteau theorem).
theorem WeakConvergesTo.tendsto_real_of_isClopen
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
(h : WeakConvergesTo μ ν) {A : Set (ConfigSpace E)} (hA : IsClopen A) :
Tendsto (fun n => (μ n : Measure (ConfigSpace E)).real A) atTop
(𝓝 ((ν : Measure (ConfigSpace E)).real A))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
Uses 2 · Used by 17
TheoremIncreasing-event probabilities along an increasing chain are monotone#✓fully proved
Along a chain μ₀ ≼ μ₁ ≼ ⋯, the probability of an increasing event is monotone.
theorem monotone_real_of_chain
{μ : ℕ → Measure (ConfigSpace E)}
(hchain : ∀ n, μ n ≼ μ (n + 1))
(hfinite : ∀ n, IsFiniteMeasure (μ n))
{A : Set (ConfigSpace E)} (hAmeas : MeasurableSet A) (hAinc : IsIncreasing A) :
Monotone (fun n => (μ n).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
Uses 4 · Used by 1
TheoremIncreasing-event probabilities along a decreasing chain are antitone#✓fully proved
Along a chain ⋯ ≼ μ₁ ≼ μ₀, the probability of an increasing event is antitone.
theorem antitone_real_of_chain
{μ : ℕ → Measure (ConfigSpace E)}
(hchain : ∀ n, μ (n + 1) ≼ μ n)
(hfinite : ∀ n, IsFiniteMeasure (μ n))
{A : Set (ConfigSpace E)} (hAmeas : MeasurableSet A) (hAinc : IsIncreasing A) :
Antitone (fun n => (μ n).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
Uses 4 · Used by 1
TheoremWeak limit of an increasing chain dominates its terms#✓fully proved
The weak limit of an increasing chain gives each increasing clopen event at least the probability any term of the chain gives it.
theorem WeakConvergesTo.le_real_of_monotone_isIncreasing
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
(h : WeakConvergesTo μ ν)
(hchain : ∀ n, (μ n : Measure (ConfigSpace E)) ≼ (μ (n + 1) : Measure (ConfigSpace E)))
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (hAinc : IsIncreasing A) (n : ℕ) :
(μ n : Measure (ConfigSpace E)).real A ≤ (ν : Measure (ConfigSpace E)).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
TheoremWeak limit of a decreasing chain is dominated by its terms#✓fully proved
The weak limit of a decreasing chain gives each increasing clopen event at most the probability any term of the chain gives it.
theorem WeakConvergesTo.ge_real_of_antitone_isIncreasing
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
(h : WeakConvergesTo μ ν)
(hchain : ∀ n, (μ (n + 1) : Measure (ConfigSpace E)) ≼ (μ n : Measure (ConfigSpace E)))
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (hAinc : IsIncreasing A) (n : ℕ) :
(ν : Measure (ConfigSpace E)).real A ≤ (μ n : Measure (ConfigSpace E)).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
TheoremLower bounds on clopen-event probabilities pass to weak limits#✓fully proved
A lower bound on the probabilities of a clopen event along a weakly convergent sequence passes to the limit.
theorem le_real_of_weakLimit
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
{ρ : Measure (ConfigSpace E)}
(h : WeakConvergesTo μ ν)
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (_hAinc : IsIncreasing A)
(hbound : ∀ n, ρ.real A ≤ (μ n : Measure (ConfigSpace E)).real A) :
ρ.real A ≤ (ν : Measure (ConfigSpace E)).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
Uses 4 · Used by 1
TheoremUpper bounds on clopen-event probabilities pass to weak limits#✓fully proved
An upper bound on the probabilities of a clopen event along a weakly convergent sequence passes to the limit.
theorem real_le_of_weakLimit
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
{ρ : Measure (ConfigSpace E)}
(h : WeakConvergesTo μ ν)
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A)
(hbound : ∀ n, (μ n : Measure (ConfigSpace E)).real A ≤ ρ.real A) :
(ν : Measure (ConfigSpace E)).real A ≤ ρ.real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
Uses 3 · Used by 1
TheoremStochastic domination from below passes to weak limits#✓fully proved
If ρ ≼ μₙ for all n and μₙ → ν weakly, then ρ(A) ≤ ν(A) for every increasing clopen
event A.
theorem dominated_weakLimit_of_forall_dominated
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
{ρ : Measure (ConfigSpace E)}
(h : WeakConvergesTo μ ν)
(hdom : ∀ n, ρ ≼ (μ n : Measure (ConfigSpace E)))
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (hAinc : IsIncreasing A) :
ρ.real A ≤ (ν : Measure (ConfigSpace E)).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
TheoremStochastic domination from above passes to weak limits#✓fully proved
If μₙ ≼ ρ for all n and μₙ → ν weakly, then ν(A) ≤ ρ(A) for every increasing clopen
event A.
theorem weakLimit_dominated_of_forall_dominated
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {ν : ProbabilityMeasure (ConfigSpace E)}
{ρ : Measure (ConfigSpace E)} [IsFiniteMeasure ρ]
(h : WeakConvergesTo μ ν)
(hdom : ∀ n, (μ n : Measure (ConfigSpace E)) ≼ ρ)
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (hAinc : IsIncreasing A) :
(ν : Measure (ConfigSpace E)).real A ≤ ρ.real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
TheoremProbability measures agreeing on clopen sets are equal#✓fully proved
Two probability measures on ConfigSpace E that agree on clopen sets are equal: the clopen
cylinder events form a generating π-system.
theorem ProbabilityMeasure.ext_of_forall_isClopen
{μ ν : ProbabilityMeasure (ConfigSpace E)}
(h : ∀ A : Set (ConfigSpace E), IsClopen A → μ A = ν A) : μ = ν
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 2 · Used by 1
TheoremSubsequential weak limits are determined by clopen-event limits#✓fully proved
If the probabilities of clopen events converge to L, every subsequential weak limit ξ
satisfies ξ(A) = L(A) on clopen A.
theorem isClopen_apply_eq_of_subseq_tendsto
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {L : Set (ConfigSpace E) → NNReal}
(hconv : ∀ A : Set (ConfigSpace E), IsClopen A → Tendsto (fun n => (μ n) A) atTop (𝓝 (L A)))
{ξ : ProbabilityMeasure (ConfigSpace E)} {ψ : ℕ → ℕ} (hψ : StrictMono ψ)
(htends : Tendsto (μ ∘ ψ) atTop (𝓝 ξ))
{A : Set (ConfigSpace E)} (hA : IsClopen A) :
(ξ A : NNReal) = L A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
TheoremConvergence on clopen events implies weak convergence#✓fully proved
If the probability of every clopen event converges along a sequence of probability measures on
ConfigSpace E, the sequence converges weakly: all subsequential limits (which exist by
Prokhorov) agree on clopen sets, hence coincide.
theorem tendsto_weakly_of_forall_isClopen_tendsto
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)} {L : Set (ConfigSpace E) → NNReal}
(hconv : ∀ A : Set (ConfigSpace E), IsClopen A → Tendsto (fun n => (μ n) A) atTop (𝓝 (L A))) :
∃ ν : ProbabilityMeasure (ConfigSpace E), WeakConvergesTo μ ν
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
TheoremConvergence of increasing-event probabilities along an increasing chain#✓fully proved
Along a chain μ₀ ≼ μ₁ ≼ ⋯, the probability of an increasing clopen event converges to its
supremum.
theorem tendsto_NNReal_of_monotone_isIncreasing
{μ : ℕ → ProbabilityMeasure (ConfigSpace E)}
(hchain : ∀ n, (μ n : Measure (ConfigSpace E)) ≼ (μ (n + 1) : Measure (ConfigSpace E)))
{A : Set (ConfigSpace E)} (hAclopen : IsClopen A) (hAinc : IsIncreasing A) :
Tendsto (fun n => (μ n) A) atTop (𝓝 (⨆ n, (μ n) 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
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.