Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equal entropy triples with different mixed-state entanglement

Proved
QAlgorithms.Papers.Independent.Support50.P42.entropy_triple_counterexample

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

prove2quantum

Write C=(∣00⟩⟨00∣+∣11⟩⟨11∣)/2C=(|00\rangle\langle00|+|11\rangle\langle11|)/2C=(∣00⟩⟨00∣+∣11⟩⟨11∣)/2. On two spins per observer define ρ=C⊗C\rho=C\otimes Cρ=C⊗C and σ=∣Ψ−⟩⟨Ψ−∣⊗I4/4\sigma=|\Psi^-\rangle\langle\Psi^-|\otimes I_4/4σ=∣Ψ−⟩⟨Ψ−∣⊗I4​/4, regrouping Alice's two spins against Bob's two spins. Both are normalized density matrices and satisfy

S(ρA)=S(ρB)=S(ρ)=S(σA)=S(σB)=S(σ)=2.S(\rho_A)=S(\rho_B)=S(\rho)=S(\sigma_A)=S(\sigma_B)=S(\sigma)=2.S(ρA​)=S(ρB​)=S(ρ)=S(σA​)=S(σB​)=S(σ)=2.

The state ρ\rhoρ is separable, whereas σ\sigmaσ is entangled; discarding the second spin locally on both sides of σ\sigmaσ leaves exactly a singlet. Thus the subsystem and total entropy triple does not determine mixed-state entanglement. The uncorrelated second pair is explicitly maximally mixed.

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.16: two four-spin mixed states with all three entropies equal to two.
The second uncorrelated pair is maximally mixed. The first state is separable;
the second is entangled and yields a singlet upon local disposal. -/
theorem entropy_triple_counterexample :
    let rho := twoPairs classicalPair classicalPair
    let sigma := twoPairs Dependency50.P42.singletState ((1/4 : ℂ) • 1)
    IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
    vnEntropy rho=2 ∧ vnEntropy (traceLeft rho)=2 ∧ vnEntropy (traceRight rho)=2 ∧
    vnEntropy sigma=2 ∧ vnEntropy (traceLeft sigma)=2 ∧ vnEntropy (traceRight sigma)=2 ∧
    Entanglement.IsSeparablePositive rho ∧ ¬Entanglement.IsSeparablePositive sigma ∧
    discardSecond sigma=Dependency50.P42.singletState := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 16, §V: equal subsystem/total entropies with different mixed-state entanglement
Read-back

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

Let Pv=vv†P_v=vv^\daggerPv​=vv†, let s=(∣01⟩−∣10⟩)/2s=(|01\rangle-|10\rangle)/\sqrt2s=(∣01⟩−∣10⟩)/2​, and put

C=12(P∣00⟩+P∣11⟩),ρ=C⊠C,σ=Ps⊠14I4,C=\tfrac12(P_{|00\rangle}+P_{|11\rangle}),\qquad \rho=C\boxtimes C,\qquad \sigma=P_s\boxtimes\tfrac14I_4,C=21​(P∣00⟩​+P∣11⟩​),ρ=C⊠C,σ=Ps​⊠41​I4​,

where the grouped product is defined by (X⊠Y)((a,a′),(b,b′)),((c,c′),(d,d′))=X(a,b),(c,d)Y(a′,b′),(c′,d′)(X\boxtimes Y)_{((a,a'),(b,b')),((c,c'),(d,d'))}=X_{(a,b),(c,d)}Y_{(a',b'),(c',d')}(X⊠Y)((a,a′),(b,b′)),((c,c′),(d,d′))​=X(a,b),(c,d)​Y(a′,b′),(c′,d′)​, so each party has local dimension four. Both ρ\rhoρ and σ\sigmaσ are positive semidefinite and have trace one, and

S(ρ)=S(tr⁡Aρ)=S(tr⁡Bρ)=2,S(σ)=S(tr⁡Aσ)=S(tr⁡Bσ)=2.S(\rho)=S(\operatorname{tr}_A\rho)=S(\operatorname{tr}_B\rho)=2, \qquad S(\sigma)=S(\operatorname{tr}_A\sigma)=S(\operatorname{tr}_B\sigma)=2.S(ρ)=S(trA​ρ)=S(trB​ρ)=2,S(σ)=S(trA​σ)=S(trB​σ)=2.

Here S(X)=−tr⁡(Xlog⁡2X)S(X)=-\operatorname{tr}(X\log_2X)S(X)=−tr(Xlog2​X), with zero eigenvalues contributing zero. The matrix ρ\rhoρ is a finite sum ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0 and local positive semidefinite trace-one matrices Aj,BjA_j,B_jAj​,Bj​, whereas σ\sigmaσ admits no such sum; this separability condition does not separately require ∑jwj=1\sum_jw_j=1∑j​wj​=1. Finally, tracing out both second-pair coordinates of σ\sigmaσ gives PsP_sPs​, explicitly

∑a′,b′=01σ((a,a′),(b,b′)),((c,a′),(d,b′))=(Ps)(a,b),(c,d).\sum_{a',b'=0}^{1} \sigma_{((a,a'),(b,b')),((c,a'),(d,b'))} =(P_s)_{(a,b),(c,d)}.a′,b′=0∑1​σ((a,a′),(b,b′)),((c,a′),(d,b′))​=(Ps​)(a,b),(c,d)​.
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