Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma B.1, p. 28 — u(x) − xu′(x) is strictly increasing for increasing, strictly concave, differentiable u on ℝ₊

Proved
AddictivePlatforms.Compete.lemma_B_1

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

concavityconvex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let u:R+→Ru : \mathbb{R}_+ \to \mathbb{R}u:R+​→R be increasing, strictly concave and differentiable. Then the function

x⟼u(x)−x u′(x)x \longmapsto u(x) - x\,u'(x)x⟼u(x)−xu′(x)

is strictly increasing on R+\mathbb{R}_+R+​.

Geometrically, u(x)−xu′(x)u(x) - x u'(x)u(x)−xu′(x) is the intercept at 000 of the tangent line to uuu at xxx; for a strictly concave function this intercept rises as the point of tangency moves right. In the paper it is the marginal value of an additional (fractional) platform, and the lemma drives the concavity statements of Lemmas B.2 and B.3.

Formalization Note. uuu is a function on R\mathbb{R}R of which only the restriction to [0,∞)[0,\infty)[0,∞) matters; monotonicity, strict concavity and differentiability are required on [0,∞)[0,\infty)[0,∞), and u′(x)u'(x)u′(x) is the derivative within [0,∞)[0,\infty)[0,∞) (one-sided at 000).

Preamble
import Mathlib

open Set
Formal statement
namespace AddictivePlatforms.Compete

/-- Lemma B.1 (p. 28): for an increasing, strictly concave, differentiable `u : ℝ₊ → ℝ`,
`u(x) − x u′(x)` is strictly increasing on `ℝ₊` (the derivative is one-sided at `0`). -/
theorem lemma_B_1 (u : ℝ → ℝ) (hmono : MonotoneOn u (Ici 0))
    (hconc : StrictConcaveOn ℝ (Ici 0) u) (hdiff : DifferentiableOn ℝ u (Ici 0)) :
    StrictMonoOn (fun x => u x - x * derivWithin u (Ici 0) x) (Ici 0) := by sorry

end AddictivePlatforms.Compete
Source
Ichihashi & Kim, Addictive Platforms, Bank of Canada SWP 2022-16 (Apr. 1, 2022), p. 28, Lemma B.1
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me