Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The real coordinate Hlawka bound for p≥8p \ge 8p≥8

Proved
HlawkaSchatten.DiagonalCutoff.real_bound8

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

hlawka-schattensharp-constant

For a real exponent p≥1p \ge 1p≥1 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),\Delta_3 = N_p(x)+N_p(y)+N_p(z)-N_p(x+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).\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).Δ2​=2(Np​(x)+Np​(y)+Np​(z))−Np​(x+y)−Np​(x+z)−Np​(y+z).

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

The quantity KpK_pKp​ is the cyclic constant: it is the comparison ratio forced by 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) of real three-vectors, for which all three singleton norms equal Ap(t)A_p(t)Ap​(t), all three pairwise sums have norm Bp(t)B_p(t)Bp​(t) and the total sum has norm 31/p∣2−t∣3^{1/p}|2-t|31/p∣2−t∣.

The theorem asserts that for every real exponent p≥8p \ge 8p≥8 the coordinate norm on Rn\mathbb{R}^nRn is admissible with the cyclic constant:

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

No equal-norm, normalization or nonvanishing hypothesis is imposed, and the dimension may be zero. The statement asserts admissibility only: it makes no leastness claim about KpK_pKp​.

The exponent 888 is not believed to be optimal. It is the lowest exponent for which the diagonal construction has been carried out in full, and the theorem records that the real coordinate problem inherits that entire range; the remaining question is the compact range 2≤p<82 \le p < 82≤p<8.

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_bound8 :
    ∀ p : ℝ, 8 ≤ p → ∀ n : ℕ,
      HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
        (cyclicConstant p) := by sorry
Source
Range restriction 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