Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Real symmetric/skew block positivity equals positivity of A+iC

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.symmetricSkewBlockPositivity

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

prove2quantum

Let A,C∈Rn×nA,C\in\mathbb R^{n\times n}A,C∈Rn×n satisfy AT=AA^T=AAT=A and CT=−CC^T=-CCT=−C, and put M=(ACCTA)M=\begin{pmatrix}A&C\\C^T&A\end{pmatrix}M=(ACT​CA​). No positivity assumption on AAA is imposed. Then

M⪰0⟺A+iC⪰0.M\succeq0\quad\Longleftrightarrow\quad A+iC\succeq0.M⪰0⟺A+iC⪰0.

The right-hand side is complex Hermitian positivity. This finite matrix lemma converts the equal-diagonal real block form into one complex Hermitian matrix.

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 2: A symmetric and C skew-symmetric, without
PSD assumption on A. Both directions and the PLUS sign in A+iC are retained. -/
theorem symmetricSkewBlockPositivity {n : ℕ}
    (A C : Matrix (Fin n) (Fin n) ℝ)
    (hA : A.transpose = A) (hC : C.transpose = -C) :
    (Matrix.fromBlocks A C C.transpose A).PosSemidef ↔
      (complexify A + Complex.I • complexify 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 2
Read-back

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

For every natural number nnn, every real n×nn\times nn×n matrix AAA satisfying AT=AA^{\mathsf T}=AAT=A, and every real n×nn\times nn×n matrix CCC satisfying CT=−CC^{\mathsf T}=-CCT=−C, the real block matrix is positive semidefinite if and only if the indicated complex matrix is positive semidefinite:

(ACCTA)⪰0⟺A+iC⪰0,\begin{pmatrix}A&C\\C^{\mathsf T}&A\end{pmatrix}\succeq0 \quad\Longleftrightarrow\quad A+iC\succeq0,(ACT​CA​)⪰0⟺A+iC⪰0,

where AAA and CCC on the right are embedded entrywise into complex matrices. The case n=0n=0n=0 is included.

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