Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5: product-target fidelity from a pure marginal

Proved
QAlgorithms.Papers.Independent.Gap48.P39.product_target_fidelity

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho^{AB}ρAB be a normalized density matrix on positive-dimensional finite systems, let ∣ψ⟩A|\psi\rangle^A∣ψ⟩A be a unit vector, and let σB\sigma^BσB be any normalized density matrix. With ρA,ρB\rho^A,\rho^BρA,ρB the actual partial traces,

F(ρAB,ψA⊗σB)≥1−3(1−F(ψA,ρA))−∥ρB−σB∥1.F(\rho^{AB},\psi^A\otimes\sigma^B)\ge1-3\bigl(1-F(\psi^A,\rho^A)\bigr)-\|\rho^B-\sigma^B\|_1.F(ρAB,ψA⊗σB)≥1−3(1−F(ψA,ρA))−∥ρB−σB∥1​.

Here ψA=∣ψ⟩⟨ψ∣\psi^A=|\psi\rangle\langle\psi|ψA=∣ψ⟩⟨ψ∣, FFF is squared Uhlmann fidelity, and ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the full trace norm. The lower bound can be negative and is not clamped. This controls joint fidelity to a product target from a pure marginal and the other marginal's trace-norm error.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Gap48.P39

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

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)

open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C X T E : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]

variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]

/-- Lemma 5, PDF pp.11–12: squared fidelity, no square root on the factor 3;
the lower bound may be negative and is not clamped. -/
theorem product_target_fidelity [Nonempty A] [Nonempty B]
    (rho : Op (A × B)) (hr : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ A) (hp : IsState psi) (sigma : Op B) (hs : IsDensityMatrix sigma) :
    1 - 3 * (1 - squaredFidelity (pureDensity psi) (traceRight rho)) -
      traceNorm (traceLeft rho - sigma) ≤
      squaredFidelity rho (Matrix.kronecker (pureDensity psi) sigma) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 11, Lemma 5: product-target fidelity from a pure marginal
Read-back

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

For nonempty finite types A,BA,BA,B with decidable equality, let ρ\rhoρ be a positive semidefinite, trace-one complex matrix on A×BA\times BA×B, let ψ∈CA\psi\in\mathbb C^Aψ∈CA have Euclidean norm 111, and let σ\sigmaσ be a positive semidefinite, trace-one complex matrix on BBB. Put Pψ(a,a′)=ψaψa′‾P_\psi(a,a')=\psi_a\overline{\psi_{a'}}Pψ​(a,a′)=ψa​ψa′​​, define

F(M,N)=(Re⁡tr⁡M N M)2,∥Z∥1=Re⁡tr⁡Z†Z,F(M,N)=\left(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt M\,N\,\sqrt M}\right)^2, \qquad \|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z},F(M,N)=(RetrM​NM​​)2,∥Z∥1​=RetrZ†Z​,

with matrix square roots interpreted through continuous functional calculus. Then

1−3(1−F(Pψ,Tr⁡Bρ))−∥Tr⁡Aρ−σ∥1≤F(ρ,Pψ⊗σ).1-3\bigl(1-F(P_\psi,\operatorname{Tr}_B\rho)\bigr) -\|\operatorname{Tr}_A\rho-\sigma\|_1 \le F(\rho,P_\psi\otimes\sigma).1−3(1−F(Pψ​,TrB​ρ))−∥TrA​ρ−σ∥1​≤F(ρ,Pψ​⊗σ).

The trace-norm term is not divided by 222, and the left side is not replaced by its maximum with zero.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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