Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 14, p. 23 — first arrow q → z: ‖z‖^{λ,K}_F ≤ L(1 + 1/λ)‖q‖^{λ,K}_F

Proved
DIGing.Push.lemma_14

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

distributed-optimizationlipschitz-gradientp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1small-gain

Let each fif_ifi​ satisfy Assumption 4, and let L=max⁡iLiL=\max_iL_iL=maxi​Li​. Let x(0),x(1),…\mathbf x(0),\mathbf x(1),\dotsx(0),x(1),… be any sequence in Rn×p\mathbb R^{n\times p}Rn×p and x∗∈Rpx^*\in\mathbb R^px∗∈Rp any point. Put q(k)=x(k)−1(x∗)⊤\mathbf q(k)=\mathbf x(k)-\mathbf 1(x^*)^\topq(k)=x(k)−1(x∗)⊤, z(k)=∇f(x(k))−∇f(x(k−1))\mathbf z(k)=\nabla\mathbf f(\mathbf x(k))-\nabla\mathbf f(\mathbf x(k-1))z(k)=∇f(x(k))−∇f(x(k−1)) for k≥1k\ge1k≥1 and z(0)=0\mathbf z(0)=0z(0)=0. Then for every K=0,1,…K=0,1,\dotsK=0,1,… and every λ∈(0,1)\lambda\in(0,1)λ∈(0,1),

∥z∥Fλ,K≤L(1+1λ)∥q∥Fλ,K.\|\mathbf z\|_F^{\lambda,K}\le L\Big(1+\frac1\lambda\Big)\|\mathbf q\|_F^{\lambda,K}.∥z∥Fλ,K​≤L(1+λ1​)∥q∥Fλ,K​.

This is the first gain γ1=L(1+1/λ)\gamma_1=L(1+1/\lambda)γ1​=L(1+1/λ) of the small gain cycle q→z→hˇ→xˇ→q\mathbf q\to\mathbf z\to\check{\mathbf h}\to\check{\mathbf x}\to\mathbf qq→z→hˇ→xˇ→q; the paper restates Lemma 5 for Push-DIGing.

Formalization Note Only Assumption 4 is used, so the sequence is arbitrary (not necessarily a run of the algorithm) and x∗x^*x∗ is any point.

Preamble
import Mathlib
import Definitions.Def_DIGing_Undir_Common
import Definitions.Def_DIGing_Push_Setting
Formal statement
namespace DIGing.Push

theorem lemma_14 {n p : ℕ} (f : Fin n → EuclideanSpace ℝ (Fin p) → ℝ) (Lc : Fin n → ℝ)
    (h4 : DIGing.Undir.Assumption4 f Lc) (x : ℕ → DIGing.Undir.Stack n p) (xstar : EuclideanSpace ℝ (Fin p)) :
    ∀ K : ℕ, ∀ lam : ℝ, 0 < lam → lam < 1 →
      DIGing.Undir.ergK lam K (fun k => DIGing.Undir.frob (DIGing.Undir.zSeq f x k)) ≤
        DIGing.Undir.Lmax Lc * (1 + 1 / lam) * DIGing.Undir.ergK lam K (fun k => DIGing.Undir.frob (x k - DIGing.Undir.ones xstar)) := by sorry

end DIGing.Push
Source
arXiv:1607.03218v3, Lemma 14, p. 23 (restating Lemma 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