Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The absolute-value power ∣x∣p|x|^p∣x∣p is convex on R\mathbb RR for every p≥1p \ge 1p≥1

Proved
HlawkaSchatten.convexOn_abs_rpow

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

convexityhlawka-schattenpower-potentialscalar-comparison

Let p∈Rp \in \mathbb Rp∈R with p≥1p \ge 1p≥1. Then

x↦∣x∣p is convex on all of R.x \mapsto |x|^{p} \text{ is convex on all of } \mathbb R.x↦∣x∣p is convex on all of R.

This is the elementary convexity fact underlying the scalar Bregman comparison built from the power potential Fp(x)=∣x∣p/pF_p(x)=|x|^p/pFp​(x)=∣x∣p/p (powerPotential): since p≥1>0p \ge 1 > 0p≥1>0, dividing a convex function by ppp preserves convexity, so this theorem also gives convexity of FpF_pFp​, and, for p>1p>1p>1, in turn nonnegativity of its Bregman divergence βp(a,b)=Fp(a)−Fp(b)−Gp(b)(a−b)\beta_p(a,b)=F_p(a)-F_p(b)-G_p(b)(a-b)βp​(a,b)=Fp​(a)−Fp​(b)−Gp​(b)(a−b), where Gp(x)=∣x∣p−2xG_p(x)=|x|^{p-2}xGp​(x)=∣x∣p−2x (powerGradient) is FpF_pFp​'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
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/ScalarBregman.lean#L222-L241
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me