Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2 / (37): fidelity controls ordinary channel norm

Proved
QAlgorithms.Papers.Independent.Gap20.P07.fidelity_controlsOrdinaryNorm

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

prove2quantum

Let TTT be a CPTP endomorphism of a nonzero finite-dimensional complex system. In the Schroedinger convention let ∥⋅∥1→1\|\cdot\|_{1\to1}∥⋅∥1→1​ be the induced trace norm on all complex matrices. Then

∥T−id∥1→1≤4sup⁡∥ψ∥=11−⟨ψ∣T(∣ψ⟩⟨ψ∣)∣ψ⟩.\|T-\mathrm{id}\|_{1\to1}\le4\sup_{\|\psi\|=1}\sqrt{1-\langle\psi|T(|\psi\rangle\langle\psi|)|\psi\rangle}.∥T−id∥1→1​≤4∥ψ∥=1sup​1−⟨ψ∣T(∣ψ⟩⟨ψ∣)∣ψ⟩​.

The map norm is equivalently the operator norm of the Heisenberg adjoint. This bound uses normalized pure states and a constant independent of dimension.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF p.13, Lemma 4.2, (37): ordinary map norm is the induced trace norm
in this Schroedinger convention; every vector in the supremum has norm one. -/
theorem fidelity_controlsOrdinaryNorm (d : ℕ) (hd : 0 < d)
    (T : Superop (Fin d) (Fin d)) (hT : IsChannel T) :
    ordinaryNorm d (fun X => T X - X) ≤ 4 * sSup {r : ℝ |
      ∃ psi : EuclideanSpace ℂ (Fin d), IsState psi ∧
        r = Real.sqrt (1 - effectProb (pureDensity psi) (T (pureDensity psi)))} := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 13, Lemma 4.2 / (37): fidelity controls ordinary channel norm
Read-back

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

For every positive integer ddd and every map T:Md(C)→Md(C)T:M_d(\mathbb C)\to M_d(\mathbb C)T:Md​(C)→Md​(C) admitting a finite Kraus representation T(X)=∑aKaXKa†T(X)=\sum_a K_aXK_a^\daggerT(X)=∑a​Ka​XKa†​ with ∑aKa†Ka=Id\sum_aK_a^\dagger K_a=I_d∑a​Ka†​Ka​=Id​, define ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​ and Pψ=ψψ†P_\psi=\psi\psi^\daggerPψ​=ψψ†. Then

sup⁡X∈Md(C)∥X∥1≤1∥T(X)−X∥1≤4sup⁡ψ∈Cd∥ψ∥2=11−Re⁡tr⁡ ⁣(PψT(Pψ)).\sup_{\substack{X\in M_d(\mathbb C)\\ \|X\|_1\le1}}\|T(X)-X\|_1 \le 4\sup_{\substack{\psi\in\mathbb C^d\\ \|\psi\|_2=1}} \sqrt{1-\operatorname{Re}\operatorname{tr}\!\bigl(P_\psi T(P_\psi)\bigr)}.X∈Md​(C)∥X∥1​≤1​sup​∥T(X)−X∥1​≤4ψ∈Cd∥ψ∥2​=1​sup​1−Retr(Pψ​T(Pψ​))​.

The supremum on the left includes all complex matrices satisfying the trace norm bound. The statement includes d=1d=1d=1 and excludes d=0d=0d=0.

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