Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Localizing a Hlawka failure to the cyclic coordinate box

Proved
HlawkaSchatten.DiagonalConstruction.exists_failure_in_entryBox

by savarin · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

coordinate-geometrycounterexamplehlawka-schattenlocalization

For p>0p>0p>0 and x:{0,1,2}→Rx:\{0,1,2\}\to\mathbb Rx:{0,1,2}→R, write lpNormp(x):=(∑i∣xi∣p)1/p\mathrm{lpNorm}_p(x):=\bigl(\sum_i|x_i|^p\bigr)^{1/p}lpNormp​(x):=(∑i​∣xi​∣p)1/p for the finite coordinate ppp-norm. For K∈RK\in\mathbb RK∈R and x,y,z:{0,1,2}→Rx,y,z:\{0,1,2\}\to\mathbb Rx,y,z:{0,1,2}→R, let

hlawkaDeficitp,K(x,y,z):=(2K−1)(lpNormp(x)+lpNormp(y)+lpNormp(z))+lpNormp(x+y+z)−K(lpNormp(x+y)+lpNormp(x+z)+lpNormp(y+z)).\mathrm{hlawkaDeficit}_{p,K}(x,y,z):=(2K-1)\bigl(\mathrm{lpNorm}_p(x)+\mathrm{lpNorm}_p(y)+\mathrm{lpNorm}_p(z)\bigr)+\mathrm{lpNorm}_p(x+y+z)-K\bigl(\mathrm{lpNorm}_p(x+y)+\mathrm{lpNorm}_p(x+z)+\mathrm{lpNorm}_p(y+z)\bigr).hlawkaDeficitp,K​(x,y,z):=(2K−1)(lpNormp​(x)+lpNormp​(y)+lpNormp​(z))+lpNormp​(x+y+z)−K(lpNormp​(x+y)+lpNormp​(x+z)+lpNormp​(y+z)).

Writing pairGap(N)(a,b):=N(a)+N(b)−N(a+b)\mathrm{pairGap}(N)(a,b):=N(a)+N(b)-N(a+b)pairGap(N)(a,b):=N(a)+N(b)−N(a+b), tripleGap(N)(a,b,c):=N(a)+N(b)+N(c)−N(a+b+c)\mathrm{tripleGap}(N)(a,b,c):=N(a)+N(b)+N(c)-N(a+b+c)tripleGap(N)(a,b,c):=N(a)+N(b)+N(c)−N(a+b+c), and pairGapSum(N)(a,b,c)\mathrm{pairGapSum}(N)(a,b,c)pairGapSum(N)(a,b,c) for the sum of the three pair gaps, one has hlawkaDeficitp,K(x,y,z)=K⋅pairGapSum(lpNormp)(x,y,z)−tripleGap(lpNormp)(x,y,z)\mathrm{hlawkaDeficit}_{p,K}(x,y,z)=K\cdot\mathrm{pairGapSum}(\mathrm{lpNorm}_p)(x,y,z)-\mathrm{tripleGap}(\mathrm{lpNorm}_p)(x,y,z)hlawkaDeficitp,K​(x,y,z)=K⋅pairGapSum(lpNormp​)(x,y,z)−tripleGap(lpNormp​)(x,y,z), which is ≥0\ge0≥0 for all x,y,zx,y,zx,y,z exactly when lpNormp\mathrm{lpNorm}_plpNormp​ has Hlawka constant KKK; so a negative value of hlawkaDeficitp,K\mathrm{hlawkaDeficit}_{p,K}hlawkaDeficitp,K​ is a strict failure of that inequality at (x,y,z)(x,y,z)(x,y,z).

Write a triple XXX as three columns X0,X1,X2∈R3X_0,X_1,X_2\in\mathbb R^3X0​,X1​,X2​∈R3, with Xj,iX_{j,i}Xj,i​ coordinate iii of column jjj (Lean: X j i), and let tripleDeficitp,K(X):=hlawkaDeficitp,K(X0,X1,X2)\mathrm{tripleDeficit}_{p,K}(X):=\mathrm{hlawkaDeficit}_{p,K}(X_0,X_1,X_2)tripleDeficitp,K​(X):=hlawkaDeficitp,K​(X0​,X1​,X2​). Let cyclicCenter\mathrm{cyclicCenter}cyclicCenter be the triple whose jjj-th column has −1-1−1 in position jjj and 111 elsewhere, and let entryBox:={X:∣Xj,i−cyclicCenterj,i∣≤19/100 for all j,i}\mathrm{entryBox}:=\{X:|X_{j,i}-\mathrm{cyclicCenter}_{j,i}|\le19/100\text{ for all }j,i\}entryBox:={X:∣Xj,i​−cyclicCenterj,i​∣≤19/100 for all j,i}.

Let

Kp:=cyclicConstant(p):=sup⁡{Rp(t):1/2≤t≤2},Rp(t):=3Ap(t)−31/p∣2−t∣6Ap(t)−3Bp(t),Ap(t):=(tp+2)1/p, Bp(t):=(2∣1−t∣p+2p)1/p.\begin{gathered} K_p:=\mathrm{cyclicConstant}(p):=\sup\{R_p(t):1/2\le t\le2\},\quad R_p(t):=\frac{3A_p(t)-3^{1/p}|2-t|}{6A_p(t)-3B_p(t)}, \\ \quad A_p(t):=(t^p+2)^{1/p},\ B_p(t):=\bigl(2|1-t|^p+2^p\bigr)^{1/p}. \end{gathered}Kp​:=cyclicConstant(p):=sup{Rp​(t):1/2≤t≤2},Rp​(t):=6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​,Ap​(t):=(tp+2)1/p, Bp​(t):=(2∣1−t∣p+2p)1/p.​

For every p≥256p\ge256p≥256 and every x,y,z:{0,1,2}→Rx,y,z:\{0,1,2\}\to\mathbb Rx,y,z:{0,1,2}→R with hlawkaDeficitp,Kp(x,y,z)<0\mathrm{hlawkaDeficit}_{p,K_p}(x,y,z)<0hlawkaDeficitp,Kp​​(x,y,z)<0, this theorem produces a triple X∈entryBoxX\in\mathrm{entryBox}X∈entryBox that is still a strict failure:

tripleDeficitp,Kp(X)<0.\mathrm{tripleDeficit}_{p,K_p}(X)<0.tripleDeficitp,Kp​​(X)<0.

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 333 — into the fixed box of triples within 19/10019/10019/100 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 19/10019/10019/100 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 6/50+84/(5p)6/50+84/(5p)6/50+84/(5p) of the cyclic pattern, which is 0.1856250.1856250.185625 at p=256p=256p=256 — below 19/100=0.1919/100=0.1919/100=0.19, but with little room to spare.

Preamble
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
Formal statement
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
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/Localization.lean#L69-L151
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by marwahaha · Sep 30, 2026

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me