Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The real three-dimensional Hlawka interval [log⁡3/log⁡(3/2), 4][\log 3/\log(3/2),\,4][log3/log(3/2),4]

Open
HlawkaSchatten.DiagonalCutoff4.real_three_threshold_to_four

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

hlawka-schattensharp-constant

For a real exponent ppp and vectors x,y,z∈R3x,y,z \in \mathbb{R}^3x,y,z∈R3 the coordinate norm is

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

and the triple deficit and 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).

For t∈[1/2,2]t \in [1/2,2]t∈[1/2,2] put Ap(t)=(tp+2)1/pA_p(t) = (t^p+2)^{1/p}Ap​(t)=(tp+2)1/p and Bp(t)=(2∣1−t∣p+2p)1/pB_p(t) = \bigl(2|1-t|^p+2^p\bigr)^{1/p}Bp​(t)=(2∣1−t∣p+2p)1/p, and let

Kp  =  sup⁡t∈[1/2,2]3Ap(t)−31/p∣2−t∣6Ap(t)−3Bp(t)K_p \;=\; \sup_{t \in [1/2,2]} \frac{3A_p(t) - 3^{1/p}|2-t|}{6A_p(t) - 3B_p(t)}Kp​=t∈[1/2,2]sup​6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​

be the cyclic constant, i.e. the comparison ratio 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 the three-dimensional real Hlawka bound for exponents strictly above the Hlawka threshold p0=log⁡3/log⁡(3/2)≈2.70951p_0 = \log 3/\log(3/2) \approx 2.70951p0​=log3/log(3/2)≈2.70951 and up to 444:

∀p∈[p0, 4], ∀x,y,z∈R3:Δ3  ≤  Kp Δ2.\forall p \in [p_0,\,4],\ \forall x,y,z \in \mathbb{R}^3:\qquad \Delta_3 \;\le\; K_p\,\Delta_2 .∀p∈[p0​,4], ∀x,y,z∈R3:Δ3​≤Kp​Δ2​.

No normalization, equal-norm or nonvanishing hypothesis is imposed, and the statement is made in dimension three only; the passage to arbitrary finite dimension is a separate theorem.

This is the part of the low-exponent range where the problem is no longer classical. Below p0p_0p0​ the constant equals 111 and the assertion reduces to Hlawka's inequality; it is known that Hlawka's inequality fails in ℓp\ell_pℓp​ for every p>p0p > p_0p>p0​, so throughout the present interval the constant genuinely exceeds one, rising from Kp0=1K_{p_0} = 1Kp0​​=1 to K4≈1.46711K_4 \approx 1.46711K4​≈1.46711. The left endpoint is included so that the interval joins continuously to the classical range: at p=p0p = p_0p=p0​ the statement is still Hlawka's inequality, since Kp0=1K_{p_0} = 1Kp0​​=1.

The statement is sharp rather than merely sufficient. Because 2Ap(t)−Bp(t)2A_p(t) - B_p(t)2Ap​(t)−Bp​(t) is strictly positive on the parameter range, the pair-deficit sum of every cyclic triple is positive, so each cyclic triple yields a legitimate lower bound sup⁡tRp(t)=Kp\sup_t R_p(t) = K_psupt​Rp​(t)=Kp​ for any admissible constant. The target constant is thus the best possible, and a proof of the statement cannot proceed by any argument that leaves slack in the constant.

Structurally the interval is the genuinely new portion of the compact range below the established cutoff: uniform bounds are known for complex exponents p≥6p \ge 6p≥6 and hence for real exponents p≥6p \ge 6p≥6, and the three-dimensional real bound is known for p≥6p \ge 6p≥6 from the windowed confinement analysis and for p≥8p \ge 8p≥8 from the diagonal construction. What remains below 666 is the three-dimensional interval [2,6][2,6][2,6], and the present statement is its upper part [p0,4][p_0,4][p0​,4], the part above the classical Hlawka threshold.

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.DiagonalCutoff4.real_three_threshold_to_four :
    ∀ p : ℝ, Real.log 3 / Real.log (3 / 2) ≤ p → p ≤ 4 →
      HasHlawkaConstant (lpNorm p : (Fin 3 → ℝ) → ℝ) (cyclicConstant p) := by sorry
Source
Middle piece of the sharp real diagonal Hlawka problem on Prove2Me (campaign sharp-diagonal-hlawka-constant, mission 'Sharp diagonal Hlawka constants: lower the cutoff to 2'); constant as in E. Esa, Hlawka-Schatten inequalities: sharp diagonal construction, https://github.com/savarin/hlawka-schatten/tree/79aa498bfcf7b22bd91d771fb32ec278e2d4704b ; threshold exponent as in http://arxiv.org/abs/2407.03278 .

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