Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem II.5: local-unitary mixtures preserve sharing

Proved
QAlgorithms.Papers.Independent.Extend50.P36.local_unitary_mixtures_preserve_sharing

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

prove2quantum

For positive integers m,nm,nm,n, a state is mmm-nnn sharable when a density operator on HL⊗m⊗HR⊗nH_L^{\otimes m}\otimes H_R^{\otimes n}HL⊗m​⊗HR⊗n​ has that same state as every left-right pair marginal. Arbitrary sharing means such an extension exists for every positive finite m,nm,nm,n.

Let the two local Hilbert spaces be nonzero and finite dimensional, and let ρ\rhoρ be an mmm-nnn sharable state. For any finite probability vector (pi)(p_i)(pi​) and local unitaries UiU_iUi​ on HLH_LHL​, ViV_iVi​ on HRH_RHR​,

∑ipi(Ui⊗Vi)ρ(Ui⊗Vi)†is m-n sharable.\sum_i p_i(U_i\otimes V_i)\rho(U_i\otimes V_i)^\dagger\quad\text{is }m\text{-}n\text{ sharable}.i∑​pi​(Ui​⊗Vi​)ρ(Ui​⊗Vi​)†is m-n sharable.

This is the class of local unitary mixtures specified by Eq.(4) and the proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P36
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Matrix.Norms.Elementwise

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Extend50.P36

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted matrix alias; tensor reductions below compose frozen superoperators.

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

/-- Theorem II.5, Eq.(4), PDF p.5: the proof specifies product local unitaries.
The unrestricted word "unitaries" in the theorem sentence is interpreted through Eq.(4). -/
theorem local_unitary_mixtures_preserve_sharing {I J : Type*}
    [Fintype I] [Fintype J] [Nonempty I] [Nonempty J]
    (m n q : ℕ) (hm : 0 < m) (hn : 0 < n) (rho : Op (I × J))
    (hrho : IsDensityMatrix rho) (hshare : Sharable m n rho)
    (p : Fin q → ℝ) (hp : ∀ i, 0 ≤ p i) (hpSum : (∑ i, p i) = 1)
    (U : Fin q → Matrix.unitaryGroup I ℂ) (V : Fin q → Matrix.unitaryGroup J ℂ) :
    Sharable m n (∑ i, (p i : ℂ) • localConjugate (U i : Op I) (V i : Op J) rho) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P36

end
Source
Compatible quantum correlations: on extension problems for Werner and isotropic states, arXiv:1305.1342v3, PDF p. 5, Theorem II.5: local-unitary mixtures preserve sharing
Read-back

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

For arbitrary finite nonempty index types I,JI,JI,J, natural numbers m,n,qm,n,qm,n,q with m,n>0m,n>0m,n>0, and a positive semidefinite trace-one matrix ρ\rhoρ indexed by I×JI\times JI×J, suppose there exists a positive semidefinite trace-one matrix XXX indexed by Im×JnI^m\times J^nIm×Jn whose reduction on every pair of coordinates i<mi<mi<m, j<nj<nj<n equals ρ\rhoρ. Explicitly, for every a,b∈I×Ja,b\in I\times Ja,b∈I×J, these reductions have entries

∑x∈Im∑y∈Jn1{xi=a1,  yj=a2} X(x,y),(x[i←b1], y[j←b2])=ρa,b.\sum_{x\in I^m}\sum_{y\in J^n} \mathbf 1_{\{x_i=a_1,\;y_j=a_2\}}\, X_{(x,y),(x[i\leftarrow b_1],\,y[j\leftarrow b_2])} =\rho_{a,b}.x∈Im∑​y∈Jn∑​1{xi​=a1​,yj​=a2​}​X(x,y),(x[i←b1​],y[j←b2​])​=ρa,b​.

For any real weights ps≥0p_s\geq0ps​≥0, s<qs<qs<q, with ∑s<qps=1\sum_{s<q}p_s=1∑s<q​ps​=1, and any unitary matrices UsU_sUs​ on CI\mathbb C^ICI and VsV_sVs​ on CJ\mathbb C^JCJ, the matrix

ρ~=∑s<qps(Us⊗Vs)ρ(Us⊗Vs)†\widetilde\rho=\sum_{s<q}p_s (U_s\otimes V_s)\rho(U_s\otimes V_s)^\daggerρ​=s<q∑​ps​(Us​⊗Vs​)ρ(Us​⊗Vs​)†

also admits such a positive semidefinite trace-one extension on Im×JnI^m\times J^nIm×Jn, with every displayed pair reduction equal to ρ~\widetilde\rhoρ​. The quantified value q=0q=0q=0 is allowed, but its weight-sum hypothesis cannot hold.

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

    Confirmed by the moderator at approval.

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