Remark 3: convexity of entropy gain on the finite-entropy domain
OpenQAlgorithms.Papers.Independent.Gap48.P45.entropyGain_convexityAll physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. For a finite or countable ensemble with average , suppose both and are finite. Define the entropy gain on this finite-entropy domain. Its weighted series is absolutely convergent and
Only positive-weight constituents affect this identity.
This result expresses information monotonicity as convexity of finite entropy gain.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap48.P45
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P18
(operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
IsParsevalFrame IsKrausRepresentation)
open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)
open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
/-- Remark 3, PDF p.19: countable convexity of entropy gain at finite average
input/output entropy. Absolute summability is a conclusion, not a premise. -/
theorem entropyGain_convexity
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (e : DiscreteEnsemble I)
(hInput : extendedEntropyNats (discreteAverageCoefficients e) < ⊤)
(hOutput : extendedEntropyNats (Phi.val (discreteAverageCoefficients e)) < ⊤) :
Summable (fun i => e.weight i * finiteEntropyGain Phi.val (e.state i).coefficients) ∧
finiteEntropyGain Phi.val (discreteAverageCoefficients e) ≤
∑' i, e.weight i * finiteEntropyGain Phi.val (e.state i).coefficients := by sorry
end QAlgorithms.Papers.Independent.Gap48.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable, nonempty types, with . Call a matrix trace class when for vectors with . States are trace-class matrices whose finite-coordinate quadratic forms are real and nonnegative and whose real diagonals are summable with sum . Let preserve trace class, be additive and complex homogeneous there, and send states to states after amplification by the identity on every finite coordinate space: amplification applies to each matrix block indexed by the auxiliary coordinates. Let be an ensemble of states with and , where the weight series converges. For a matrix , let be a chosen bounded operator having coordinate matrix , or if none exists, and let . The ensemble average used in this statement is
For a finite coordinate set , write , and define
where , regarded as an extended nonnegative real, and denotes continuous functional calculus with the real logarithm, including . Put , where is the real value of a finite extended nonnegative number and . If and , then the real series is summable and
All indices, including those of weight zero, carry states; individual entropy finiteness is not an explicit hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.