Lemma 4: entropy decomposition of an arbitrary discrete mixture
OpenQAlgorithms.Papers.Independent.Intakethird100.P63.lemma4_entropyDecompositionAll states below are positive trace-class density operators of trace one on completed complex Hilbert tensor products, represented in countable orthonormal coordinates. Finite dimensional systems are included. Entropies use natural logarithms and the convention . A discrete ensemble may have finitely or countably many components: its weights are nonnegative and sum to one, and each component with is a normalized density operator. Every mixture below is the computed trace-norm convergent sum . All component conditions concern positive-weight labels only.
Assume only that the mixture has finite entropy, . Let denote Umegaki relative entropy, with value on support failure. Then
Both sums are taken as nonnegative extended sums; their equality to the finite left side entails their finiteness. No orthogonality or Shannon-entropy bound is required. The component support inclusions follow from the mixture and are not assumptions.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P63
noncomputable section
open scoped ENNReal BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P63
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the accepted nuclear trace-class, positive, trace-one predicate verbatim.
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Dependency50.P13 (finiteRelativeEntropy)
/-- Lemma 4, PDF p.6, (14b): entropy decomposition of any discrete mixture.
Only finite entropy of the computed mixture is assumed; no Shannon bound, support
inclusion premise, component entropy bounds, or orthogonality is added. -/
theorem lemma4_entropyDecomposition {I : Type} [Countable I] (e : DiscreteDensityEnsemble I)
(hfinite : herbutEntropy (herbutMixture e) ≠ ⊤) :
herbutEntropy (herbutMixture e) =
(∑' k, ENNReal.ofReal (e.weight k) * traceClassDivergence (e.component k) (herbutMixture e)) +
(∑' k, ENNReal.ofReal (e.weight k) * herbutEntropy (e.component k)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any countable type, and let consist of weights and complex kernels , indexed by , such that , the weights are summable, and . Whenever , assume is a density kernel: it admits an expansion with and ; every finite quadratic form is real and nonnegative; and its real diagonal is summable with sum . Components with zero weight need not satisfy these conditions. Define the mixture entrywise by . For any kernel on a label set , define as the infimum of over all representations , where are summable with sum , and the vectors having positive weight are unit vectors and pairwise orthogonal; zero-weight vectors are unrestricted. Here , regarded as an extended nonnegative real, and an empty infimum is . Define as the supremum over every , including , and every orthonormal family , of the following quantity. Form matrices
The quantity is unless ; when this inclusion holds, it is
with the matrix functions defined by continuous functional calculus. If , then
This equality is in , where ; no separate finiteness assumption is imposed on individual component entropies or divergences. The quantification permits an empty , although no ensemble satisfying the stated density and mass requirements exists then.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.