5.10
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.conditional_order_comparisonsAll 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. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy.
All four comparisons (5.66)–(5.67) at transformed order 2−1/α for 1/2≤α≤∞: tilde-up≤bar-up, bar-up≤bar-down, tilde-up≤tilde-down, and tilde-down≤bar-down, with each RHS at transformed order.
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#5.10
5.10, arXiv:1504.00233v5, PDF p.85. -/
theorem conditional_order_comparisons [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(a : ENNReal) (ha : 1/2 ≤ a) :
conditionalUp true a r ≤ conditionalUp false (transformedOrder a) r ∧
conditionalUp false a r ≤ conditionalDown false (transformedOrder a) r ∧
conditionalUp true a r ≤ conditionalDown true (transformedOrder a) r ∧
conditionalDown true a r ≤ conditionalDown false (transformedOrder a) r := 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 finite nonempty index types with decidable equality, let be a complex matrix on that is positive semidefinite with , and let satisfy . The conditional quantities in the assertion are defined as follows. Write , where and for , and write . Set and otherwise, with values in the extended reals. For positive semidefinite , put when , and define
For real , let
The real-valued first branch is embedded in the extended reals. Extend this definition by , , and
where means is positive semidefinite and the infimum is taken in the extended reals. For a matrix on , define its second marginal by , and set
Thus the optimizing matrices may have trace less than one, including zero; all these suprema and infima use extended-real arithmetic, and uses the specified zero-at-zero convention. Define if , and otherwise. Then all four inequalities hold:
The allowed orders include , for which , and , for which .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.