Proof of Proposition 2, p. 212 (corrected: the dual optimal set of (14)) — ∂v(x, Y) = {optimal dual prices}, uniformly bounded by r̄
ProvedRLPBidPrice.Directional.superdiff_eq_dualOptLet be a 0/1 incidence matrix with nonzero columns, , a capacity vector with every component , and a demand vector. Then the superdifferential of the concave function at ,
is exactly the set of optimal vectors of dual prices,
and every satisfies for every leg . In particular is bounded uniformly in .
Formalization Note. The superdifferential is taken over the feasible capacities . is written ⨆ j, r j. is the paper's implicit setting for differentiating at a capacity vector (at a zero capacity the dual prices of that leg are unbounded). The time index is dropped.
Correction. The paper states , which omits the dual variables of the constraints . With one leg, one itinerary, , and , the printed set is while has superdifferential at .
import Mathlib import Definitions.Def_RLPBidPrice_Directional_Model open MeasureTheory Matrix
namespace RLPBidPrice.Directional
/-- Proof of Proposition 2, p. 212 (corrected): for `x > 0` the superdifferential of
`z ↦ v(z, y₀)` at `x` is the set of optimal dual price vectors of (14), and it lies in the box
`0 ≤ μ ≤ r̄`, `r̄ = max_j r^j`, whatever `y₀` is. -/
theorem superdiff_eq_dualOpt {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₀) :
superdiff A r x y₀ = {μ | IsDualOpt A r x y₀ μ} ∧
∀ μ ∈ superdiff A r x y₀, ∀ i, 0 ≤ μ i ∧ μ i ≤ ⨆ j, r j := 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 .
Definitions used.
- , which is if the set is empty.
- is the set of all (no sign restriction) with
- is the set of all that minimise
over all .
Conclusion. Both of the following hold:
- , as sets.
- Every satisfies
where is the real supremum over . For this is , and for it is .
Neither part asserts that the set is nonempty.
Degenerate cases.
- If : the incidence hypothesis forces . Both sets are then the one-point set , and the box condition is vacuous.
- If and : on and , so both sets must equal . The box becomes .
- If : on , and the claim covers this case too.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.