Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1: purification independence of entanglement fidelity

Proved
QAlgorithms.Papers.Independent.Support50.P41.intrinsicFidelity

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

prove2quantum

Fix a finite-dimensional CPTP map Φ\PhiΦ and density matrix ρ\rhoρ. Any normalized purifications ψ\psiψ and ϕ\phiϕ of ρ\rhoρ, on possibly different finite reference spaces, give

Fe(ψ,Φ)=Fe(ϕ,Φ).F_e(\psi,\Phi)=F_e(\phi,\Phi).Fe​(ψ,Φ)=Fe​(ϕ,Φ).

Moreover the output corresponding to (UR⊗IQ)ψ(U_R\otimes I_Q)\psi(UR​⊗IQ​)ψ is (UR⊗IQ)ρRQ′(UR†⊗IQ)(U_R\otimes I_Q)\rho'_{RQ}(U_R^\dagger\otimes I_Q)(UR​⊗IQ​)ρRQ′​(UR†​⊗IQ​) for every reference unitary URU_RUR​, where ρRQ′=(idR⊗Φ)(∣ψ⟩⟨ψ∣)\rho'_{RQ}=(\mathrm{id}_R\otimes\Phi)(|\psi\rangle\langle\psi|)ρRQ′​=(idR​⊗Φ)(∣ψ⟩⟨ψ∣). Thus fidelity is intrinsic to ρ\rhoρ and Φ\PhiΦ.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.13--14, (9): purification independence across reference dimensions, with unitary covariance. -/
theorem intrinsicFidelity {d a b : ℕ} [NeZero d]
    (Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
    (hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
    (phi : EuclideanSpace ℂ (Fin b × Fin d)) (hphi : IsPurification rho phi) :
    purificationFidelity psi Phi = purificationFidelity phi Phi ∧
    ∀ U : Matrix.unitaryGroup (Fin a) ℂ,
      idTensorSuperop Phi (pureDensity
        (act (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
          (1 : Matrix (Fin d) (Fin d) ℂ)) psi)) =
      conjSuperop (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
        (1 : Matrix (Fin d) (Fin d) ℂ)) (idTensorSuperop Phi (pureDensity psi)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 14, §4.1: purification independence of entanglement fidelity
Read-back

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

Let d≥1d\ge1d≥1 and a,b≥0a,b\ge0a,b≥0 be integers. Let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) be complex linear, trace preserving on all matrices, and completely positive, meaning that every blockwise amplification id⁡r⊗Φ\operatorname{id}_r\otimes\Phiidr​⊗Φ, including r=0r=0r=0, preserves positive semidefiniteness. Let ρ\rhoρ be positive semidefinite with trace one, and let unit vectors ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd and ϕ∈Cb⊗Cd\phi\in\mathbb C^b\otimes\mathbb C^dϕ∈Cb⊗Cd satisfy Tr⁡Ca(ψψ†)=ρ=Tr⁡Cb(ϕϕ†)\operatorname{Tr}_{\mathbb C^a}(\psi\psi^\dagger)=\rho=\operatorname{Tr}_{\mathbb C^b}(\phi\phi^\dagger)TrCa​(ψψ†)=ρ=TrCb​(ϕϕ†), where the partial trace sums entries over equal reference indices. For a vector vvv with reference dimension rrr, define FΦ(v)=Re⁡[v†(id⁡r⊗Φ)(vv†)v]F_\Phi(v)=\operatorname{Re}[v^\dagger(\operatorname{id}_r\otimes\Phi)(vv^\dagger)v]FΦ​(v)=Re[v†(idr​⊗Φ)(vv†)v]. Then FΦ(ψ)=FΦ(ϕ)F_\Phi(\psi)=F_\Phi(\phi)FΦ​(ψ)=FΦ​(ϕ), and every unitary U∈Ma(C)U\in M_a(\mathbb C)U∈Ma​(C) satisfies

(id⁡a⊗Φ) ⁣(((U⊗Id)ψ)((U⊗Id)ψ)†)=(U⊗Id)(id⁡a⊗Φ)(ψψ†)(U⊗Id)†.(\operatorname{id}_a\otimes\Phi)\!\left(((U\otimes I_d)\psi)((U\otimes I_d)\psi)^\dagger\right) =(U\otimes I_d)(\operatorname{id}_a\otimes\Phi)(\psi\psi^\dagger)(U\otimes I_d)^\dagger.(ida​⊗Φ)(((U⊗Id​)ψ)((U⊗Id​)ψ)†)=(U⊗Id​)(ida​⊗Φ)(ψψ†)(U⊗Id​)†.

The amplification applies Φ\PhiΦ to each system block. The purification hypotheses cannot hold if a=0a=0a=0 or b=0b=0b=0.

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

    Confirmed by the moderator at approval.

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