4.10
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_orderAll 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 normalized rho << sigma, Qtilde_α is increasing under replacement of rho by any larger positive operator, without a support restriction on that larger operator, for α>0; it decreases in its second argument for α>1 and increases there for 1/2≤α<1.
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.10
4.10, arXiv:1504.00233v5, PDF p.62. -/
theorem sandwiched_order [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
(hc : paperSupported r s) (a : ℝ) (ha : 0 < a) :
(∀ t : paperMat I, t.PosSemidef → paperBelow r t → paperRenyiQ true r s a ≤ paperRenyiQ true t s a) ∧
(∀ t : paperMat I, t.PosSemidef → paperBelow s t →
(1 < a → paperRenyiQ true r t a ≤ paperRenyiQ true r s a) ∧
(1/2 ≤ a → a < 1 → paperRenyiQ true r s a ≤ paperRenyiQ true r t a)) := 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 type with decidable equality, and let be complex matrices indexed by , both positive semidefinite and both having trace one. Assume . For any real exponent , define by continuous functional calculus using the scalar function that is zero at zero and equals at every nonzero real ; in particular, uses zero, rather than one, on the zero eigenspace. For a real , write
Then both of the following statements hold: for every positive semidefinite matrix such that ,
and for every positive semidefinite matrix such that ,
There is no trace restriction on either quantified , and singular matrices are included under the stated power convention. The first inequality applies to every ; the second pair imposes no inequality when or when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.