Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The real coordinate Hlawka bound for 2≤p≤162 \le p \le 162≤p≤16

Open
HlawkaSchatten.DiagonalCutoff.real_bound_mid

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

hlawka-schattensharp-constant

For a real exponent ppp with 2≤p≤162 \le p \le 162≤p≤16 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,

and 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 when Δ3≤C Δ2\Delta_3 \le C\,\Delta_2Δ3​≤CΔ2​ holds for every triple in every finite dimension. For t∈[1/2,2]t \in [1/2,2]t∈[1/2,2] define

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),

so that KpK_pKp​ is the foundation's cyclicConstant, the constant forced by the cyclic family (−t,1,1),(1,−t,1),(1,1,−t)(-t,1,1),(1,-t,1),(1,1,-t)(−t,1,1),(1,−t,1),(1,1,−t).

The theorem asserts that for every ppp in the compact range 2≤p≤162 \le p \le 162≤p≤16 the coordinate norm NpN_pNp​ on Rn\mathbb{R}^nRn is admissible with the constant KpK_pKp​:

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

There is no equal-norm, normalization or nonzero restriction, and the finite dimension may be zero. The statement asserts admissibility only; it makes no leastness claim about KpK_pKp​. It is the range restriction of the campaign endpoint for p≥2p \ge 2p≥2 that remains open after the accepted bound for every p≥16p \ge 16p≥16.

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_mid :
    ∀ p : ℝ, 2 ≤ p → p ≤ 16 → ∀ n : ℕ,
      HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
        (cyclicConstant p) := by sorry
Source
Range restriction of the campaign endpoint theorem HlawkaSchatten.DiagonalCutoff.real_bound2 (Prove2Me, sharp diagonal Hlawka campaign, https://prove2.me/campaigns/sharp-diagonal-hlawka-constant). Construction: E. Esa, Hlawka-Schatten inequalities: sharp diagonal construction, https://github.com/savarin/hlawka-schatten/tree/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction . See also 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