5.6
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.petz_down_dualityAll 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 a normalized pure ABC state, Hbar_α↓(A|B)+Hbar_β↓(A|C)=0 for α+β=2, α,β∈[0,2].
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.6
5.6, arXiv:1504.00233v5, PDF p.82. -/
theorem petz_down_duality [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : IsDensityMatrix r) (hp : paperPure r) (a b : ℝ) (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : a+b = 2) :
conditionalDown false (ENNReal.ofReal a) (traceRight r)+conditionalDown false (ENNReal.ofReal b) (paperTraceMiddle r) = 0 := 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, and let be a positive semidefinite complex matrix on with trace and rank . Let satisfy , , and . Define its two marginals by
For positive semidefinite , write for functional calculus of off zero with value zero at zero, including at exponent zero or a negative exponent; let be functional calculus of , with total value zero at zero; define if , and otherwise. Set . Define , and, for , set if or , and otherwise, where and otherwise. For a nonnegative finite order , put when , and , taking the infimum in the extended reals. For on , write and set . Then, as an equality in the extended reals,
The nonnegative real orders are embedded into the extended nonnegative reals; the cases and are included, with order zero defined by the stated infimum.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.