4.15
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_limit_oneAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion.
The one-sided limits of Dtilde_α as α approaches 1 equal normalized-trace Umegaki divergence, including +∞ on support failure.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#4.15
4.15, arXiv:1504.00233v5, PDF p.65. -/
theorem sandwiched_limit_one [Nonempty I] (r s : paperMat I) (hr : r.PosSemidef) (hne : r ≠ 0) (hs : s.PosSemidef) :
renyiFinite true r s 1 = paperRelativeD r s ∧
Tendsto (renyiFinite true r s) (nhdsWithin 1 (Set.Iio 1)) (nhds (paperRelativeD r s)) ∧
Tendsto (renyiFinite true r s) (nhdsWithin 1 (Set.Ioi 1)) (nhds (paperRelativeD r s)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite, nonempty index type with decidable equality, and let be complex matrices indexed by , with positive semidefinite and nonzero and positive semidefinite. For any positive semidefinite matrix , write for the functional calculus of the function that is when and when , including when or , and write for the functional calculus of , with the total-function value . Put
Define the extended-real-valued function to be at ; for , define it as if either and , or , and as otherwise, where the extended logarithm sends zero to . Then , and tends to both as real approaches from below and as it approaches from above, in the topology of the extended real line. No trace normalization or support inclusion is assumed; the asserted limiting value can therefore be .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.