Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Additivity across arbitrary product partitions

Proved
QAlgorithms.Papers.Independent.Support50.P43.alternative_product_partition

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All entropies are von Neumann entropies in bits, with zero eigenvalues contributing zero. For a normalized positive semidefinite state ρ\rhoρ on n≥2n\ge2n≥2 nonzero finite-dimensional local complex spaces, write S(T)=S(ρT)S(T)=S(\rho_T)S(T)=S(ρT​) for the marginal entropy, [n]={1,…,n}[n]=\{1,\ldots,n\}[n]={1,…,n}, and iˉ=[n]∖{i}\bar i=[n]\setminus\{i\}iˉ=[n]∖{i}. Define

I(ρ)=∑i=1nS(iˉ)−(n−1)S([n]),Ix(ρ)=∑i=1nS({i})−S([n]).I(\rho)=\sum_{i=1}^n S(\bar i)-(n-1)S([n]),\qquad I_x(\rho)=\sum_{i=1}^n S(\{i\})-S([n]).I(ρ)=i=1∑n​S(iˉ)−(n−1)S([n]),Ix​(ρ)=i=1∑n​S({i})−S([n]).

Let B1,…,BmB_1,\ldots,B_mB1​,…,Bm​ be any partition of [n][n][n] into nonempty disjoint blocks, with m≥1m\ge1m≥1, and suppose ρ=⨂j=1mρBj\rho=\bigotimes_{j=1}^m\rho_{B_j}ρ=⨂j=1m​ρBj​​ after regrouping the registers. For a nonempty block BBB, put IB(ρ)=∑i∈BS(B∖{i})−(∣B∣−1)S(B)I_B(\rho)=\sum_{i\in B}S(B\setminus\{i\})-(|B|-1)S(B)IB​(ρ)=∑i∈B​S(B∖{i})−(∣B∣−1)S(B), using S(∅)=0S(\varnothing)=0S(∅)=0. Then

I(ρ)=∑j=1mIBj(ρ).I(\rho)=\sum_{j=1}^m I_{B_j}(\rho).I(ρ)=j=1∑m​IBj​​(ρ).

This includes singleton blocks, whose information is zero, and products across any partition of the physical parties.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P43

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- These accepted register types are definitionally the required finite tensor bases.

open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)

open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)

/-- Theorem 5 and (15), PDF p.4: additivity across ANY partition of the parties
on which the density matrix factors, allowing singleton blocks. -/
theorem alternative_product_partition {n m : ℕ} (hn : 2 ≤ n) (hm : 1 ≤ m)
    {D : Fin n → Type} [∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
    (rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho)
    (blocks : Fin m → Finset (Fin n))
    (hne : ∀ j, (blocks j).Nonempty)
    (hdis : ∀ j k, j ≠ k → Disjoint (blocks j) (blocks k))
    (hcover : Finset.univ.biUnion blocks = Finset.univ)
    (hprod : IsProductAcross rho blocks) :
    alternativeOn rho Finset.univ = ∑ j, alternativeOn rho (blocks j) := by sorry

end QAlgorithms.Papers.Independent.Support50.P43

end
Source
Multiparty Quantum Mutual Information: An alternative definition, arXiv:1504.07176v2, PDF p. 4, Theorem 5 and equation (15)
Read-back

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

For every pair of natural numbers n≥2n\ge2n≥2 and m≥1m\ge1m≥1, every family of finite nonempty sets DiD_iDi​ indexed by I={0,…,n−1}I=\{0,\ldots,n-1\}I={0,…,n−1}, and every positive semidefinite trace-one complex matrix ρ\rhoρ indexed by ∏i∈IDi\prod_{i\in I}D_i∏i∈I​Di​, define its marginals by (ρS)a,b=∑x,y: x∣S=a, y∣S=b, x∣Sc=y∣Scρx,y(\rho_S)_{a,b}=\sum_{x,y:\,x|_S=a,\ y|_S=b,\ x|_{S^c}=y|_{S^c}}\rho_{x,y}(ρS​)a,b​=∑x,y:x∣S​=a, y∣S​=b, x∣Sc​=y∣Sc​​ρx,y​, and put H(S)=−Re⁡tr⁡f(ρS)H(S)=-\operatorname{Re}\operatorname{tr}f(\rho_S)H(S)=−Retrf(ρS​), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. Suppose B0,…,Bm−1B_0,\ldots,B_{m-1}B0​,…,Bm−1​ are nonempty, pairwise disjoint subsets of III whose union is III, and suppose that, for every pair of full register labels x,yx,yx,y,

ρx,y=∏j=0m−1(ρBj)x∣Bj,y∣Bj.\rho_{x,y}=\prod_{j=0}^{m-1}(\rho_{B_j})_{x|_{B_j},y|_{B_j}}.ρx,y​=j=0∏m−1​(ρBj​​)x∣Bj​​,y∣Bj​​​.

For S⊆IS\subseteq IS⊆I, define

A(S)=∑i∈SH(S∖{i})−max⁡(∣S∣−1,0) H(S).A(S)=\sum_{i\in S}H(S\setminus\{i\})-\max(|S|-1,0)\,H(S).A(S)=i∈S∑​H(S∖{i})−max(∣S∣−1,0)H(S).

Then A(I)=∑j=0m−1A(Bj)A(I)=\sum_{j=0}^{m-1}A(B_j)A(I)=∑j=0m−1​A(Bj​). This includes the one-block partition and partitions containing singleton blocks; a singleton block contributes H(∅)=0H(\varnothing)=0H(∅)=0.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me