Proof of Proposition 2, p. 212 — D(x, Y; d) = lim_{h↓0} (1/h)[v(x + hd, Y) − v(x, Y)] = inf{dᵀμ : μ ∈ ∂v(x, Y)}
ProvedRLPBidPrice.Directional.piValue_directional_derivativeLet be a 0/1 incidence matrix with nonzero columns, , a capacity vector with every component , and a demand vector. For every direction the one-sided directional derivative of at exists and equals the least value of over the superdifferential:
where .
The paper cites this as a known fact about concave functions (Bazaraa, Sherali and Shetty 1993, p. 218) and applies it to the LP value in each demand scenario.
Formalization Note. The limit is one-sided, (nhdsWithin 0 (Set.Ioi 0)): the two-sided limit written in the paper as does not exist in the nondifferentiable case this section treats (one leg, one itinerary, , , , : the right quotient is , the left one is ). For small , because . The infimum is a real sInf; for the superdifferential is nonempty and bounded, so it is an attained minimum. The time index is dropped.
import Mathlib import Definitions.Def_RLPBidPrice_Directional_Model open MeasureTheory Matrix
namespace RLPBidPrice.Directional
/-- Proof of Proposition 2, p. 212 (Bazaraa–Sherali–Shetty): at `x > 0` the one-sided
directional derivative of `z ↦ v(z, y₀)` in the direction `d` exists and equals
`inf { dᵀμ : μ ∈ ∂v(x, y₀) }`. -/
theorem piValue_directional_derivative {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₀) (d : Fin m → ℝ) :
Filter.Tendsto (fun h : ℝ => h⁻¹ * (piValue A r (x + h • d) y₀ - piValue A r x y₀))
(nhdsWithin 0 (Set.Ioi 0))
(nhds (sInf ((fun μ : Fin m → ℝ => d ⬝ᵥ μ) '' superdiff A r x y₀))) := by sorry
end RLPBidPrice.Directional
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let , let be a real matrix, and let . All vector inequalities are componentwise.
Hypotheses.
- is an incidence matrix: every entry is or , and every column has at least one nonzero entry.
- .
- with for every .
- with .
- is any direction, with no sign or size restriction.
Definitions used.
- , which is if the set is empty.
- is the set of all with for every .
Conclusion.
The limit is taken as tends to through strictly positive reals, and it is asserted to exist and to be a finite real number. The right-hand side is the real infimum, which by convention is if is empty or if is unbounded below on it. So in those cases the statement asserts that the one-sided difference quotient tends to .
Degenerate cases.
- Because , the point stays for all small , so the junk value of at infeasible capacities does not enter the limit.
- If : the quotient is identically . The claim then says the infimum of (or of the empty set) is , which holds in both cases.
- If : the incidence hypothesis forces , and everything is .
- If and : near , so the claim is and the infimum must be .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.