Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.5), p. 10 — summed EXTRA: x^{k+1} = W̃x^k − Σ_{t≤k}(W̃ − W)x^t − α∇f(x^k)

Proved
ExtraConsensus.Sublinear.eq_3_5

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

decentralized-optimizationextragradient-methodp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let xk\mathbf x^kxk be the EXTRA iterates for any step size α\alphaα, any mixing matrices W,W~W,\tilde WW,W~, any functions fif_ifi​ (∇\nabla∇ denotes the gradient) and any start x0\mathbf x^0x0. Summing the iterations 1 through k+1k+1k+1 gives, for every k≥0k\ge0k≥0,

xk+1=W~xk−∑t=0k(W~−W)xt−α∇f(xk).\mathbf x^{k+1}=\tilde W\mathbf x^k-\sum_{t=0}^{k}(\tilde W-W)\mathbf x^t-\alpha\nabla\mathbf f(\mathbf x^k).xk+1=W~xk−t=0∑k​(W~−W)xt−α∇f(xk).

This rewrites the two-step recursion of EXTRA as a one-step update with a cumulative correction term, the form on which Lemma 3.2 rests.

Preamble
import Mathlib
import Definitions.Def_ExtraConsensus_Sublinear_Model
Formal statement
namespace ExtraConsensus.Sublinear

open Matrix Filter Topology Asymptotics

/-- Eq. (3.5), p. 10. Summing the EXTRA iterations: for every `k`,
`𝐱^{k+1} = W̃𝐱ᵏ − Σ_{t=0}^{k} (W̃ − W)𝐱ᵗ − α∇𝐟(𝐱ᵏ)`, where `𝐱 = extraIter α W W̃ f 𝐱⁰`. -/
theorem eq_3_5 {n p : ℕ} (W Wt : Matrix (Fin n) (Fin n) ℝ)
    (f : Fin n → EuclideanSpace ℝ (Fin p) → ℝ) (α : ℝ) (x0 : Stack n p) :
    let x := extraIter α W Wt f x0
    ∀ k : ℕ, x (k + 1) =
      mix Wt (x k) - ∑ t ∈ Finset.range (k + 1), mix (Wt - W) (x t) - α • gradF f (x k) := by sorry

end ExtraConsensus.Sublinear
Source
Shi, Ling, Wu & Yin, arXiv:1404.6264v4, §3.1, proof of Lemma 3.2, eq. (3.5), p. 10
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