Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An EPR marginal factors from the third system

Open
QAlgorithms.Papers.Independent.Intakethird100.P06.pureEprMarginal_product

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

prove2quantum

Let Alice and Bob be qubits, let EEE be any Hilbert space, and let ωABE\omega_{ABE}ωABE​ be a positive trace-class density operator of trace one. Put PΦ=∣Φ⟩⟨Φ∣P_\Phi=|\Phi\rangle\langle\Phi|PΦ​=∣Φ⟩⟨Φ∣ for Φ=(∣00⟩+∣11⟩)/2\Phi=(|00\rangle+|11\rangle)/\sqrt{2}Φ=(∣00⟩+∣11⟩)/2​. If Tr⁡Eω=PΦ\operatorname{Tr}_E\omega=P_\PhiTrE​ω=PΦ​, then the computed marginal τE=Tr⁡ABω\tau_E=\operatorname{Tr}_{AB}\omegaτE​=TrAB​ω is a density operator and

ωABE=PΦ⊗τE.\omega_{ABE}=P_\Phi\otimes\tau_E.ωABE​=PΦ​⊗τE​.

There is no dimension bound on EEE, and neither ω\omegaω nor τE\tau_EτE​ is required to be pure.

This is the decoupling fact used in the EPR non-shareability and secrecy arguments. Formalization Note: arbitrary orthonormal coordinates represent EEE; nuclearity, positivity and normalization are explicit. The source's ket notation for Joe in equation (2) is read as density-operator shorthand, consistent with the stated purity of the AB marginal alone.

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, factorization preceding
(2): an exact EPR marginal forces product with the computed third marginal.
Printed: Joe is written as a ket in (2). Changed: a possibly mixed density.
Why: only the AB marginal is assumed pure; a mixed Joe is allowed by the prose.
The normalization is the 1/sqrt(2) displayed in both (1) and the rendered (2).
This source correction requires independent moderation. -/
theorem pureEprMarginal_product {E : Type}
    (omega : Matrix ((Opinion × Opinion) × E) ((Opinion × Opinion) × E) ℂ)
    (hstate : IsCoordinateDensity omega) (hepr : partialTraceRightCoeff omega = eprDensity) :
    IsCoordinateDensity (traceLeft omega) ∧
      omega = Matrix.kronecker eprDensity (traceLeft omega) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P06

end
Source
Is Entanglement Monogamous?, arXiv:quant-ph/0307120v1, PDF p. 5, Section II, explicit supporting result: a pure EPR marginal decouples the third system
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, let EEE be any type, and let ω\omegaω be a complex matrix indexed by (B×B)×E(B\times B)\times E(B×B)×E. Write R(a,b),(a′,b′)=1/2R_{(a,b),(a',b')}=1/2R(a,b),(a′,b′)​=1/2 when a=ba=ba=b and a′=b′a'=b'a′=b′, and zero otherwise. Assume that ω\omegaω 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)×E;C)u_n,v_n\in\ell^2((B\times B)\times E;\mathbb C)un​,vn​∈ℓ2((B×B)×E;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 the real diagonal of ω\omegaω is summable with sum 111. Assume also that ∑e∈E′ω((a,b),e),((a′,b′),e)=R(a,b),(a′,b′)\sum'_{e\in E}\omega_{((a,b),e),((a',b'),e)}=R_{(a,b),(a',b')}∑e∈E′​ω((a,b),e),((a′,b′),e)​=R(a,b),(a′,b′)​ for every a,b,a′,b′a,b,a',b'a,b,a′,b′, where ∑′\sum'∑′ denotes the total infinite sum, assigned zero if the family is not summable. Define τe,f=∑a,b∈Bω((a,b),e),((a,b),f)\tau_{e,f}=\sum_{a,b\in B}\omega_{((a,b),e),((a,b),f)}τe,f​=∑a,b∈B​ω((a,b),e),((a,b),f)​. Then τ\tauτ admits an expansion τe,f=∑nrn(e)sn(f)‾\tau_{e,f}=\sum_nr_n(e)\overline{s_n(f)}τe,f​=∑n​rn​(e)sn​(f)​ with rn,sn∈ℓ2(E;C)r_n,s_n\in\ell^2(E;\mathbb C)rn​,sn​∈ℓ2(E;C) and summable ∑n∥rn∥2∥sn∥2\sum_n\|r_n\|_2\|s_n\|_2∑n​∥rn​∥2​∥sn​∥2​, all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum 111; furthermore, ω((a,b),e),((a′,b′),f)=R(a,b),(a′,b′)τe,f\omega_{((a,b),e),((a',b'),f)}=R_{(a,b),(a',b')}\tau_{e,f}ω((a,b),e),((a′,b′),f)​=R(a,b),(a′,b′)​τe,f​ for every choice of indices. No finiteness or countability assumption is imposed on EEE; if EEE is empty, the assumed diagonal sum of ω\omegaω cannot equal 111.

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