Theorem 2 (§VIII.A): smooth max-relative entropy gives spectral sup-divergence
ProvedQAlgorithms.Papers.Independent.Support50.P21.spectralSup_smoothMaxAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Fix a nonzero finite-dimensional system . Let be density operators and on for each . Define and
Then, in the extended real topology,
The limit in is taken first. There are no iid, support, trace-bound-on-, or finite-rate assumptions. This identifies the spectral sup-divergence rate with the smoothed asymptotic quantity.
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]
/-- Theorem 2, PDF pp.8–9, (53): arbitrary (not necessarily iid) tensor-register
sequences; n=k+1. No support, trace-bound-on-sigma, or finite-rate hypothesis. -/
theorem spectralSup_smoothMax (rho sigma : (k : ℕ) → Mat (PositiveTensorBasis I k))
(hrho : ∀ k, IsDensityMatrix (rho k)) (hsigma : ∀ k, (sigma k).PosSemidef) :
Tendsto (maxAsymptotic rho sigma) (nhdsWithin 0 (Set.Ioi (0 : ℝ)))
(nhds (spectralSup rho sigma)) := 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
Let be a finite index type with decidable equality. For every integer , let be complex matrices indexed by the functions , with positive semidefinite of trace and positive semidefinite. No trace normalization or nonzero condition is imposed on . Define
For , set , let be its spectral projection onto the nonnegative eigenvalues, including zero, and put . Then, in the topology of the extended reals,
The outer limit is through strictly positive real ; it does not evaluate the expression at . The index corresponds to one coordinate, and no tensor-product structure relating different is required. The final infimum is an extended-real infimum, with value if its defining set is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.