Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The signed power x↦sgn⁡(x)∣x∣qx \mapsto \operatorname{sgn}(x)|x|^{q}x↦sgn(x)∣x∣q is strictly increasing for every exponent q>0q>0q>0

Proved
HlawkaSchatten.strictMono_signedPower

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

hlawka-schattenmazur-mapmonotonicityscalar-comparison

Let q∈Rq \in \mathbb Rq∈R with q>0q>0q>0. For x∈Rx \in \mathbb Rx∈R write signedPower(q,x)=sgn⁡(x) ∣x∣q\mathrm{signedPower}(q,x)=\operatorname{sgn}(x)\,|x|^{q}signedPower(q,x)=sgn(x)∣x∣q (with sgn⁡(0)=0\operatorname{sgn}(0)=0sgn(0)=0). Then

signedPower(q,⋅) is strictly monotone on R,\mathrm{signedPower}(q,\cdot) \text{ is strictly monotone on } \mathbb R,signedPower(q,⋅) is strictly monotone on R,

that is, x<yx<yx<y implies sgn⁡(x)∣x∣q<sgn⁡(y)∣y∣q\operatorname{sgn}(x)|x|^{q}<\operatorname{sgn}(y)|y|^{q}sgn(x)∣x∣q<sgn(y)∣y∣q for all real x,yx,yx,y.

Strict monotonicity makes signedPower(q,⋅)\mathrm{signedPower}(q,\cdot)signedPower(q,⋅) injective: if two inputs give the same signed power, they must be equal. This underlies its use as an order-preserving change of variables -- for instance in the scalar Mazur map ψp(x)=signedPower(p/2,x)\psi_p(x)=\mathrm{signedPower}(p/2,x)ψp​(x)=signedPower(p/2,x) for p>0p>0p>0 -- where recovering xxx from ψp(x)\psi_p(x)ψp​(x) reduces to this injectivity, and comparing the order of two scalar quantities after applying the map reduces to the strict monotonicity itself.

Formalization Note. Strict monotonicity alone gives injectivity, not a full two-sided inverse function on R\mathbb RR; producing one additionally needs continuity (continuous_signedPower, proved separately for q>0q>0q>0) together with the fact that signedPower(q,⋅)\mathrm{signedPower}(q,\cdot)signedPower(q,⋅) is unbounded in both directions.

Preamble
import Definitions.Def_HlawkaSchatten_ScalarBregman
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

open Filter
open scoped Topology

open HlawkaSchatten
Formal statement
theorem HlawkaSchatten.strictMono_signedPower {q : ℝ} (hq : 0 < q) : StrictMono (signedPower q) := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/ScalarBregman.lean#L135-L163
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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