Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark after Theorem 4, item 3, p. 11 — a ρ₁-hard IQC is ρ-hard for every ρ ≥ ρ₁

Proved
IQCAlg.ConvexIQC.remark_rho_mono

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

abel-summationintegral-quadratic-constraintsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rho-hard-iqc

Let (wt)t≥0(w_t)_{t\ge0}(wt​)t≥0​ be real numbers and 0<ρ1≤ρ0<\rho_1\le\rho0<ρ1​≤ρ. If

∑t=0kρ1−2t wt ≥ 0for all k≥0,\sum_{t=0}^{k}\rho_1^{-2t}\,w_t\ \ge\ 0\qquad\text{for all }k\ge0,t=0∑k​ρ1−2t​wt​ ≥ 0for all k≥0,

then

∑t=0kρ−2t wt ≥ 0for all k≥0.\sum_{t=0}^{k}\rho^{-2t}\,w_t\ \ge\ 0\qquad\text{for all }k\ge0 .t=0∑k​ρ−2twt​ ≥ 0for all k≥0.

With wt=(zt−z⋆)TM(zt−z⋆)w_t=(z_t-z_\star)^{\mathsf T}M(z_t-z_\star)wt​=(zt​−z⋆​)TM(zt​−z⋆​) this is the first sentence of item 3 of the remarks after Theorem 4: if a ρ1\rho_1ρ1​-hard IQC is satisfied, then so is the ρ\rhoρ-hard IQC for any ρ≥ρ1\rho\ge\rho_1ρ≥ρ1​. The proof of Lemma 10 uses it to pass from ρˉ\bar\rhoρˉ​ to ρ\rhoρ.

Formalization Note The remark is stated for the scalar summand wtw_twt​, since its content does not depend on Ψ\PsiΨ or MMM. The weight ρ−2t\rho^{-2t}ρ−2t is written (ρ2t)−1(\rho^{2t})^{-1}(ρ2t)−1; ρ1>0\rho_1>0ρ1​>0 is required because ρ1−2t\rho_1^{-2t}ρ1−2t​ is undefined at ρ1=0\rho_1=0ρ1​=0 (in Lean 0−1=00^{-1}=00−1=0).

Preamble
import Mathlib
import Definitions.Def_IQCAlg_ConvexIQC_Setting

open scoped InnerProductSpace
Formal statement
namespace IQCAlg.ConvexIQC

/-- Remark after Theorem 4, item 3, first sentence, p. 11: a `ρ₁`-hard IQC is `ρ`-hard for
every `ρ ≥ ρ₁`, stated for the scalar summand `w t = (z_t − z⋆)ᵀM(z_t − z⋆)`. -/
theorem remark_rho_mono (w : ℕ → ℝ) (ρ₁ ρ : ℝ) (hρ₁ : 0 < ρ₁) (hρ : ρ₁ ≤ ρ)
    (hw : ∀ k : ℕ, 0 ≤ ∑ t ∈ Finset.range (k + 1), (ρ₁ ^ (2 * t))⁻¹ * w t) :
    ∀ k : ℕ, 0 ≤ ∑ t ∈ Finset.range (k + 1), (ρ ^ (2 * t))⁻¹ * w t := by sorry

end IQCAlg.ConvexIQC
Source
Lessard, Recht & Packard, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, arXiv:1408.3595v7, p. 11, remarks after Theorem 4 (Pointwise and hard IQCs), item 3, first sentence
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