Strictly negative tripartite information of a perfect tensor
OpenQAlgorithms.Papers.Independent.Intakenext100.P95.perfect_tensor_tripartite_negativeLet be a normalized perfect tensor state on spins of common dimension . Partition all its legs into four pairwise disjoint sets satisfying . Write for the von Neumann entropy of the actual reduced state on , using logarithms to base . Then
This is a strict inequality for the stated perfect tensor state; it does not assert nonpositivity for all tensor-network states.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite type with decidable equality and , let be a natural number, and let have Euclidean norm one. Suppose , the number of positions is even, and for every subset with , its flattening , with and , satisfies for some real . Let be four pairwise disjoint subsets whose union is all positions, and suppose for every . For a subset , define its reduced density matrix by , and define , where the eigenvalues of are counted with multiplicity and . Then
The partition and size hypotheses cannot hold when or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.