Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2.1 — cut convergence implies operator-norm convergence

Proved
GraphonMF.SparseLLN.remark_2_1

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

cut-metricgraphonoperator-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GnG_nGn​ and GGG be graphons on I=[0,1]I=[0,1]I=[0,1]. Write ∥W∥□\|W\|_\square∥W∥□​ for the supremum of the absolute integral of WWW over measurable rectangles and ∥W∥∞→1\|W\|_{\infty\to1}∥W∥∞→1​ for its norm as an operator from L∞(I)L^\infty(I)L∞(I) to L1(I)L^1(I)L1(I). Then

∥Gn−G∥□⟶0⟹∥Gn−G∥∞→1⟶0.\|G_n-G\|_\square\longrightarrow0\quad\Longrightarrow\quad\|G_n-G\|_{\infty\to1}\longrightarrow0.∥Gn​−G∥□​⟶0⟹∥Gn​−G∥∞→1​⟶0.

This converts graph-sequence convergence into the operator estimate used by the coupling argument.

Formalization Note The suprema range over measurable sets and measurable test functions bounded by one. The graphon hypotheses ensure these real suprema are bounded.

Preamble
import Definitions.Def_GraphonMF_SparseLLN_Setting

open Filter Topology
set_option autoImplicit false
Formal statement
namespace GraphonMF.SparseLLN

/-- Remark 2.1, p. 3590: cut convergence implies L∞→L¹ operator-norm convergence. -/
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 => 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.SparseLLN
Source
Bayraktar, Chakraborty, Wu, Graphon mean field systems, Ann. Appl. Probab. 33(5) (2023), p. 3590, Remark 2.1; https://doi.org/10.1214/22-AAP1901
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