Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, equation (10): intrinsic Kraus formula

Proved
QAlgorithms.Papers.Independent.Support50.P41.krausFidelity

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

prove2quantum

Let ρ\rhoρ be a density matrix on a nonzero finite-dimensional system, ψ\psiψ any normalized purification, and Φ(X)=∑μAμXAμ†\Phi(X)=\sum_\mu A_\mu X A_\mu^\daggerΦ(X)=∑μ​Aμ​XAμ†​ a fixed normalized operator-sum representation. Then

Fe(ψ,Φ)=∑μ∣Tr⁡(ρAμ)∣2.F_e(\psi,\Phi)=\sum_\mu|\operatorname{Tr}(\rho A_\mu)|^2.Fe​(ψ,Φ)=μ∑​∣Tr(ρAμ​)∣2.

This expresses fidelity intrinsically and gives the same value for every normalized Kraus representation.

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 p.15, (10): scalar trace conjugation in the intrinsic Kraus formula. -/
theorem krausFidelity {d a m : ℕ} [NeZero d]
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
    (Phi : Superop (Fin d) (Fin d)) (A : Fin m → Matrix (Fin d) (Fin d) ℂ)
    (hA : OperatorSum Phi A) :
    purificationFidelity psi Phi = ∑ k, Complex.normSq ((rho * A k).trace) := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 15, §4.2, equation (10): intrinsic Kraus formula
Read-back

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

Let d≥1d\ge1d≥1 and a,m≥0a,m\ge0a,m≥0 be integers. Let ρ∈Md(C)\rho\in M_d(\mathbb C)ρ∈Md​(C) be positive semidefinite with trace one, and let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd have norm one and satisfy ∑iψijψil‾=ρjl\sum_i\psi_{ij}\overline{\psi_{il}}=\rho_{jl}∑i​ψij​ψil​​=ρjl​. Let Φ\PhiΦ be a function from Md(C)M_d(\mathbb C)Md​(C) to itself, and suppose matrices A0,…,Am−1A_0,\ldots,A_{m-1}A0​,…,Am−1​ satisfy ∑kAk†Ak=Id\sum_kA_k^\dagger A_k=I_d∑k​Ak†​Ak​=Id​ and Φ(X)=∑kAkXAk†\Phi(X)=\sum_kA_kXA_k^\daggerΦ(X)=∑k​Ak​XAk†​ for every matrix XXX. Then

Re⁡ ⁣[ψ†(id⁡a⊗Φ)(ψψ†)ψ]=∑k=0m−1∣tr⁡(ρAk)∣2,\operatorname{Re}\!\left[\psi^\dagger(\operatorname{id}_a\otimes\Phi)(\psi\psi^\dagger)\psi\right] =\sum_{k=0}^{m-1}\left|\operatorname{tr}(\rho A_k)\right|^2,Re[ψ†(ida​⊗Φ)(ψψ†)ψ]=k=0∑m−1​∣tr(ρAk​)∣2,

where id⁡a⊗Φ\operatorname{id}_a\otimes\Phiida​⊗Φ applies Φ\PhiΦ to each block with fixed reference row and column. The hypotheses are impossible when a=0a=0a=0, because ψ\psiψ must be a unit vector, or when m=0m=0m=0, because the empty completeness sum cannot equal IdI_dId​.

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