Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A negative deficit localizes into the cutoff-70 entry box

Proved
HlawkaSchatten.DiagonalCutoff.local_failure70

by moona3k · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

diagonal-constructionhlawka-schattenoptimal-constant

If the cyclic constant exceeds both 2350p\frac{23}{50}p5023​p and the scalar envelope at 73200\frac{73}{200}20073​, 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 p≥70p\ge 70p≥70, and assume 2350p<C(p)\frac{23}{50}p < C(p)5023​p<C(p) and E(p,73200)<C(p)E(p,\frac{73}{200}) < C(p)E(p,20073​)<C(p). Write Dp(x,y,z)D_p(x,y,z)Dp​(x,y,z) for the Hlawka deficit of three real vectors at height C(p)C(p)C(p). If Dp(x,y,z)<0D_p(x,y,z)<0Dp​(x,y,z)<0, there is a 3×33\times 33×3 real matrix X=(Xji)X=(X_{ji})X=(Xji​) such that the associated triple deficit is negative and the entries obey

−219200≤Xjj≤−52177000,52177000≤Xji≤219200 (i≠j).-\frac{219}{200}\le X_{jj}\le -\frac{5217}{7000},\qquad \frac{5217}{7000}\le X_{ji}\le \frac{219}{200}\ (i\ne j).−200219​≤Xjj​≤−70005217​,70005217​≤Xji​≤200219​ (i=j).

The diagonal is the negative coordinate and the off-diagonal entries are the positive ones. This is the localization step of the cutoff-707070 argument: every counterexample meets this box.

Formalization Note. The box is the set comprehension in local_failure70; Triple is Fin 3 → Fin 3 → ℝ.

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_failure70 : ∀ p : ℝ, 70 ≤ 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 ≤ -(5217 / 7000 : ℝ)
          else (5217 / 7000 : ℝ) ≤ X j i ∧ X j i ≤ (219 / 200 : ℝ)} : Set Triple),
          tripleDeficit p (cyclicConstant p) X < 0 := by sorry
Source
https://prove2.me/campaigns/sharp-diagonal-hlawka-constant — localization of a negative cyclic deficit into the cutoff-70 asymmetric entry box.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me