§5.3.4: other three tensor additivities
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.other_conditional_additivitiesAll 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.
Both fixed-reference families and the optimized Petz entropy are additive on actual independent tensor-product inputs, for the orders where the respective quantities are defined.
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.otheradditivity
§5.3.4: other three tensor additivities, arXiv:1504.00233v5, PDF p.85. -/
theorem other_conditional_additivities [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(r : paperMat (A × B)) (s : paperMat (C × D)) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) (a : ENNReal) :
conditionalDown false a (paperIndependentProduct r s) = conditionalDown false a r+conditionalDown false a s ∧
conditionalDown true a (paperIndependentProduct r s) = conditionalDown true a r+conditionalDown true a s ∧
conditionalUp false a (paperIndependentProduct r s) = conditionalUp false a r+conditionalUp false 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 on and on each have trace one, and let be any extended nonnegative real, including zero and infinity. Define on by
For a matrix on , write , and define
To specify these quantities completely, let be functional calculus using the function zero at zero and elsewhere, let , and let , otherwise. Put
For real , at define as if , and otherwise; at , define it as
if either and , or , and as otherwise. Set , , and , where means . All optimizations and subsequent arithmetic are extended real, and the upward optimization allows zero and other matrices of trace less than one. Then all three identities hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.