Remark 2.1, p. 3590 — cut-norm convergence of graphons implies operator-norm convergence
ProvedGraphonMF.DenseLLN.remark_2_1cut-normgraphonp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , , be graphons on , and write for the cut norm and for the operator norm of a kernel viewed as an operator . If , then
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 runs over measurable with 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.