Lemma 5: mutual-information mixing for a monoorthogonal decomposition
OpenQAlgorithms.Papers.Independent.Intakethird100.P63.lemma5_monoorthogonalMixingAll 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 . Every subsystem entropy occurring in an entropy difference is finite; this is the proof-supported finite-entropy reading of the source, and imposes no finite Hilbert dimension. 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.
Consider a bipartite ensemble on parties , monoorthogonal on party : for distinct active labels. Let be Umegaki relative entropy and let . Then
The sums may first be formed as nonnegative extended sums and are finite on this domain. This describes information in a mixture with orthogonality on only one subsystem; neither SSA equality nor third-party orthogonality is required.
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 5, PDF p.7, (18): monoorthogonal mutual-information mixing. The relative
entropy uses third-party marginals, with two plus signs and no Shannon term. -/
theorem lemma5_monoorthogonalMixing (e : DiscreteDensityEnsemble (Fin 2 → ℕ))
(hmono : Monoorthogonal e {0})
(hfinite : FiniteSubsystemEntropies (herbutMixture e)) :
ENNReal.ofReal (clusterMutualInformation (herbutMixture e) {0} {1}) =
(∑' k, ENNReal.ofReal (e.weight k) *
traceClassDivergence (herbutReduction (e.component k) {1}) (herbutReduction (herbutMixture e) {1})) +
(∑' k, ENNReal.ofReal (e.weight k) *
ENNReal.ofReal (clusterMutualInformation (e.component k) {0} {1})) := 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 consist of nonnegative summable real weights with and kernels indexed by pairs of natural numbers. For each with , require that admit a representation by square-summable vectors with , have real nonnegative finite quadratic forms, and have a summable real diagonal of sum ; zero-weight components are unrestricted. Put . For , define the reduced kernel by
where and combines the coordinates on and its complement. For any kernel , let be the infimum of over all entrywise expansions with nonnegative summable weights of sum and square-summable vectors whose positive-weight members are unit and mutually orthogonal; zero-weight vectors are unrestricted, and an empty infimum is . Write , where , and define . Assume that, for distinct with , the reductions on coordinate obey
and assume for every , including the empty set. For kernels on the same label set, define as the supremum over all finite orthonormal families , including the empty family, of the quantity obtained from compressions and : it is if , and otherwise is , where , , and matrix functions use continuous functional calculus. Then
Here takes values in , and . Individual component marginal entropies are not assumed finite; their conversion to real numbers uses the stated convention.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.