Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 22 — ‖Δ‖_∞ ≤ 1 − d

Proved
DirectedOpinion.Typical.delta_norm_le

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

contractionopinion-dynamicsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a vertex-weighted directed graph whose weights c(i,r)c(i,r)c(i,r) lie in [0,1][0,1][0,1] and sum to ccc at every vertex with di−>0d_i^->0di−​>0, where c∈[0,1)c\in[0,1)c∈[0,1), d∈(0,1]d\in(0,1]d∈(0,1] and c+d≤1c+d\le1c+d≤1. Let Δ\DeltaΔ be the operator (10), Δf(i)=∑r=1di−c(i,r)f(ℓ(i,r))+(1−c−d)f(i)\Delta f(i)=\sum_{r=1}^{d_i^-}c(i,r)f(\ell(i,r))+(1-c-d)f(i)Δf(i)=∑r=1di−​​c(i,r)f(ℓ(i,r))+(1−c−d)f(i). If ∣f(v)∣≤M|f(v)|\le M∣f(v)∣≤M for every vertex vvv, then for every vertex iii

∣Δf(i)∣≤∑r=1di−c(i,r)M+(1−c−d)M≤(1−d)M.|\Delta f(i)|\le\sum_{r=1}^{d_i^-}c(i,r)M+(1-c-d)M\le(1-d)M .∣Δf(i)∣≤r=1∑di−​​c(i,r)M+(1−c−d)M≤(1−d)M.

Taking M=sup⁡v∣f(v)∣M=\sup_v|f(v)|M=supv​∣f(v)∣ gives ∥Δ∥∞≤1−d<1\|\Delta\|_\infty\le1-d<1∥Δ∥∞​≤1−d<1: the operator is a contraction of L∞(V)L^\infty(V)L∞(V), which drives both the stationarity of Theorem 1 and the error propagation in Theorem 2.

Formalization Note The page writes ∥f∥∞=sup⁡vf(v)\|f\|_\infty=\sup_vf(v)∥f∥∞​=supv​f(v); the absolute value is meant. The bound is stated for every bound MMM on ∣f∣|f|∣f∣ instead of through an operator norm on L∞(V)L^\infty(V)L∞(V).

Preamble
import Mathlib
import Definitions.Def_DirectedOpinion_Typical_Model
Formal statement
namespace DirectedOpinion.Typical

/-- Proof of Theorem 1, p. 22: `|Δf(i)| ≤ Σ_r c(i, r)‖f‖_∞ + (1 − c − d)‖f‖_∞ ≤ (1 − d)‖f‖_∞` for
every vertex `i`, i.e. `‖Δ‖_∞ ≤ 1 − d`, stated for any bound `M` on `|f|`. -/
theorem delta_norm_le {V : Type*} (G : WDigraph V) (c d : ℝ) (hc0 : 0 ≤ c) (hc1 : c < 1)
    (hd0 : 0 < d) (hd1 : d ≤ 1) (hcd : c + d ≤ 1) (hG : G.Valid c) (f : V → ℝ) (M : ℝ)
    (hf : ∀ v, |f v| ≤ M) (i : V) :
    |Δ G c d f i| ≤ (1 - d) * M := by sorry

end DirectedOpinion.Typical
Source
Fraiman, Lin and Olvera-Cravioto, Opinion dynamics on directed complex networks, arXiv:2209.00969v2, p. 22, proof of Theorem 1, display after the definition of ‖Δ‖_∞
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 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