Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 4 — partition claim: J(L) and J(L⊥) partition {1, …, n}

Proved
ProjRescale.MaxSupport.partition_claim

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

linear-feasibilitymaximum-supportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1theorem-of-the-alternative

Let L⊆RnL \subseteq \mathbb R^nL⊆Rn be a linear subspace with orthogonal complement L⊥L^\perpL⊥, and let J(L)={j:xj>0 for some x∈L∩R+n}J(L) = \{j : x_j > 0 \text{ for some } x \in L \cap \mathbb R^n_+\}J(L)={j:xj​>0 for some x∈L∩R+n​} be its maximum support index set. Then the maximum support index sets of LLL and L⊥L^\perpL⊥ partition {1,…,n}\{1,\dots,n\}{1,…,n}:

J(L)∩J(L⊥)=∅andJ(L)∪J(L⊥)={1,…,n}.J(L) \cap J(L^\perp) = \emptyset \quad\text{and}\quad J(L) \cup J(L^\perp) = \{1,\dots,n\}.J(L)∩J(L⊥)=∅andJ(L)∪J(L⊥)={1,…,n}.

This is the duality fact behind Algorithm 2: it makes the covering condition J∪J^={1,…,n}J \cup \hat J = \{1,\dots,n\}J∪J^={1,…,n} 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
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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