Minimum output entropy as a right trace-power limit
ProvedQAlgorithms.Papers.Independent.Support50.P31.entropyLimitAtOneLet be a completely positive trace-preserving endomorphism on a nonzero finite-dimensional complex Hilbert space. For real , set , where the maximum is over all density inputs, and let , using natural logarithms and . Then
This limit connects output Schatten purity with minimum output entropy; the right-hand approach excludes the zero denominator at .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF p.4: right limit of maximal trace-power quotient, in natural units. -/
theorem entropyLimitAtOne {I : Type} [Fintype I] [DecidableEq I] [Nonempty I]
(Phi : Superop I I) (hPhi : IsChannel Phi) :
Tendsto (fun p : ℝ => (1 - maxPower p Phi) / (p - 1))
(nhdsWithin 1 (Set.Ioi 1)) (nhds (nuH Phi)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, and let be a map on complex matrices admitting a finite representation with . For a real number , define as the supremum, over all positive semidefinite trace-one inputs , of , where is applied by continuous functional calculus; on these outputs this is . Define as the infimum over the same inputs of , using natural logarithms and . Then
The limit concerns real approaching one and imposes no value at .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.