Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Root-fidelity lower bound for arbitrary positive operators

Proved
QAlgorithms.Papers.Independent.Advance50.P05.positiveOperatorFidelityLowerBound

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

prove2quantum

Let P,QP,QP,Q be arbitrary positive semidefinite operators on a finite-dimensional Hilbert space. Neither a trace-one condition nor a trace upper bound is assumed. Define root fidelity and the full trace norm by F(P,Q)=∥PQ∥1F(P,Q)=\|\sqrt P\sqrt Q\|_1F(P,Q)=∥P​Q​∥1​ and ∥X∥1=Tr⁡X†X\|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=TrX†X​. Then

F(P,Q)≥Tr⁡P+Tr⁡Q2−12∥P−Q∥1.F(P,Q)\ge\frac{\operatorname{Tr}P+\operatorname{Tr}Q}{2}-\frac12\|P-Q\|_1.F(P,Q)≥2TrP+TrQ​−21​∥P−Q∥1​.

This includes zero operators and operators of unequal or arbitrarily large trace. It supplies the unnormalized fidelity estimate used in decoupling arguments.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P05
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P05

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder

open QAlgorithms.Papers.Independent.Dependency50.P19 (first both epr IsIso)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P35 (elog marginalAB marginalAC)

open QAlgorithms.Papers.Independent.Support50.P21 (dMin weakPositive PositiveTensorBasis)

open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Buscemi--Datta, arXiv:1006.1896v2, PDF pp.16--17, Lemma 11, (62).
Arbitrary positive operators with arbitrary traces; no normalization or trace cap.
The trace norm is the full Schatten one-norm and F is root fidelity. -/
theorem positiveOperatorFidelityLowerBound
    {I : Type} [Fintype I] [DecidableEq I]
    (P Q : Matrix I I ℂ) (hP : P.PosSemidef) (hQ : Q.PosSemidef) :
    rootFidelity P Q ≥ (P.trace.re + Q.trace.re) / 2 - traceNorm (P - Q) / 2 := by sorry

end QAlgorithms.Papers.Independent.Advance50.P05

end
Source
Distilling entanglement from arbitrary resources, arXiv:1006.1896v2, PDF p. 16, Lemma 11, Eq.(62): fidelity bound for arbitrary positive operators
Read-back

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

For every finite type III with decidable equality, possibly empty, and every pair of positive semidefinite complex matrices P,QP,QP,Q on III, the functional-calculus quantity

F(P,Q)=Re⁡Tr⁡P QPF(P,Q)=\operatorname{Re}\operatorname{Tr}\sqrt{\sqrt P\,Q\sqrt P}F(P,Q)=ReTrP​QP​​

satisfies

F(P,Q)≥Re⁡Tr⁡P+Re⁡Tr⁡Q2−Re⁡Tr⁡(P−Q)†(P−Q)2.F(P,Q)\ge \frac{\operatorname{Re}\operatorname{Tr}P+\operatorname{Re}\operatorname{Tr}Q}{2} -\frac{\operatorname{Re}\operatorname{Tr}\sqrt{(P-Q)^\dagger(P-Q)}}{2}.F(P,Q)≥2ReTrP+ReTrQ​−2ReTr(P−Q)†(P−Q)​​.

The last trace is the defined trace norm of P−QP-QP−Q. Neither matrix is required to have trace 111 or to be nonzero; for an empty index type all displayed traces are zero.

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

    Confirmed by the moderator at approval.

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