Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.16, p. 17 — {FG:F⊤F⩽Fˉ}={SFˉ1/2G:S⊤S⩽I}={H:H⊤H⩽G⊤FˉG}\{FG: F^\top F\leqslant\bar F\}=\{S\bar F^{1/2}G: S^\top S\leqslant I\}=\{H: H^\top H\leqslant G^\top\bar FG\}{FG:F⊤F⩽Fˉ}={SFˉ1/2G:S⊤S⩽I}={H:H⊤H⩽G⊤FˉG}

Proved
QuadMatIneq.Petersen.set_identity

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

norm-bounded-uncertaintyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petersen-lemmaquadratic-matrix-inequality

Let Fˉ∈Rq×q\bar F\in\mathbb R^{q\times q}Fˉ∈Rq×q with Fˉ⩾0\bar F\geqslant0Fˉ⩾0, let Fˉ1/2\bar F^{1/2}Fˉ1/2 be its positive semidefinite square root, and let G∈Rq×nG\in\mathbb R^{q\times n}G∈Rq×n. Then

{FG∈Rp×n∣F∈Rp×q, F⊤F⩽Fˉ}={SFˉ1/2G∈Rp×n∣S∈Rp×q, S⊤S⩽I}\{FG\in\mathbb R^{p\times n}\mid F\in\mathbb R^{p\times q},\ F^\top F\leqslant\bar F\}=\{S\bar F^{1/2}G\in\mathbb R^{p\times n}\mid S\in\mathbb R^{p\times q},\ S^\top S\leqslant I\}{FG∈Rp×n∣F∈Rp×q, F⊤F⩽Fˉ}={SFˉ1/2G∈Rp×n∣S∈Rp×q, S⊤S⩽I}

and this set equals

{H∈Rp×n∣H⊤H⩽G⊤FˉG}.\{H\in\mathbb R^{p\times n}\mid H^\top H\leqslant G^\top\bar FG\}.{H∈Rp×n∣H⊤H⩽G⊤FˉG}.

This is the first step of the paper's proof of Petersen's lemma: it replaces the products FGFGFG over the norm-bounded uncertainty set by the solution set of a single quadratic matrix inequality in HHH.

Formalization Note The square root is Mathlib's CFC.sqrt for the (scoped) matrix order, which on a positive semidefinite matrix is its unique positive semidefinite square root. The sets are written as images of F↦FGF\mapsto FGF↦FG and S↦SFˉ1/2GS\mapsto S\bar F^{1/2}GS↦SFˉ1/2G.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Petersen_QMI
import Definitions.Def_QuadMatIneq_Petersen_Setup

open scoped MatrixOrder
Formal statement
namespace QuadMatIneq.Petersen
open Matrix
theorem set_identity {n p q : ℕ} (Fbar : Matrix (Fin q) (Fin q) ℝ) (G : Matrix (Fin q) (Fin n) ℝ)
    (hFbar : Fbar.PosSemidef) :
    (fun F : Matrix (Fin p) (Fin q) ℝ => F * G) '' uncSet Fbar =
        (fun S : Matrix (Fin p) (Fin q) ℝ => S * CFC.sqrt Fbar * G) ''
          {S | (1 - Sᵀ * S).PosSemidef} ∧
    (fun F : Matrix (Fin p) (Fin q) ℝ => F * G) '' uncSet Fbar =
        {H : Matrix (Fin p) (Fin n) ℝ | (Gᵀ * Fbar * G - Hᵀ * H).PosSemidef} := by sorry
end QuadMatIneq.Petersen
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §4.5.3, proof of Proposition 4.16, p. 17, first paragraph (the two set identities obtained from Lemma A.1)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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