Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2: biorthogonal mixtures preserve SSA equality and yield correlated nonproduct cases

Open
QAlgorithms.Papers.Independent.Intakethird100.P63.theorem2_biorthogonalSSA

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.

For a tripartite ensemble suppose that for distinct active labels k,lk,lk,l, both ρ1kρ1l=0\rho_1^k\rho_1^l=0ρ1k​ρ1l​=0 and ρ2kρ2l=0\rho_2^k\rho_2^l=0ρ2k​ρ2l​=0. If every active component satisfies I(1:2)ρk=I(1:23)ρkI(1:2)_{\rho^k}=I(1:23)_{\rho^k}I(1:2)ρk​=I(1:23)ρk​, then

I(1:2)ρ=I(1:23)ρ.I(1:2)_\rho=I(1:23)_\rho.I(1:2)ρ​=I(1:23)ρ​.

Moreover, if at least two labels have positive weight and ρ≠ρ12⊗ρ3\rho\ne\rho_{12}\otimes\rho_3ρ=ρ12​⊗ρ3​, then

I(2:3)ρ>0.I(2:3)_\rho>0.I(2:3)ρ​>0.

Here I(A:B)=SA+SB−SA∪BI(A:B)=S_A+S_B-S_{A\cup B}I(A:B)=SA​+SB​−SA∪B​ and all subscripts denote actual marginals. The result gives SSA equality beyond independent-third-factor states.

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)

/-- Theorem 2, PDF pp.5,7: both SSA equality and positivity outside the aggregate
product exception (8). Finiteness of mixture marginals implies it for active components.
Zero labels do not count toward the condition of at least two terms. -/
theorem theorem2_biorthogonalSSA (e : DiscreteDensityEnsemble (Fin 3 → ℕ))
    (hbio : Biorthogonal e {0} {1})
    (hfinite : FiniteSubsystemEntropies (herbutMixture e))
    (hssa : ∀ k, 0 < e.weight k →
      clusterMutualInformation (e.component k) {0} {1} = clusterMutualInformation (e.component k) {0} {1, 2}) :
    clusterMutualInformation (herbutMixture e) {0} {1} = clusterMutualInformation (herbutMixture e) {0} {1, 2} ∧
    ((∃ k l, k ≠ l ∧ 0 < e.weight k ∧ 0 < e.weight l) →
      herbutMixture e ≠ productAcross (herbutMixture e) {0, 1} →
      0 < clusterMutualInformation (herbutMixture e) {1} {2}) := 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. 5, Theorem 2 (seed paper result): biorthogonal mixtures preserve SSA equality, with correlated nonproduct cases
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​, k∈Nk\in\mathbb Nk∈N, with ∑kwk=1\sum_k w_k=1∑k​wk​=1, and complex kernels KkK_kKk​ on N3\mathbb N^3N3. For every kkk with wk>0w_k>0wk​>0, require an entrywise expansion Kk(i,j)=∑rar(i)br(j)‾K_k(i,j)=\sum_r a_r(i)\overline{b_r(j)}Kk​(i,j)=∑r​ar​(i)br​(j)​ with square-summable vectors and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, real nonnegative finite quadratic forms ∑i,j∈Fzi‾Kk(i,j)zj\sum_{i,j\in F}\overline{z_i}K_k(i,j)z_j∑i,j∈F​zi​​Kk​(i,j)zj​ for every finite FFF and arbitrary complex zzz, and summable real diagonal of sum 111; zero-weight components are unrestricted. For any kernel KKK on N3\mathbb N^3N3, define RCK(x,y)=∑z∈NCcK(x⊕Cz,y⊕Cz)R_C^K(x,y)=\sum_{z\in\mathbb N^{C^c}}K(x\oplus_C z,y\oplus_C z)RCK​(x,y)=∑z∈NCc​K(x⊕C​z,y⊕C​z). Define H(Q)H(Q)H(Q) as the infimum in [0,∞][0,\infty][0,∞] of ∑jmax⁡{−pjlog⁡pj,0}\sum_j\max\{-p_j\log p_j,0\}∑j​max{−pj​logpj​,0} over representations Q(a,b)=∑jpjuj(a)uj(b)‾Q(a,b)=\sum_j p_j u_j(a)\overline{u_j(b)}Q(a,b)=∑j​pj​uj​(a)uj​(b)​, with nonnegative summable weights of sum 111 and square-summable vectors that are unit and pairwise orthogonal at distinct positive-weight indices; an empty infimum is +∞+\infty+∞. Put SK(C)=H(RCK).toRealS_K(C)=H(R_C^K).\mathrm{toReal}SK​(C)=H(RCK​).toReal, with +∞+\infty+∞ converted to 000, and IK(A:B)=SK(A)+SK(B)−SK(A∪B)I_K(A:B)=S_K(A)+S_K(B)-S_K(A\cup B)IK​(A:B)=SK​(A)+SK​(B)−SK​(A∪B). Assume that, for all distinct k,lk,lk,l with positive weights and for each C={0},{1}C=\{0\},\{1\}C={0},{1}, the reduced kernels satisfy ∑zRCKk(x,z)RCKl(z,y)=0\sum_z R_C^{K_k}(x,z)R_C^{K_l}(z,y)=0∑z​RCKk​​(x,z)RCKl​​(z,y)=0 for every x,yx,yx,y. Let Kˉ(x,y)=∑kwkKk(x,y)\bar K(x,y)=\sum_k w_kK_k(x,y)Kˉ(x,y)=∑k​wk​Kk​(x,y), assume H(RCKˉ)≠+∞H(R_C^{\bar K})\ne+\inftyH(RCKˉ​)=+∞ for every C⊆{0,1,2}C\subseteq\{0,1,2\}C⊆{0,1,2}, including the empty set, and assume IKk({0}:{1})=IKk({0}:{1,2})I_{K_k}(\{0\}:\{1\})=I_{K_k}(\{0\}:\{1,2\})IKk​​({0}:{1})=IKk​​({0}:{1,2}) for every positive-weight kkk. Then

IKˉ({0}:{1})=IKˉ({0}:{1,2}).I_{\bar K}(\{0\}:\{1\})=I_{\bar K}(\{0\}:\{1,2\}).IKˉ​({0}:{1})=IKˉ​({0}:{1,2}).

In addition, if there exist two distinct positive-weight indices and Kˉ\bar KKˉ is unequal to the kernel (x,y)↦R{0,1}Kˉ(x∣{0,1},y∣{0,1})R{2}Kˉ(x2,y2)(x,y)\mapsto R_{\{0,1\}}^{\bar K}(x|_{\{0,1\}},y|_{\{0,1\}})R_{\{2\}}^{\bar K}(x_2,y_2)(x,y)↦R{0,1}Kˉ​(x∣{0,1}​,y∣{0,1}​)R{2}Kˉ​(x2​,y2​), then 0<IKˉ({1}:{2})0<I_{\bar K}(\{1\}:\{2\})0<IKˉ​({1}:{2}). All kernel series use total infinite sums; finite subsystem entropies are assumed for Kˉ\bar KKˉ, with no such assumption on the individual components.

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