Sharp complex coordinate Hlawka constant for p ≥ 89
ProvedHlawkaSchatten.DiagonalCutoff.cutoff89For a real exponent and a vector , the coordinate norm is
For any three vectors in the same space, their triple deficit is
and their pair-deficit sum is
A real constant is uniformly admissible when for every triple and every finite dimension.
For , define
This cyclic constant is exactly the foundation's cyclicConstant.
It comes from the three vectors .
The fixed compact interval and the absolute value in are part of
the definition and remain unchanged in this task.
Cyclic definitions
For every real , the theorem asks for
This includes admissibility and uniform optimality, with all unequal-norm and zero triples allowed. Dimension zero is included. No proof is known for ; the accepted cutoff-90 theorem covers every .
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalCutoff.cutoff89 :
∀ p : ℝ, 89 ≤ p →
IsLeast {C : ℝ | ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℂ) → ℝ) C}
(cyclicConstant p) := by sorry
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
For every real number (any real, not necessarily an integer), the real number defined below is the least element of the set of real constants that satisfy the following condition. For every and all (which need not be distinct or nonzero),
Addition is coordinatewise. The norm is , where is the complex modulus. Every power here is a real power of a nonnegative base, so for this is the usual norm on . The bundle calls the left side the triple gap and the bracket the pair-gap sum. ranges over all real numbers, positive or negative.
"Least element" means two claims:
- is admissible: the inequality holds with for every and all .
- No smaller uniform constant exists: if a real makes the inequality hold for every and all , then .
The constant. For set
and let . This is a supremum in over the closed real interval.
Edge cases.
- : it is included but constrains nothing. The only vector is , the empty sum gives , and the inequality reads .
- Scope of claim 2: it compares only with constants that work in every dimension at once. The statement does not say is the best constant for any single fixed .
- Junk values: in the formal system, division by zero gives , and the supremum of a set that is empty or unbounded above is . Neither case arises here. On we have , so , which is equivalent to . So is continuous on the compact interval, and is its maximum value there.
- Range of : nothing is claimed for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.