Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fidelity squared is an attained primal SDP value

Open
QAlgorithms.Papers.Independent.Intakenext100.P98.fidelity_primal_maximum

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

prove2quantum

Let Y=CmY=\mathbb C^mY=Cm and Z=CrZ=\mathbb C^rZ=Cr, where m,r≥1m,r\ge1m,r≥1, and let u,v∈Y⊗Zu,v\in Y\otimes Zu,v∈Y⊗Z be arbitrary vectors. Define P=Tr⁡Y(uu∗)P=\operatorname{Tr}_Y(uu^*)P=TrY​(uu∗) and Q=Tr⁡Y(vv∗)Q=\operatorname{Tr}_Y(vv^*)Q=TrY​(vv∗), and let F(P,Q)=Tr⁡PQPF(P,Q)=\operatorname{Tr}\sqrt{\sqrt P Q\sqrt P}F(P,Q)=TrP​QP​​ denote root fidelity. Then

F(P,Q)2=max⁡W⪰0Tr⁡YW⪯PRe⁡Tr⁡((vv∗)∗W).F(P,Q)^2=\max_{\substack{W\succeq0\\\operatorname{Tr}_Y W\preceq P}}\operatorname{Re}\operatorname{Tr}((vv^*)^*W).F(P,Q)2=W⪰0TrY​W⪯P​max​ReTr((vv∗)∗W).

The maximum is attained. Neither vector must have norm one, and the marginal constraint is an inequality. This is the primal fidelity SDP obtained from Uhlmann’s theorem.

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, Corollary 7: squared fidelity is a MAXIMUM with a marginal
INEQUALITY; P,Q are constructed from the given, unnormalized vectors. -/
theorem fidelity_primal_maximum {m r : ℕ} (hm : 0 < m) (hr : 0 < r)
    (u v : EuclideanSpace ℂ (Fin m × Fin r)) :
    IsGreatest (fidelityPrimalValues u v)
      ((rootFidelity (traceLeft (pureDensity u)) (traceLeft (pureDensity v))) ^ 2) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P98

end
Source
Semidefinite programs for completely bounded norms, arXiv:0901.4709v2, PDF p. 14, Corollary 7 (fidelity as a primal SDP maximum)
Read-back

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

For positive natural numbers m,rm,rm,r and arbitrary vectors u,v∈Cmru,v\in\mathbb C^{mr}u,v∈Cmr, let Ru=uu†R_u=uu^\daggerRu​=uu†, Rv=vv†R_v=vv^\daggerRv​=vv†, and let Tr⁡m\operatorname{Tr}_mTrm​ sum over the first coordinate: (Tr⁡mY)ts=∑a=0m−1Y(a,t),(a,s)(\operatorname{Tr}_m Y)_{ts}=\sum_{a=0}^{m-1}Y_{(a,t),(a,s)}(Trm​Y)ts​=∑a=0m−1​Y(a,t),(a,s)​. Set A=Tr⁡mRuA=\operatorname{Tr}_m R_uA=Trm​Ru​, B=Tr⁡mRvB=\operatorname{Tr}_m R_vB=Trm​Rv​, and

f=(Re⁡tr⁡A B A)2.f=\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt A\,B\,\sqrt A}\right)^2.f=(RetrA​BA​​)2.

Then fff is the greatest element of the set of numbers Re⁡tr⁡(Rv†W)\operatorname{Re}\operatorname{tr}(R_v^\dagger W)Retr(Rv†​W) for matrices W∈Mmr(C)W\in M_{mr}(\mathbb C)W∈Mmr​(C) satisfying W⪰0W\succeq0W⪰0 and A−Tr⁡mW⪰0A-\operatorname{Tr}_m W\succeq0A−Trm​W⪰0. Thus such a matrix WWW attains value fff, and every feasible WWW has value at most fff. Here †\dagger† is conjugate transpose, ⪰0\succeq0⪰0 means positive semidefinite, and the square roots are positive semidefinite matrix square roots. No normalization or nonzero assumption is imposed on u,vu,vu,v.

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