Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: product fidelity from a near-pure marginal

Proved
QAlgorithms.Papers.Independent.Support50.P02.product_fidelity

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

prove2quantum

Let A,BA,BA,B be finite, positive-dimensional complex registers, ϕA\phi^AϕA a unit vector, ρB\rho^BρB a density operator, and ΩAB\Omega^{AB}ΩAB a density operator. Define its marginals by ΩA=Tr⁡BΩ\Omega^A=\operatorname{Tr}_B\OmegaΩA=TrB​Ω and ΩB=Tr⁡AΩ\Omega^B=\operatorname{Tr}_A\OmegaΩB=TrA​Ω. Let ϵ∈R\epsilon\in\mathbb Rϵ∈R satisfy F(ϕ,ΩA)≥1−ϵF(\phi,\Omega^A)\ge1-\epsilonF(ϕ,ΩA)≥1−ϵ, where FFF is squared Uhlmann fidelity. Then

F(ϕ⊗ρ,Ω)≥1−∥ρ−ΩB∥1−3ϵ.F(\phi\otimes\rho,\Omega)\ge1-\|\rho-\Omega^B\|_1-3\epsilon.F(ϕ⊗ρ,Ω)≥1−∥ρ−ΩB∥1​−3ϵ.

The trace norm is not halved. This relates a near-pure marginal to a joint product target. No positive-overlap assumption is imposed; the zero-overlap case is included.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Support50.P02

open QAlgorithms.Papers.Independent.Information100.P67
  (squaredFidelity receiverChannel complementaryChannel IsDegradable)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E R S I J : Type*}

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

variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]

variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- Lemma 2, PDF pp.10–11: both marginals are computed from Omega.
No f>0 hypothesis is imposed: the zero-overlap case is part of the theorem.
The proof's claim of general fidelity linearity is not used as a definition. -/
theorem product_fidelity [Nonempty A] [Nonempty B]
    (phi : EuclideanSpace ℂ A) (hp : IsState phi)
    (rho : Op B) (hr : IsDensityMatrix rho) (Omega : Op (A × B))
    (hO : IsDensityMatrix Omega) (epsilon : ℝ)
    (hf : 1 - epsilon ≤ squaredFidelity (pureDensity phi) (traceRight Omega)) :
    1 - traceNorm (rho - traceLeft Omega) - 3 * epsilon ≤
      squaredFidelity (Matrix.kronecker (pureDensity phi) rho) Omega := by sorry

end QAlgorithms.Papers.Independent.Support50.P02

end
Source
Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions, arXiv:quant-ph/0501045v3, PDF p. 10, Lemma 2: product fidelity from a near-pure marginal
Read-back

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

For every pair of nonempty finite index types A,BA,BA,B with decidable equality, every norm-one vector ϕ∈CA\phi\in\mathbb C^Aϕ∈CA, every positive semidefinite matrix ρ\rhoρ on BBB of trace 111, every positive semidefinite matrix Ω\OmegaΩ on A×BA\times BA×B of trace 111, and every real number ϵ\epsilonϵ, define Pϕ=[ϕiϕj‾]i,jP_\phi=[\phi_i\overline{\phi_j}]_{i,j}Pϕ​=[ϕi​ϕj​​]i,j​,

F(X,Y)=(Re⁡tr⁡X Y X)2,∥M∥1=Re⁡tr⁡M†M,F(X,Y)=\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt X\,Y\,\sqrt X}\right)^2, \qquad \|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M},F(X,Y)=(RetrX​YX​​)2,∥M∥1​=RetrM†M​,

with square roots given by continuous functional calculus. If 1−ϵ≤F(Pϕ,Tr⁡BΩ)1-\epsilon\le F(P_\phi,\operatorname{Tr}_B\Omega)1−ϵ≤F(Pϕ​,TrB​Ω), then

1−∥ρ−Tr⁡AΩ∥1−3ϵ≤F(Pϕ⊗ρ,Ω).1-\|\rho-\operatorname{Tr}_A\Omega\|_1-3\epsilon \le F(P_\phi\otimes\rho,\Omega).1−∥ρ−TrA​Ω∥1​−3ϵ≤F(Pϕ​⊗ρ,Ω).

The partial traces mean (Tr⁡BΩ)i,j=∑bΩ(i,b),(j,b)(\operatorname{Tr}_B\Omega)_{i,j}=\sum_b\Omega_{(i,b),(j,b)}(TrB​Ω)i,j​=∑b​Ω(i,b),(j,b)​ and (Tr⁡AΩ)b,b′=∑iΩ(i,b),(i,b′)(\operatorname{Tr}_A\Omega)_{b,b'}=\sum_i\Omega_{(i,b),(i,b')}(TrA​Ω)b,b′​=∑i​Ω(i,b),(i,b′)​, and the tensor-product matrix has entries (Pϕ)i,jρb,b′(P_\phi)_{i,j}\rho_{b,b'}(Pϕ​)i,j​ρb,b′​. No separate sign or range restriction on ϵ\epsilonϵ is assumed.

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

    Confirmed by the moderator at approval.

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