A rough exponent bound for the cyclic candidate constant
ProvedHlawkaSchatten.DiagonalConstruction.cyclicConstant_le_exponentFor a real exponent and , let , , and
be the cyclic ratio built from the cyclic vectors and their pairwise sums. Let
be the cyclic candidate constant. Here, for a finite index set and , is the coordinate -norm, and for , is the value of on each cyclic vector and its value on each of their pairwise sums. For let be the triple deficit, and the sum of the three pair deficits over . A real is an admissible Hlawka constant for when for all .
The theorem states that for every real exponent ,
This is a coarse, purely exponent-dependent upper bound on , valid for every real . It complements the separate results that is admissible for complex diagonal triples in every finite dimension when and that every admissible constant in some dimension is at least .
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Mathlib.Analysis.Convex.Deriv import Mathlib.Analysis.Convex.Function import Mathlib.Analysis.Convex.Jensen import Mathlib.Analysis.Convex.SpecificFunctions.Basic import Mathlib.Analysis.InnerProductSpace.Basic import Mathlib.Analysis.InnerProductSpace.Dual import Mathlib.Analysis.InnerProductSpace.NormPow import Mathlib.Analysis.Normed.Lp.PiLp import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Data.Fin.VecNotation import Mathlib.Data.Real.Basic import Mathlib.Data.Sign.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination 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 -/ /-! # Monotonicity of the scalar envelope -/ open HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalConstruction.cyclicConstant_le_exponent {p : ℝ} (hp : 1 < p) : cyclicConstant p ≤ p := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.