Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two classical three-qubit states have opposite tripartite information

Proved
QAlgorithms.Papers.Independent.Support50.P46.classical_examples

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

prove2quantum

Let A, B and C be qubits, in that order, and let

ρ=12(∣000⟩⟨000∣+∣111⟩⟨111∣),τ=14(∣000⟩⟨000∣+∣011⟩⟨011∣+∣101⟩⟨101∣+∣110⟩⟨110∣).\rho=\tfrac12(|000\rangle\langle000|+|111\rangle\langle111|),\qquad \tau=\tfrac14(|000\rangle\langle000|+|011\rangle\langle011|+|101\rangle\langle101|+|110\rangle\langle110|).ρ=21​(∣000⟩⟨000∣+∣111⟩⟨111∣),τ=41​(∣000⟩⟨000∣+∣011⟩⟨011∣+∣101⟩⟨101∣+∣110⟩⟨110∣).

Both matrices are normalized density operators. With S the von Neumann entropy in bits of the actual reduced state, define I₃(A:B:C)=S(A)+S(B)+S(C)−S(AB)−S(AC)−S(BC)+S(ABC). Then

I3(A:B:C)ρ=1,I3(A:B:C)τ=−1.I_3(A:B:C)_\rho=1,\qquad I_3(A:B:C)_\tau=-1.I3​(A:B:C)ρ​=1,I3​(A:B:C)τ​=−1.

These explicit classical correlations exhibit both signs and disprove general mutual-information monogamy.

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.5, (2.1)–(2.2): both signs occur for the two displayed classical
states, with entropy in bits and actual reduced density matrices. -/
theorem classical_examples :
    IsDensityMatrix redundantClassical ∧ IsDensityMatrix xorClassical ∧
    tripartiteInformation redundantClassical {0} {1} {2} = 1 ∧
    tripartiteInformation xorClassical {0} {1} {2} = -1 := by sorry

end QAlgorithms.Papers.Independent.Support50.P46

end
Source
Holographic Mutual Information is Monogamous, arXiv:1107.2940v2, PDF p. 5, §2, (2.1)–(2.2): classical positive and negative I3
Read-back

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

Let ρred\rho_{\mathrm{red}}ρred​ and ρ⊕\rho_{\oplus}ρ⊕​ be matrices indexed by three-bit strings u,v∈{0,1}3u,v\in\{0,1\}^3u,v∈{0,1}3, defined by

(ρred)uv={12u=v, u0=u1=u2,0otherwise,(ρ⊕)uv={14u=v, u2=u0⊕u1,0otherwise,(\rho_{\mathrm{red}})_{uv}= \begin{cases}\frac12&u=v,\ u_0=u_1=u_2,\\0&\text{otherwise},\end{cases} \qquad (\rho_{\oplus})_{uv}= \begin{cases}\frac14&u=v,\ u_2=u_0\oplus u_1,\\0&\text{otherwise},\end{cases}(ρred​)uv​={21​0​u=v, u0​=u1​=u2​,otherwise,​(ρ⊕​)uv​={41​0​u=v, u2​=u0​⊕u1​,otherwise,​

where ⊕\oplus⊕ denotes exclusive-or. For a matrix ρ\rhoρ on bit strings and a set of coordinates SSS, define its reduced matrix by

(ρS)uv=∑x∣S=u, y∣S=vx∣Sc=y∣Scρxy,(\rho_S)_{uv} =\sum_{\substack{x|_S=u,\ y|_S=v\\x|_{S^c}=y|_{S^c}}}\rho_{xy},(ρS​)uv​=x∣S​=u, y∣S​=vx∣Sc​=y∣Sc​​∑​ρxy​,

and put Hρ(S)=−Re⁡tr⁡[g(ρS)]H_\rho(S)=-\operatorname{Re}\operatorname{tr}\bigl[g(\rho_S)\bigr]Hρ​(S)=−Retr[g(ρS​)], where g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t, g(0)=0g(0)=0g(0)=0, and g(ρS)g(\rho_S)g(ρS​) is evaluated by spectral functional calculus. Define

I3(ρ;A,B,C)=Hρ(A)+Hρ(B)+Hρ(C)−Hρ(A∪B)−Hρ(B∪C)−Hρ(A∪C)+Hρ(A∪B∪C).I_3(\rho;A,B,C)=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).I3​(ρ;A,B,C)=Hρ​(A)+Hρ​(B)+Hρ​(C)−Hρ​(A∪B)−Hρ​(B∪C)−Hρ​(A∪C)+Hρ​(A∪B∪C).

The declaration asserts that both ρred\rho_{\mathrm{red}}ρred​ and ρ⊕\rho_{\oplus}ρ⊕​ are positive semidefinite with trace 111, and that

I3(ρred;{0},{1},{2})=1,I3(ρ⊕;{0},{1},{2})=−1.I_3(\rho_{\mathrm{red}};\{0\},\{1\},\{2\})=1, \qquad I_3(\rho_{\oplus};\{0\},\{1\},\{2\})=-1.I3​(ρred​;{0},{1},{2})=1,I3​(ρ⊕​;{0},{1},{2})=−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