A negative deficit localizes into the cutoff-66 entry box
ProvedHlawkaSchatten.DiagonalCutoff.local_failure66If 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. This is the localization step of the cutoff- argument: every counterexample meets this box. The lower entry is the frozen left-endpoint value of the cutoff- confinement.
Formalization Note. The box is the set comprehension in local_failure66; Triple is Fin 3 → Fin 3 → ℝ.
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
theorem HlawkaSchatten.DiagonalCutoff.local_failure66 : ∀ p : ℝ, 66 ≤ p →
(23 / 50 : ℝ) * p < cyclicConstant p →
scalarEnvelope p (73 / 200) < cyclicConstant p →
∀ x y z : Fin 3 → ℝ,
hlawkaDeficit p (cyclicConstant p) x y z < 0 →
∃ X ∈ ({X : Triple | ∀ j i,
if j = i then -(219 / 200 : ℝ) ≤ X j i ∧ X j i ≤ -(1631 / 2200 : ℝ)
else (1631 / 2200 : ℝ) ≤ X j i ∧ X j i ≤ (219 / 200 : ℝ)} : Set Triple),
tripleDeficit p (cyclicConstant p) X < 0 := by sorry