Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — Schur-complement sufficient condition and P-matrix characterization

Proved
RobinsonSR.Schur.theorem_3_1

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

generalized-equationlipschitzp-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schur-complement

Let r,sr,sr,s be positive integers, let K⊆RsK\subseteq\mathbb R^sK⊆Rs be nonempty, closed, and convex, and partition AAA into r×rr\times rr×r, r×sr\times sr×s, s×rs\times rs×r, and s×ss\times ss×s blocks. Define TK(w)=Aw+NRr×K(w)T_K(w)=Aw+N_{\mathbb R^r\times K}(w)TK​(w)=Aw+NRr×K​(w). If A11A_{11}A11​ is nonsingular and its Schur complement A/A11A/A_{11}A/A11​ is positive definite in the sense v⊤(A/A11)v>0v^\top(A/A_{11})v>0v⊤(A/A11​)v>0 for nonzero vvv, then TK−1T_K^{-1}TK−1​ is an everywhere-defined, single-valued, globally Lipschitz function. In the special case K=R+sK=\mathbb R^s_+K=R+s​, this has an exact characterization:

TR+s−1 is everywhere defined, unique and Lipschitz⟺det⁡A11≠0 and A/A11 has positive principal minors.T_{\mathbb R^s_+}^{-1}\text{ is everywhere defined, unique and Lipschitz} \quad\Longleftrightarrow\quad \det A_{11}\ne0\ \text{and}\ A/A_{11}\text{ has positive principal minors}.TR+s​−1​ is everywhere defined, unique and Lipschitz⟺detA11​=0 and A/A11​ has positive principal minors.

The first assertion covers arbitrary nonempty closed convex KKK; the second replaces positive definiteness by the P-matrix condition on the orthant and asserts its necessity. Together these are Robinson's Theorem 3.1.

Formalization Note The Schur complement is only used under the nonsingularity condition; positive definiteness does not require a symmetric matrix. The Lean statement quantifies over all eligible KKK for the first assertion and uses the orthant for the second.

Preamble
import Mathlib
import Definitions.Def_RobinsonSR_Schur_Setting
Formal statement
namespace RobinsonSR.Schur

/-- Robinson, Theorem 3.1, p. 51. -/
theorem theorem_3_1 (r s : ℕ) (hr : 0 < r) (hs : 0 < s)
    (A₁₁ : Matrix (Fin r) (Fin r) ℝ)
    (A₁₂ : Matrix (Fin r) (Fin s) ℝ)
    (A₂₁ : Matrix (Fin s) (Fin r) ℝ)
    (A₂₂ : Matrix (Fin s) (Fin s) ℝ) :
    (∀ K : Set (EuclideanSpace ℝ (Fin s)), K.Nonempty → IsClosed K → Convex ℝ K →
      A₁₁.det ≠ 0 → PosDefNS (schur A₁₁ A₁₂ A₂₁ A₂₂) →
      InvIsLipschitzFunction (Matrix.fromBlocks A₁₁ A₁₂ A₂₁ A₂₂) (prodSet K)) ∧
    (InvIsLipschitzFunction (Matrix.fromBlocks A₁₁ A₁₂ A₂₁ A₂₂)
        (prodSet (nonnegOrthant s)) ↔
      A₁₁.det ≠ 0 ∧ IsPMatrix (schur A₁₁ A₁₂ A₂₁ A₂₂)) := by sorry

end RobinsonSR.Schur
Source
Robinson, Strongly regular generalized equations, Math. Oper. Res. 5 (1980), p. 51, Theorem 3.1; proof pp. 51–52
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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