Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

First derivative of the triple Hlawka deficit along a line (deficitSlope)

Definition
HlawkaSchatten_DiagonalConstruction_BoxConvexity

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

convexityderivativehlawka-inequalityhlawka-schatten

For a real exponent ppp, a real constant KKK, and two triples X,ZX, ZX,Z (each a Triple, i.e. three vectors in R3\mathbb{R}^3R3 packaged as Fin 3 → Fin 3 → ℝ), deficitSlope defines

deficitSlope(p,K,X,Z)=(2K−1)∑jnormSlopep(Xj,Zj)  +  normSlopep(∑jXj, ∑jZj)  −  K∑jnormSlopep(pairTriple(X)j, pairTriple(Z)j),\begin{gathered} \mathrm{deficitSlope}(p,K,X,Z) = (2K-1)\sum_{j} \mathrm{normSlope}_p(X_j, Z_j) \\ \;+\; \mathrm{normSlope}_p\Big(\sum_j X_j,\ \sum_j Z_j\Big) \;-\; K\sum_{j} \mathrm{normSlope}_p\big(\mathrm{pairTriple}(X)_j,\ \mathrm{pairTriple}(Z)_j\big), \end{gathered}deficitSlope(p,K,X,Z)=(2K−1)j∑​normSlopep​(Xj​,Zj​)+normSlopep​(j∑​Xj​, j∑​Zj​)−Kj∑​normSlopep​(pairTriple(X)j​, pairTriple(Z)j​),​

where normSlope is, for p>1p>1p>1 and a nonzero base vector, the directional derivative of lpNorm p at that vector in a given direction, and pairTriple returns the three pairwise column sums of a triple.

For p>1p>1p>1, and at any XXX whose three columns, three pairwise column sums and column total are all nonzero (as they are throughout the cyclic coordinate box), this is exactly the derivative at t=0t=0t=0, along the line X+tZX + tZX+tZ, of the quantity K⋅(pair-deficit sum)−(triple deficit)K\cdot(\text{pair-deficit sum}) - (\text{triple deficit})K⋅(pair-deficit sum)−(triple deficit) built from lpNorm p on the three columns of XXX: the quantity whose nonnegativity on a box around the cyclic sign matrix (the cyclic witness triple at parameter t=1t=1t=1) shows KKK is a valid Hlawka constant there. deficitSlope is the first-order tool for that convexity argument; its own derivative, deficitHessian, is what actually gets checked for a sign.

Definition code
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_BoxCoordinates
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_BoxGeometry
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Localization
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_NormHessian
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.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.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
-/

/-! # Convexity of the sharp deficit on the cyclic box -/

namespace HlawkaSchatten.DiagonalConstruction

noncomputable def deficitSlope (p K : ℝ) (X Z : Triple) : ℝ :=
  (2 * K - 1) * (∑ j, normSlope p (X j) (Z j)) +
    normSlope p (totalTriple X) (totalTriple Z) -
      K * (∑ j, normSlope p (pairTriple X j) (pairTriple Z j))

















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