The absolute-value power is convex on for every
ProvedHlawkaSchatten.convexOn_abs_rpowconvexityhlawka-schattenpower-potentialscalar-comparison
Let with . Then
This is the elementary convexity fact underlying the scalar Bregman comparison built from the power potential (powerPotential): since , dividing a convex function by preserves convexity, so this theorem also gives convexity of , and, for , in turn nonnegativity of its Bregman divergence , where (powerGradient) is 's gradient.
Preamble
import Mathlib.Analysis.Convex.Deriv import Mathlib.Analysis.Convex.SpecificFunctions.Basic import Mathlib.Analysis.InnerProductSpace.Basic import Mathlib.Analysis.InnerProductSpace.Dual import Mathlib.Analysis.InnerProductSpace.NormPow import Mathlib.Data.Sign.Basic import Mathlib.Topology.Instances.Sign /- Copyright (c) 2026 Ezzeri Esa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ezzeri Esa -/ /-! # Scalar power Bregman data These are the scalar objects used in the first layer of the audited Bregman--Mazur proof. The normalization of `powerPotential` is important: its derivative is the signed `(p - 1)`-power with no extra factor of `p`. -/ open Filter open scoped Topology
Formal statement
theorem HlawkaSchatten.convexOn_abs_rpow {p : ℝ} (hp : 1 ≤ p) :
ConvexOn ℝ Set.univ (fun x : ℝ ↦ |x| ^ p) := by sorry
Source
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.