Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — |v(x + h eⁱ, Y) − v(x, Y)| ≤ h r̄ with r̄ = max_j r^j

Proved
RLPBidPrice.Unbiased.lemma2_lipschitz_bound

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

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

Let AAA be a 0/1 leg–itinerary incidence matrix with nonzero columns, r≥0r \ge 0r≥0 the fares, x≥0x \ge 0x≥0 a capacity vector and Y≥0Y \ge 0Y≥0 a demand vector, and let v(x,Y)=max⁡{r⊤y:Ay≤x, 0≤y≤Y}v(x, Y) = \max\{r^\top y : Ay \le x,\ 0 \le y \le Y\}v(x,Y)=max{r⊤y:Ay≤x, 0≤y≤Y}. For every leg iii and every h≥0h \ge 0h≥0,

∣v(x+hei,Y)−v(x,Y)∣≤h rˉ,rˉ=max⁡jrj,|v(x + h e^i, Y) - v(x, Y)| \le h\, \bar r, \qquad \bar r = \max_{j} r^j,∣v(x+hei,Y)−v(x,Y)∣≤hrˉ,rˉ=jmax​rj,

where eie^iei is the iii-th unit vector.

This bound is what the paper means by "vk(x,Y)v_k(x, Y)vk​(x,Y) satisfies the Lipschitz condition in Lemma 1": it gives the constant K=rˉK = \bar rK=rˉ in each coordinate direction, uniformly in YYY.

Formalization Note. rˉ\bar rrˉ is written sup⁡jrj\sup_j r^jsupj​rj (⨆ j, r j), which is max⁡jrj\max_j r^jmaxj​rj for n≥1n \ge 1n≥1 and 000 when there are no itineraries. The paper's "for all xxx" is restricted to x≥0x \ge 0x≥0: for capacities with a negative entry the LP is infeasible and has no value. Fares r≥0r \ge 0r≥0 are an implicit hypothesis (revenues): if every rj<0r^j < 0rj<0 then v≡0v \equiv 0v≡0 and the bound hrˉ<0h \bar r < 0hrˉ<0 fails. The time index kkk is dropped.

Preamble
import Mathlib
import Definitions.Def_RLPBidPrice_Unbiased_Model

open MeasureTheory Matrix
Formal statement
namespace RLPBidPrice.Unbiased

theorem lemma2_lipschitz_bound {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r : Fin n → ℝ)
    (hA : IsIncidence A) (hr : 0 ≤ r) (x : Fin m → ℝ) (hx : 0 ≤ x)
    (y₀ : Fin n → ℝ) (hy₀ : 0 ≤ y₀) (i : Fin m) (h : ℝ) (hh : 0 ≤ h) :
    |piValue A r (x + h • Pi.single i 1) y₀ - piValue A r x y₀| ≤ h * ⨆ j, r j := 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, Lemma 2 and the sentence preceding it
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 coordinatewise;
  • x∈Rmx \in \mathbb{R}^mx∈Rm with x≥0x \ge 0x≥0;
  • y0∈Rny_0 \in \mathbb{R}^ny0​∈Rn with y0≥0y_0 \ge 0y0​≥0;
  • a row index iii and a real h≥0h \ge 0h≥0.

Write

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

a real supremum that is 000 if the set is empty. The inequalities are coordinatewise. Let eie_iei​ be the iii-th unit vector. The statement asserts

∣v(x+hei,y0)−v(x,y0)∣  ≤  h⋅sup⁡jrj,\big| v(x + h e_i, y_0) - v(x, y_0) \big| \;\le\; h \cdot \sup_{j} r_j,​v(x+hei​,y0​)−v(x,y0​)​≤h⋅jsup​rj​,

where sup⁡jrj\sup_j r_jsupj​rj​ is the largest of r1,…,rnr_1,\dots,r_nr1​,…,rn​.

Degenerate cases.

  • The row index iii must exist, so m≥1m \ge 1m≥1. For m=0m = 0m=0 there are no instances.
  • If n=0n = 0n=0, the supremum over an empty index set is 000 by convention, and both values of vvv are 000.
  • If h=0h = 0h=0, both sides are 000.
  • Both xxx and x+heix + h e_ix+hei​ are nonnegative, so the feasible sets contain y=0y = 0y=0 and are nonempty.
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