Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Table I: eight exact information pairs

Proved
QAlgorithms.Papers.Independent.Support50.P43.table_information_values

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

prove2quantum

For a pure finite multipartite state ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣, define I(ρ)=∑iS(iˉ)−(n−1)S([n])I(\rho)=\sum_i S(\bar i)-(n-1)S([n])I(ρ)=∑i​S(iˉ)−(n−1)S([n]) and common information Ic(ρ)=∑∅≠T⊆[n](−1)∣T∣+1S(T)I_c(\rho)=\sum_{\varnothing\ne T\subseteq[n]}(-1)^{|T|+1}S(T)Ic​(ρ)=∑∅=T⊆[n]​(−1)∣T∣+1S(T), with entropy in bits. Write h2(t)=−tlog⁡2t−(1−t)log⁡2(1−t)h_2(t)=-t\log_2t-(1-t)\log_2(1-t)h2​(t)=−tlog2​t−(1−t)log2​(1−t), with 0log⁡20=00\log_20=00log2​0=0.

Here ∣GHZn⟩=(∣0n⟩+∣1n⟩)/2|\mathrm{GHZ}_n\rangle=(|0^n\rangle+|1^n\rangle)/\sqrt2∣GHZn​⟩=(∣0n⟩+∣1n⟩)/2​, and ∣Dnr⟩|D_n^r\rangle∣Dnr​⟩ is the equal superposition of the distinct weight-rrr strings divided by (nr)\sqrt{\binom nr}(rn​)​. The three-qutrit vector is ∣ψas⟩=(∣123⟩−∣132⟩+∣231⟩−∣213⟩+∣312⟩−∣321⟩)/6|\psi_{\mathrm{as}}\rangle=(|123\rangle-|132\rangle+|231\rangle-|213\rangle+|312\rangle-|321\rangle)/\sqrt6∣ψas​⟩=(∣123⟩−∣132⟩+∣231⟩−∣213⟩+∣312⟩−∣321⟩)/6​. Finally, ∣C4⟩=(∣0000⟩+∣0011⟩+∣1100⟩−∣1111⟩)/2|C_4\rangle=(|0000\rangle+|0011\rangle+|1100\rangle-|1111\rangle)/2∣C4​⟩=(∣0000⟩+∣0011⟩+∣1100⟩−∣1111⟩)/2. The exact pairs are

(Ic,I)(GHZ2)=(2,2),(Ic,I)(GHZ3)=(0,3),(Ic,I)(D31)=(0,3h2(1/3)),(Ic,I)(ψas)=(0,3log⁡23),(Ic,I)(GHZ4)=(2,4),(Ic,I)(D41)=(8h2(1/4)−6,4h2(1/4)),(Ic,I)(D42)=(8h2(1/4)−6,4),(Ic,I)(C4)=(−2,4).\begin{aligned} (I_c,I)(\mathrm{GHZ}_2)&=(2,2),& (I_c,I)(\mathrm{GHZ}_3)&=(0,3),\\ (I_c,I)(D_3^1)&=(0,3h_2(1/3)),& (I_c,I)(\psi_{\mathrm{as}})&=(0,3\log_2 3),\\ (I_c,I)(\mathrm{GHZ}_4)&=(2,4),& (I_c,I)(D_4^1)&=(8h_2(1/4)-6,4h_2(1/4)),\\ (I_c,I)(D_4^2)&=(8h_2(1/4)-6,4),& (I_c,I)(C_4)&=(-2,4). \end{aligned}(Ic​,I)(GHZ2​)(Ic​,I)(D31​)(Ic​,I)(GHZ4​)(Ic​,I)(D42​)​=(2,2),=(0,3h2​(1/3)),=(2,4),=(8h2​(1/4)−6,4),​(Ic​,I)(GHZ3​)(Ic​,I)(ψas​)(Ic​,I)(D41​)(Ic​,I)(C4​)​=(0,3),=(0,3log2​3),=(8h2​(1/4)−6,4h2​(1/4)),=(−2,4).​

These reproduce the displayed rounded decimals while distinguishing the nonnegative alternative information from signed common information.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P43

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- These accepted register types are definitionally the required finite tensor bases.

open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)

open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)

/-- Table I, PDF p.5 (announced on p.3), all eight rows. Decimal displays are
replaced by their exact entropy expressions, not exact decimal equalities. -/
theorem table_information_values :
    informationPair (ghzKet 2 true) = (2,2) ∧
    informationPair (ghzKet 3 true) = (0,3) ∧
    informationPair (dickeQubitVector 3 1) = (0,3 * binEntropy2 (1/3)) ∧
    informationPair antisymmetric = (0,3 * Real.logb 2 3) ∧
    informationPair (ghzKet 4 true) = (2,4) ∧
    informationPair (dickeQubitVector 4 1) = (8 * binEntropy2 (1/4) - 6,4 * binEntropy2 (1/4)) ∧
    informationPair (dickeQubitVector 4 2) = (8 * binEntropy2 (1/4) - 6,4) ∧
    informationPair cluster = (-2,4) := by sorry

end QAlgorithms.Papers.Independent.Support50.P43

end
Source
Multiparty Quantum Mutual Information: An alternative definition, arXiv:1504.07176v2, PDF p. 5, Table I (announced on PDF p.3)
Read-back

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

For a complex vector ψ\psiψ on nnn registers of local dimension ddd, form the matrix ρx,y=ψxψy‾\rho_{x,y}=\psi_x\overline{\psi_y}ρx,y​=ψx​ψy​​, let ρS\rho_SρS​ be its marginal obtained by summing over equal labels outside SSS, and set H(S)=−Re⁡tr⁡f(ρS)H(S)=-\operatorname{Re}\operatorname{tr}f(\rho_S)H(S)=−Retrf(ρS​), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. Define C(ψ)=∑∅≠S⊆I(−1)∣S∣+1H(S)C(\psi)=\sum_{\varnothing\ne S\subseteq I}(-1)^{|S|+1}H(S)C(ψ)=∑∅=S⊆I​(−1)∣S∣+1H(S) and A(ψ)=∑i∈IH(I∖{i})−max⁡(n−1,0)H(I)A(\psi)=\sum_{i\in I}H(I\setminus\{i\})-\max(n-1,0)H(I)A(ψ)=∑i∈I​H(I∖{i})−max(n−1,0)H(I), where I={0,…,n−1}I=\{0,\ldots,n-1\}I={0,…,n−1}. Write h2(t)=binEntropy⁡(t)/ln⁡2h_2(t)=\operatorname{binEntropy}(t)/\ln2h2​(t)=binEntropy(t)/ln2, Gn=(∣0n⟩+∣1n⟩)/2G_n=(|0^n\rangle+|1^n\rangle)/\sqrt2Gn​=(∣0n⟩+∣1n⟩)/2​, and Dn,r=(nr)−1/2∑∣x∣=r∣x⟩D_{n,r}=\binom nr^{-1/2}\sum_{|x|=r}|x\rangleDn,r​=(rn​)−1/2∑∣x∣=r​∣x⟩, where ∣x∣|x|∣x∣ counts entries equal to 111. Let F=(∣012⟩+∣120⟩+∣201⟩−∣021⟩−∣102⟩−∣210⟩)/6F=(|012\rangle+|120\rangle+|201\rangle-|021\rangle-|102\rangle-|210\rangle)/\sqrt6F=(∣012⟩+∣120⟩+∣201⟩−∣021⟩−∣102⟩−∣210⟩)/6​ and K=(∣0000⟩+∣0011⟩+∣1100⟩−∣1111⟩)/2K=(|0000\rangle+|0011\rangle+|1100\rangle-|1111\rangle)/2K=(∣0000⟩+∣0011⟩+∣1100⟩−∣1111⟩)/2, with ∣x⟩|x\rangle∣x⟩ denoting the coordinate vector at xxx. The following eight equalities hold simultaneously:

(C(G2),A(G2))=(2,2),(C(G3),A(G3))=(0,3),(C(D3,1),A(D3,1))=(0,3h2(1/3)),(C(F),A(F))=(0,3log⁡23),(C(G4),A(G4))=(2,4),(C(D4,1),A(D4,1))=(8h2(1/4)−6,4h2(1/4)),(C(D4,2),A(D4,2))=(8h2(1/4)−6,4),(C(K),A(K))=(−2,4).\begin{aligned} (C(G_2),A(G_2))&=(2,2),\\ (C(G_3),A(G_3))&=(0,3),\\ (C(D_{3,1}),A(D_{3,1}))&=(0,3h_2(1/3)),\\ (C(F),A(F))&=(0,3\log_2 3),\\ (C(G_4),A(G_4))&=(2,4),\\ (C(D_{4,1}),A(D_{4,1}))&=(8h_2(1/4)-6,4h_2(1/4)),\\ (C(D_{4,2}),A(D_{4,2}))&=(8h_2(1/4)-6,4),\\ (C(K),A(K))&=(-2,4). \end{aligned}(C(G2​),A(G2​))(C(G3​),A(G3​))(C(D3,1​),A(D3,1​))(C(F),A(F))(C(G4​),A(G4​))(C(D4,1​),A(D4,1​))(C(D4,2​),A(D4,2​))(C(K),A(K))​=(2,2),=(0,3),=(0,3h2​(1/3)),=(0,3log2​3),=(2,4),=(8h2​(1/4)−6,4h2​(1/4)),=(8h2​(1/4)−6,4),=(−2,4).​
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