Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered Eq.(93): preservation of Eq.(91) class

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.multipartite_preservation

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥3N\ge3N≥3 parties have arbitrary positive finite dimensions. A state is biseparable if it is a finite convex mixture of products of density matrices across nonempty proper bipartitions, permitting entanglement inside blocks and mixtures across cuts. Let Vk=⨂j=1NAk,jV_k=\bigotimes_{j=1}^NA_{k,j}Vk​=⨂j=1N​Ak,j​ be a finite complete family, ∑kVk†Vk=I\sum_kV_k^\dagger V_k=I∑k​Vk†​Vk​=I. Then

ρ biseparable⟹∑kVkρVk† biseparable.\rho\ \mathrm{biseparable}\quad\Longrightarrow\quad\sum_kV_k\rho V_k^\dagger\ \mathrm{biseparable}.ρ biseparable⟹k∑​Vk​ρVk†​ biseparable.

For four parties this includes every 1:3 and 2:2 cut, preserving Eq.(91) rather than the fully separable alternative (94).

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.34–35, Eqs.(91)–(93): local product Kraus maps preserve mixtures across
all nontrivial cuts, for arbitrary party count and positive local dimensions. -/
theorem multipartite_preservation {N r : ℕ} (hN : 3 ≤ N) (d : Fin N → ℕ)
    (hd : ∀ i, 0 < d i)
    (A : Fin r → ∀ i, Matrix (Fin (d i)) (Fin (d i)) ℂ)
    (hcomplete : IsKrausFamily (fun k => partyKraus (A k)))
    (rho : Matrix (∀ i, Fin (d i)) (∀ i, Fin (d i)) ℂ) (hrho : IsMultipartiteBiseparable d rho) :
    IsMultipartiteBiseparable d (krausApply (fun k => partyKraus (A k)) rho) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 34, Unnumbered Eq.(93): preservation of Eq.(91) class
Read-back

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

For every natural numbers N,rN,rN,r with N≥3N\ge3N≥3, every collection of positive natural dimensions did_idi​ indexed by i=0,…,N−1i=0,\ldots,N-1i=0,…,N−1, and every family of complex square matrices Ak,iA_{k,i}Ak,i​ of size did_idi​, indexed by k=0,…,r−1k=0,\ldots,r-1k=0,…,r−1, define KkK_kKk​ on H=⨂iCdi\mathcal H=\bigotimes_i\mathbb C^{d_i}H=⨂i​Cdi​ by (Kk)x,y=∏i(Ak,i)xi,yi(K_k)_{x,y}=\prod_i(A_{k,i})_{x_i,y_i}(Kk​)x,y​=∏i​(Ak,i​)xi​,yi​​ and assume ∑k=0r−1Kk†Kk=I\sum_{k=0}^{r-1}K_k^\dagger K_k=I∑k=0r−1​Kk†​Kk​=I. Suppose ρ\rhoρ admits a finite decomposition ρ=∑ℓ=1qwℓXℓ⊗Sℓ∣SℓcYℓ\rho=\sum_{\ell=1}^{q}w_\ell X_\ell\otimes_{S_\ell\mid S_\ell^c}Y_\ellρ=∑ℓ=1q​wℓ​Xℓ​⊗Sℓ​∣Sℓc​​Yℓ​, where wℓ≥0w_\ell\ge0wℓ​≥0, ∑ℓwℓ=1\sum_\ell w_\ell=1∑ℓ​wℓ​=1, every SℓS_\ellSℓ​ is a nonempty proper subset of the NNN parties, and Xℓ,YℓX_\ell,Y_\ellXℓ​,Yℓ​ are positive semidefinite trace-one matrices on the parties in SℓS_\ellSℓ​ and its complement, respectively; the grouped product has entry (Xℓ)x∣Sℓ,y∣Sℓ(Yℓ)x∣Sℓc,y∣Sℓc(X_\ell)_{x|_{S_\ell},y|_{S_\ell}}(Y_\ell)_{x|_{S_\ell^c},y|_{S_\ell^c}}(Xℓ​)x∣Sℓ​​,y∣Sℓ​​​(Yℓ​)x∣Sℓc​​,y∣Sℓc​​​. Then ∑k=0r−1KkρKk†\sum_{k=0}^{r-1}K_k\rho K_k^\dagger∑k=0r−1​Kk​ρKk†​ also admits a finite decomposition of this same form, allowing a separately chosen nonempty proper subset for each term. No positivity of rrr is explicitly assumed, but r=0r=0r=0 cannot satisfy the completeness equation because all did_idi​ are positive.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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