Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strictly negative tripartite information of a perfect tensor

Open
QAlgorithms.Papers.Independent.Intakenext100.P95.perfect_tensor_tripartite_negative

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ∣ψ⟩\lvert\psi\rangle∣ψ⟩ be a normalized perfect tensor state on 2n2n2n spins of common dimension v≥2v\ge2v≥2. Partition all its legs into four pairwise disjoint sets A,B,C,DA,B,C,DA,B,C,D satisfying 0<∣A∣,∣B∣,∣C∣,∣D∣<n0<|A|,|B|,|C|,|D|<n0<∣A∣,∣B∣,∣C∣,∣D∣<n. Write SXS_XSX​ for the von Neumann entropy of the actual reduced state on XXX, using logarithms to base vvv. Then

I3(A,B,C):=SA+SB+SC−SAB−SAC−SBC+SABC<0.I_3(A,B,C):=S_A+S_B+S_C-S_{AB}-S_{AC}-S_{BC}+S_{ABC}<0.I3​(A,B,C):=SA​+SB​+SC​−SAB​−SAC​−SBC​+SABC​<0.

This is a strict inequality for the stated perfect tensor state; it does not assert nonpositivity for all tensor-network states.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P95

open scoped Matrix ComplexConjugate

noncomputable section

local instance (p : Prop) : Decidable p := Classical.propDecidable p

/-- PDF pp.22–23, Theorem 4: strict negativity for a four-part partition of a
normalized perfect tensor state, with every part nonempty and smaller than n. -/
theorem perfect_tensor_tripartite_negative {V : Type*} [Fintype V] [DecidableEq V]
    (n : ℕ) (hv : 2 ≤ Fintype.card V) (psi : EuclideanSpace ℂ (Fin (2 * n) → V))
    (hstate : IsState psi) (hperfect : IsPerfect psi)
    (parts : Fin 4 → Finset (Fin (2 * n)))
    (hdisjoint : ∀ i j, i ≠ j → Disjoint (parts i) (parts j))
    (hcover : Finset.univ.biUnion parts = Finset.univ)
    (hsizes : ∀ i, 0 < (parts i).card ∧ (parts i).card < n) :
    tripartiteInfo psi (parts 0) (parts 1) (parts 2) < 0 := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P95
Source
Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence, arXiv:1503.06237v2, PDF p. 22, Theorem 4: strictly negative tripartite information of a perfect tensor
Read-back

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

Let VVV be a finite type with decidable equality and d=∣V∣≥2d=|V|\ge2d=∣V∣≥2, let nnn be a natural number, and let ψ∈CV{0,…,2n−1}\psi\in\mathbb C^{V^{\{0,\ldots,2n-1\}}}ψ∈CV{0,…,2n−1} have Euclidean norm one. Suppose ψ≠0\psi\ne0ψ=0, the number of positions is even, and for every subset SSS with 2∣S∣≤2n2|S|\le2n2∣S∣≤2n, its flattening FS(b,a)=ψ(a∪b)F_S(b,a)=\psi(a\cup b)FS​(b,a)=ψ(a∪b), with a∈VSa\in V^Sa∈VS and b∈VScb\in V^{S^c}b∈VSc, satisfies FS†FS=cSIF_S^\dagger F_S=c_S IFS†​FS​=cS​I for some real cS>0c_S>0cS​>0. Let P0,P1,P2,P3P_0,P_1,P_2,P_3P0​,P1​,P2​,P3​ be four pairwise disjoint subsets whose union is all 2n2n2n positions, and suppose 0<∣Pi∣<n0<|P_i|<n0<∣Pi​∣<n for every iii. For a subset SSS, define its reduced density matrix by ρS(a,a′)=∑b∈VScψ(a∪b)ψ(a′∪b)‾\rho_S(a,a')=\sum_{b\in V^{S^c}}\psi(a\cup b)\overline{\psi(a'\cup b)}ρS​(a,a′)=∑b∈VSc​ψ(a∪b)ψ(a′∪b)​, and define H(S)=−∑λλlog⁡2λ/log⁡2dH(S)=-\sum_\lambda\lambda\log_2\lambda/\log_2 dH(S)=−∑λ​λlog2​λ/log2​d, where the eigenvalues of ρS\rho_SρS​ are counted with multiplicity and 0log⁡20=00\log_2 0=00log2​0=0. Then

H(P0)+H(P1)+H(P2)−H(P0∪P1)−H(P0∪P2)−H(P1∪P2)+H(P0∪P1∪P2)<0.H(P_0)+H(P_1)+H(P_2)-H(P_0\cup P_1)-H(P_0\cup P_2)-H(P_1\cup P_2)+H(P_0\cup P_1\cup P_2)<0.H(P0​)+H(P1​)+H(P2​)−H(P0​∪P1​)−H(P0​∪P2​)−H(P1​∪P2​)+H(P0​∪P1​∪P2​)<0.

The partition and size hypotheses cannot hold when n=0n=0n=0 or n=1n=1n=1.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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