Lemma 6: tensor-factor lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.tensor_factor_lowerFor arbitrary finite-dimensional density matrices and , let denote the logarithm of the joint retained-subset minimum , with retained mass at least . Then
No purity or flatness assumption is imposed on the auxiliary density . This bounds a tensor product's smooth spread using one factor.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P61
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)
open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
attribute [local instance] Classical.propDecidable
section SpectralResults
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- PDF p.4, Lemma 6: arbitrary auxiliary density, including epsilon=0. -/
theorem tensor_factor_lower (tau : Matrix I I ℂ) (omega : Matrix J J ℂ)
(htau : IsDensityMatrix tau) (homega : IsDensityMatrix omega)
(epsilon : ℝ) (hzero : 0 ≤ epsilon) (hone : epsilon < 1) :
smoothSpread tau (Real.sqrt epsilon) + logTwo (1 - Real.sqrt epsilon) ≤
smoothSpread (Matrix.kronecker tau omega) epsilon := by sorry
end SpectralResults
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types with decidable equality, let and be positive semidefinite complex matrices on and , respectively, each with trace , and let . For a density matrix with ascending eigenvalues , define
Then
where . Both retention families are nonempty and contain only nonempty subsets. The case is included, and the density hypotheses exclude empty index types.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.