Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rank-one domination and inverse pairing

Open
QAlgorithms.Papers.Independent.Intakenext100.P98.rankOne_domination_iff_inversePairing

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

prove2quantum

Let Y=CmY=\mathbb C^mY=Cm, Z=CrZ=\mathbb C^rZ=Cr, m,r≥1m,r\ge1m,r≥1, and let v∈Y⊗Zv\in Y\otimes Zv∈Y⊗Z be any vector. For every positive definite operator H∈L(Z)H\in L(Z)H∈L(Z),

IY⊗H⪰vv∗⟺Re⁡Tr⁡((Tr⁡Yvv∗)∗H−1)≤1.I_Y\otimes H\succeq vv^*\quad\Longleftrightarrow\quad\operatorname{Re}\operatorname{Tr}\big((\operatorname{Tr}_Y vv^*)^*H^{-1}\big)\le1.IY​⊗H⪰vv∗⟺ReTr((TrY​vv∗)∗H−1)≤1.

No normalization of vvv is required, and positive definiteness ensures the inverse is the ordinary inverse. This equivalence converts a rank-one operator constraint into a scalar constraint for the fidelity dual program.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P98

/-- PDF p.14, Proposition 8: positive definiteness guards the inverse. At v=0
both conditions hold. The proposition needs no correction to its statement. -/
theorem rankOne_domination_iff_inversePairing {m r : ℕ} (hm : 0 < m) (hr : 0 < r)
    (v : EuclideanSpace ℂ (Fin m × Fin r)) (Z : (Matrix (Fin r) (Fin r) ℂ)) (hZ : Z.PosDef) :
    (unitTensor m Z - pureDensity v).PosSemidef ↔
      realTracePairing (traceLeft (pureDensity v)) Z⁻¹ ≤ 1 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P98

end
Source
Semidefinite programs for completely bounded norms, arXiv:0901.4709v2, PDF p. 14, Proposition 8 (rank-one domination and inverse pairing)
Read-back

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

For positive natural numbers m,rm,rm,r, any vector v∈Cmrv\in\mathbb C^{mr}v∈Cmr, and any positive definite matrix Z∈Mr(C)Z\in M_r(\mathbb C)Z∈Mr​(C), let Rv=vv†R_v=vv^\daggerRv​=vv† and define B∈Mr(C)B\in M_r(\mathbb C)B∈Mr​(C) by Bts=∑a=0m−1v(a,t)v(a,s)‾B_{ts}=\sum_{a=0}^{m-1}v_{(a,t)}\overline{v_{(a,s)}}Bts​=∑a=0m−1​v(a,t)​v(a,s)​​. Then

Im⊗Z−Rv⪰0⟺Re⁡tr⁡(B†Z−1)≤1,I_m\otimes Z-R_v\succeq0 \quad\Longleftrightarrow\quad \operatorname{Re}\operatorname{tr}(B^\dagger Z^{-1})\le1,Im​⊗Z−Rv​⪰0⟺Retr(B†Z−1)≤1,

where †\dagger† denotes conjugate transpose, ⪰0\succeq0⪰0 means positive semidefinite, and Z−1Z^{-1}Z−1 is the matrix inverse. The vector vvv is unrestricted and may be zero or unnormalized.

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