Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 2.3: necessity of the zero-marginal perturbation criterion

Open
QAlgorithms.Papers.Independent.Intakethird100.P12.zero_marginal_necessity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d1,d2d_1,d_2d1​,d2​ be the dimensions of finite-dimensional complex Hilbert spaces with chosen orthonormal bases. Let ρ1,ρ2\rho_1,\rho_2ρ1​,ρ2​ be positive semidefinite operators of trace one. Write C(ρ1,ρ2)C(\rho_1,\rho_2)C(ρ1​,ρ2​) for all joint density matrices with these two partial traces, and E(ρ1,ρ2)E(\rho_1,\rho_2)E(ρ1​,ρ2​) for its extreme points over the real scalars. Coordinates in the tensor product use lexicographic order.

Let ρ∈C(ρ1,ρ2)\rho\in C(\rho_1,\rho_2)ρ∈C(ρ1​,ρ2​) have rank k<nk<nk<n.

Set n=d1d2n=d_1d_2n=d1​d2​ and k=rank⁡ρk=\operatorname{rank}\rhok=rankρ. Let σ\sigmaσ be a permutation unitary, AAA a complex k×(n−k)k\times(n-k)k×(n−k) matrix, and KKK a strictly positive definite k×kk\times kk×k matrix satisfying

σρσ−1=BA(K),BA(L)=(LLAA†LA†LA).\sigma\rho\sigma^{-1}=B_A(K),\qquad B_A(L)=\begin{pmatrix}L&LA\\A^\dagger L&A^\dagger LA\end{pmatrix}.σρσ−1=BA​(K),BA​(L)=(LA†L​LAA†LA​).

Here †\dagger† denotes conjugate transpose. Both marginals of σ−1BA(L)σ\sigma^{-1}B_A(L)\sigmaσ−1BA​(L)σ are computed in the original tensor coordinates.

If ρ\rhoρ is extreme, then for every Hermitian matrix LLL of order kkk,

Tr⁡H2(σ−1BA(L)σ)=0 and Tr⁡H1(σ−1BA(L)σ)=0⟹L=0.\operatorname{Tr}_{H_2}(\sigma^{-1}B_A(L)\sigma)=0\ \text{and}\ \operatorname{Tr}_{H_1}(\sigma^{-1}B_A(L)\sigma)=0\quad\Longrightarrow\quad L=0.TrH2​​(σ−1BA​(L)σ)=0 and TrH1​​(σ−1BA​(L)σ)=0⟹L=0.

Thus an extreme coupling admits no nonzero Hermitian perturbation in its rank-block coordinates that preserves both marginals.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P12
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P12

open scoped ComplexConjugate ComplexOrder

/-- Proposition 2.3, PDF pp.5–6: extremality implies injectivity on Hermitian perturbations. -/
theorem zero_marginal_necessity {d1 d2 k : ℕ}
    (rho1 : Matrix (Fin d1) (Fin d1) ℂ) (rho2 : Matrix (Fin d2) (Fin d2) ℂ)
    (hm1 : IsDensityMatrix rho1) (hm2 : IsDensityMatrix rho2)
    (rho : Matrix (Fin d1 × Fin d2) (Fin d1 × Fin d2) ℂ)
    (hmem : rho ∈ finiteCouplingSet rho1 rho2) (hrank : rho.rank = k)
    (hkn : k < d1*d2) (p : Equiv.Perm (Fin (d1*d2)))
    (A : Matrix (Fin k) (Fin (d1*d2-k)) ℂ) (K : Matrix (Fin k) (Fin k) ℂ)
    (hK : K.PosDef) (hblock : permuteMatrix p (flatMatrix rho) = rankBlockMatrix hkn.le K A)
    (hext : rho ∈ Set.extremePoints ℝ (finiteCouplingSet rho1 rho2)) :
    NoZeroMarginalPerturbation hkn.le p A := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P12
Source
Extremal Quantum States in Coupled Systems, arXiv:quant-ph/0307182v1, PDF p. 5, Proposition 2.3: necessity of the zero-marginal perturbation criterion
Read-back

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

For all natural numbers d1,d2,kd_1,d_2,kd1​,d2​,k, let ρ1,ρ2\rho_1,\rho_2ρ1​,ρ2​ be complex matrices of sizes d1×d1d_1\times d_1d1​×d1​ and d2×d2d_2\times d_2d2​×d2​, each positive semidefinite with trace one. Let ρ\rhoρ be a complex matrix on the product index set, also positive semidefinite with trace one, whose partial traces satisfy ∑bρ(a,b),(a′,b)=(ρ1)a,a′\sum_b\rho_{(a,b),(a',b)}=(\rho_1)_{a,a'}∑b​ρ(a,b),(a′,b)​=(ρ1​)a,a′​ and ∑aρ(a,b),(a,b′)=(ρ2)b,b′\sum_a\rho_{(a,b),(a,b')}=(\rho_2)_{b,b'}∑a​ρ(a,b),(a,b′)​=(ρ2​)b,b′​. Assume that rank⁡ρ=k<d1d2\operatorname{rank}\rho=k<d_1d_2rankρ=k<d1​d2​. Let ppp be any permutation of {0,…,d1d2−1}\{0,\ldots,d_1d_2-1\}{0,…,d1​d2​−1}, let AAA be a complex k×(d1d2−k)k\times(d_1d_2-k)k×(d1​d2​−k) matrix, and let KKK be a positive definite complex k×kk\times kk×k matrix. Writing f(a,b)=d2a+bf(a,b)=d_2a+bf(a,b)=d2​a+b and

BA(H)=(HHAA†HA†HA),B_A(H)= \begin{pmatrix} H & HA\\ A^\dagger H & A^\dagger HA \end{pmatrix},BA​(H)=(HA†H​HAA†HA​),

assume that ρf−1(p(i)), f−1(p(j))=BA(K)i,j\rho_{f^{-1}(p(i)),\,f^{-1}(p(j))}=B_A(K)_{i,j}ρf−1(p(i)),f−1(p(j))​=BA​(K)i,j​ for all i,ji,ji,j. Also assume that ρ\rhoρ is an extreme point, with respect to real scalars, of the set of positive semidefinite trace-one matrices with these same two partial traces: whenever ρ=tσ+(1−t)τ\rho=t\sigma+(1-t)\tauρ=tσ+(1−t)τ for 0<t<10<t<10<t<1 and σ,τ\sigma,\tauσ,τ in that set, one has σ=τ=ρ\sigma=\tau=\rhoσ=τ=ρ. Then every Hermitian complex k×kk\times kk×k matrix LLL for which the matrix

(PL)(a,b),(a′,b′)=BA(L)p−1(f(a,b)), p−1(f(a′,b′))(P_L)_{(a,b),(a',b')}=B_A(L)_{p^{-1}(f(a,b)),\,p^{-1}(f(a',b'))}(PL​)(a,b),(a′,b′)​=BA​(L)p−1(f(a,b)),p−1(f(a′,b′))​

has both partial traces zero must itself satisfy L=0L=0L=0. The assumptions cannot hold when either d1d_1d1​ or d2d_2d2​ is zero, or when k=0k=0k=0, because ρ\rhoρ has trace one.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me