Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The real coordinate Hlawka bound for p ≥ 90

Open
HlawkaSchatten.DiagonalCutoff.real_bound90

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

hlawka-schattensharp-constant

For a real exponent p>1p>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)=\left(\sum_{i=1}^n|x_i|^p\right)^{1/p}.Np​(x)=(i=1∑n​∣xi​∣p)1/p.

For any three vectors in the same space, their triple deficit is

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

and their pair-deficit sum is

Δ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​ for every triple and 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)=(2|1-t|^p+2^p)^{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).

This cyclic constant is exactly the foundation's cyclicConstant. It comes from the three vectors (−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 fixed compact interval and the absolute value in BpB_pBp​ are part of the definition and remain unchanged in this task. Cyclic definitions

The theorem asks for

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

There is no equal-norm, normalization or nonzero restriction. The finite dimension may be zero. This is the real admissibility statement, without a leastness assertion, used in the supplied proof's complex sharp-bound result.

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_bound90 :
    ∀ p : ℝ, 90 ≤ p → ∀ n : ℕ,
      HasHlawkaConstant (lpNorm p : (Fin n → ℝ) → ℝ)
        (cyclicConstant p) := by sorry
Source
https://gist.github.com/savarin/4621846808053fe597d1a59f1b7acbbd/59d328b191c87c3b4963bb6b9aa491f98f695075#file-proof-md
Read-back

What the Lean code literally says, in plain math · GPT-6

For every real number ppp satisfying 90≤p90\le p90≤p (including p=90p=90p=90), every natural number n≥0n\ge0n≥0, and every three real coordinate vectors x,y,z∈RInx,y,z\in\mathbb{R}^{I_n}x,y,z∈RIn​, where In={i∈N:i<n}I_n=\{i\in\mathbb{N}:i<n\}In​={i∈N:i<n}, define Np(w)=(∑i∈In∣wi∣p)1/pN_p(w)=\left(\sum_{i\in I_n}|w_i|^p\right)^{1/p}Np​(w)=(∑i∈In​​∣wi​∣p)1/p for each w∈RInw\in\mathbb{R}^{I_n}w∈RIn​. Define a set of real numbers and a real constant depending only on ppp by

Sp={3(tp+2)1/p−31/p∣2−t∣6(tp+2)1/p−3(2∣1−t∣p+2p)1/p: t∈R, 12≤t≤2},Cp=sup⁡Sp.S_p=\left\{ \frac{3(t^p+2)^{1/p}-3^{1/p}|2-t|} {6(t^p+2)^{1/p}-3\left(2|1-t|^p+2^p\right)^{1/p}} :\ t\in\mathbb{R},\ \frac{1}{2}\le t\le2 \right\}, \qquad C_p=\sup S_p.Sp​={6(tp+2)1/p−3(2∣1−t∣p+2p)1/p3(tp+2)1/p−31/p∣2−t∣​: t∈R, 21​≤t≤2},Cp​=supSp​.

The declaration asserts

Np(x)+Np(y)+Np(z)−Np(x+y+z) ≤ Cp([Np(x)+Np(y)−Np(x+y)]+[Np(x)+Np(z)−Np(x+z)]+[Np(y)+Np(z)−Np(y+z)]).\begin{aligned} N_p(x)+N_p(y)+N_p(z)-N_p(x+y+z) \ \le\ C_p\bigl(&[N_p(x)+N_p(y)-N_p(x+y)]\\ &+[N_p(x)+N_p(z)-N_p(x+z)]\\ &+[N_p(y)+N_p(z)-N_p(y+z)]\bigr). \end{aligned}Np​(x)+Np​(y)+Np​(z)−Np​(x+y+z) ≤ Cp​(​[Np​(x)+Np​(y)−Np​(x+y)]+[Np​(x)+Np​(z)−Np​(x+z)]+[Np​(y)+Np​(z)−Np​(y+z)]).​

Here all vector additions are coordinatewise and the norm of an individual real coordinate is its ordinary absolute value. The powers are real powers: on a positive base aaa they have the value ar=exp⁡(rlog⁡a)a^r=\exp(r\log a)ar=exp(rloga), and 0r=00^r=00r=0 for the positive exponents occurring here. All bases in the displayed formulas are nonnegative, and p≥90p\ge90p≥90 ensures both p>0p>0p>0 and 1/p>01/p>01/p>0. The interval defining SpS_pSp​ includes both endpoints and is nonempty. In the definition of CpC_pCp​, the real supremum is the least upper bound when its argument set is nonempty and bounded above, and is defined to be 000 otherwise; in particular, the definition would give Cp=0C_p=0Cp​=0 if SpS_pSp​ were unbounded above. The scalar quotient uses total real division, so a zero denominator would give the value 000; denominator nonvanishing and attainment of the supremum are not additional hypotheses of this declaration. The vectors are arbitrary, including zero vectors, repeated vectors, and triples for which the sum of the three bracketed quantities is zero; in that last case the asserted inequality has right-hand side zero. No positive lower bound on nnn is imposed: when n=0n=0n=0, there is a unique empty coordinate vector, every defining sum for NpN_pNp​ is empty and equals zero, every value of NpN_pNp​ is zero, and the inequality reads 0≤00\le00≤0. The condition p≥90p\ge90p≥90 is the only hypothesis beyond membership in the stated domains; ppp need not be an integer, and the declaration imposes no conclusion for p<90p<90p<90.

Human review
  • Endorsed by marwahaha · Sep 30, 2026

  • Endorsed by savarin · Sep 30, 2026

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

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