Unnumbered Eq.(93): preservation of Eq.(91) class
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.multipartite_preservationLet 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 be a finite complete family, . Then
For four parties this includes every 1:3 and 2:2 cut, preserving Eq.(91) rather than the fully separable alternative (94).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural numbers with , every collection of positive natural dimensions indexed by , and every family of complex square matrices of size , indexed by , define on by and assume . Suppose admits a finite decomposition , where , , every is a nonempty proper subset of the parties, and are positive semidefinite trace-one matrices on the parties in and its complement, respectively; the grouped product has entry . Then also admits a finite decomposition of this same form, allowing a separately chosen nonempty proper subset for each term. No positivity of is explicitly assumed, but cannot satisfy the completeness equation because all are positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.