Affine invariance of the Löwner–John ellipsoid
ProvedConvexOptimization.lowner_john_affine_invariantThe Löwner–John ellipsoid commutes with nonsingular affine changes of coordinates.
Let , let be invertible, let , and write for the corresponding affine bijection. If is a Löwner–John pair for , then the image set also admits a Löwner–John pair , and its ellipsoid is the affine image of the original:
(Concretely one may take and , which is again symmetric-positive-definite up to the normalization built into the predicate.)
Affine invariance is what makes the normalization step of this mission legitimate: an arbitrary configuration can be mapped so that its Löwner–John ellipsoid becomes the unit ball, where the KKT identities take their clean isotropic form, and the conclusion transported back. It also shows the rounding factor is an affine invariant of the body, not an artefact of a particular position — determinant ratios, unlike volumes, are unchanged by .
Formalization Note Nonsingularity is stated as IsUnit T.det; the image is (fun v => T.mulVec v + t) '' S. The conclusion is existential in together with the set identity, even though uniqueness makes the pair determined. Source: Boyd & Vandenberghe §8.4.3, pp. 415–416.
import Mathlib import Definitions.Def_ConvexOptimization_ellipsoidBody import Definitions.Def_ConvexOptimization_IsLownerJohn open scoped RealInnerProductSpace ENNReal open MeasureTheory
theorem ConvexOptimization.lowner_john_affine_invariant {nn : ℕ}
(T : Matrix (Fin nn) (Fin nn) ℝ) (hT : IsUnit T.det) (t : Fin nn → ℝ)
(S : Set (Fin nn → ℝ)) (A : Matrix (Fin nn) (Fin nn) ℝ) (b : Fin nn → ℝ)
(h : IsLownerJohn A b S) :
∃ (A' : Matrix (Fin nn) (Fin nn) ℝ) (b' : Fin nn → ℝ),
IsLownerJohn A' b' ((fun v => T.mulVec v + t) '' S) ∧
ellipsoidBody A' b' = (fun v => T.mulVec v + t) '' ellipsoidBody A b := by
sorry