Lemma 2 — |v(x + h eⁱ, Y) − v(x, Y)| ≤ h r̄ with r̄ = max_j r^j
ProvedRLPBidPrice.Unbiased.lemma2_lipschitz_boundLet be a 0/1 leg–itinerary incidence matrix with nonzero columns, the fares, a capacity vector and a demand vector, and let . For every leg and every ,
where is the -th unit vector.
This bound is what the paper means by " satisfies the Lipschitz condition in Lemma 1": it gives the constant in each coordinate direction, uniformly in .
Formalization Note. is written (⨆ j, r j), which is for and when there are no itineraries. The paper's "for all " is restricted to : for capacities with a negative entry the LP is infeasible and has no value. Fares are an implicit hypothesis (revenues): if every then and the bound fails. The time index is dropped.
import Mathlib import Definitions.Def_RLPBidPrice_Unbiased_Model open MeasureTheory Matrix
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a real matrix whose entries are all or and whose every column has a nonzero entry. Assume further:
- with coordinatewise;
- with ;
- with ;
- a row index and a real .
Write
a real supremum that is if the set is empty. The inequalities are coordinatewise. Let be the -th unit vector. The statement asserts
where is the largest of .
Degenerate cases.
- The row index must exist, so . For there are no instances.
- If , the supremum over an empty index set is by convention, and both values of are .
- If , both sides are .
- Both and are nonnegative, so the feasible sets contain and are nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.