Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 5: mutual-information mixing for a monoorthogonal decomposition

Open
QAlgorithms.Papers.Independent.Intakethird100.P63.lemma5_monoorthogonalMixing

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All 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 0log⁡0=00\log 0=00log0=0. 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 wkw_kwk​ are nonnegative and sum to one, and each component with wk>0w_k>0wk​>0 is a normalized density operator. Every mixture below is the computed trace-norm convergent sum ρ=∑kwkρk\rho=\sum_k w_k\rho^kρ=∑k​wk​ρk. All component conditions concern positive-weight labels only.

Consider a bipartite ensemble on parties 2,32,32,3, monoorthogonal on party 222: ρ2kρ2l=0\rho_2^k\rho_2^l=0ρ2k​ρ2l​=0 for distinct active labels. Let DDD be Umegaki relative entropy and let I(2:3)=S2+S3−S23I(2:3)=S_2+S_3-S_{23}I(2:3)=S2​+S3​−S23​. Then

I(2:3)ρ=∑kwkD(ρ3k∥ρ3)+∑kwkI(2:3)ρk.I(2:3)_\rho=\sum_k w_k D(\rho_3^k\|\rho_3)+\sum_k w_k I(2:3)_{\rho^k}.I(2:3)ρ​=k∑​wk​D(ρ3k​∥ρ3​)+k∑​wk​I(2:3)ρk​.

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P63
Formal statement
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
Source
On Mutual Information in Multipartite Quantum States and Equality in Strong Subadditivity of Entropy, arXiv:quant-ph/0311193v1, PDF p. 7, Lemma 5: mutual-information mixing for a monoorthogonal decomposition
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let eee consist of nonnegative summable real weights wkw_kwk​ with ∑kwk=1\sum_k w_k=1∑k​wk​=1 and kernels XkX_kXk​ indexed by pairs of natural numbers. For each kkk with wk>0w_k>0wk​>0, require that XkX_kXk​ admit a representation Xk(x,y)=∑rur(x)vr(y)‾X_k(x,y)=\sum_r u_r(x)\overline{v_r(y)}Xk​(x,y)=∑r​ur​(x)vr​(y)​ by square-summable vectors with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, have real nonnegative finite quadratic forms, and have a summable real diagonal of sum 111; zero-weight components are unrestricted. Put X(x,y)=∑kwkXk(x,y)X(x,y)=\sum_k w_kX_k(x,y)X(x,y)=∑k​wk​Xk​(x,y). For C⊆{0,1}C\subseteq\{0,1\}C⊆{0,1}, define the reduced kernel by

YC(a,b)=∑z:C∁→NY(a⊔z,b⊔z),Y_C(a,b)=\sum_{z:C^{\complement}\to\mathbb N}Y(a\sqcup z,b\sqcup z),YC​(a,b)=z:C∁→N∑​Y(a⊔z,b⊔z),

where a,b:C→Na,b:C\to\mathbb Na,b:C→N and a⊔za\sqcup za⊔z combines the coordinates on CCC and its complement. For any kernel YYY, let H(Y)H(Y)H(Y) be the infimum of ∑r[−arlog⁡ar]+\sum_r[-a_r\log a_r]_+∑r​[−ar​logar​]+​ over all entrywise expansions Y=∑rarqrqr∗Y=\sum_r a_rq_rq_r^*Y=∑r​ar​qr​qr∗​ with nonnegative summable weights of sum 111 and square-summable vectors whose positive-weight members are unit and mutually orthogonal; zero-weight vectors are unrestricted, and an empty infimum is +∞+\infty+∞. Write SY(C)=toReal⁡H(YC)S_Y(C)=\operatorname{toReal}H(Y_C)SY​(C)=toRealH(YC​), where toReal⁡(+∞)=0\operatorname{toReal}(+\infty)=0toReal(+∞)=0, and define JY(A,B)=SY(A)+SY(B)−SY(A∪B)J_Y(A,B)=S_Y(A)+S_Y(B)-S_Y(A\cup B)JY​(A,B)=SY​(A)+SY​(B)−SY​(A∪B). Assume that, for distinct k,lk,lk,l with wk,wl>0w_k,w_l>0wk​,wl​>0, the reductions on coordinate 000 obey

∑z(Xk){0}(a,z)(Xl){0}(z,b)=0for every a,b,\sum_z (X_k)_{\{0\}}(a,z)(X_l)_{\{0\}}(z,b)=0 \quad\text{for every }a,b,z∑​(Xk​){0}​(a,z)(Xl​){0}​(z,b)=0for every a,b,

and assume H(XC)≠+∞H(X_C)\ne+\inftyH(XC​)=+∞ for every C⊆{0,1}C\subseteq\{0,1\}C⊆{0,1}, including the empty set. For kernels Y,ZY,ZY,Z on the same label set, define D(Y∥Z)D(Y\|Z)D(Y∥Z) as the supremum over all finite orthonormal families vvv, including the empty family, of the quantity obtained from compressions Yabv=∑iva(i)‾∑jY(i,j)vb(j)Y^v_{ab}=\sum_i\overline{v_a(i)}\sum_jY(i,j)v_b(j)Yabv​=∑i​va​(i)​∑j​Y(i,j)vb​(j) and ZvZ^vZv: it is +∞+\infty+∞ if ker⁡Zv⊈ker⁡Yv\ker Z^v\not\subseteq\ker Y^vkerZv⊆kerYv, and otherwise is [Re⁡tr⁡(f(Yv)−Yvg(Zv)−Yv+Zv)]+[\operatorname{Re}\operatorname{tr}(f(Y^v)-Y^v g(Z^v)-Y^v+Z^v)]_+[Retr(f(Yv)−Yvg(Zv)−Yv+Zv)]+​, where f(t)=tlog⁡tf(t)=t\log tf(t)=tlogt, g(t)=log⁡tg(t)=\log tg(t)=logt, and matrix functions use continuous functional calculus. Then

[JX({0},{1})]+=∑k=0∞[wk]+D((Xk){1}∥X{1})+∑k=0∞[wk]+[JXk({0},{1})]+.[J_X(\{0\},\{1\})]_+ = \sum_{k=0}^{\infty}[w_k]_+ D\bigl((X_k)_{\{1\}}\|X_{\{1\}}\bigr) + \sum_{k=0}^{\infty}[w_k]_+ [J_{X_k}(\{0\},\{1\})]_+.[JX​({0},{1})]+​=k=0∑∞​[wk​]+​D((Xk​){1}​∥X{1}​)+k=0∑∞​[wk​]+​[JXk​​({0},{1})]+​.

Here [t]+=max⁡(t,0)[t]_+=\max(t,0)[t]+​=max(t,0) takes values in [0,∞][0,\infty][0,∞], and 0⋅(+∞)=00\cdot(+\infty)=00⋅(+∞)=0. Individual component marginal entropies are not assumed finite; their conversion to real numbers uses the stated convention.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me