The Hlawka inequality for complex coordinate -norms with constant , for
ProvedHlawkaSchatten.DiagonalConstruction.complex_hlawka_boundFor a finite index set of any size (including the empty set, i.e. dimension zero) and a real exponent , write
for the finite coordinate -norm of a complex vector (with the complex modulus; a norm for ). For put
Let be the following explicit constant: with
( and are the coordinate -norms of the cyclic triple and of its pairwise sums, and is the corresponding value of for that triple.)
This theorem shows that for every real , every finite index set , and every ,
This theorem gives the existence half of the sharp diagonal Hlawka inequality for complex coordinate norms: for every , the explicit constant is admissible, dimension-independently, with no assumption that have equal norms. A companion theorem shows that any constant admissible for the complex coordinate -norm on in some fixed dimension is at least , for every ; combined with that lower bound, this theorem is what makes the sharp (smallest possible) Hlawka constant for the coordinate -norm on in every dimension — equivalently, the smallest constant valid in all those finite dimensions at once — for every . On its own, this theorem concerns the coordinate -quantity on ; a companion identity, showing that this same quantity equals the Schatten -norm of the diagonal operator with entries , carries the bound over to complex diagonal Schatten -norms.
Formalization Note The index set ranges over an arbitrary finite type (via a Fintype instance), not just Fin n, and may be empty.
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
theorem HlawkaSchatten.DiagonalConstruction.complex_hlawka_bound {p : ℝ} (hp : 256 ≤ p) :
HasHlawkaConstant (lpNorm p : (ι → ℂ) → ℝ) (cyclicConstant p) := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.