5.7
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_up_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, Htilde_α↑(A|B)+Htilde_β↑(A|C)=0 for 1/α+1/β=2, α,β∈[1/2,∞], including complementary endpoint (1/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.7
5.7, arXiv:1504.00233v5, PDF p.82. -/
theorem sandwiched_up_duality [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : IsDensityMatrix r) (hp : paperPure r) (a b : ENNReal) (ha : 1/2 ≤ a) (hb : 1/2 ≤ b) (hab : a⁻¹+b⁻¹ = 2) :
conditionalUp true a (traceRight r)+conditionalUp true 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 , of trace and rank . Let satisfy and , using the extended nonnegative inverse, so has inverse zero. Define
For positive semidefinite , let be functional calculus of away from zero with value zero at zero, even for zero or negative exponents, let be functional calculus of the total logarithm , with value zero at zero, and set if , and otherwise. For finite positive , put . Define ; for finite positive , define if or , and otherwise, where and otherwise; at infinite order set , where the infimum is in the extended reals and means is positive semidefinite. For on , define
Then
in the extended reals. The order pairs and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.