Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition V.3: subadditivity on tensor-product states

Proved
QAlgorithms.Papers.Independent.Support50.P09.squashed_product_subadditive

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

prove2quantum

For a normalized state ρX1⋯Xm\rho^{X_1\cdots X_m}ρX1​⋯Xm​ with m≥1m\ge1m≥1 finite nonzero local systems, define

Esq(ρ)=12inf⁡ρ~:Tr⁡Eρ~=ρ[∑i=1mH(Xi∣E)ρ~−H(X1⋯Xm∣E)ρ~].E_{\rm sq}(\rho)=\frac12\inf_{\widetilde\rho:\operatorname{Tr}_E\widetilde\rho=\rho} \left[\sum_{i=1}^m H(X_i\mid E)_{\widetilde\rho}-H(X_1\cdots X_m\mid E)_{\widetilde\rho}\right].Esq​(ρ)=21​ρ​:TrE​ρ​=ρinf​[i=1∑m​H(Xi​∣E)ρ​​−H(X1​⋯Xm​∣E)ρ​​].

Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of EEE, with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.

Let ρ\rhoρ be a state on X1⋯XmX_1\cdots X_mX1​⋯Xm​ and σ\sigmaσ a state on Y1⋯YmY_1\cdots Y_mY1​⋯Ym​, allowing different positive local dimensions. Construct their independent product and group the output parties as XiYiX_iY_iXi​Yi​. Then

Esq(X1Y1;…;XmYm)ρ⊗σ≤Esq(X1;…;Xm)ρ+Esq(Y1;…;Ym)σ.E_{\rm sq}(X_1Y_1;\ldots;X_mY_m)_{\rho\otimes\sigma} \le E_{\rm sq}(X_1;\ldots;X_m)_\rho+E_{\rm sq}(Y_1;\ldots;Y_m)_\sigma.Esq​(X1​Y1​;…;Xm​Ym​)ρ⊗σ​≤Esq​(X1​;…;Xm​)ρ​+Esq​(Y1​;…;Ym​)σ​.

This states the source’s subadditivity, without strengthening it to later additivity results.

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

/-- Proposition V.3, PDF p.18, (55): subadditivity on the ACTUAL independent
partywise product, allowing different local dimensions in the two inputs. -/
theorem squashed_product_subadditive {m : ℕ} (hm : 0 < m) {D F : Fin m → Type}
    [∀ i, Fintype (D i)] [∀ i, Fintype (F i)]
    [∀ i, Nonempty (D i)] [∀ i, Nonempty (F i)]
    (rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ)
    (sigma : Matrix (RegisterBasis F) (RegisterBasis F) ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
    halfExtensionSquashed .total (partyProduct rho sigma) ≤
      halfExtensionSquashed .total rho + halfExtensionSquashed .total sigma := by sorry

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 18, Proposition V.3: subadditivity on tensor-product states
Read-back

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

For every positive natural number mmm, let Di,FiD_i,F_iDi​,Fi​, i<mi<mi<m, be finite nonempty sets, and let ρ\rhoρ and σ\sigmaσ be positive semidefinite complex matrices of trace 111 on ∏iDi\prod_iD_i∏i​Di​ and ∏iFi\prod_iF_i∏i​Fi​, respectively. For an mmm-party density matrix τ\tauτ, define

Em(τ)=12inf⁡e>0, ω a density matrixTr⁡Eω=τ[∑i=0m−1S(ωiE)−S(ω)−(m−1)S(ωE)],E_m(\tau)=\frac12\inf_{\substack{e>0,\ \omega\ \text{a density matrix}\\ \operatorname{Tr}_{E}\omega=\tau}} \left[\sum_{i=0}^{m-1}S(\omega_{iE})-S(\omega)-(m-1)S(\omega_E)\right],Em​(τ)=21​e>0, ω a density matrixTrE​ω=τ​inf​[i=0∑m−1​S(ωiE​)−S(ω)−(m−1)S(ωE​)],

where eee ranges over positive integer environment dimensions, the marginals are partial traces, and S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)) with f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t and f(0)=0f(0)=0f(0)=0. Form the matrix τ\tauτ on ∏i(Di×Fi)\prod_i(D_i\times F_i)∏i​(Di​×Fi​) by

τ((di,fi)i,(di′,fi′)i)=ρ((di)i,(di′)i) σ((fi)i,(fi′)i).\tau\bigl((d_i,f_i)_i,(d'_i,f'_i)_i\bigr) =\rho((d_i)_i,(d'_i)_i)\,\sigma((f_i)_i,(f'_i)_i).τ((di​,fi​)i​,(di′​,fi′​)i​)=ρ((di​)i​,(di′​)i​)σ((fi​)i​,(fi′​)i​).

Then Em(τ)≤Em(ρ)+Em(σ)E_m(\tau)\le E_m(\rho)+E_m(\sigma)Em​(τ)≤Em​(ρ)+Em​(σ). Singleton local sets and m=1m=1m=1 are included.

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