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
ProvedQAlgorithms.Papers.Independent.Renew46.P43.tenderMeasurementLet be normalized states, let be a finite or countable POVM, and let . Suppose and for every . The interior instrument is ; the total instrument retains as a classical label.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary types , with countable and finite with decidable equality, let be positive semidefinite complex matrices indexed by , each of trace . Let be positive semidefinite matrices whose unordered sum converges to the identity, let be any function, and let . Assume that for every . Define by functional calculus and . Then both
and
The sums use the total infinite-sum operation, which returns zero for a nonsummable family. No upper bound on is assumed. The type may be empty, in which case the pointwise hypotheses and conclusions are vacuous; if is nonempty, the density hypotheses exclude empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.