Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation B.2 — WWW is a square invertible matrix

Proved
ChoicePAC.MidPoint.observation_B2_W_invertible

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

linear-programmingnondegeneracyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a valid instance satisfying Assumptions 2.1 and 2.2, and let YYY be the optimal solution of DLP[C,λ]\mathrm{DLP}[C,\lambda]DLP[C,λ]. The augmented matrix

W=[AˉB,yPB2,y]W = \begin{bmatrix}\bar A_{B,y}\\ P_{B_2,y}\end{bmatrix}W=[AˉB,y​PB2​,y​​]

(rows: the binding resources BAB_ABA​ and the binding types B2B_2B2​ without an offer in JλJ_\lambdaJλ​; columns: JyJ_yJy​) is square, ∣BA∣+∣B2∣=∣Jy∣|B_A| + |B_2| = |J_y|∣BA​∣+∣B2​∣=∣Jy​∣, and invertible.

Invertibility of WWW is what lets the optimal solution follow a perturbation of the capacity linearly (App. B.2).

Formalization Note "Square" is stated as equality of the cardinalities of the row and column index types, "invertible" as bijectivity of x↦Wxx \mapsto Wxx↦Wx. 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 λq≥0\lambda_q \ge 0λq​≥0, bounded nonnegative consumption and rj(0)=0r_j(0)=0rj​(0)=0; read in are C≥0C \ge 0C≥0, consumption laws that are probability measures, Aij≤ξjA_{ij} \le \xi_jAij​≤ξj​ almost surely (the page writes ξj≥Aij\xi_j \ge A_{ij}ξj​≥Aij​ on p. 317 and Aij<ξjA_{ij} < \xi_jAij​<ξj​ on p. 327; the weaker ≤\le≤ 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).

Preamble
import Mathlib
import Definitions.Def_ChoicePAC_MidPoint_Model
import Definitions.Def_ChoicePAC_MidPoint_Assumptions
Formal statement
namespace ChoicePAC.MidPoint
theorem observation_B2_W_invertible {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) :
    Fintype.card (↥(I.BA Y) ⊕ ↥(I.B2 Y)) = Fintype.card ↥(I.Jy Y) ∧
      Function.Bijective (I.Wmat Y).mulVec := by sorry
end ChoicePAC.MidPoint
Source
Jasin, Kumar, A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice, Math. Oper. Res. 37(2), 2012, App. B.1, p. 333, Observation B.2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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