Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 10 — mean estimate equals mean decision

Proved
AggGameNet.Gossip.lemma_2

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

aggregate-trackingconsensusgossipp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let vi0=xi0v_i^0=x_i^0vi0​=xi0​ and update each estimate by vik+1=v^ik+xik+1−xikv_i^{k+1}=\hat v_i^k+x_i^{k+1}-x_i^kvik+1​=v^ik​+xik+1​−xik​, where v^k\hat v^kv^k is obtained by the pairwise gossip matrix. For every realization and every k≥0k\ge0k≥0,

yk:=1N∑ivik=1N∑ixik.y^k:=\frac1N\sum_i v_i^k=\frac1N\sum_i x_i^k.yk:=N1​i∑​vik​=N1​i∑​xik​.

This identity keeps the tracked average equal to the actual average throughout the gossip run.

Formalization Note The source assumes that every matrix has unit column sums. The displayed gossip matrix has that property directly, so the theorem specializes the lemma to this mission's matrices. Only the estimate recursion is assumed; no projected-gradient condition is needed.

Preamble
import Mathlib
import Definitions.Def_AggGameNet_Gossip_Setting

open MeasureTheory Filter Finset
open scoped BigOperators
Formal statement
namespace AggGameNet.Gossip

theorem lemma_2 {N n : ℕ} (hN : 0 < N) {Ω : Type*}
    (I J : ℕ → Ω → Fin N)
    (x v : ℕ → Ω → Fin N → AggGameNet.Sync.E n)
    (h0 : ∀ ω, v 0 ω = x 0 ω)
    (hrec : ∀ ω k i,
      v (k + 1) ω i = vhat I J v k ω i + x (k + 1) ω i - x k ω i) :
    ∀ ω k, yavg v k ω = (1 / (N : ℝ)) • ∑ i, x k ω i := by sorry

end AggGameNet.Gossip
Source
Koshal, Nedić, Shanbhag, Distributed Algorithms for Aggregative Games on Graphs, arXiv:1605.00267v2, Lemma 2, p. 10; gossip matrix (26), p. 16
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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