Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Positive multipliers preserve amplitude weights in ordinary derivatives

Proved
BianchiIX.multiplier_radial_derivative

by trppppp · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

bianchi-ix-era-statisticsdynamical-systems

Let u,m:R→Ru,m:\mathbb R\to\mathbb Ru,m:R→R be differentiable at xxx, u(x)≥0u(x)\geq0u(x)≥0, m(x)>0m(x)>0m(x)>0, and suppose f=umf=umf=um near xxx. If ∣u′(x)∣≤au(x)|u'(x)|\leq a u(x)∣u′(x)∣≤au(x) and ∣(log⁡m)′(x)∣≤b|(\log m)'(x)|\leq b∣(logm)′(x)∣≤b, then fff is differentiable at xxx, f(x)≥0f(x)\geq0f(x)≥0, and

f′(x)=m(x)(u′(x)+u(x)(log⁡m)′(x)),∣f′(x)∣≤f(x)(a+b).f'(x)=m(x)\bigl(u'(x)+u(x)(\log m)'(x)\bigr),\qquad |f'(x)|\leq f(x)(a+b).f′(x)=m(x)(u′(x)+u(x)(logm)′(x)),∣f′(x)∣≤f(x)(a+b).

If u(x)=0u(x)=0u(x)=0, both f(x)f(x)f(x) and f′(x)f'(x)f′(x) vanish.

Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Deriv
import Mathlib.Analysis.Calculus.Deriv.Add
import Mathlib.Analysis.Calculus.Deriv.Mul
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

namespace BianchiIX
end BianchiIX

noncomputable section
open BianchiIX
open Filter
open scoped Topology

Formal statement
theorem BianchiIX.multiplier_radial_derivative {u m f : ℝ → ℝ} {x a b : ℝ}
    (hu : DifferentiableAt ℝ u x) (hm : DifferentiableAt ℝ m x)
    (hu0 : 0 ≤ u x) (hm0 : 0 < m x)
    (heq : f =ᶠ[𝓝 x] fun y => u y * m y)
    (hdu : |deriv u x| ≤ a * u x)
    (hdl : |deriv (fun y => Real.log (m y)) x| ≤ b) :
    DifferentiableAt ℝ f x ∧ 0 ≤ f x ∧
      deriv f x = m x * (deriv u x + u x * deriv (fun y => Real.log (m y)) x) ∧
      |deriv f x| ≤ f x * (a + b) ∧
      (u x = 0 → f x = 0 ∧ deriv f x = 0) := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Analysis/MultiplierRadialDerivative.lean#L15-L44

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