4.13
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_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.
On the standing domain, α↦log Qtilde_α is convex and α↦Dtilde_α is increasing.
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.13
4.13, arXiv:1504.00233v5, PDF p.64. -/
theorem sandwiched_order_parameter [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
(hc : paperSupported r s) :
ConvexOn ℝ (Set.Ioi 0) (fun a => Real.logb 2 (paperRenyiQ true r s a)) ∧
Monotone (paperRenyi true 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
For every nonempty finite index type with decidable equality and every positive semidefinite with and , two assertions hold. First, writing for functional calculus with scalar function at zero and elsewhere, the real function
is convex on . Second, the extended-real function specified below is monotone: for every extended nonnegative , including and . For finite , with denoting functional calculus with and with , embedded as a real otherwise, its values are
Its endpoint values are defined by
where both infima are extended-real infima over the indicated embedded real or extended-real values. The convexity assertion concerns only positive finite real orders, while the monotonicity assertion concerns the entire extended nonnegative domain.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.