Convexity of the triple deficit on the cutoff-66 entry box
ProvedHlawkaSchatten.DiagonalCutoff.convex_box66diagonal-constructionhlawka-schattenoptimal-constant
For an exponent and a height between and , the triple deficit is a convex function of the nine matrix entries on the cutoff- asymmetric box.
Let and . On the set of real matrices whose diagonal entries lie in and whose off-diagonal entries lie in , the map
is convex. Together with the localization lemma, convexity lets an orbit average rule out a negative deficit inside the box. The Hessian comparison on this wider box uses a coefficient budget of .
Formalization Note. Convexity is ConvexOn ℝ applied to tripleDeficit p K on the same entry box as local_failure66.
Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_ScalarBounds import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Localization import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalCutoff.convex_box66 : ∀ p K : ℝ, 66 ≤ p → (23 / 50 : ℝ) * p ≤ K → K ≤ p →
ConvexOn ℝ {X : Triple | ∀ j i,
if j = i then -(219 / 200 : ℝ) ≤ X j i ∧ X j i ≤ -(1631 / 2200 : ℝ)
else (1631 / 2200 : ℝ) ≤ X j i ∧ X j i ≤ (219 / 200 : ℝ)}
(tripleDeficit p K) := by sorry
Source