Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Hlawka inequality for complex coordinate ppp-norms with constant KpK_pKp​, for p≥256p\ge256p≥256

Proved
HlawkaSchatten.DiagonalConstruction.complex_hlawka_bound

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

complex-analysishlawka-inequalityhlawka-schattenlp-normsharp-constant

For a finite index set ι\iotaι of any size (including the empty set, i.e. dimension zero) and a real exponent ppp, write

∥v∥p:=(∑i∈ι∣vi∣p)1/p\|v\|_p := \Big(\sum_{i\in\iota}|v_i|^p\Big)^{1/p}∥v∥p​:=(i∈ι∑​∣vi​∣p)1/p

for the finite coordinate ppp-norm of a complex vector v:ι→Cv:\iota\to\mathbb Cv:ι→C (with ∣⋅∣|\cdot|∣⋅∣ the complex modulus; a norm for p≥1p\ge1p≥1). For x,y,z:ι→Cx,y,z:\iota\to\mathbb Cx,y,z:ι→C put

S=∥x∥p+∥y∥p+∥z∥p,T=∥x+y+z∥p,P=∥x+y∥p+∥x+z∥p+∥y+z∥p.S=\|x\|_p+\|y\|_p+\|z\|_p,\qquad T=\|x+y+z\|_p,\qquad P=\|x+y\|_p+\|x+z\|_p+\|y+z\|_p.S=∥x∥p​+∥y∥p​+∥z∥p​,T=∥x+y+z∥p​,P=∥x+y∥p​+∥x+z∥p​+∥y+z∥p​.

Let KpK_pKp​ be the following explicit constant: with

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),A_p(t)=(t^p+2)^{1/p},\qquad B_p(t)=(2|1-t|^p+2^p)^{1/p},\qquad R_p(t)=\frac{3A_p(t)-3^{1/p}|2-t|}{6A_p(t)-3B_p(t)},Ap​(t)=(tp+2)1/p,Bp​(t)=(2∣1−t∣p+2p)1/p,Rp​(t)=6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​, Kp:=sup⁡{Rp(t):12≤t≤2}.K_p := \sup\{R_p(t) : \tfrac12\le t\le2\}.Kp​:=sup{Rp​(t):21​≤t≤2}.

(Ap(t)A_p(t)Ap​(t) and Bp(t)B_p(t)Bp​(t) are the coordinate ppp-norms of the cyclic triple (−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) and of its pairwise sums, and RpR_pRp​ is the corresponding value of (S−T)/(2S−P)(S-T)/(2S-P)(S−T)/(2S−P) for that triple.)

This theorem shows that for every real p≥256p\ge256p≥256, every finite index set ι\iotaι, and every x,y,z:ι→Cx,y,z:\iota\to\mathbb Cx,y,z:ι→C,

S−T  ≤  Kp (2S−P).S - T \;\le\; K_p\,(2S-P).S−T≤Kp​(2S−P).

This theorem gives the existence half of the sharp diagonal Hlawka inequality for complex coordinate norms: for every p≥256p\ge256p≥256, the explicit constant KpK_pKp​ is admissible, dimension-independently, with no assumption that x,y,zx,y,zx,y,z have equal norms. A companion theorem shows that any constant admissible for the complex coordinate ppp-norm on Cn\mathbb C^nCn in some fixed dimension n≥3n\ge3n≥3 is at least KpK_pKp​, for every p>1p>1p>1; combined with that lower bound, this theorem is what makes KpK_pKp​ the sharp (smallest possible) Hlawka constant for the coordinate ppp-norm on Cn\mathbb C^nCn in every dimension n≥3n\ge3n≥3 — equivalently, the smallest constant valid in all those finite dimensions at once — for every p≥256p\ge256p≥256. On its own, this theorem concerns the coordinate ℓp\ell^pℓp-quantity ∥⋅∥p\|\cdot\|_p∥⋅∥p​ on Cι\mathbb C^\iotaCι; a companion identity, showing that this same quantity equals the Schatten ppp-norm of the diagonal operator with entries vvv, carries the bound over to complex diagonal Schatten ppp-norms.

Formalization Note The index set ι\iotaι ranges over an arbitrary finite type (via a Fintype instance), not just Fin n, and may be empty.

Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic
import Definitions.Def_HlawkaSchatten_GapComparison
import Mathlib.Analysis.Complex.Circle
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Analysis.Convex.Deriv
import Mathlib.Analysis.Convex.Function
import Mathlib.Analysis.Convex.Integral
import Mathlib.Analysis.Convex.Jensen
import Mathlib.Analysis.Convex.SpecificFunctions.Basic
import Mathlib.Analysis.Convex.SpecificFunctions.Pow
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.InnerProductSpace.Dual
import Mathlib.Analysis.InnerProductSpace.NormPow
import Mathlib.Analysis.Normed.Lp.PiLp
import Mathlib.Analysis.Normed.Module.FiniteDimension
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
import Mathlib.Data.Fin.VecNotation
import Mathlib.Data.Real.Basic
import Mathlib.Data.Sign.Basic
import Mathlib.LinearAlgebra.Dimension.Finite
import Mathlib.MeasureTheory.Group.Integral
import Mathlib.MeasureTheory.Integral.Bochner.ContinuousLinearMap
import Mathlib.MeasureTheory.Measure.Haar.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Module
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Instances.Sign
import Mathlib.Topology.Order.Compact

/-
Copyright (c) 2026 Ezzeri Esa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ezzeri Esa
-/

/-!
# Transfer to complex coordinates

Finite convex combinations of real circle projections obey the real bound.
Continuity preserves this statement on their closure. The circle average
belongs to that closure and reproduces all seven complex norms with one
common positive factor.
-/


open MeasureTheory





variable {ι : Type*} [Fintype ι]

open HlawkaSchatten
open HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.complex_hlawka_bound {p : ℝ} (hp : 256 ≤ p) :
    HasHlawkaConstant (lpNorm p : (ι → ℂ) → ℝ) (cyclicConstant p) := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/ComplexTransfer.lean#L82-L120
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Sep 29, 2026

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

  • Endorsed by marwahaha · Sep 30, 2026

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