Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, p. 3608 — W_{2,T}((1/n) Σ δ_{x_i}, (1/n) Σ δ_{y_i})² ≤ (1/n) Σ ‖x_i − y_i‖²_{*,T}

Proved
GraphonMF.DenseLLN.coupling_bound

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

empirical-measurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wasserstein-distance

Let n≥1n\ge1n≥1 and let x1,…,xnx_1,\dots,x_nx1​,…,xn​ and y1,…,yny_1,\dots,y_ny1​,…,yn​ be paths in Cd=C([0,T]:Rd)\mathcal C_d=C([0,T]:\mathbb R^d)Cd​=C([0,T]:Rd). Then

[W2,T(1n∑i=1nδxi, 1n∑i=1nδyi)]2≤1n∑i=1n∥xi−yi∥∗,T2.\Big[W_{2,T}\Big(\frac1n\sum_{i=1}^n\delta_{x_i},\ \frac1n\sum_{i=1}^n\delta_{y_i}\Big)\Big]^2\le\frac1n\sum_{i=1}^n\|x_i-y_i\|_{*,T}^2 .[W2,T​(n1​i=1∑n​δxi​​, n1​i=1∑n​δyi​​)]2≤n1​i=1∑n​∥xi​−yi​∥∗,T2​.

In the proof of Theorem 3.1 it is applied pathwise with xi=Xin(ω)x_i=X^n_i(\omega)xi​=Xin​(ω) and yi=Xi/nG~(ω)y_i=X^{\tilde G}_{i/n}(\omega)yi​=Xi/nG~​(ω). It bounds the distance between the two empirical measures by the mean-square error of Lemma 6.1.

Formalization Note The page states the bound for the random empirical measures. It is a deterministic statement about two nnn-tuples of paths, and it is stated in that form (via the coupling 1n∑iδ(xi,yi)\frac1n\sum_i\delta_{(x_i,y_i)}n1​∑i​δ(xi​,yi​)​).

Preamble
import Mathlib
import Definitions.Def_GraphonMF_DenseLLN_Setting

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace GraphonMF.DenseLLN
theorem coupling_bound {T : ℝ≥0} {d : ℕ} (n : ℕ) (hn : 0 < n) (x y : Fin n → GraphonMF.Stability.Cd T d) :
    GraphonMF.Stability.W2T (empiricalMeasure x) (empiricalMeasure y) ^ 2 ≤
      (1 / (n : ℝ≥0∞)) * ∑ i : Fin n, ‖x i - y i‖ₑ ^ 2 := by sorry
end GraphonMF.DenseLLN
Source
Bayraktar, Chakraborty, Wu, Graphon mean field systems, Ann. Appl. Probab. 33(5) (2023), p. 3608, §6.2, display after (6.13)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me