Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2.1, p. 3590 — cut-norm convergence of graphons implies operator-norm convergence

Proved
GraphonMF.DenseLLN.remark_2_1

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

cut-normgraphonp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG and GnG_nGn​, n∈Nn\in\mathbb Nn∈N, be graphons on I=[0,1]I=[0,1]I=[0,1], and write ∥W∥□\|W\|_\square∥W∥□​ for the cut norm and ∥W∥=∥W∥∞→1\|W\|=\|W\|_{\infty\to1}∥W∥=∥W∥∞→1​ for the operator norm of a kernel viewed as an operator L∞(I)→L1(I)L^\infty(I)\to L^1(I)L∞(I)→L1(I). If ∥Gn−G∥□→0\|G_n-G\|_\square\to0∥Gn​−G∥□​→0, then

∥Gn−G∥=sup⁡∥g∥∞≤1∫I∣∫I(Gn−G)(u,v) g(v) dv∣ du  ⟶  0.\|G_n-G\|=\sup_{\|g\|_\infty\le 1}\int_I\Big|\int_I (G_n-G)(u,v)\,g(v)\,dv\Big|\,du\;\longrightarrow\;0 .∥Gn​−G∥=∥g∥∞​≤1sup​∫I​​∫I​(Gn​−G)(u,v)g(v)dv​du⟶0.

The paper cites this from Lovász, Large Networks and Graph Limits, Lemma 8.11. It turns the cut-metric convergence of Condition 3.1(c) into the operator-norm convergence that Lemma 6.1 uses.

Formalization Note The supremum defining ∥⋅∥∞→1\|\cdot\|_{\infty\to1}∥⋅∥∞→1​ runs over measurable ggg with ∣g∣≤1|g|\le1∣g∣≤1 everywhere. The page states only the implication, so no constant (such as Lovász's factor 4) is stated.

Preamble
import Mathlib
import Definitions.Def_GraphonMF_DenseLLN_Setting

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace GraphonMF.DenseLLN
theorem remark_2_1 (G : GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ) (Gs : ℕ → GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ) (hG : GraphonMF.Stability.IsGraphon G)
    (hGs : ∀ n, GraphonMF.Stability.IsGraphon (Gs n))
    (hcut : Tendsto (fun n => GraphonMF.Stability.cutNorm (fun u v => Gs n u v - G u v)) atTop (𝓝 0)) :
    Tendsto (fun n => GraphonMF.Stability.opNorm (fun u v => Gs n u v - G u v)) atTop (𝓝 0) := by sorry
end GraphonMF.DenseLLN
Source
Bayraktar, Chakraborty, Wu, Graphon mean field systems, Ann. Appl. Probab. 33(5) (2023), p. 3590, Remark 2.1
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