Localizing a Hlawka failure to the cyclic coordinate box
ProvedHlawkaSchatten.DiagonalConstruction.exists_failure_in_entryBoxFor and , write for the finite coordinate -norm. For and , let
Writing , , and for the sum of the three pair gaps, one has , which is for all exactly when has Hlawka constant ; so a negative value of is a strict failure of that inequality at .
Write a triple as three columns , with coordinate of column (Lean: X j i), and let . Let be the triple whose -th column has in position and elsewhere, and let .
Let
For every and every with , this theorem produces a triple that is still a strict failure:
This localizes an arbitrary strict counterexample — after normalizing its total mass, relabeling which vector plays which coordinate role together with a sign flip per coordinate, and rescaling by — into the fixed box of triples within of the cyclic sign pattern. Turning an otherwise unbounded search for failures of the Hlawka inequality into one confined to a small, fixed region is what makes the region's own geometry (its convexity, and the curvature of the deficit on it) usable against the failure.
Formalization Note The box radius is the exact entrywise tolerance this construction's coordinate-geometry and curvature estimates are built around: the localization step used here puts the confined counterexample's entries within of the cyclic pattern, which is at — below , but with little room to spare.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Localization import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Normalization import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Analysis.Convex.Deriv import Mathlib.Analysis.Convex.Function import Mathlib.Analysis.Convex.Jensen import Mathlib.Analysis.Convex.SpecificFunctions.Basic import Mathlib.Analysis.InnerProductSpace.Basic import Mathlib.Analysis.InnerProductSpace.Dual import Mathlib.Analysis.InnerProductSpace.NormPow import Mathlib.Analysis.Normed.Lp.PiLp import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Data.Fin.VecNotation import Mathlib.Data.Real.Basic import Mathlib.Data.Sign.Basic import Mathlib.Tactic.Abel import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Topology.Instances.Sign import Mathlib.Topology.Order.Compact /- Copyright (c) 2026 Ezzeri Esa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ezzeri Esa -/ /-! # A strict counterexample lies in the cyclic coordinate box -/ open HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalConstruction.exists_failure_in_entryBox {p : ℝ} (hp : 256 ≤ p)
(x y z : Fin 3 → ℝ) (hf : hlawkaDeficit p (cyclicConstant p) x y z < 0) :
∃ X ∈ entryBox, tripleDeficit p (cyclicConstant p) X < 0 := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.