Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1.3 (ii) — rank-sensitive tightness of the real mixed-block Matrix Cube certificate

Proved
RobustOpt2009.SDPApproximation.theorem_7_1_3_ii

by tianyipeng · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-cuberobust-optimizationsemidefinite-programming

This is part (ii) of the real mixed-block Matrix Cube Theorem (Theorem 7.1.3): the rank-sensitive tightness of the semidefinite certificate B(ρ)\mathcal B(\rho)B(ρ).

Let B0,B1,…,BsB_0,B_1,\ldots,B_sB0​,B1​,…,Bs​ be real symmetric m×mm\times mm×m matrices (m>0m>0m>0), and let Lj∈Rpj×mL_j\in\mathbb R^{p_j\times m}Lj​∈Rpj​×m, Rj∈Rqj×mR_j\in\mathbb R^{q_j\times m}Rj​∈Rqj​×m, j=1,…,fj=1,\ldots,fj=1,…,f, with pj,qj>0p_j,q_j>0pj​,qj​>0. For r∈Rr\in\mathbb Rr∈R let A(r)\mathcal A(r)A(r) be the robust condition

B0+∑i=1sziBi+∑j=1f(LjTZjRj+RjTZjTLj)⪰0for all ∣zi∣≤r, ∥Zj∥2,2≤r,B_0+\sum_{i=1}^s z_iB_i+\sum_{j=1}^f\bigl(L_j^TZ_jR_j+R_j^TZ_j^TL_j\bigr)\succeq0\qquad\text{for all }|z_i|\le r,\ \|Z_j\|_{2,2}\le r,B0​+i=1∑s​zi​Bi​+j=1∑f​(LjT​Zj​Rj​+RjT​ZjT​Lj​)⪰0for all ∣zi​∣≤r, ∥Zj​∥2,2​≤r,

and, for a fixed ρ≥0\rho\ge0ρ≥0, let B(ρ)\mathcal B(\rho)B(ρ) ask for symmetric matrices Ui,VjU_i,V_jUi​,Vj​ with

Ui⪰±Bi,Vj⪰LjTZRj+RjTZTLj  ∀ ∥Z∥2,2≤1,B0−ρ∑iUi−ρ∑jVj⪰0.U_i\succeq\pm B_i,\qquad V_j\succeq L_j^TZR_j+R_j^TZ^TL_j\ \ \forall\,\|Z\|_{2,2}\le1,\qquad B_0-\rho\sum_iU_i-\rho\sum_jV_j\succeq0 .Ui​⪰±Bi​,Vj​⪰LjT​ZRj​+RjT​ZTLj​  ∀∥Z∥2,2​≤1,B0​−ρi∑​Ui​−ρj∑​Vj​⪰0.

Claim. There is one universal nondecreasing function ϑ:N→R\vartheta:\mathbb N\to\mathbb Rϑ:N→R with

ϑ(2)=π2,ϑ(4)=2,ϑ(μ)≤πμ/2  (μ≥2),\vartheta(2)=\frac\pi2,\qquad\vartheta(4)=2,\qquad\vartheta(\mu)\le\pi\sqrt{\mu/2}\ \ (\mu\ge2),ϑ(2)=2π​,ϑ(4)=2,ϑ(μ)≤πμ/2​  (μ≥2),

such that for all data as above and every integer μ≥2\mu\ge2μ≥2 with rank⁡Bi≤μ\operatorname{rank}B_i\le\murankBi​≤μ for all iii:

¬ B(ρ) ⟹ ¬ A(ϑ(μ)ρ).\neg\,\mathcal B(\rho)\ \Longrightarrow\ \neg\,\mathcal A(\vartheta(\mu)\rho).¬B(ρ) ⟹ ¬A(ϑ(μ)ρ).

Part (i) of Theorem 7.1.3 (sufficiency B(ρ)⇒A(ρ)\mathcal B(\rho)\Rightarrow\mathcal A(\rho)B(ρ)⇒A(ρ), and exactness for a single perturbation block) is elementary; this child isolates the hard part, whose proof in the book (Appendix B.4.6, Theorem B.4.14) goes through semidefinite duality and Gaussian randomization. The predicates are expanded verbatim as in the parent statement theorem_7_1_3; ∥⋅∥\|\cdot\|∥⋅∥ is the spectral (L2 operator) norm.

Preamble
import Mathlib

open Matrix
open scoped Matrix.Norms.L2Operator
Formal statement
namespace RobustOpt2009.SDPApproximation

/-- Theorem 7.1.3 (ii): the rank-sensitive tightness bound of the real mixed-block
Matrix Cube Theorem, with one universal nondecreasing function `θ`. -/
theorem theorem_7_1_3_ii :
    ∃ θ : ℕ → ℝ, Monotone θ ∧ θ 2 = Real.pi / 2 ∧ θ 4 = 2 ∧
      (∀ μ : ℕ, 2 ≤ μ → θ μ ≤ Real.pi * Real.sqrt ((μ : ℝ) / 2)) ∧
      ∀ (m s f : ℕ), 0 < m → ∀ (p q : Fin f → ℕ),
      (∀ j, 0 < p j) → (∀ j, 0 < q j) →
      ∀ (B₀ : Matrix (Fin m) (Fin m) ℝ) (B : Fin s → Matrix (Fin m) (Fin m) ℝ)
        (L : (j : Fin f) → Matrix (Fin (p j)) (Fin m) ℝ)
        (R : (j : Fin f) → Matrix (Fin (q j)) (Fin m) ℝ),
      B₀.IsHermitian → (∀ i, (B i).IsHermitian) → ∀ ρ : ℝ, 0 ≤ ρ →
      let a : ℝ → Prop := fun r =>
        ∀ (z : Fin s → ℝ) (Z : (j : Fin f) → Matrix (Fin (p j)) (Fin (q j)) ℝ),
          (∀ i, |z i| ≤ r) → (∀ j, ‖Z j‖ ≤ r) →
          (B₀ + (∑ i, z i • B i) +
            ∑ j, ((L j)ᵀ * Z j * R j + (R j)ᵀ * (Z j)ᵀ * L j)).PosSemidef
      let b : Prop :=
        ∃ (U : Fin s → Matrix (Fin m) (Fin m) ℝ)
          (V : Fin f → Matrix (Fin m) (Fin m) ℝ),
          (∀ i, (U i).IsHermitian) ∧ (∀ j, (V j).IsHermitian) ∧
          (∀ i, (U i - B i).PosSemidef ∧ (U i + B i).PosSemidef) ∧
          (∀ j, ∀ Z : Matrix (Fin (p j)) (Fin (q j)) ℝ, ‖Z‖ ≤ 1 →
            (V j - ((L j)ᵀ * Z * R j + (R j)ᵀ * Zᵀ * L j)).PosSemidef) ∧
          (B₀ - ρ • (∑ i, U i) - ρ • (∑ j, V j)).PosSemidef
      ∀ μ : ℕ, 2 ≤ μ → (∀ i, (B i).rank ≤ μ) → ¬ b → ¬ a (θ μ * ρ) := by sorry

end RobustOpt2009.SDPApproximation
Source
Ben-Tal, El Ghaoui and Nemirovski, Robust Optimization, Princeton University Press, 2009, https://doi.org/10.1515/9781400831050, Theorem 7.1.3 (ii), printed p. 183 (PDF p. 209); cf. Theorem B.4.14 (iii), printed p. 507

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