Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered correlation criterion following Definition IV.1

Proved
QAlgorithms.Papers.Independent.Support50.P09.totalInformation_zero_iff_product

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

prove2quantum

Let ρ\rhoρ be one normalized density operator on finitely many finite nonzero registers. All named systems below are disjoint groups of these registers, and every entropy is computed from the corresponding marginal of ρ\rhoρ. Define I(Y1;…;Yr∣E)=∑jH(YjE)−H(Y1⋯YrE)−(r−1)H(E)I(Y_1;\ldots;Y_r\mid E)=\sum_j H(Y_jE)-H(Y_1\cdots Y_rE)-(r-1)H(E)I(Y1​;…;Yr​∣E)=∑j​H(Yj​E)−H(Y1​⋯Yr​E)−(r−1)H(E), with logarithms to base two; omitting EEE denotes unconditional information. Empty groups represent one-dimensional systems.

For m≥1m\ge1m≥1 and a state on X1⋯XmX_1\cdots X_mX1​⋯Xm​, let ρXi\rho^{X_i}ρXi​ be its own single-party marginals. Then

I(X1;⋯ ;Xm)ρ=0⟺ρ=ρX1⊗⋯⊗ρXm.I(X_1;\cdots;X_m)_\rho=0\quad\Longleftrightarrow\quad \rho=\rho^{X_1}\otimes\cdots\otimes\rho^{X_m}.I(X1​;⋯;Xm​)ρ​=0⟺ρ=ρX1​⊗⋯⊗ρXm​.

This characterizes absence of total correlation, rather than absence of squashed entanglement.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P09

open QAlgorithms.Papers.Independent.Claimed50.P33

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Unnumbered criterion after Definition IV.1, PDF pp.13–14:
zero TOTAL correlation iff the state equals the product of its own marginals. -/
theorem totalInformation_zero_iff_product {m : ℕ} (hm : 0 < m)
    {D : Fin m → Type} [∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
    (rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho) :
    info .total rho (singleParties m) ∅ = 0 ↔ rho = productOfMarginals rho := by sorry

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 14, Unnumbered correlation criterion following Definition IV.1
Read-back

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

For every natural number m>0m>0m>0, every family of finite nonempty bases DiD_iDi​, and every positive semidefinite matrix ρ\rhoρ of trace 111 on the basis ∏i<mDi\prod_{i<m}D_i∏i<m​Di​, let ρi\rho_iρi​ be its marginal on register iii, explicitly

ρi(a,b)=∑x,y∈∏jDjxi=a, yi=bxj=yj for all j≠iρ(x,y),\rho_i(a,b)= \sum_{\substack{x,y\in\prod_jD_j\\ x_i=a,\ y_i=b\\ x_j=y_j\ \text{for all }j\ne i}}\rho(x,y),ρi​(a,b)=x,y∈∏j​Dj​xi​=a, yi​=bxj​=yj​ for all j=i​∑​ρ(x,y),

and define S(X)=−Re⁡Tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{Tr}[f(X)]S(X)=−ReTr[f(X)], where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, f(0)=0f(0)=0f(0)=0, is applied by continuous functional calculus. Then

∑i<mS(ρi)−S(ρ)=0⟺∀x,y∈∏i<mDi,ρ(x,y)=∏i<mρi(xi,yi).\sum_{i<m}S(\rho_i)-S(\rho)=0 \quad\Longleftrightarrow\quad \forall x,y\in\prod_{i<m}D_i,\quad \rho(x,y)=\prod_{i<m}\rho_i(x_i,y_i).i<m∑​S(ρi​)−S(ρ)=0⟺∀x,y∈i<m∏​Di​,ρ(x,y)=i<m∏​ρi​(xi​,yi​).

This includes m=1m=1m=1; m=0m=0m=0 is excluded by the hypothesis.

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