Remark 9
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_faithfulAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Assume [BSW15a, Conjecture 34] for the actual optimized Petz conditional mutual information, including its von Neumann value at order one. For every and state ,
Separability means a finite convex mixture of product densities. The equivalence is the claimed faithfulness property, rather than only vanishing on separable inputs.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF p.11, Remark 9. Faithfulness is an iff. -/
theorem squashed_faithful (hconjecture : PetzParameterConjecture) (a : ℝ) (ha : 1 < a)
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
renyiSquashed a rho = 0 ↔ Entanglement.IsSeparableDensity rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive semidefinite , let assign to zero eigenvalues and to nonzero eigenvalues. Define
when , , for a density matrix on ; the embedding inserts the identity on , and the marginals are partial traces. At , instead set , where , , using continuous functional calculus and natural logarithms. Assume the global conjecture that for every tripartite density matrix on finite nonempty registers and every real , with no upper bound on . For finite register types with decidable equality, every , and every density matrix on , define as one half of the extended-real infimum of over all density-matrix extensions with arbitrary auxiliary dimension , . Then if and only if is a finite convex combination , where , , and every is a density matrix. Zero weights are allowed; an empty convex combination cannot have total weight .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.