Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The five-party XOR purification is monogamous for all disjoint subsystems

Proved
QAlgorithms.Papers.Independent.Support50.P46.five_party_xor_monogamy

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

prove2quantum

Let A,A′,B,B′,C be five qubit factors in this order, and define

∣ψ5⟩=12∑x,y∈{0,1}∣x⟩A∣x⟩A′∣y⟩B∣y⟩B′∣x⊕y⟩C.|\psi_5\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.∣ψ5​⟩=21​x,y∈{0,1}∑​∣x⟩A​∣x⟩A′​∣y⟩B​∣y⟩B′​∣x⊕y⟩C​.

The 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. Let U,V,W be any three pairwise disjoint subsets of the five factors; a subset denotes their tensor product and may be empty. Using von Neumann entropy in bits and I₃(U:V:W)=S(U)+S(V)+S(W)−S(UV)−S(UW)−S(VW)+S(UVW), one has

I3(U:V:W)ψ5≤0.I_3(U:V:W)_{\psi_5}\le0.I3​(U:V:W)ψ5​​≤0.

This shows that a pure state may be monogamous on every such triple while possessing the displayed classical ABC marginal.

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.18, (5.14): the displayed normalized five-party pure state has the
classical XOR ABC marginal and obeys monogamy for every triple of disjoint
unions of its five fixed factors, including empty unions. -/
theorem five_party_xor_monogamy :
    IsState copiedFiveVector ∧ IsDensityMatrix copiedFiveDensity ∧
    threeMarginal copiedFiveDensity ![0, 2, 4] = xorClassical ∧
    ∀ a b c : Finset (Fin 5),
      Disjoint a b → Disjoint a c → Disjoint b c →
      tripartiteInformation copiedFiveDensity a b c ≤ 0 := by sorry

end QAlgorithms.Papers.Independent.Support50.P46

end
Source
Holographic Mutual Information is Monogamous, arXiv:1107.2940v2, PDF p. 18, §5.2, (5.14): a pure monogamous state with classical ABC marginal
Read-back

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

Define a complex vector ψ\psiψ indexed by five-bit strings by ψ(u)=12\psi(u)=\frac12ψ(u)=21​ when u0=u1u_0=u_1u0​=u1​, u2=u3u_2=u_3u2​=u3​, 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) has entries 14\frac1441​ when its row and column three-bit strings are equal and their third bit is the exclusive-or of their first two bits, and 000 otherwise; explicitly, this reduced matrix sums ρxy\rho_{xy}ρxy​ over x,yx,yx,y with the prescribed bits on (0,2,4)(0,2,4)(0,2,4) and with xi=yix_i=y_ixi​=yi​ on the remaining coordinates. For any coordinate set SSS, define (ρ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 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. For every three pairwise disjoint subsets A,B,C⊆{0,1,2,3,4}A,B,C\subseteq\{0,1,2,3,4\}A,B,C⊆{0,1,2,3,4}, the declaration further asserts

Hρ(A)+Hρ(B)+Hρ(C)−Hρ(A∪B)−Hρ(B∪C)−Hρ(A∪C)+Hρ(A∪B∪C)≤0.H_\rho(A)+H_\rho(B)+H_\rho(C) -H_\rho(A\cup B)-H_\rho(B\cup C)-H_\rho(A\cup C) +H_\rho(A\cup B\cup C)\le0.Hρ​(A)+Hρ​(B)+Hρ​(C)−Hρ​(A∪B)−Hρ​(B∪C)−Hρ​(A∪C)+Hρ​(A∪B∪C)≤0.

The quantified subsets may be empty and need not cover all five coordinates.

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