A negative deficit localizes into the cutoff-64 entry box
ProvedHlawkaSchatten.DiagonalCutoff.local_failure64diagonal-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 . Write for the Hlawka deficit of three real vectors at height . If , there is a real matrix such that the associated triple deficit is negative and the entries obey
The diagonal is the negative coordinate and the off-diagonal entries are the positive ones. The lower entry is the frozen left-endpoint value of the cutoff- confinement at the same radius .
Formalization Note. The box is the set comprehension in local_failure64; Triple is Fin 3 \to Fin 3 \to \mathbb{R}.
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_failure64 : ∀ p : ℝ, 64 ≤ p →
(23 / 50 : ℝ) * p < cyclicConstant p →
scalarEnvelope p (91 / 250) < cyclicConstant p →
∀ x y z : Fin 3 → ℝ,
hlawkaDeficit p (cyclicConstant p) x y z < 0 →
∃ X ∈ ({X : Triple | ∀ j i,
if j = i then -(273 / 250 : ℝ) ≤ X j i ∧ X j i ≤ -(23847 / 32000 : ℝ)
else (23847 / 32000 : ℝ) ≤ X j i ∧ X j i ≤ (273 / 250 : ℝ)} : Set Triple),
tripleDeficit p (cyclicConstant p) X < 0 := by sorrySource