The real coordinate Hlawka bound for
ProvedHlawkaSchatten.DiagonalCutoff.real_bound6For 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
Here is the cyclic constant, the comparison ratio forced by the cyclic family , , , whose three singleton norms are all , whose three pairwise sums all have norm , and whose total sum has norm .
The theorem asserts that for every real exponent the coordinate norm on is admissible with the cyclic constant:
No equal-norm, normalization or nonvanishing hypothesis is imposed, and the dimension may be zero. The statement asserts admissibility only and claims nothing about optimality.
The exponent is inherited rather than proved optimal. It is the lowest exponent for which the sharp diagonal constant has been established, and the content of the theorem is that the real coordinate problem picks up that entire range at no extra cost; the open range is .
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_bound6 :
∀ p : ℝ, 6 ≤ p → ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
(cyclicConstant p) := by sorry