Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The real coordinate Hlawka bound for 2≤p≤62 \le p \le 62≤p≤6

Open
HlawkaSchatten.DiagonalCutoff.real_bound_below6

by Nihal · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

hlawka-schattensharp-constant

For a real exponent ppp and a vector x∈Rnx \in \mathbb{R}^nx∈Rn, the coordinate norm is

Np(x)=(∑i=1n∣xi∣p)1/p.N_p(x) = \Bigl(\sum_{i=1}^{n} |x_i|^p\Bigr)^{1/p} .Np​(x)=(i=1∑n​∣xi​∣p)1/p.

For three vectors x,y,z∈Rnx,y,z \in \mathbb{R}^nx,y,z∈Rn, the triple deficit and the pair-deficit sum are

Δ3=Np(x)+Np(y)+Np(z)−Np(x+y+z),Δ2=2(Np(x)+Np(y)+Np(z))−Np(x+y)−Np(x+z)−Np(y+z),\Delta_3 = N_p(x)+N_p(y)+N_p(z)-N_p(x+y+z), \qquad \Delta_2 = 2\bigl(N_p(x)+N_p(y)+N_p(z)\bigr) - N_p(x+y) - N_p(x+z) - N_p(y+z),Δ3​=Np​(x)+Np​(y)+Np​(z)−Np​(x+y+z),Δ2​=2(Np​(x)+Np​(y)+Np​(z))−Np​(x+y)−Np​(x+z)−Np​(y+z),

and a real constant CCC is uniformly admissible for NpN_pNp​ when Δ3≤C Δ2\Delta_3 \le C\,\Delta_2Δ3​≤CΔ2​ for every triple in every finite dimension. For t∈[1/2,2]t \in [1/2,2]t∈[1/2,2] put

Ap(t)=(tp+2)1/p,Bp(t)=(2∣1−t∣p+2p)1/p,Rp(t)=3Ap(t)−31/p∣2−t∣6Ap(t)−3Bp(t),A_p(t) = (t^p+2)^{1/p}, \qquad B_p(t) = \bigl(2|1-t|^p + 2^p\bigr)^{1/p}, \qquad R_p(t) = \frac{3A_p(t) - 3^{1/p}|2-t|}{6A_p(t) - 3B_p(t)},Ap​(t)=(tp+2)1/p,Bp​(t)=(2∣1−t∣p+2p)1/p,Rp​(t)=6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​, Kp=sup⁡t∈[1/2,2]Rp(t).K_p = \sup_{t \in [1/2,2]} R_p(t).Kp​=t∈[1/2,2]sup​Rp​(t).

The quantity KpK_pKp​ is the cyclic constant: the cyclic family (−t,1,1)(-t,1,1)(−t,1,1), (1,−t,1)(1,-t,1)(1,−t,1), (1,1,−t)(1,1,-t)(1,1,−t) has all three singleton norms equal to Ap(t)A_p(t)Ap​(t), all three pairwise sums of norm Bp(t)B_p(t)Bp​(t) and total sum of norm 31/p∣2−t∣3^{1/p}|2-t|31/p∣2−t∣, so its comparison ratio is Rp(t)R_p(t)Rp​(t). Because 2Ap(t)−Bp(t)>02A_p(t)-B_p(t) > 02Ap​(t)−Bp​(t)>0 on the parameter range, every such triple has Δ2>0\Delta_2 > 0Δ2​>0; hence no admissible constant can be smaller than sup⁡tRp(t)=Kp\sup_t R_p(t) = K_psupt​Rp​(t)=Kp​, and this statement is tight.

The theorem asserts that for every exponent in the compact range 2≤p≤62 \le p \le 62≤p≤6 the coordinate norm on Rn\mathbb{R}^nRn is admissible with exactly this constant:

∀p∈[2,6], ∀n∈N, ∀x,y,z∈Rn:Δ3≤Kp Δ2,\forall p \in [2,6],\ \forall n \in \mathbb{N},\ \forall x,y,z \in \mathbb{R}^n: \qquad \Delta_3 \le K_p\,\Delta_2 ,∀p∈[2,6], ∀n∈N, ∀x,y,z∈Rn:Δ3​≤Kp​Δ2​,

again with no normalization or equal-norm hypothesis, and with the dimension allowed to be zero.

This interval is the part of the sharp real diagonal problem that remains open. Its structure is worth recording, since the three sub-intervals behave very differently. For 2≤p≤log⁡3/log⁡(3/2)≈2.70952 \le p \le \log 3/\log(3/2) \approx 2.70952≤p≤log3/log(3/2)≈2.7095 the constant equals 111, the statement is precisely Hlawka's classical inequality, and Hlawka's inequality is known to fail for ppp above that threshold, so the constant genuinely exceeds 111 from there on. At the other end, from p≥4p \ge 4p≥4 the dimension can be reduced to three, and the three-dimensional problem has been settled for p≥6p \ge 6p≥6; what remains in [4,6)[4,6)[4,6) is the three-dimensional interval. The constants increase steeply across the interval, from K2=1K_2 = 1K2​=1 through K3≈1.093K_3 \approx 1.093K3​≈1.093 and K4≈1.467K_4 \approx 1.467K4​≈1.467 to K6≈2.305K_6 \approx 2.305K6​≈2.305.

Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic
import Definitions.Def_HlawkaSchatten_GapComparison

open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalCutoff.real_bound_below6 :
    ∀ p : ℝ, 2 ≤ p → p ≤ 6 → ∀ n : ℕ,
      HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
        (cyclicConstant p) := by sorry
Source
Remaining range of the sharp real diagonal Hlawka endpoint on Prove2Me (campaign sharp-diagonal-hlawka-constant, mission 'Sharp diagonal Hlawka constants: lower the cutoff to 2'); the constant is that of E. Esa, Hlawka-Schatten inequalities: sharp diagonal construction, https://github.com/savarin/hlawka-schatten/tree/79aa498bfcf7b22bd91d771fb32ec278e2d4704b ; cf. K. M. R. Audenaert and F. Kittaneh, Problems and Conjectures in Matrix and Operator Inequalities, arXiv:1201.5232, Problem 7.

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