5.11
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.conditional_rank_boundsAll 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 every one of the four conditional entropies in its DPI range, −log min(rankρ_A,rankρ_B)≤Hα(A|B)≤log rankρ_A; additionally Hα≥0 for separable normalized ρ_AB.
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.11
5.11, arXiv:1504.00233v5, PDF p.86. -/
theorem conditional_rank_bounds [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(sand up : Bool) (a : ENNReal) (ha : DPIOrder sand a) :
(-Real.logb 2 (min (traceRight r).rank (traceLeft r).rank):EReal) ≤ paperConditional sand up a r ∧
paperConditional sand up a r ≤ (Real.logb 2 (traceRight r).rank:EReal) ∧
(paperSeparable r → 0 ≤ paperConditional sand up a r) := 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 on have . Choose Boolean flags , interpreted as for false and for true, and an extended nonnegative order . Assume if , and if . Define by functional calculus using the function that is zero at zero and elsewhere, and define by functional calculus using the total real logarithm. Let and otherwise. For positive semidefinite , write for , and put
For real , is at when , and at otherwise; for , it is
when either and , or , and is otherwise. Its endpoint definitions are
All these quantities are extended real. With and , define
Then
Moreover whenever there exist a natural number , nonnegative weights summing to one, and positive semidefinite matrices on , respectively, each of trace one, such that . The optimizing above need only have trace at most one; the order range includes when , and when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.