Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.2), p. 6 — for Π ∈ 𝕊^{q+r} with Π₂₂ ⩽ 0: ker Π₂₂ ⊆ ker Π₁₂ ⟺ Π₁₂Π₂₂Π₂₂† = Π₁₂, and then Π factors through diag(Π|Π₂₂, Π₂₂)

Proved
QuadMatIneq.Basic.eq_3_2

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-inversequadratic-matrix-inequalityschur-complement

Let Π∈Sq+r\Pi \in \mathbb{S}^{q+r}Π∈Sq+r be symmetric, partitioned with Π11\Pi_{11}Π11​ of size q×qq\times qq×q and Π22\Pi_{22}Π22​ of size r×rr\times rr×r, and suppose Π22≤0\Pi_{22} \le 0Π22​≤0. Write Π22†\Pi_{22}^\daggerΠ22†​ for the Moore–Penrose pseudo-inverse and Π ∣ Π22=Π11−Π12Π22†Π21\Pi\,|\,\Pi_{22} = \Pi_{11} - \Pi_{12}\Pi_{22}^\dagger\Pi_{21}Π∣Π22​=Π11​−Π12​Π22†​Π21​ for the generalized Schur complement. Then:

  1. ker⁡Π22⊆ker⁡Π12\ker\Pi_{22} \subseteq \ker\Pi_{12}kerΠ22​⊆kerΠ12​ holds if and only if Π12Π22Π22†=Π12\Pi_{12}\Pi_{22}\Pi_{22}^\dagger = \Pi_{12}Π12​Π22​Π22†​=Π12​;
  2. if ker⁡Π22⊆ker⁡Π12\ker\Pi_{22} \subseteq \ker\Pi_{12}kerΠ22​⊆kerΠ12​, then
[Π11Π12Π21Π22]=[IqΠ12Π22†0Ir][Π ∣ Π2200Π22][Iq0Π22†Π21Ir].\begin{bmatrix}\Pi_{11} & \Pi_{12}\\ \Pi_{21} & \Pi_{22}\end{bmatrix} = \begin{bmatrix} I_q & \Pi_{12}\Pi_{22}^\dagger \\ 0 & I_r\end{bmatrix}\begin{bmatrix}\Pi\,|\,\Pi_{22} & 0\\ 0 & \Pi_{22}\end{bmatrix}\begin{bmatrix} I_q & 0\\ \Pi_{22}^\dagger\Pi_{21} & I_r\end{bmatrix}.[Π11​Π21​​Π12​Π22​​]=[Iq​0​Π12​Π22†​Ir​​][Π∣Π22​0​0Π22​​][Iq​Π22†​Π21​​0Ir​​].

This block factorization is the generalized Schur complement identity on which all of §3 rests: it reduces questions about the QMI defined by Π\PiΠ to questions about the two diagonal blocks.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Basic_QMI
Formal statement
namespace QuadMatIneq.Basic
open Matrix
theorem eq_3_2 {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
    (P : Matrix (ι ⊕ κ) (ι ⊕ κ) ℝ) (hP : P.IsHermitian) (h22 : (-P.toBlocks₂₂).PosSemidef) :
    ((∀ v : κ → ℝ, P.toBlocks₂₂ *ᵥ v = 0 → P.toBlocks₁₂ *ᵥ v = 0) ↔
        P.toBlocks₁₂ * P.toBlocks₂₂ * pinv P.toBlocks₂₂ = P.toBlocks₁₂) ∧
    ((∀ v : κ → ℝ, P.toBlocks₂₂ *ᵥ v = 0 → P.toBlocks₁₂ *ᵥ v = 0) →
      P = Matrix.fromBlocks 1 (P.toBlocks₁₂ * pinv P.toBlocks₂₂) 0 1 *
            Matrix.fromBlocks (schur P) 0 0 P.toBlocks₂₂ *
            Matrix.fromBlocks 1 0 (pinv P.toBlocks₂₂ * P.toBlocks₂₁) 1) := by sorry
end QuadMatIneq.Basic
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §3, display (3.2) and the sentence before it, p. 6
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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