Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4: entropy decomposition of an arbitrary discrete mixture

Open
QAlgorithms.Papers.Independent.Intakethird100.P63.lemma4_entropyDecomposition

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. 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.

Assume only that the mixture has finite entropy, S(ρ)<∞S(\rho)<\inftyS(ρ)<∞. Let D(σ∥ρ)=Tr⁡(σlog⁡σ)−Tr⁡(σlog⁡ρ)D(\sigma\|\rho)=\operatorname{Tr}(\sigma\log\sigma)-\operatorname{Tr}(\sigma\log\rho)D(σ∥ρ)=Tr(σlogσ)−Tr(σlogρ) denote Umegaki relative entropy, with value +∞+\infty+∞ on support failure. Then

S(ρ)=∑kwkD(ρk∥ρ)+∑kwkS(ρk).S(\rho)=\sum_k w_k D(\rho^k\|\rho)+\sum_k w_k S(\rho^k).S(ρ)=k∑​wk​D(ρk∥ρ)+k∑​wk​S(ρk).

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.

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 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
Source
On Mutual Information in Multipartite Quantum States and Equality in Strong Subadditivity of Entropy, arXiv:quant-ph/0311193v1, PDF p. 6, Lemma 4: entropy decomposition of an arbitrary mixture by relative entropy
Read-back

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

Let III be any countable type, and let eee consist of weights wk∈Rw_k\in\mathbb Rwk​∈R and complex kernels Xk:I×I→CX_k:I\times I\to\mathbb CXk​:I×I→C, indexed by k∈Nk\in\mathbb Nk∈N, such that wk≥0w_k\ge0wk​≥0, the weights are summable, and ∑kwk=1\sum_k w_k=1∑k​wk​=1. Whenever wk>0w_k>0wk​>0, assume XkX_kXk​ is a density kernel: it admits an expansion Xk(i,j)=∑rur(i)vr(j)‾X_k(i,j)=\sum_r u_r(i)\overline{v_r(j)}Xk​(i,j)=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2(I;C)u_r,v_r\in\ell^2(I;\mathbb C)ur​,vr​∈ℓ2(I;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; every finite quadratic form ∑i,j∈szi‾Xk(i,j)zj\sum_{i,j\in s}\overline{z_i}X_k(i,j)z_j∑i,j∈s​zi​​Xk​(i,j)zj​ is real and nonnegative; and its real diagonal is summable with sum 111. Components with zero weight need not satisfy these conditions. Define the mixture entrywise by X(i,j)=∑kwkXk(i,j)X(i,j)=\sum_k w_kX_k(i,j)X(i,j)=∑k​wk​Xk​(i,j). For any kernel YYY on a label set LLL, define H(Y)∈[0,∞]H(Y)\in[0,\infty]H(Y)∈[0,∞] as the infimum of ∑r[−arlog⁡ar]+\sum_r[-a_r\log a_r]_+∑r​[−ar​logar​]+​ over all representations Y(i,j)=∑rarqr(i)qr(j)‾Y(i,j)=\sum_r a_r q_r(i)\overline{q_r(j)}Y(i,j)=∑r​ar​qr​(i)qr​(j)​, where ar≥0a_r\ge0ar​≥0 are summable with sum 111, and the vectors qr∈ℓ2(L;C)q_r\in\ell^2(L;\mathbb C)qr​∈ℓ2(L;C) having positive weight are unit vectors and pairwise orthogonal; zero-weight vectors are unrestricted. Here [t]+=max⁡(t,0)[t]_+=\max(t,0)[t]+​=max(t,0), regarded as an extended nonnegative real, and an empty infimum is +∞+\infty+∞. Define D(Y∥Z)D(Y\|Z)D(Y∥Z) as the supremum over every m∈Nm\in\mathbb Nm∈N, including m=0m=0m=0, and every orthonormal family v0,…,vm−1∈ℓ2(L;C)v_0,\ldots,v_{m-1}\in\ell^2(L;\mathbb C)v0​,…,vm−1​∈ℓ2(L;C), of the following quantity. Form matrices

Yabv=∑iva(i)‾(∑jY(i,j)vb(j)),Zabv=∑iva(i)‾(∑jZ(i,j)vb(j)).Y^v_{ab}=\sum_i\overline{v_a(i)}\left(\sum_jY(i,j)v_b(j)\right), \qquad Z^v_{ab}=\sum_i\overline{v_a(i)}\left(\sum_jZ(i,j)v_b(j)\right).Yabv​=i∑​va​(i)​(j∑​Y(i,j)vb​(j)),Zabv​=i∑​va​(i)​(j∑​Z(i,j)vb​(j)).

The quantity is +∞+\infty+∞ unless ker⁡Zv⊆ker⁡Yv\ker Z^v\subseteq\ker Y^vkerZv⊆kerYv; when this inclusion holds, it is

[Re⁡tr⁡(f(Yv)−Yvg(Zv)−Yv+Zv)]+,f(t)=tlog⁡t,g(t)=log⁡t,\left[\operatorname{Re}\operatorname{tr} \left(f(Y^v)-Y^v g(Z^v)-Y^v+Z^v\right)\right]_+, \qquad f(t)=t\log t,\quad g(t)=\log t,[Retr(f(Yv)−Yvg(Zv)−Yv+Zv)]+​,f(t)=tlogt,g(t)=logt,

with the matrix functions defined by continuous functional calculus. If H(X)≠+∞H(X)\ne+\inftyH(X)=+∞, then

H(X)=∑k=0∞[wk]+D(Xk∥X)+∑k=0∞[wk]+H(Xk).H(X)=\sum_{k=0}^{\infty}[w_k]_+D(X_k\|X) +\sum_{k=0}^{\infty}[w_k]_+H(X_k).H(X)=k=0∑∞​[wk​]+​D(Xk​∥X)+k=0∑∞​[wk​]+​H(Xk​).

This equality is in [0,∞][0,\infty][0,∞], where 0⋅(+∞)=00\cdot(+\infty)=00⋅(+∞)=0; no separate finiteness assumption is imposed on individual component entropies or divergences. The quantification permits an empty III, although no ensemble satisfying the stated density and mass requirements exists then.

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