The cyclic constant equals one below the Hlawka threshold
ProvedHlawkaSchatten.LpThreshold.cyclicConstant_le_one_belowFor a real exponent and a parameter put
and let the cyclic constant be
The quantity is the comparison ratio forced by the three real vectors , , under the coordinate norm : each of the three has norm , each pairwise sum has norm , and the total sum has norm .
The theorem asserts that below the Hlawka threshold
the cyclic constant is exactly one:
Together with the companion bound (obtained by evaluating the ratio at , where numerator and denominator both equal ), this pins on .
The threshold is not an artefact of the definition: it is exactly the exponent at which the cyclic family stops satisfying the classical Hlawka inequality with constant one. Concretely, at the three vectors are , , , whose singleton norms are all , whose pairwise sums all have norm , and whose total sum has norm ; the classical inequality therefore reads , which is equivalent to , i.e. to . It is a theorem that Hlawka's inequality in fails for every , so is the exact right endpoint of the range on which the constant can equal one.
The mathematical content is therefore that among all , the maximum of the cyclic ratio is attained at precisely when ; for above the threshold the maximum migrates into the interior of the interval and the constant becomes strictly larger than one. The statement is a scalar, one-parameter inequality — it involves no vectors, no dimension and no norm inequality, and it is independent of the analytic difficulty of Hlawka's inequality itself. That separation is its purpose: it isolates the computation of the constant from the proof that the constant is admissible.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.LpThreshold.cyclicConstant_le_one_below :
∀ p : ℝ, 2 ≤ p → p ≤ Real.log 3 / Real.log (3 / 2) → cyclicConstant p ≤ 1 := by sorry