Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A rough exponent bound Kp≤pK_p\le pKp​≤p for the cyclic candidate constant

Proved
HlawkaSchatten.DiagonalConstruction.cyclicConstant_le_exponent

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

cyclic-constanthlawka-schattenscalar-envelopesharp-constantupper-bound

For a real exponent ppp and t≥0t\ge0t≥0, let Ap(t)=(tp+2)1/pA_p(t)=(t^p+2)^{1/p}Ap​(t)=(tp+2)1/p, Bp(t)=(2∣1−t∣p+2p)1/pB_p(t)=(2|1-t|^p+2^p)^{1/p}Bp​(t)=(2∣1−t∣p+2p)1/p, and

Rp(t)  =  3Ap(t)−31/p∣2−t∣6Ap(t)−3Bp(t)R_p(t) \;=\; \frac{3A_p(t)-3^{1/p}|2-t|}{6A_p(t)-3B_p(t)}Rp​(t)=6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​

be the cyclic ratio built from the cyclic 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) and their pairwise sums. Let

Kp  =  sup⁡{Rp(t):1/2≤t≤2}K_p \;=\; \sup\{R_p(t) : 1/2\le t\le2\}Kp​=sup{Rp​(t):1/2≤t≤2}

be the cyclic candidate constant. Here, for a finite index set ι\iotaι and x:ι→Rx:\iota\to\mathbb Rx:ι→R, ∥x∥p=(∑i∣xi∣p)1/p\|x\|_p=\bigl(\sum_i|x_i|^p\bigr)^{1/p}∥x∥p​=(∑i​∣xi​∣p)1/p is the coordinate ppp-norm, and for t≥0t\ge0t≥0, Ap(t)A_p(t)Ap​(t) is the value of ∥⋅∥p\|\cdot\|_p∥⋅∥p​ on each cyclic vector and Bp(t)B_p(t)Bp​(t) its value on each of their pairwise sums. For x,y,z:ι→Rx,y,z:\iota\to\mathbb Rx,y,z:ι→R let tripleGap(x,y,z)=∥x∥p+∥y∥p+∥z∥p−∥x+y+z∥p\mathrm{tripleGap}(x,y,z)=\|x\|_p+\|y\|_p+\|z\|_p-\|x+y+z\|_ptripleGap(x,y,z)=∥x∥p​+∥y∥p​+∥z∥p​−∥x+y+z∥p​ be the triple deficit, and pairGapSum(x,y,z)\mathrm{pairGapSum}(x,y,z)pairGapSum(x,y,z) the sum of the three pair deficits ∥u∥p+∥v∥p−∥u+v∥p\|u\|_p+\|v\|_p-\|u+v\|_p∥u∥p​+∥v∥p​−∥u+v∥p​ over {u,v}={x,y},{x,z},{y,z}\{u,v\}=\{x,y\},\{x,z\},\{y,z\}{u,v}={x,y},{x,z},{y,z}. A real CCC is an admissible Hlawka constant for ∥⋅∥p\|\cdot\|_p∥⋅∥p​ when tripleGap(x,y,z)≤C⋅pairGapSum(x,y,z)\mathrm{tripleGap}(x,y,z)\le C\cdot\mathrm{pairGapSum}(x,y,z)tripleGap(x,y,z)≤C⋅pairGapSum(x,y,z) for all x,y,zx,y,zx,y,z.

The theorem states that for every real exponent p>1p>1p>1,

Kp  ≤  p.K_p \;\le\; p.Kp​≤p.

This is a coarse, purely exponent-dependent upper bound on KpK_pKp​, valid for every real p>1p>1p>1. It complements the separate results that KpK_pKp​ is admissible for complex diagonal triples in every finite dimension when p≥256p\ge256p≥256 and that every admissible constant in some dimension n≥3n\ge3n≥3 is at least KpK_pKp​.

Preamble
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
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.cyclicConstant_le_exponent {p : ℝ} (hp : 1 < p) : cyclicConstant p ≤ p := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/ScalarEnvelope.lean#L13-L16
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