Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.8, p. 32 — Fenchel step: sup over λ ≥ 0 of λb − νλ log λ equals ν exp(b/ν − 1)

Proved
BootRobust.NWDual.fenchel_xlogx

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

convex-analysisconvex-conjugateentropyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ν>0\nu>0ν>0 and b∈Rb\in\mathbb Rb∈R. Then

sup⁡λ≥0(λb−νλlog⁡λ)=νexp⁡(bν−1),\sup_{\lambda\ge0}\big(\lambda b-\nu\lambda\log\lambda\big)=\nu\exp\Big(\frac b\nu-1\Big),λ≥0sup​(λb−νλlogλ)=νexp(νb​−1),

with the convention 0log⁡0=00\log0=00log0=0, and the supremum is attained (at λ=eb/ν−1\lambda=e^{b/\nu-1}λ=eb/ν−1).

This is the Fenchel conjugate of λ↦νλlog⁡λ\lambda\mapsto\nu\lambda\log\lambdaλ↦νλlogλ on [0,∞)[0,\infty)[0,∞); it evaluates the inner maximization over each coordinate PiP_iPi​ of the Lagrangian in the proof of Lemma 2.

Formalization Note The value at λ=0\lambda=0λ=0 uses Lean's Real.log 0 = 0, which is the convention 0log⁡0=00\log 0=00log0=0.

Preamble
import Mathlib
import Definitions.Def_BootRobust_NWDual_Setting
Formal statement
namespace BootRobust.NWDual

/-- B.8, p. 32 (Fenchel step): for `ν > 0`, `sup_{λ ≥ 0} (λ b − ν λ log λ) = ν exp(b/ν − 1)`,
and the supremum is attained. At `λ = 0` the term `λ log λ` is `0` (Lean's `Real.log 0 = 0`). -/
theorem fenchel_xlogx (ν b : ℝ) (hν : 0 < ν) :
    IsGreatest {x : ℝ | ∃ lam : ℝ, 0 ≤ lam ∧ x = lam * b - ν * lam * Real.log lam}
      (ν * Real.exp (b / ν - 1)) := by sorry

end BootRobust.NWDual
Source
Bertsimas and Van Parys, Bootstrap robust prescriptive analytics, arXiv:1711.09974v2, B.8 (proof of Lemma 2), p. 32, 'The inner maximization problems over λ can be dealt with using the Fenchel conjugate of the λ ↦ λ · log λ function'
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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