The cyclic constant is at least one
ProvedHlawkaSchatten.DiagonalConstruction.cyclicConstant_ge_oneFor a real exponent and a parameter , put
and define the cyclic ratio
The denominator is strictly positive on the parameter range, the function is continuous there, and the interval is compact, so attains a maximum. The cyclic constant is that maximum,
Geometrically, is the ratio of the triple deficit to the pair-deficit sum of the three real vectors , , under the coordinate norm ; the constant is the comparison ratio this one-parameter family forces, and it is the sharp constant in the diagonal Hlawka problem.
The theorem asserts a universal lower bound for this supremum:
The proof is a single evaluation: at the right endpoint the two auxiliary quantities coincide, , because and , so both the numerator and the denominator of equal and . Since lies in the parameter interval, a maximum of over that interval is at least the value at , hence .
The bound is not an artefact of the endpoint: it is exactly what makes the normalization hypotheses in the downstream reduction and curvature criteria satisfiable, so the statement is recorded for every even though the extremal ratio can dip below strictly inside the interval when is small.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalConstruction.cyclicConstant_ge_one {p : ℝ} (hp : 1 < p) :
1 ≤ cyclicConstant p := by sorry