Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Singular Schur-complement positivity with both kernel conditions

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.singularSchurComplement

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A∈Rn×nA\in\mathbb R^{n\times n}A∈Rn×n and B∈Rm×mB\in\mathbb R^{m\times m}B∈Rm×m be symmetric positive-semidefinite matrices, and let C∈Rn×mC\in\mathbb R^{n\times m}C∈Rn×m be arbitrary. Here n,mn,mn,m count matrix coordinates, not bosonic modes. Put M=(ACCTB)M=\begin{pmatrix}A&C\\C^T&B\end{pmatrix}M=(ACT​CB​). The following are equivalent:

M⪰0⟺(ker⁡B⊆ker⁡C  and  A−CB+CT⪰0)⟺(ker⁡A⊆ker⁡CT  and  B−CTA+C⪰0).M\succeq0 \quad\Longleftrightarrow\quad \bigl(\ker B\subseteq\ker C\ \text{ and }\ A-CB^+C^T\succeq0\bigr) \quad\Longleftrightarrow\quad \bigl(\ker A\subseteq\ker C^T\ \text{ and }\ B-C^TA^+C\succeq0\bigr).M⪰0⟺(kerB⊆kerC  and  A−CB+CT⪰0)⟺(kerA⊆kerCT  and  B−CTA+C⪰0).

The inverses are spectral Moore–Penrose inverses, including zero eigenvalues. The kernel conditions are essential in the singular case. Lean records the two equivalences with M⪰0M\succeq0M⪰0 as their common left-hand side.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P68
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators Topology ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P68

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState IsSeparable IsBarycenter productCoeff)

open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)

open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)

open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

/-- PDF p.4, Appendix Lemma 1: both singular Schur-complement equivalences.
Here n,m count matrix coordinates, not oscillator modes. Both kernel clauses
are retained, with no invertibility or positive-mode-count restriction. -/
theorem singularSchurComplement {n m : ℕ}
    (A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin m) (Fin m) ℝ)
    (C : Matrix (Fin n) (Fin m) ℝ) (hA : A.PosSemidef) (hB : B.PosSemidef) :
    ((Matrix.fromBlocks A C C.transpose B).PosSemidef ↔
      (∀ v : Fin m → ℝ, B.mulVec v = 0 → C.mulVec v = 0) ∧
      (A - C * hermitianInverse B * C.transpose).PosSemidef) ∧
    ((Matrix.fromBlocks A C C.transpose B).PosSemidef ↔
      (∀ v : Fin n → ℝ, A.mulVec v = 0 → C.transpose.mulVec v = 0) ∧
      (B - C.transpose * hermitianInverse A * C).PosSemidef) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P68

end
Source
Separability Criterion for all bipartite Gaussian States, arXiv:quant-ph/0104050v1, PDF p. 4, Appendix Lemma 1
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For any natural numbers n,mn,mn,m, any real n×nn\times nn×n positive semidefinite matrix AAA, any real m×mm\times mm×m positive semidefinite matrix BBB, and any real n×mn\times mn×m matrix CCC, both equivalences below hold. Here M♯M^\sharpM♯ means the spectral functional calculus t↦t−1t\mapsto t^{-1}t↦t−1 for a Hermitian matrix MMM, taking 0−1=00^{-1}=00−1=0, and means zero for a non-Hermitian matrix:

(ACCTB)⪰0  ⟺  (∀v∈Rm, Bv=0⇒Cv=0) ∧ A−CB♯CT⪰0,(ACCTB)⪰0  ⟺  (∀v∈Rn, Av=0⇒CTv=0) ∧ B−CTA♯C⪰0.\begin{aligned} \begin{pmatrix}A&C\\C^{\mathsf T}&B\end{pmatrix}\succeq0 &\iff \left(\forall v\in\mathbb R^m,\ Bv=0\Rightarrow Cv=0\right) \ \land\ A-CB^\sharp C^{\mathsf T}\succeq0,\\ \begin{pmatrix}A&C\\C^{\mathsf T}&B\end{pmatrix}\succeq0 &\iff \left(\forall v\in\mathbb R^n,\ Av=0\Rightarrow C^{\mathsf T}v=0\right) \ \land\ B-C^{\mathsf T}A^\sharp C\succeq0. \end{aligned}(ACT​CB​)⪰0(ACT​CB​)⪰0​⟺(∀v∈Rm, Bv=0⇒Cv=0) ∧ A−CB♯CT⪰0,⟺(∀v∈Rn, Av=0⇒CTv=0) ∧ B−CTA♯C⪰0.​

Neither AAA nor BBB is assumed invertible. Zero dimensions are included, with empty matrices and the corresponding zero-dimensional vector spaces.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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