§5.1, p. 18 — Σ = 𝒵_{n+m}(N): (A, B) is compatible with the data iff [A B]ᵀ solves the QMI defined by N of (5.2)
ProvedQuadMatIneq.Stabilization.sigma_eq_ZSet_Ndata-driven-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-matrix-inequality
Let , let and be data, and let be the matrix (5.2),
Then for all , ,
This identity, which the paper recalls from Section 2 and (2.5), recasts the set of systems consistent with the noisy data as the solution set of a single quadratic matrix inequality in .
Formalization Note is Matrix.fromRows Aᵀ Bᵀ; , and are Sigma, Nmat and ZSet of the definitions items.
Preamble
import Mathlib import Definitions.Def_QuadMatIneq_Stabilization_QMI import Definitions.Def_QuadMatIneq_Stabilization_Data open Matrix Filter Topology
Formal statement
namespace QuadMatIneq.Stabilization
/-- §5.1, p. 18: "Σ = 𝒵_{n+m}(N)", with `[A B]ᵀ ∈ ℝ^{(n+m)×n}` written `fromRows Aᵀ Bᵀ`. -/
theorem sigma_eq_ZSet_N {n m T : ℕ}
(Φ : Matrix (Fin n ⊕ Fin T) (Fin n ⊕ Fin T) ℝ) (X : Matrix (Fin n) (Fin (T + 1)) ℝ)
(Um : Matrix (Fin m) (Fin T) ℝ) (A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ) :
(A, B) ∈ Sigma Φ X Um ↔ Matrix.fromRows Aᵀ Bᵀ ∈ ZSet (Nmat Φ X Um) := by sorry
end QuadMatIneq.Stabilization
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §5.1, p. 18, sentence after (5.2) ("Recall from Section 2 and (2.5) that Σ = 𝒵_{n+m}(N)")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.