5.8
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.mixed_renyi_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)+Htilde_β↓(A|C)=0 for reciprocal orders αβ=1, including (0,∞) and (∞,0) interpreted by limits rather than 0*∞ arithmetic.
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.8
5.8, arXiv:1504.00233v5, PDF p.84. -/
theorem mixed_renyi_duality [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : IsDensityMatrix r) (hp : paperPure r) (a : ENNReal) :
conditionalUp false a (traceRight r)+conditionalDown true a⁻¹ (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 be any extended nonnegative real number, including zero and , and form
For positive semidefinite , write for functional calculus of away from zero with value zero at zero, including for zero or negative exponents, let be functional calculus of the total with value zero at zero, and define if , and otherwise. Put
For each choice, define ; for real , define if or , and otherwise, where and otherwise. Define for finite positive , and ; at infinite order define and , with extended-real infima and suprema and positive-semidefinite matrix order. For on , let , and put
Then
in the extended reals, where and . There is no further restriction on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.