Lemma 12
ProvedQAlgorithms.Papers.Independent.Support50.P21.eigenvalue_and_trace_boundsAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be density operators with . Let denote the smallest strictly positive eigenvalue. Then
The support hypothesis and normalization keep these logarithms finite. These are both bounds in Lemma 12.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Lemma 12, PDF pp.5–6, (31)–(32): minimum STRICTLY positive eigenvalue,
plus the full-trace-norm bound with exactly the factor 1/2. -/
theorem eigenvalue_and_trace_bounds (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hsupp : SupportIncluded rho sigma) :
dMin rho sigma ≤ maxRelative rho sigma ∧
maxRelative rho sigma ≤ -elog (minPositiveEigenvalue sigma) ∧
dMin rho sigma ≤ -elog (1 - traceNorm (rho - sigma) / 2) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite index type with decidable equality, let be positive semidefinite complex matrices indexed by , each with complex trace one, and suppose . Write , let be the orthogonal projection onto the range of , define for and otherwise, and put
where the infimum is extended-real-valued and an empty feasible set gives . Let be the least strictly positive eigenvalue of , defined to be zero if there are none, and let . Then
The density hypothesis ensures that has a positive eigenvalue; if the argument of in the final bound is zero or negative, its right side is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.