Convexity of Positive Semidefinite Quadratics
ProvedFunctionalInequalities.Analysis.convexOn_quadraticAt_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This proves convexity of a quadratic with positive semidefinite matrix.
Let , let be a real matrix indexed by Fin n, and assume is positive semidefinite. For any and , the function quadraticAt A x₀ b c is convex on the whole space:
This is a finite-dimensional algebraic lemma for constructing convex quadratic potentials. No positivity or dimension restriction on is assumed.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem convexOn_quadraticAt {n : ℕ} {A : Matrix (Fin n) (Fin n) ℝ} (hA : A.PosSemidef)
(x₀ b : EuclideanSpace ℝ (Fin n)) (c : ℝ) : ConvexOn ℝ univ (quadraticAt A x₀ b c)
Module navigation
Module: Analysis/Convex/Alexandrov.
Previous: quadraticAt_subgradient_iff · Next: volume_subgradientImage_quadraticAt_aux.
Source excerpt, lines 1585–1586 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Alexandrov open MeasureTheory Set Matrix
Formal statement
theorem FunctionalInequalities.Analysis.convexOn_quadraticAt_readable {n : ℕ} {A : Matrix (Fin n) (Fin n) ℝ} (hA : A.PosSemidef)
(x₀ b : EuclideanSpace ℝ (Fin n)) (c : ℝ) : ConvexOn ℝ univ (quadraticAt A x₀ b c) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/Alexandrov.lean#L1584-L1601 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.Alexandrov`, declaration `FunctionalInequalities.Analysis.convexOn_quadraticAt`; the repository is private at upload time).