Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2, p. 10 — (I + W − 2W̃)(x^{k+1} − x*) + W̃(x^{k+1} − x^k) = −U(q^{k+1} − q*) − α[∇f(x^k) − ∇f(x*)]

Proved
ExtraConsensus.Sublinear.lemma_3_2

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

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

Assume Assumption 1, let U=UT⪰0U=U^{\mathsf T}\succeq0U=UT⪰0 with U2=W~−WU^2=\tilde W-WU2=W~−W, let α∈R\alpha\in\mathbb Rα∈R, and let (q∗,x∗)(\mathbf q^*,\mathbf x^*)(q∗,x∗) satisfy the optimality conditions (3.1)–(3.2) of Lemma 3.1. Let xk\mathbf x^kxk be the EXTRA iterates from any x0\mathbf x^0x0 and qk=∑t=0kUxt\mathbf q^k=\sum_{t=0}^kU\mathbf x^tqk=∑t=0k​Uxt. Then for every k=0,1,…k=0,1,\dotsk=0,1,…

(I+W−2W~)(xk+1−x∗)+W~(xk+1−xk)=−U(qk+1−q∗)−α[∇f(xk)−∇f(x∗)].(3.4)(I+W-2\tilde W)(\mathbf x^{k+1}-\mathbf x^*)+\tilde W(\mathbf x^{k+1}-\mathbf x^k)=-U(\mathbf q^{k+1}-\mathbf q^*)-\alpha\big[\nabla\mathbf f(\mathbf x^k)-\nabla\mathbf f(\mathbf x^*)\big].\tag{3.4}(I+W−2W~)(xk+1−x∗)+W~(xk+1−xk)=−U(qk+1−q∗)−α[∇f(xk)−∇f(x∗)].(3.4)

Every convergence estimate of the paper starts from this recursion relating the iterates to an optimal pair.

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

open Matrix Filter Topology Asymptotics

/-- Lemma 3.2, p. 10. Under Assumption 1, with `U` the symmetric positive semidefinite square root
of `W̃ − W`, let `(𝐪*, 𝐱*)` satisfy the optimality conditions (3.1)–(3.2). Then for every `k ≥ 0`
the EXTRA iterates `𝐱ᵏ` and `𝐪ᵏ = Σ_{t≤k} U𝐱ᵗ` obey (3.4):
`(I + W − 2W̃)(𝐱^{k+1} − 𝐱*) + W̃(𝐱^{k+1} − 𝐱ᵏ) = −U(𝐪^{k+1} − 𝐪*) − α[∇𝐟(𝐱ᵏ) − ∇𝐟(𝐱*)]`. -/
theorem lemma_3_2 {n p : ℕ} (Gr : SimpleGraph (Fin n))
    (W Wt U : Matrix (Fin n) (Fin n) ℝ) (f : Fin n → EuclideanSpace ℝ (Fin p) → ℝ) (α : ℝ)
    (hA1 : MixingAssumption Gr W Wt)
    (hUs : Uᵀ = U) (hUpsd : U.PosSemidef) (hU2 : U * U = Wt - W)
    (x0 : Stack n p) (qs xs : Stack n p) (hopt : IsOptimalPair U α f qs xs) :
    let x := extraIter α W Wt f x0
    let q := qSeq U x
    ∀ k : ℕ,
      mix (1 + W - (2 : ℝ) • Wt) (x (k + 1) - xs) + mix Wt (x (k + 1) - x k) =
        -(mix U (q (k + 1) - qs)) - α • (gradF f (x k) - gradF f xs) := by sorry

end ExtraConsensus.Sublinear
Source
Shi, Ling, Wu & Yin, arXiv:1404.6264v4, Lemma 3.2, eq. (3.4), 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