Theorem 3.1, (3.3), p. 3595 — μⁿ → μ̄ in 𝒫(𝒞_d) in probability
OpenGraphonMF.DenseLLN.theorem_3_1_eq_3_3Let , , and let the initial states and the standard Brownian motions , , be mutually independent on one probability space. Assume
- Condition 2.1: is measurable, for some , and are Lipschitz;
- Condition 2.2(a): for a finite cover of by intervals , is -continuous on each ;
- Condition 3.1: each is a step graphon as in (3.2); the weights satisfy either , or independently for and independently of the noise; and for a graphon .
Let solve the graphon particle system (2.1) for , with path laws , and let solve the -particle system (3.1), driven by and . Then
as .
This is the first assertion of Theorem 3.1; it needs no regularity of (Condition 2.2(b) is not assumed). It is stated separately because the second assertion (3.4) follows directly from Lemma 6.1 and Remark 2.1, while (3.3) needs the continuous-graphon approximation of §6.2.
Formalization Note Same conventions as the parent theorem GraphonMF.DenseLLN.theorem_3_1: convergence in probability means that for every neighbourhood of in the weak topology, with applied as an outer measure; is the mixture ; each is assumed measurable. The hypotheses are exactly those of the parent theorem.
import Mathlib import Definitions.Def_GraphonMF_DenseLLN_Setting open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
namespace GraphonMF.DenseLLN
theorem theorem_3_1_eq_3_3 {Ω : Type*} [MeasurableSpace Ω] {T : ℝ≥0} {d N : ℕ} {P : Measure Ω}
{μ0 : GraphonMF.Stability.I → Measure (GraphonMF.Stability.State d)} {X0 : GraphonMF.Stability.I → Ω → GraphonMF.Stability.State d} {B : GraphonMF.Stability.I → ℝ≥0 → Ω → GraphonMF.Stability.State d}
(noise : NoiseSetting P μ0 X0 B) (hT : 0 < T)
(b : GraphonMF.Stability.State d → GraphonMF.Stability.State d → GraphonMF.Stability.State d) (σ : GraphonMF.Stability.State d → GraphonMF.Stability.State d → Matrix (Fin d) (Fin d) ℝ)
(ε : ℝ) (h21 : GraphonMF.Stability.Cond21 ε μ0 b σ)
(J : Fin N → Set GraphonMF.Stability.I) (h22a : Cond22a μ0 J)
(G : GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ) (hG : GraphonMF.Stability.IsGraphon G)
(Gs : ℕ → GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ) (h31a : ∀ n, 0 < n → GraphonMF.Stability.IsStepGraphon n (Gs n))
(ξ : (n : ℕ) → Ω → Fin n → Fin n → ℝ) (hξ : ∀ n, Measurable (ξ n))
(h31b : Cond31b P X0 B ξ Gs)
(h31c : Tendsto (fun n => GraphonMF.Stability.cutNorm (fun u v => Gs n u v - G u v)) atTop (𝓝 0))
(X : GraphonMF.Stability.I → Ω → GraphonMF.Stability.Cd T d) (hX : IsGraphonSolution noise G b σ X)
(Xn : (n : ℕ) → Fin n → Ω → GraphonMF.Stability.Cd T d)
(hXn : ∀ n, IsParticleSolution noise b σ n (ξ n) (hξ n) (Xn n)) :
TendstoInProb P (fun n ω => empiricalPM (fun i => Xn n i ω)) (mixturePM P X) := by sorry
end GraphonMF.DenseLLN