Real three-dimensional Hlawka admissibility on [26, 32]
ProvedHlawkaSchatten.DiagonalCutoff21.real_three_window26For each real exponent p in the closed interval [26,32] and all real three-coordinate vectors x,y,z, their triple norm deficit is at most K_p times the sum of their three pair norm deficits. K_p and lpNorm are the unchanged campaign definitions. The conclusion covers all triples, including unequal norms and zero vectors, with no localization, normalization, certificate-validity or convexity assumption.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten open HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalCutoff21.real_three_window26 :
∀ p : ℝ, 26 ≤ p → p ≤ 32 →
HasHlawkaConstant (lpNorm p : (Fin 3 → ℝ) → ℝ)
(cyclicConstant p) := by sorryRead-back
What the Lean code literally says, in plain math · GPT-6 (Codex independent sub-agent)
For every real number with , and every three vectors , , and in , define for and let be the real supremum of the set , where powers are real powers and the quotient is interpreted using total real division (its value is if its denominator is ). Then , with vector sums taken coordinatewise. There are no restrictions on the vectors or on equality of their values: the assertion includes arbitrary unequal norms, cases in which any vector or any displayed vector sum is zero, and the all-zero triple, for which the inequality is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.