Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The six-party copied XOR purification violates monogamy

Proved
QAlgorithms.Papers.Independent.Support50.P46.copied_xor_violation

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

prove2quantum

Let A,A′,B,B′,C,C′ be six qubit factors, in this order. Put

∣ψ6⟩=12∑x,y∈{0,1}∣x⟩A∣x⟩A′∣y⟩B∣y⟩B′∣x⊕y⟩C∣x⊕y⟩C′.|\psi_6\rangle=\tfrac12\sum_{x,y\in\{0,1\}} |x\rangle_A|x\rangle_{A'}|y\rangle_B|y\rangle_{B'}|x\mathbin{\oplus}y\rangle_C|x\mathbin{\oplus}y\rangle_{C'}.∣ψ6​⟩=21​x,y∈{0,1}∑​∣x⟩A​∣x⟩A′​∣y⟩B​∣y⟩B′​∣x⊕y⟩C​∣x⊕y⟩C′​.

Here ⊕ is addition modulo two. This vector has norm one, its rank-one density matrix is normalized, and its ABC marginal is the equal diagonal mixture of 000,011,101,110. For entropy in bits and I₃(U:V:W)=S(U)+S(V)+S(W)−S(UV)−S(UW)−S(VW)+S(UVW),

I3(A:A′:BC)ψ6=1.I_3(A:A':BC)_{\psi_6}=1.I3​(A:A′:BC)ψ6​​=1.

BC retains only B and C, not their copies. Thus this purification violates monogamy, independently of the incorrect preceding general identity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P46

open scoped BigOperators ComplexConjugate

open QAlgorithms.Papers.Independent.Gap48.P20 (subsystemEntropy)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.17, (5.13) and the following paragraph: copied XOR purification
has I3(A:A-copy:BC)=1 bit and hence violates mutual-information monogamy.
This does not rely on the false general identity preceding that paragraph. -/
theorem copied_xor_violation :
    IsState copiedSixVector ∧ IsDensityMatrix copiedSixDensity ∧
    threeMarginal copiedSixDensity ![0, 2, 4] = xorClassical ∧
    tripartiteInformation copiedSixDensity {0} {1} {2, 4} = 1 := by sorry

end QAlgorithms.Papers.Independent.Support50.P46

end
Source
Holographic Mutual Information is Monogamous, arXiv:1107.2940v2, PDF p. 17, §5.2: the six-party copied XOR purification violates monogamy
Read-back

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

Define a complex vector ψ\psiψ indexed by six-bit strings by ψ(u)=12\psi(u)=\frac12ψ(u)=21​ when u0=u1u_0=u_1u0​=u1​, u2=u3u_2=u_3u2​=u3​, u4=u5u_4=u_5u4​=u5​, and u4=u0⊕u2u_4=u_0\oplus u_2u4​=u0​⊕u2​, and by ψ(u)=0\psi(u)=0ψ(u)=0 otherwise; here ⊕\oplus⊕ denotes exclusive-or. Let ρuv=ψ(u)ψ(v)‾\rho_{uv}=\psi(u)\overline{\psi(v)}ρuv​=ψ(u)ψ(v)​. The declaration asserts that ∥ψ∥2=1\|\psi\|_2=1∥ψ∥2​=1, that ρ\rhoρ is positive semidefinite with trace 111, and that its reduced matrix on coordinates (0,2,4)(0,2,4)(0,2,4) satisfies

∑x0=u0, x2=u1, x4=u2y0=v0, y2=v1, y4=v2xi=yi (i∉{0,2,4})ρxy={14u=v, u2=u0⊕u1,0otherwise(u,v∈{0,1}3).\sum_{\substack{x_0=u_0,\ x_2=u_1,\ x_4=u_2\\ y_0=v_0,\ y_2=v_1,\ y_4=v_2\\ x_i=y_i\ (i\notin\{0,2,4\})}}\rho_{xy} = \begin{cases}\frac14&u=v,\ u_2=u_0\oplus u_1,\\0&\text{otherwise}\end{cases} \quad(u,v\in\{0,1\}^3).x0​=u0​, x2​=u1​, x4​=u2​y0​=v0​, y2​=v1​, y4​=v2​xi​=yi​ (i∈/{0,2,4})​∑​ρxy​={41​0​u=v, u2​=u0​⊕u1​,otherwise​(u,v∈{0,1}3).

For each coordinate set SSS, let (ρS)uv=∑x∣S=u, y∣S=v, x∣Sc=y∣Scρxy(\rho_S)_{uv}=\sum_{x|_S=u,\ y|_S=v,\ x|_{S^c}=y|_{S^c}}\rho_{xy}(ρS​)uv​=∑x∣S​=u, y∣S​=v, x∣Sc​=y∣Sc​​ρxy​ and let Hρ(S)=−Re⁡tr⁡[g(ρS)]H_\rho(S)=-\operatorname{Re}\operatorname{tr}[g(\rho_S)]Hρ​(S)=−Retr[g(ρS​)], using spectral functional calculus with g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t and g(0)=0g(0)=0g(0)=0. The further asserted equality is

Hρ({0})+Hρ({1})+Hρ({2,4})−Hρ({0,1})−Hρ({1,2,4})−Hρ({0,2,4})+Hρ({0,1,2,4})=1.H_\rho(\{0\})+H_\rho(\{1\})+H_\rho(\{2,4\}) -H_\rho(\{0,1\})-H_\rho(\{1,2,4\})-H_\rho(\{0,2,4\}) +H_\rho(\{0,1,2,4\})=1.Hρ​({0})+Hρ​({1})+Hρ​({2,4})−Hρ​({0,1})−Hρ​({1,2,4})−Hρ​({0,2,4})+Hρ​({0,1,2,4})=1.
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