Corollary 2.10 — faces under a full column rank projection
ProvedDisjunctive.Polarity.full_rank_face_dimension_preserveddisjunctive-programmingpolyhedraprojection
This is Corollary 2.10 of Balas's Disjunctive Programming, a consequence of Theorem 2.7 for the dimension-preserving case.
If has full column rank (), then every -dimensional face of , for , projects to a -dimensional face of : is again a face of , of the same dimension .
Unlike Corollary 2.9, no rank-matching hypothesis on itself is needed here — full column rank of for as a whole is already enough to make every face's projection well-behaved.
Formalization Note. "Face" here is Mathlib's IsExtreme (no codimension restriction, unlike
IsFacet), matching the book's unrestricted "-dimensional face" for any .
Preamble
import Mathlib import Definitions.Def_Disjunctive_Polarity_Projection import Definitions.Def_Disjunctive_Polarity_EqualitySubsystem
Formal statement
namespace Disjunctive.Polarity
/-- Corollary 2.10 (Balas §2.2.3, p. 30): if `A=` has full column rank, every `d`-dimensional
face of `Q` (for `0 ≤ d ≤ dim(Q) - 1`) projects to a `d`-dimensional face of `Proj_x(Q)`. -/
theorem full_rank_face_dimension_preserved {m p q : ℕ} (A : Matrix (Fin m) (Fin p) ℝ)
(B : Matrix (Fin m) (Fin q) ℝ) (b : Fin m → ℝ) (hFullRank : EqRankA A B b = p)
(Fc : Set ((Fin p → ℝ) × (Fin q → ℝ))) (hFace : IsExtreme ℝ (Poly2 A B b) Fc)
(d : ℕ) (hd : (d : ℤ) ≤ PolyDim (Poly2 A B b) - 1) (hdimFc : PolyDim Fc = (d : ℤ)) :
IsExtreme ℝ (ProjOntoX (Poly2 A B b)) (ProjOntoX Fc) ∧ PolyDim (ProjOntoX Fc) = (d : ℤ) := by sorry
end Disjunctive.Polarity
Source
Balas, Disjunctive Programming, Springer 2018, DOI 10.1007/978-3-030-00148-3, p. 30, Corollary 2.10
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.