Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma I.5: If D identifies phi(a) in rho_a with pointwise error≤lambda>0, both ||rho_a−Dint*(rho_a)||1 and ||[phi(a)]⊗rho_a−Dtot*(rho_a)||1 a

Proved
QAlgorithms.Papers.Independent.Renew46.P43.tenderMeasurement

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

prove2quantum

Let ρa\rho_aρa​ be normalized states, let (Db)b∈B(D_b)_{b\in B}(Db​)b∈B​ be a finite or countable POVM, and let ϕ:A→B\phi:A\to Bϕ:A→B. Suppose λ>0\lambda>0λ>0 and 1−Tr⁡(ρaDϕ(a))≤λ1-\operatorname{Tr}(\rho_aD_{\phi(a)})\le\lambda1−Tr(ρa​Dϕ(a)​)≤λ for every aaa. The interior instrument is Dint,∗(ρ)=∑bDbρDbD_{\rm int,*}(\rho)=\sum_b\sqrt{D_b}\rho\sqrt{D_b}Dint,∗​(ρ)=∑b​Db​​ρDb​​; the total instrument retains bbb as a classical label.

∥ρa−Dint,∗(ρa)∥1≤8λ+λ,∥[ϕ(a)]⊗ρa−Dtot,∗(ρa)∥1≤8λ+λ.\|\rho_a-D_{\rm int,*}(\rho_a)\|_1\le\sqrt{8\lambda}+\lambda,\qquad \|[\phi(a)]\otimes\rho_a-D_{\rm tot,*}(\rho_a)\|_1\le\sqrt{8\lambda}+\lambda.∥ρa​−Dint,∗​(ρa​)∥1​≤8λ​+λ,∥[ϕ(a)]⊗ρa​−Dtot,∗​(ρa​)∥1​≤8λ​+λ.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

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

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma I.5, PDF p.10; countable observables as permitted on PDF p.62.
The second bound retains the real outcome, rather than replacing the instrument. -/
theorem tenderMeasurement {A B I : Type*} [Countable B] [Fintype I] [DecidableEq I]
    (rho : A → Matrix I I ℂ) (hrho : ∀ a, IsDensityMatrix (rho a))
    (D : B → Matrix I I ℂ) (hD : IsCountablePOVM D) (phi : A → B)
    (lambda : ℝ) (hlambda : 0 < lambda)
    (herror : ∀ a, 1 - effectProb (rho a) (D (phi a)) ≤ lambda) :
    (∀ a, traceNorm (rho a - interior D (rho a)) ≤ Real.sqrt (8 * lambda) + lambda) ∧
    (∀ a, totalDisturbance D (rho a) (phi a) ≤ Real.sqrt (8 * lambda) + lambda) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 10, Lemma I.5
Read-back

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

For arbitrary types A,B,IA,B,IA,B,I, with BBB countable and III finite with decidable equality, let (ρa)a∈A(\rho_a)_{a\in A}(ρa​)a∈A​ be positive semidefinite complex matrices indexed by III, each of trace 111. Let (Db)b∈B(D_b)_{b\in B}(Db​)b∈B​ be positive semidefinite matrices whose unordered sum converges to the identity, let ϕ:A→B\phi:A\to Bϕ:A→B be any function, and let λ>0\lambda>0λ>0. Assume that 1−Re⁡tr⁡(ρaDϕ(a))≤λ1-\operatorname{Re}\operatorname{tr}(\rho_aD_{\phi(a)})\le\lambda1−Retr(ρa​Dϕ(a)​)≤λ for every a∈Aa\in Aa∈A. Define Eb=DbE_b=\sqrt{D_b}Eb​=Db​​ by functional calculus and ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​. Then both

∀a∈A,∥ρa−∑b∈BEbρaEb∥1≤8λ+λ\forall a\in A,\qquad \left\|\rho_a-\sum_{b\in B}E_b\rho_aE_b\right\|_1 \le\sqrt{8\lambda}+\lambda∀a∈A,​ρa​−b∈B∑​Eb​ρa​Eb​​1​≤8λ​+λ

and

∀a∈A,∑b∈B∥1{b=ϕ(a)}ρa−EbρaEb∥1≤8λ+λ.\forall a\in A,\qquad \sum_{b\in B} \left\|\mathbf1_{\{b=\phi(a)\}}\rho_a-E_b\rho_aE_b\right\|_1 \le\sqrt{8\lambda}+\lambda.∀a∈A,b∈B∑​​1{b=ϕ(a)}​ρa​−Eb​ρa​Eb​​1​≤8λ​+λ.

The sums use the total infinite-sum operation, which returns zero for a nonsummable family. No upper bound on λ\lambdaλ is assumed. The type AAA may be empty, in which case the pointwise hypotheses and conclusions are vacuous; if AAA is nonempty, the density hypotheses exclude empty III.

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