4.21
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.petz_order_parameterAll 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.
For every normalized pair of states, the extended logarithm of the Petz trace functional is convex in the positive order, the Petz divergence is nondecreasing, and its order-one value is Umegaki divergence. Orthogonal pairs are included.
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.21
Corollary 4.21, PDF pp.70-71. Extended log Q retains orthogonal pairs;
no support premise is added. The value at order one is the Umegaki divergence. -/
theorem petz_order_parameter [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) :
(∀ a b : ℝ, 0 < a → 0 < b → ∀ l : ℝ, l ∈ Set.Icc 0 1 →
paperLogE (paperRenyiQ false r s (l*a+(1-l)*b)) ≤ (l:EReal)*paperLogE (paperRenyiQ false r s a)+((1-l:ℝ):EReal)*paperLogE (paperRenyiQ false r s b)) ∧
Monotone (paperRenyi false r s) ∧ paperRenyi false r s 1 = 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 positive semidefinite complex matrices indexed by , each with complex trace . Write for functional calculus with the scalar function away from zero and value zero at zero, even for zero or negative exponents, put , and let be at and the real number , embedded in the extended reals, otherwise. Define as if , and as otherwise, where is functional calculus of the total real logarithm , whose value at zero is zero. For real , define at ; otherwise set when or , and set in the remaining case. Define , for , by , , and for finite positive . The assertion is that, for every pair of positive real numbers and every ,
that whenever , and that . The displayed inequality and monotonicity use extended-real arithmetic, include endpoint mixture weights and the orders , and do not require .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.