Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The sharp diagonal Hlawka constant for every real exponent p >= 12

Proved
HlawkaSchatten.DiagonalCutoff12.cutoff12

by shivm · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysishlawka-schatteninequalities

For every real p≥12p\ge12p≥12, the cyclic constant

Kp=max⁡1/2≤t≤23(tp+2)1/p−31/p∣2−t∣6(tp+2)1/p−3(2∣1−t∣p+2p)1/pK_p=\max_{1/2\le t\le2}\frac{3(t^p+2)^{1/p}-3^{1/p}|2-t|}{6(t^p+2)^{1/p}-3(2|1-t|^p+2^p)^{1/p}}Kp​=1/2≤t≤2max​6(tp+2)1/p−3(2∣1−t∣p+2p)1/p3(tp+2)1/p−31/p∣2−t∣​

is the least real constant CCC such that

∥x∥p+∥y∥p+∥z∥p−∥x+y+z∥p≤C(2∥x∥p+2∥y∥p+2∥z∥p−∥x+y∥p−∥x+z∥p−∥y+z∥p)\|x\|_p+\|y\|_p+\|z\|_p-\|x+y+z\|_p\le C\bigl(2\|x\|_p+2\|y\|_p+2\|z\|_p-\|x+y\|_p-\|x+z\|_p-\|y+z\|_p\bigr)∥x∥p​+∥y∥p​+∥z∥p​−∥x+y+z∥p​≤C(2∥x∥p​+2∥y∥p​+2∥z∥p​−∥x+y∥p​−∥x+z∥p​−∥y+z∥p​)

for every finite dimension and every triple of complex vectors. The cutoff 12 is sufficient; this theorem does not assert it is optimal and does not settle exponents between 2 and 12.

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.DiagonalCutoff12.cutoff12 :
    ∀ p : ℝ, 12 ≤ p →
      IsLeast {C : ℝ | ∀ n : ℕ,
        HasHlawkaConstant (lpNorm p : (Fin n → ℂ) → ℝ) C}
        (cyclicConstant p) := by sorry
Source
Cutoff-12 extension of the genuinely open sharp diagonal Hlawka campaign, https://prove2.me/theorems/7fe6f02d-65e5-4c21-9796-c83889b29b9d . Uses the adjoining [12,16] real-three-dimensional interval results, the proved cutoff-16 theorem, and the proved real-three-to-complex-sharpness transfer.
Human review
  • Endorsed by Shuze Chen · Oct 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by shivm · Oct 27, 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