§2, p. 4 — partition claim: J(L) and J(L⊥) partition {1, …, n}
ProvedProjRescale.MaxSupport.partition_claimlinear-feasibilitymaximum-supportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1theorem-of-the-alternative
Let be a linear subspace with orthogonal complement , and let be its maximum support index set. Then the maximum support index sets of and partition :
This is the duality fact behind Algorithm 2: it makes the covering condition a certificate that both index sets are maximal (Corollary 1).
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_ProjRescale_MaxSupport_Setting
Formal statement
namespace ProjRescale.MaxSupport
/-- §2, p. 4: the maximum support index sets `J(L)` and `J(L⊥)` partition `{1, …, n}`. -/
theorem partition_claim {n : ℕ} (L : Submodule ℝ (E n)) :
maxSupp L ∩ maxSupp Lᗮ = ∅ ∧ maxSupp L ∪ maxSupp Lᗮ = Finset.univ := by sorry
end ProjRescale.MaxSupport
Source
Peña & Soheili, Projection and rescaling algorithm for finding maximum support solutions to polyhedral conic systems, arXiv:2003.08911v3, p. 4, §2 (unnumbered claim after the definition of σ(L))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.