Remark I.6: Mean identification error≤lambdaBar implies both mean disturbances from I.5≤sqrt(8lambdaBar)+lambdaBar.
ProvedQAlgorithms.Papers.Independent.Renew46.P43.tenderMeasurementMeanUse the states, countable POVM and square-root instruments above, but assume only , for a discrete probability law on the labels and . No pointwise error bound is required.
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
/-- Remark I.6, PDF p.10: the average of norms, under only a mean error bound. -/
theorem tenderMeasurementMean {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) (P : PMF A)
(lambda : ℝ) (hlambda : 0 < lambda)
(herror : (∑' a, (P a).toReal * (1 - effectProb (rho a) (D (phi a)))) ≤ lambda) :
(∑' a, (P a).toReal * traceNorm (rho a - interior D (rho a))) ≤
Real.sqrt (8 * lambda) + lambda ∧
(∑' a, (P a).toReal * 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 , and let be positive semidefinite matrices whose unordered sum converges to the identity. Let be any function, a probability mass function on , and . Write , using functional calculus, and . If
then
All infinite sums use the total infinite-sum operation, which returns zero for a nonsummable family. No countability assumption on , pointwise error bound, or upper bound on is imposed. The probability mass function requires to be nonempty, and the density hypotheses consequently exclude empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.