Lemma 5: one-sided trace-norm robustness
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.trace_norm_robustnessLet be density matrices on the same finite-dimensional system, and let . Write for the trace norm, , and for the retained-eigenvalue-subset spread at mass at least . If , then
The endpoint is included. This is a one-sided robustness estimate for the unsmoothed spread.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P61
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)
open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
attribute [local instance] Classical.propDecidable
section SpectralResults
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- PDF p.4, Lemma 5: one-sided trace-norm robustness, including epsilon=0. -/
theorem trace_norm_robustness (rho sigma : Matrix I I ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(epsilon : ℝ) (hzero : 0 ≤ epsilon) (hone : epsilon < 1)
(hclose : traceNorm (rho - sigma) ≤ epsilon) :
smoothSpread sigma (Real.sqrt epsilon) + logTwo (1 - Real.sqrt epsilon) ≤ spread rho := by sorry
end SpectralResults
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a finite index type with decidable equality, let be positive semidefinite complex matrices of trace , and let . Assume
For the ascending eigenvalues of , put
and write for the complex dimension of the range of and for its largest eigenvalue. Then
The tolerance is included; the retention family is nonempty, its subsets are nonempty, and the logarithm has positive argument. The density hypotheses exclude empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.