Unnumbered: non-negativity of relative-entropy-difference variance
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.difference_variance_nonnegativeAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Let be positive definite states and a strict CPTP map. Define , , and . For the full variance
All traces are real on these Hermitian expressions. The final correction is essential; the functional is not merely the ordinary variance of . This supplies the nonnegative coefficient in Appendix B.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.35–36, (B.14)–(B.21): full variance nonnegativity. -/
theorem difference_variance_nonnegative (rho sigma : Op A) (N : Superop A B)
(hrho : IsDensityMatrix rho) (hprho : rho.PosDef)
(hsigma : IsDensityMatrix sigma) (hpsigma : sigma.PosDef) (hN : StrictChannel N) :
0 ≤ differenceVariance rho sigma N := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite index types with decidable equality, and let be positive definite complex matrices on , each with trace . Let have a finite Kraus representation with , and assume that, for every natural number , its amplification sends every positive definite matrix to a positive definite matrix. Define
where the logarithms use the natural real logarithm through continuous functional calculus and denotes a matrix unit. Then
The squares here are matrix products, and the amplification assumption includes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.