Pinching domination
ProvedQAlgorithms.Papers.Independent.Advance50.P23.pinching_dominationFor a finite density matrix and positive semidefinite reference , , where is pinching by distinct eigenspace projections and is the number of distinct spectral values, including zero when present. The order is Loewner order.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P23
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P23
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal
open Filter
open QAlgorithms.Papers.Independent.Information100.P56
(IsLaw entropy average holevo uniform ProjectiveRep orbit productOutput)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)
open QAlgorithms.Papers.Independent.Dependency50.P28 (pinch logNonnegativeExtended)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {X A Z B E : Type} [Fintype X] [Fintype A] [Fintype Z]
[Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- PDF p.3, (13): the pinching inequality in Loewner order; v counts distinct
spectral values, not multiplicities. Rho is the normalized state of II.B. -/
theorem pinching_domination [Nonempty E]
(rho sigma : Matrix E E ℂ) (hrho : IsDensityMatrix rho) (hsigma : sigma.PosSemidef) :
(((eigenCount sigma : ℂ) • pinch sigma rho) - rho).PosSemidef := by sorry
end QAlgorithms.Papers.Independent.Advance50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, let be positive semidefinite with trace , and let be positive semidefinite, with no trace normalization or nonzero assumption. Let be the set of distinct eigenvalues of , including zero if present, and for each let . The assertion is
The sum is over distinct eigenvalues rather than eigenvalues counted with multiplicity. The case is included: then , , and the displayed matrix is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.