§6.2, p. 3608 — every graphon is approximated in ‖·‖_{∞→1} by continuous graphons (Lusin)
ProvedGraphonMF.DenseLLN.lusin_approxapproximationgraphonp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a graphon on and . Then there is a continuous graphon , that is a continuous symmetric function , such that
where is the operator norm of Remark 2.1.
The proof of (3.3) uses this approximation to reduce to graphons that satisfy Condition 2.2(b).
Preamble
import Mathlib import Definitions.Def_GraphonMF_DenseLLN_Setting open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
Formal statement
namespace GraphonMF.DenseLLN
theorem lusin_approx (G : GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ) (hG : GraphonMF.Stability.IsGraphon G) (η : ℝ) (hη : 0 < η) (hη1 : η < 1) :
∃ G' : GraphonMF.Stability.I → GraphonMF.Stability.I → ℝ, GraphonMF.Stability.IsGraphon G' ∧ Continuous (Function.uncurry G') ∧
GraphonMF.Stability.opNorm (fun u v => G' u v - G u v) < η := 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 "Fix η ∈ (0,1)"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.