Theorem 7.1.3 — Real mixed-block Matrix Cube Theorem
ProvedRobustOpt2009.SDPApproximation.theorem_7_1_3Let be real symmetric matrices, where , and let , for , with positive block dimensions. For , let require
for every , . Let ask for symmetric dominating respectively and every unit-radius full-block perturbation, with .
There is a universal nondecreasing function such that , , and for integers . For all the data above:
When , these conditions are equivalent. Whenever bounds every scalar matrix rank,
This is the mixed scalar/full-block result; the existing Open scalar-only Matrix Cube Theorem is not re-posed.
Formalization Note The universal function is chosen before all dimensions and data. The scalar and full block counts may separately be zero. The full-block factors may vanish in this theorem. The finite certificate (9.1.3) is not substituted for the independently defined predicate .
import Mathlib open Matrix open scoped Matrix.Norms.L2Operator
namespace RobustOpt2009.SDPApproximation
/-- Theorem 7.1.3: one universal nondecreasing function, with the two
predicates expanded independently inside the statement. -/
theorem theorem_7_1_3 :
∃ θ : ℕ → ℝ, 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
(b → a ρ) ∧ (s + f = 1 → (b ↔ a ρ)) ∧
(∀ μ : ℕ, 2 ≤ μ → (∀ i, (B i).rank ≤ μ) → ¬ b → ¬ a (θ μ * ρ)) := by sorry
end RobustOpt2009.SDPApproximation
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The statement asserts that there is a single function , chosen before any data, with the following properties.
Properties of .
- is nondecreasing.
- and .
- for every integer .
The data. The remaining claims hold for every choice of:
- natural numbers , and ;
- positive integers for ;
- a symmetric real matrix and symmetric real matrices ;
- real matrices and real matrices ;
- a real number .
The notation is as follows. means is symmetric and for all real . The norm of a matrix is its spectral (Euclidean operator) norm.
Predicate . For a real number , says the following. For every and every family of real matrices with for all and for all ,
Proposition . This proposition is evaluated at the given . It says there exist symmetric real matrices and such that:
- and for every ;
- for every and every real matrix with , we have ;
- .
Conclusions. The theorem asserts all three of the following.
-
.
-
If , then .
-
For every integer : if for all and fails, then fails.
The rank hypothesis concerns only the scalar matrices . Nothing is assumed about the ranks of or . The negated predicate is evaluated at the scaled radius , while uses .
Degenerate cases.
- Values of . and are constrained only by monotonicity: . Also . For , monotonicity gives , so the radius is nonnegative.
- . Clause 2 is vacuous, and the rank hypothesis in clause 3 is empty. Both and reduce to .
- . and only test and , so both reduce to . In , the final condition reduces to . The remaining conditions on and are then separate existence requirements.
- Zero factors. and may be zero. The hypothesis rules out empty matrices.
- . Clause 2 gives nothing.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.