Remark after Theorem 4, item 3, p. 11 — a ρ₁-hard IQC is ρ-hard for every ρ ≥ ρ₁
ProvedIQCAlg.ConvexIQC.remark_rho_monoabel-summationintegral-quadratic-constraintsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rho-hard-iqc
Let be real numbers and . If
then
With this is the first sentence of item 3 of the remarks after Theorem 4: if a -hard IQC is satisfied, then so is the -hard IQC for any . The proof of Lemma 10 uses it to pass from to .
Formalization Note The remark is stated for the scalar summand , since its content does not depend on or . The weight is written ; is required because is undefined at (in Lean ).
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.