The real coordinate Hlawka bound for
OpenHlawkaSchatten.DiagonalCutoff.real_bound_midhlawka-schattensharp-constant
For a real exponent with and a vector , the coordinate norm is
and for three vectors the triple deficit and the pair-deficit sum are
A real constant is uniformly admissible when holds for every triple in every finite dimension. For define
so that is the foundation's cyclicConstant, the constant forced by the
cyclic family .
The theorem asserts that for every in the compact range the coordinate norm on is admissible with the constant :
There is no equal-norm, normalization or nonzero restriction, and the finite dimension may be zero. The statement asserts admissibility only; it makes no leastness claim about . It is the range restriction of the campaign endpoint for that remains open after the accepted bound for every .
Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalCutoff.real_bound_mid :
∀ p : ℝ, 2 ≤ p → p ≤ 16 → ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
(cyclicConstant p) := by sorry
Source
Range restriction of the campaign endpoint theorem HlawkaSchatten.DiagonalCutoff.real_bound2 (Prove2Me, sharp diagonal Hlawka campaign, https://prove2.me/campaigns/sharp-diagonal-hlawka-constant). Construction: E. Esa, Hlawka-Schatten inequalities: sharp diagonal construction, https://github.com/savarin/hlawka-schatten/tree/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction . See also K. M. R. Audenaert and F. Kittaneh, Problems and Conjectures in Matrix and Operator Inequalities, arXiv:1201.5232, Problem 7.