Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 210 — for x > 0, ∇ₓv(x, Y) exists iff the optimal dual price vector is unique

Proved
RLPBidPrice.Unbiased.gradient_iff_unique_dual

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

linear-programmingp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-managementsensitivity-analysis

Let AAA be a 0/1 incidence matrix with nonzero columns, r≥0r \ge 0r≥0, Y≥0Y \ge 0Y≥0, and let xxx be a capacity vector with every component xi>0x^i > 0xi>0. Then the perfect-information LP value x′↦v(x′,Y)=max⁡{r⊤y:Ay≤x′, 0≤y≤Y}x' \mapsto v(x', Y) = \max\{r^\top y : Ay \le x',\ 0 \le y \le Y\}x′↦v(x′,Y)=max{r⊤y:Ay≤x′, 0≤y≤Y} is (Fréchet) differentiable at xxx if and only if the problem

min⁡μ≥0L(x,μ),L(x,μ)=∑j=1nYj(rj−μ⊤Aj)++μ⊤x,\min_{\mu \ge 0} L(x, \mu), \qquad L(x, \mu) = \sum_{j=1}^n Y^j (r^j - \mu^\top A^j)^+ + \mu^\top x,μ≥0min​L(x,μ),L(x,μ)=j=1∑n​Yj(rj−μ⊤Aj)++μ⊤x,

has exactly one solution, i.e. the optimal vector of dual prices μ(x,Y)\mu(x, Y)μ(x,Y) of the capacity constraints Ay≤xAy \le xAy≤x is unique.

This is the reduction of the paper's differentiability question to uniqueness of the dual prices.

Formalization Note. The paper's "μ(Y)\mu(Y)μ(Y)" is μ(x,Y)\mu(x, Y)μ(x,Y) at the fixed capacity xxx. Differentiability is taken at an interior capacity x>0x > 0x>0, where a neighbourhood of xxx consists of feasible capacities; at a boundary point of {x≥0}\{x \ge 0\}{x≥0} the two-sided derivative is not meaningful. Dual optimality is minimization of the Lagrangian (13) over μ≥0\mu \ge 0μ≥0 (Eq. (14)). The time index kkk is dropped.

Preamble
import Mathlib
import Definitions.Def_RLPBidPrice_Unbiased_Model

open MeasureTheory Matrix
Formal statement
namespace RLPBidPrice.Unbiased

theorem gradient_iff_unique_dual {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r : Fin n → ℝ)
    (hA : IsIncidence A) (hr : 0 ≤ r) (x : Fin m → ℝ) (hx : ∀ i, 0 < x i)
    (y₀ : Fin n → ℝ) (hy₀ : 0 ≤ y₀) :
    DifferentiableAt ℝ (fun x' => piValue A r x' y₀) x ↔ ∃! μ, IsDualOpt A r x y₀ μ := by sorry

end RLPBidPrice.Unbiased
Source
Talluri, van Ryzin, A Randomized Linear Programming Method for Computing Network Bid Prices, Transp. Sci. 33(2), 1999, p. 210, §2.1, text after Lemma 2 (unnumbered)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let AAA be a real m×nm \times nm×n matrix whose entries are all 000 or 111 and whose every column has a nonzero entry. Assume further:

  • r∈Rnr \in \mathbb{R}^nr∈Rn with r≥0r \ge 0r≥0;
  • x∈Rmx \in \mathbb{R}^mx∈Rm with every coordinate strictly positive, xi>0x_i > 0xi​>0;
  • y0∈Rny_0 \in \mathbb{R}^ny0​∈Rn with y0≥0y_0 \ge 0y0​≥0.

Define, for any x′∈Rmx' \in \mathbb{R}^mx′∈Rm,

v(x′)=sup⁡{r⋅y:Ay≤x′, 0≤y≤y0}.v(x') = \sup\{ r \cdot y : Ay \le x',\ 0 \le y \le y_0\}.v(x′)=sup{r⋅y:Ay≤x′, 0≤y≤y0​}.

This is a real supremum, 000 when the set is empty. Since A≥0A \ge 0A≥0, that happens exactly when some xi′<0x'_i < 0xi′​<0.

Define

L(μ)=∑j(y0)jmax⁡(0,rj−∑iμiAij)+μ⋅x.L(\mu) = \sum_j (y_0)_j \max\Big(0, r_j - \sum_i \mu_i A_{ij}\Big) + \mu \cdot x.L(μ)=j∑​(y0​)j​max(0,rj​−i∑​μi​Aij​)+μ⋅x.

Call μ∈Rm\mu \in \mathbb{R}^mμ∈Rm dual-optimal if μ≥0\mu \ge 0μ≥0 and L(μ)≤L(μ′)L(\mu) \le L(\mu')L(μ)≤L(μ′) for all μ′≥0\mu' \ge 0μ′≥0.

The statement asserts an equivalence:

v is (Freˊchet) differentiable at x  as a function on all of Rm  ⟺  there exists exactly one dual-optimal μ.v \text{ is (Fréchet) differentiable at } x \ \text{ as a function on all of } \mathbb{R}^m \iff \text{there exists exactly one dual-optimal } \mu.v is (Freˊchet) differentiable at x  as a function on all of Rm⟺there exists exactly one dual-optimal μ.

Degenerate cases.

  • If m=0m = 0m=0, the incidence condition forces n=0n = 0n=0. Then R0\mathbb{R}^0R0 is a single point, vvv is trivially differentiable, and the unique vector is dual-optimal. Both sides hold.
  • If n=0n = 0n=0 (with m≥1m \ge 1m≥1), v≡0v \equiv 0v≡0 near xxx and L(μ)=μ⋅xL(\mu) = \mu \cdot xL(μ)=μ⋅x. The asserted equivalence covers this case too.
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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