Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The EPR pair has no symmetric three-party extension

Open
QAlgorithms.Papers.Independent.Intakethird100.P06.epr_noSymmetricExtension

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Φ=(∣00⟩+∣11⟩)/2\Phi=(|00\rangle+|11\rangle)/\sqrt{2}Φ=(∣00⟩+∣11⟩)/2​ and let PΦ=∣Φ⟩⟨Φ∣P_\Phi=|\Phi\rangle\langle\Phi|PΦ​=∣Φ⟩⟨Φ∣. Alice, Bob and Joe each have one qubit. There is no normalized positive three-qubit density operator ω\omegaω satisfying either of the following two sets of requirements:

Tr⁡Jω=PΦ,SBJωSBJ†=ω;\operatorname{Tr}_J\omega=P_\Phi,\qquad S_{BJ}\omega S_{BJ}^{\dagger}=\omega;TrJ​ω=PΦ​,SBJ​ωSBJ†​=ω; Tr⁡Jω=PΦ,Tr⁡Bω=PΦ.\operatorname{Tr}_J\omega=P_\Phi,\qquad \operatorname{Tr}_B\omega=P_\Phi.TrJ​ω=PΦ​,TrB​ω=PΦ​.

Here SBJS_{BJ}SBJ​ interchanges Bob and Joe while fixing Alice; in the second display the surviving spaces are identified in the order Alice, Joe. No purity assumption is imposed on ω\omegaω.

This states the impossibility of both the strong symmetric extension and the equal-marginal extension of the ideal EPR pair.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P06
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P06

open scoped BigOperators

open QAlgorithms.Papers.Independent.Dependency50.P33 (NuclearExpansion)

open QAlgorithms.Papers.Independent.Frontier18.P09 (partialTraceRightCoeff)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Section II, arXiv:quant-ph/0307120v1, PDF p.5 (weak terminology p.7):
the EPR marginal admits neither a Bob/Joe invariant three-qubit extension nor
one with equal EPR marginals on Alice-Bob and Alice-Joe. Global purity and
product factorization are not hypotheses. -/
theorem epr_noSymmetricExtension :
    (¬ ∃ omega : Matrix ((Opinion × Opinion) × Opinion)
        ((Opinion × Opinion) × Opinion) ℂ,
      IsCoordinateDensity omega ∧ traceRight omega = eprDensity ∧
        omega = swapBobJoe omega) ∧
    (¬ ∃ omega : Matrix ((Opinion × Opinion) × Opinion)
        ((Opinion × Opinion) × Opinion) ℂ,
      IsCoordinateDensity omega ∧ traceRight omega = eprDensity ∧
        aliceJoeMarginal omega = eprDensity) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P06

end
Source
Is Entanglement Monogamous?, arXiv:quant-ph/0307120v1, PDF p. 5, Section II, unnumbered: the EPR pair has no symmetric three-party extension
Read-back

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

Let BBB be the two-element set of one-bit strings, and let RRR be the matrix on B×BB\times BB×B with R(a,b),(a′,b′)=1/2R_{(a,b),(a',b')}=1/2R(a,b),(a′,b′)​=1/2 if a=ba=ba=b and a′=b′a'=b'a′=b′, and zero otherwise. For a matrix ω\omegaω on (B×B)×B(B\times B)\times B(B×B)×B, its coordinate density condition means that it admits an expansion ωij=∑nun(i)vn(j)‾\omega_{ij}=\sum_nu_n(i)\overline{v_n(j)}ωij​=∑n​un​(i)vn​(j)​ with un,vn∈ℓ2((B×B)×B;C)u_n,v_n\in\ell^2((B\times B)\times B;\mathbb C)un​,vn​∈ℓ2((B×B)×B;C) and summable ∑n∥un∥2∥vn∥2\sum_n\|u_n\|_2\|v_n\|_2∑n​∥un​∥2​∥vn​∥2​, that every finite quadratic form ∑i,j∈Fz(i)‾ωijz(j)\sum_{i,j\in F}\overline{z(i)}\omega_{ij}z(j)∑i,j∈F​z(i)​ωij​z(j) is real and nonnegative for every finite FFF and every complex function zzz, and that its real diagonal is summable with sum 111. The assertion is the conjunction of two nonexistence statements: there is no such coordinate density matrix ω\omegaω satisfying both ∑c∈Bω((a,b),c),((a′,b′),c)=R(a,b),(a′,b′)\sum_{c\in B}\omega_{((a,b),c),((a',b'),c)}=R_{(a,b),(a',b')}∑c∈B​ω((a,b),c),((a′,b′),c)​=R(a,b),(a′,b′)​ for every a,b,a′,b′a,b,a',b'a,b,a′,b′ and ω((a,b),c),((a′,b′),c′)=ω((a,c),b),((a′,c′),b′)\omega_{((a,b),c),((a',b'),c')}=\omega_{((a,c),b),((a',c'),b')}ω((a,b),c),((a′,b′),c′)​=ω((a,c),b),((a′,c′),b′)​ for every a,b,c,a′,b′,c′a,b,c,a',b',c'a,b,c,a′,b′,c′; and there is no such coordinate density matrix ω\omegaω satisfying both that same first marginal equation and ∑b∈Bω((a,b),c),((a′,b),c′)=R(a,c),(a′,c′)\sum_{b\in B}\omega_{((a,b),c),((a',b),c')}=R_{(a,c),(a',c')}∑b∈B​ω((a,b),c),((a′,b),c′)​=R(a,c),(a′,c′)​ for every a,c,a′,c′a,c,a',c'a,c,a′,c′.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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