Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (2.28) — selected-gradient deterministic inequality

Proved
GhadimiLan.TwoPhase.eq_2_28

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

inequalitiesnonconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let asa_sas​ be the true gradients at S≥1S\ge1S≥1 candidates, and bsb_sbs​ their estimated gradients. Choose any s∗s^*s∗ minimizing ∥bs∥\|b_s\|∥bs​∥. Then

∥as∗∥2≤4min⁡s∥as∥2+4max⁡s∥bs−as∥2+2∥as∗−bs∗∥2.\|a_{s^*}\|^2\le4\min_s\|a_s\|^2+4\max_s\|b_s-a_s\|^2+2\|a_{s^*}-b_{s^*}\|^2.∥as∗​∥2≤4smin​∥as​∥2+4smax​∥bs​−as​∥2+2∥as∗​−bs∗​∥2.

This deterministic relation connects the selected candidate to the best true gradient and to estimation errors.

Formalization Note The finite minimum and maximum are taken over the nonempty candidate set Fin S; the vectors abstract the paper's ∇f(xˉs)\nabla f(\bar x_s)∇f(xˉs​) and g^s\widehat g_sg​s​.

Preamble
import Mathlib
import Definitions.Def_GhadimiLan_TwoPhase_Model
open MeasureTheory ProbabilityTheory
Formal statement
namespace GhadimiLan.TwoPhase

/-- Equation (2.28), p. 12, abstracted from candidate gradients and estimates. -/
theorem eq_2_28 {n S : ℕ} (hS : 0 < S)
    (a b : Fin S → GhadimiLan.RSG.E n) (sStar : Fin S)
    (hmin : ∀ s, ‖b sStar‖ ≤ ‖b s‖) :
    ‖a sStar‖ ^ 2 ≤
      4 * (Finset.univ : Finset (Fin S)).inf'
        (by exact ⟨⟨0, hS⟩, Finset.mem_univ _⟩) (fun s => ‖a s‖ ^ 2) +
      4 * (Finset.univ : Finset (Fin S)).sup'
        (by exact ⟨⟨0, hS⟩, Finset.mem_univ _⟩) (fun s => ‖b s - a s‖ ^ 2) +
      2 * ‖a sStar - b sStar‖ ^ 2 := by sorry

end GhadimiLan.TwoPhase
Source
Ghadimi & Lan, arXiv:1309.5549v1, Eq. (2.28), proof of Theorem 2.4(a), p. 12
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