Unnumbered: Petz difference monotonicity near one, as proved in Appendix B
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.petz_difference_near_oneAll 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. Suppose the full computed variance of (B.14) is strictly positive. Then there exists an instance-dependent such that
The one endpoint uses the ordinary relative entropy relativeEntropyDifference. This states the Petz neighborhood monotonicity justified in Appendix B; it does not include the explicitly unhandled case or assert a sandwiched analogue.
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.34–37, Appendix B: PETZ local monotonicity
under the proof's explicit V>0 condition. Neighborhood depends on rho,sigma,N. -/
theorem petz_difference_near_one (rho sigma : Op A) (N : Superop A B)
(hrho : IsDensityMatrix rho) (hprho : rho.PosDef)
(hsigma : IsDensityMatrix sigma) (hpsigma : sigma.PosDef) (hN : StrictChannel N)
(hV : 0 < differenceVariance rho sigma N) :
∃ eta : ℝ, 0 < eta ∧ eta < 1 ∧
MonotoneOn (fun a : ℝ => differencePetz a rho sigma N) (Set.Ioo (1-eta) (1+eta)) := 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 for a finite family satisfying , and assume that every amplification , for every natural number , sends positive definite matrices to positive definite matrices. Define
Assume . Write for continuous functional calculus with scalar value at zero and otherwise, and define
Then there exists a real with such that whenever . This is nondecreasingness on the entire open interval, including comparisons involving the defined value . All logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.