Unnumbered: finite product decomposition and 79 angles
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.finite_parameterizationAll local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, , and Umegaki relative entropy is on failure of support inclusion. The relative entropy of entanglement is , where separability is across the specified Alice:Bob cut.
For positive finite local dimensions , every separable state is a convex combination of at most projectors onto unit product vectors. For two qubits every separable can be written using 79 angles in as
Here and . There are 15 mixing and 64 local angles; an empty product is one. This is a surjective parameterization and a parameter bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.20–22: at most (d_A d_B)^2 pure products, and an explicit 79-angle
surjection for two qubits. This is a parameter count, not a runtime theorem. -/
theorem finite_parameterization :
(∀ (I J : Type) [Fintype I] [Fintype J] [Nonempty I] [Nonempty J]
(rho : Matrix (I × J) (I × J) ℂ), IsSeparableDensity rho →
HasPureProductDecomposition rho ((Fintype.card I * Fintype.card J)^2)) ∧
(∀ rho : Matrix (Bool × Bool) (Bool × Bool) ℂ, IsSeparableDensity rho →
∃ a : Fin 79 → ℝ, (∀ i, a i ∈ Set.Icc 0 (2*Real.pi)) ∧ rho = angleState a) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Two assertions hold. First, for every pair of finite nonempty types and every separable matrix on , there exist a natural number , nonnegative real weights summing to , and unit vectors , such that ; the premise “separable” itself means a finite convex combination of tensor products of positive semidefinite trace-one matrices, without initially requiring pure factors. Second, every separable matrix on admits real parameters , all in , with the following expression: define the Boolean-indexed vector , with the false coordinate first, and define, for ,
Then
The product for is empty and equals ; zero decomposition weights are permitted, while an empty decomposition cannot have weights summing to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.