App. B.2, p. 333 — is the unique optimum of DLP
ProvedChoicePAC.MidPoint.perturbation_unique_optimumConsider a valid instance satisfying Assumptions 2.1 and 2.2, let be the optimal solution of , and let . Define by for and
If the feasibility conditions
hold (componentwise; denotes the nonbinding resources and types at ), then is the unique optimal solution of .
This is how the paper tracks the re-solved DLP solution of PAC when the remaining capacity deviates from its fluid path.
Formalization Note The page motivates the claim for "sufficiently small" , but the claim is made under the displayed conditions, so Lean takes every satisfying them. The standing hypotheses (IsValid) are the disclosed reading of Sec. 2.1, p. 315, Sec. 2.3, p. 317 and Sec. 5.2, p. 327: printed are , bounded nonnegative consumption and ; read in are , consumption laws that are probability measures, almost surely (the page writes on p. 317 and on p. 327; the weaker is used), measurable revenue functions, and revenue that is nonnegative and bounded by a common constant (implicit on the page, needed in App. C.4).
import Mathlib import Definitions.Def_ChoicePAC_MidPoint_Model import Definitions.Def_ChoicePAC_MidPoint_Assumptions
namespace ChoicePAC.MidPoint
open Matrix in
theorem perturbation_unique_optimum {NT n m : ℕ} (I : Instance NT n m) (hI : I.IsValid)
(h21 : I.Assumption21) (h22 : I.Assumption22) (Y : Fin n → ℝ)
(hY : I.IsDLPOptimal I.C I.lam Y) (Δ : Fin m → ℝ)
(hA_N : ∀ i, i ∉ I.BA Y → (I.Abar *ᵥ I.Ypert Y Δ) i < I.C i - Δ i)
(hP_N : ∀ q, q ∉ I.BP Y → (I.P *ᵥ I.Ypert Y Δ) q < I.lam q)
(hy_pos : ∀ j ∈ I.Jy Y, 0 < I.Ypert Y Δ j) :
I.IsDLPOptimal (I.C - Δ) I.lam (I.Ypert Y Δ) ∧
∀ x, I.IsDLPOptimal (I.C - Δ) I.lam x → x = I.Ypert Y Δ := by sorry
end ChoicePAC.MidPoint
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.