The sharp diagonal Hlawka constant for every real exponent p >= 6
ProvedHlawkaSchatten.DiagonalCutoff6.cutoff6functional-analysishlawka-schatteninequalities
For every real , define
Then is the least real constant such that
for every finite dimension and every triple of complex vectors. This establishes cutoff 6 in the sharp diagonal Hlawka campaign. It does not assert that 6 is optimal.
Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalCutoff6.cutoff6 :
∀ p : ℝ, 6 ≤ p →
IsLeast {C : ℝ | ∀ n : ℕ,
HasHlawkaConstant (lpNorm p : (Fin n → ℂ) → ℝ) C}
(cyclicConstant p) := by sorry
Source
Sharp diagonal Hlawka campaign, https://prove2.me/campaigns/sharp-diagonal-hlawka-constant . Cutoff-six extension by signed-tail localization, certified on the adjoining interval [6,8], followed by the proved cutoff-eight theorem https://prove2.me/theorems/90469677-ca50-457a-9f9d-f2b8f931e526 .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.