The real coordinate Hlawka bound for
OpenHlawkaSchatten.DiagonalCutoff.real_bound_below6For a real exponent and a vector , the coordinate norm is
For three vectors , the triple deficit and the pair-deficit sum are
and a real constant is uniformly admissible for when for every triple in every finite dimension. For put
The quantity is the cyclic constant: the cyclic family , , has all three singleton norms equal to , all three pairwise sums of norm and total sum of norm , so its comparison ratio is . Because on the parameter range, every such triple has ; hence no admissible constant can be smaller than , and this statement is tight.
The theorem asserts that for every exponent in the compact range the coordinate norm on is admissible with exactly this constant:
again with no normalization or equal-norm hypothesis, and with the dimension allowed to be zero.
This interval is the part of the sharp real diagonal problem that remains open. Its structure is worth recording, since the three sub-intervals behave very differently. For the constant equals , the statement is precisely Hlawka's classical inequality, and Hlawka's inequality is known to fail for above that threshold, so the constant genuinely exceeds from there on. At the other end, from the dimension can be reduced to three, and the three-dimensional problem has been settled for ; what remains in is the three-dimensional interval. The constants increase steeply across the interval, from through and to .
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_below6 :
∀ p : ℝ, 2 ≤ p → p ≤ 6 → ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
(cyclicConstant p) := by sorry