Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform lower and upper bounds for the coordinate norm Hessian

Definition
HlawkaSchatten_DiagonalConstruction_HessianBounds

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

convexitydiagonal-constructionhessian-boundshlawka-schattenschatten-norm

Two explicit real-valued functions of a single real exponent ppp supply uniform coefficients for the second directional derivative of the finite coordinate power functional (normHessian, defined in the NormHessian bundle).

lowerHessianCoefficient sends ppp to

(p−1) (43/100)p−23 (157/100)p−1.\frac{(p-1)\,(43/100)^{p-2}}{3\,(157/100)^{p-1}}.3(157/100)p−1(p−1)(43/100)p−2​.

upperHessianCoefficient sends ppp to

2(p−1) (19/50)p−2(81/50)p−1.\frac{2(p-1)\,(19/50)^{p-2}}{(81/50)^{p-1}}.(81/50)p−12(p−1)(19/50)p−2​.

Both are ordinary real-power expressions, defined by Lean's totalized real power for every real ppp. The two Hessian-bound theorems that accompany them in the same source module assume a real exponent p>2p>2p>2: for vectors v,h∈R3v,h\in\mathbb{R}^3v,h∈R3, lowerHessianCoefficient(p)(p)(p) times the squared Euclidean length of h−avh-a vh−av, with a=radialCoefficient⁡(p,v,h)a=\operatorname{radialCoefficient}(p,v,h)a=radialCoefficient(p,v,h), is a lower bound for normHessian⁡(p,v,h)\operatorname{normHessian}(p,v,h)normHessian(p,v,h) whenever every coordinate of vvv has absolute value between 43/10043/10043/100 and 157/100157/100157/100; and normHessian⁡(p,v,h)\operatorname{normHessian}(p,v,h)normHessian(p,v,h) is at most upperHessianCoefficient(p)(p)(p) times the plain squared Euclidean length of hhh whenever one coordinate of vvv has absolute value at least 81/5081/5081/50 and every other coordinate has absolute value at most 19/5019/5019/50. These are exactly the two coordinate patterns that arise on the cyclic coordinate box (entryBox, in the Localization bundle), where the two coefficients are used together to bound the deficit Hessian from below.

Definition code
import Mathlib.Analysis.Complex.ExponentialBounds
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.Abel
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
-/

/-! # Uniform lower and upper bounds for the norm Hessian -/

namespace HlawkaSchatten.DiagonalConstruction

noncomputable def lowerHessianCoefficient (p : ℝ) : ℝ :=
  (p - 1) * (43 / 100 : ℝ) ^ (p - 2) / (3 * (157 / 100 : ℝ) ^ (p - 1))

noncomputable def upperHessianCoefficient (p : ℝ) : ℝ :=
  2 * (p - 1) * (19 / 50 : ℝ) ^ (p - 2) / (81 / 50 : ℝ) ^ (p - 1)













end HlawkaSchatten.DiagonalConstruction
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/HessianBounds.lean#L13-L17
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