5.9
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_up_additiveAll 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.
For independent normalized bipartite states, Htilde_α↑(AAprime|BBprime) is the sum of the two conditional entropies for 1/2≤α<∞, with the actual regrouped tensor product.
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.9
5.9, arXiv:1504.00233v5, PDF p.84. -/
theorem sandwiched_up_additive [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(r : paperMat (A × B)) (s : paperMat (C × D)) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
(a : ENNReal) (ha : 1/2 ≤ a) (hfin : a < ⊤) :
conditionalUp true a (paperIndependentProduct r s) = conditionalUp true a r+conditionalUp true a 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 finite, nonempty index types with decidable equality, let and be positive semidefinite complex matrices on and , respectively, each with trace , and let be an extended nonnegative real number satisfying . For positive semidefinite , let denote functional calculus of off zero with value zero at zero, including for zero or negative exponents, let be functional calculus of the total real with value zero at zero, and define if , and otherwise. For the finite real value of , put
Define ; when , define if or , and otherwise, where and otherwise. For a matrix on , define , with indexed by and the supremum taken in the extended reals. Define , indexed by , by
Then
as an equality in the extended reals. The combined quantity uses a supremum over all density matrices on ; the hypotheses include and , and exclude infinite order.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.