§6.1.3 (6.22)–(6.23): max-entropy versus support entropy
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.max_support_entropyAll 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. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
For every subnormalized rho_AB, including zero, the max-entropy is at most the optimized logarithmic support trace. This support entropy equals the logarithm of the operator norm of the partial trace of the support projector; the scalar reference-state maximum is attained.
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#6.hartleybound
§6.1.3 (6.22)–(6.23): max-entropy versus support entropy, arXiv:1504.00233v5, PDF p.95,96. -/
theorem max_support_entropy [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r) :
hmax r ≤ hartleyConditional r ∧ hartleyConditional r = paperLogE ‖traceLeft (paperPower r 0)‖ ∧
(∃ s : paperMat B, paperSubnormalized s ∧ (paperPower r 0*Matrix.kronecker (1:paperMat A) s).trace.re = ‖traceLeft (paperPower r 0)‖) ∧
(∀ s : paperMat B, paperSubnormalized s → (paperPower r 0*Matrix.kronecker (1:paperMat A) s).trace.re ≤ ‖traceLeft (paperPower 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 nonempty finite types with decidable equality, and let be a positive semidefinite matrix on with , including the possibility . Let be obtained from by functional calculus with the function that is at and at every nonzero real number; thus is the support projection of this positive semidefinite . Write
where the second branch is a real number embedded into the extended reals. Define
Then
Furthermore, there exists on with such that
and every such subnormalized satisfies the corresponding inequality with . Here , and is the ambient matrix norm appearing in the statement. In particular, the definitions retain when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.