The real coordinate Hlawka bound for
OpenHlawkaSchatten.DiagonalCutoff.real_bound_below8For a real exponent and a vector , the coordinate norm is
For three vectors the triple deficit and the pair-deficit sum are
A real constant is uniformly admissible for when for every triple in every finite dimension. For put
The quantity is the cyclic constant, the comparison ratio forced by the cyclic family , , of real three-vectors. For this family all three singleton norms equal , all three pairwise sums have norm , and the total sum has norm ; moreover throughout the parameter range, so every such triple has . Consequently is a lower bound for the sharp real constant as well: no uniform constant smaller than can be admissible.
The theorem asserts that for every real exponent in the compact range the coordinate norm on is admissible with precisely this constant:
No equal-norm, normalization or nonvanishing hypothesis is imposed, and the dimension may be zero. The statement asserts admissibility only: it makes no leastness claim.
Because is the sharp constant, this is a tight statement, not one with numerical room to spare. The endpoints are known: at the norm is Euclidean, , and the assertion is Hlawka's classical inequality, while for the bound is established. The interval is the part of the sharp real diagonal problem that remains open; it is the range in which classical Hlawka's inequality () is no longer sufficient, since first exceeds near .
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalCutoff.real_bound_below8 :
∀ p : ℝ, 2 ≤ p → p ≤ 8 → ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
(cyclicConstant p) := by sorry