Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.17), p. 3609 — T̃ⁿ,¹_s ≤ 2κ maxᵢ E|Xⁿ_i(s) − X_{i/n}(s)|²

Proved
GraphonMF.DenseRate.eq_6_17

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

graphonlipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1propagation-of-chaos

In the setting of Theorem 3.2 of Bayraktar–Chakraborty–Wu (graphon GGG, Condition 2.1, Condition 3.2, a solution XXX of (2.1) and solutions XnX^nXn of (3.1)), let

T~sn,1=E∣1n∑j=1nξijn(b(Xin(s),Xjn(s))−b(Xi/n(s),Xj/n(s)))∣2\tilde T^{n,1}_s=\mathbb E\Big|\frac1n\sum_{j=1}^n\xi^n_{ij}\big(b(X^n_i(s),X^n_j(s))-b(X_{i/n}(s),X_{j/n}(s))\big)\Big|^2T~sn,1​=E​n1​j=1∑n​ξijn​(b(Xin​(s),Xjn​(s))−b(Xi/n​(s),Xj/n​(s)))​2

be the first term of the decomposition (6.16) for particle iii at time sss.

There is a constant κ∈(0,∞)\kappa\in(0,\infty)κ∈(0,∞), independent of nnn, iii and sss, such that for every nnn, every i∈{1,…,n}i\in\{1,\dots,n\}i∈{1,…,n} and every s∈[0,T]s\in[0,T]s∈[0,T],

T~sn,1≤2κmax⁡i′=1,…,nE∣Xi′n(s)−Xi′/n(s)∣2.\tilde T^{n,1}_s\le2\kappa\max_{i'=1,\dots,n}\mathbb E|X^n_{i'}(s)-X_{i'/n}(s)|^2.T~sn,1​≤2κi′=1,…,nmax​E∣Xi′n​(s)−Xi′/n​(s)∣2.

This is the term that feeds back into Gronwall's inequality: it controls the effect of replacing the nnn-particle states by the continuum states inside the interaction.

Formalization Note. The maximum over particles is a supremum over Fin n; only the final inequality of (6.17) is stated, with the constant written 2κ2\kappa2κ as printed.

Preamble
import Mathlib
import Definitions.Def_GraphonMF_DenseRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology unitInterval
open scoped ENNReal NNReal
Formal statement
namespace GraphonMF.DenseRate

theorem eq_6_17 {Ω : Type*} [MeasurableSpace Ω] {d : ℕ} (T : ℝ≥0) (hT : 0 < T)
    (P : Measure Ω) (μ0 : I → Measure (Fin d → ℝ)) (X0 : I → Ω → (Fin d → ℝ))
    (B : I → ℝ≥0 → Ω → Fin d → ℝ) (hN : NoiseSetting P μ0 X0 B)
    (ξ : (n : ℕ) → Ω → Fin n → Fin n → ℝ)
    (b : (Fin d → ℝ) → (Fin d → ℝ) → (Fin d → ℝ))
    (sigma : (Fin d → ℝ) → (Fin d → ℝ) → Matrix (Fin d) (Fin d) ℝ)
    (ε : ℝ) (hε : 0 < ε) (h21 : Cond21 ε μ0 b sigma)
    (G : I → I → ℝ) (hG : IsGraphon G)
    (h32 : Cond32 P X0 B ξ G)
    (X : I → ℝ≥0 → Ω → (Fin d → ℝ)) (hX : IsGraphonSolution T P X0 B G b sigma X) :
    ∃ κ : ℝ, 0 < κ ∧ ∀ (n : ℕ) (Xn : Fin n → ℝ≥0 → Ω → (Fin d → ℝ)),
      IsParticleSolution T P X0 B ξ b sigma n Xn → ∀ (i : Fin n) (s : ℝ≥0), s ≤ T →
      Tt1 P ξ b X n Xn i s ≤
        ENNReal.ofReal (2 * κ) * ⨆ i' : Fin n, ∫⁻ ω, ‖Xn i' s ω - X (lab n i') s ω‖ₑ ^ 2 ∂P := by sorry

end GraphonMF.DenseRate
Source
Bayraktar, Chakraborty, Wu, Graphon mean field systems, Ann. Appl. Probab. 33(5) (2023), https://doi.org/10.1214/22-AAP1901, p. 3609, §6.3, (6.17)
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