Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical correlation defeats the purification-minimum prescription

Proved
QAlgorithms.Papers.Independent.Support50.P42.purification_measure_counterexample

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

prove2quantum

Let χ=(∣00⟩⟨00∣+∣11⟩⟨11∣)/2\chi=(|00\rangle\langle00|+|11\rangle\langle11|)/2χ=(∣00⟩⟨00∣+∣11⟩⟨11∣)/2. Consider all normalized pure states on AC:BDAC:BDAC:BD with arbitrary positive finite ancillary dimensions for C,DC,DC,D whose partial trace over the ancillas is the displayed classically correlated two-qubit density. The set of their entropies across AC:BDAC:BDAC:BD is nonempty and bounded below, but

inf⁡∣Φ⟩: Tr⁡CD∣Φ⟩⟨Φ∣=χS(ΦBD)>0.\inf_{|\Phi\rangle:\ \operatorname{Tr}_{CD}|\Phi\rangle\langle\Phi|=\chi} S(\Phi_{BD})>0.∣Φ⟩: TrCD​∣Φ⟩⟨Φ∣=χinf​S(ΦBD​)>0.

Nevertheless the two-qubit state is separable and an actual finite local protocol prepares it from a one-dimensional product input, without any singlets. This is the source's objection to this proposed measure, distinct from its operational formation definition.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF p.17: the purification-minimum prescription assigns positive value
to a classically correlated density obtainable by actual local preparation
from no shared entanglement. Both ancillary dimensions vary in the infimum. -/
theorem purification_measure_counterexample :
    (purificationScores classicalPair).Nonempty ∧ BddBelow (purificationScores classicalPair) ∧
    0<purificationMinimum classicalPair ∧ Entanglement.IsSeparablePositive classicalPair ∧
    ∃ L : Superop (Fin 1 × Fin 1) (Fin 2 × Fin 2),
      FiniteLOCC L ∧ L (1 : Op (Fin 1 × Fin 1))=classicalPair := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 17, §V: classical correlation defeats the suggested purification minimum
Read-back

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

Let C=12(∣00⟩⟨00∣+∣11⟩⟨11∣)C=\tfrac12(|00\rangle\langle00|+|11\rangle\langle11|)C=21​(∣00⟩⟨00∣+∣11⟩⟨11∣). Form the set of all real numbers S(tr⁡AA′vv†)S(\operatorname{tr}_{AA'}vv^\dagger)S(trAA′​vv†) obtained by choosing arbitrary positive natural dimensions c,dc,dc,d and a unit vector vvv on (C2⊗Cc)⊗(C2⊗Cd)(\mathbb C^2\otimes\mathbb C^c)\otimes(\mathbb C^2\otimes\mathbb C^d)(C2⊗Cc)⊗(C2⊗Cd) satisfying

C(a,b),(a′,b′)=∑u=0c−1∑w=0d−1v((a,u),(b,w))v((a′,u),(b′,w))‾.C_{(a,b),(a',b')}= \sum_{u=0}^{c-1}\sum_{w=0}^{d-1} v_{((a,u),(b,w))} \overline{v_{((a',u),(b',w))}}.C(a,b),(a′,b′)​=u=0∑c−1​w=0∑d−1​v((a,u),(b,w))​v((a′,u),(b′,w))​​.

Here S(X)=−tr⁡(Xlog⁡2X)S(X)=-\operatorname{tr}(X\log_2X)S(X)=−tr(Xlog2​X), with zero eigenvalues contributing zero. This set is nonempty and bounded below, and its real infimum is strictly positive. Also, CCC is a finite sum of tensor products of local positive semidefinite trace-one matrices with nonnegative coefficients, with no separate coefficient-sum condition in that definition, and there exists a finite recursive LOCC map LLL from matrices on C1⊗C1\mathbb C^1\otimes\mathbb C^1C1⊗C1 to matrices on C2⊗C2\mathbb C^2\otimes\mathbb C^2C2⊗C2 such that L(1)=CL(1)=CL(1)=C. Such LOCC maps are generated by identities and complete finite local Kraus measurements on either party, followed by outcome-dependent recursive continuations and summation over outcomes. The statement asserts positivity of the infimum, without asserting that a purification attains it.

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