A negative deficit localizes into the cutoff-62 entry box
ProvedHlawkaSchatten.DiagonalCutoff.local_failure62diagonal-constructionhlawka-schattenoptimal-constant
If the cyclic constant exceeds both and the scalar envelope at , then any real three-coordinate counterexample to the cyclic bound can be rotated and signed into a fixed asymmetric box on which the triple deficit is still negative.
Let , and assume and . If the Hlawka deficit of three real vectors at height is negative, there is a real matrix with negative triple deficit whose entries obey
The lower entry is the frozen left endpoint of the cutoff- confinement at radius .
Formalization Note. The box is the set comprehension in local_failure62.
Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_DiagonalConstruction_ScalarBounds import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Localization import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalCutoff.local_failure62 : ∀ p : ℝ, 62 ≤ p →
(23 / 50 : ℝ) * p < cyclicConstant p →
scalarEnvelope p (3643 / 10000) < cyclicConstant p →
∀ x y z : Fin 3 → ℝ,
hlawkaDeficit p (cyclicConstant p) x y z < 0 →
∃ X ∈ ({X : Triple | ∀ j i,
if j = i then -(10929 / 10000 : ℝ) ≤ X j i ∧ X j i ≤ -(28719 / 38750 : ℝ)
else (28719 / 38750 : ℝ) ≤ X j i ∧ X j i ≤ (10929 / 10000 : ℝ)} : Set Triple),
tripleDeficit p (cyclicConstant p) X < 0 := by sorrySource