Lemma 9
ProvedQAlgorithms.Papers.Independent.Support50.P21.maxRelative_mixture_boundAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be a nonempty finite set, with , and let be density operators. Using the same weights in both mixtures,
The maximum may be . This is the source's maximum bound, including zero-weight components.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Lemma 9, PDF p.5, (25): common weights and finite maximum, not an average. -/
theorem maxRelative_mixture_bound {K : Type} [Fintype K] [Nonempty K]
(p : K → ℝ) (hp : ∀ i, 0 ≤ p i) (hsum : ∑ i, p i = 1)
(rho sigma : K → Mat I) (hrho : ∀ i, IsDensityMatrix (rho i))
(hsigma : ∀ i, IsDensityMatrix (sigma i)) :
maxRelative (∑ i, (p i : ℂ) • rho i) (∑ i, (p i : ℂ) • sigma i) ≤
⨆ i, maxRelative (rho i) (sigma i) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite index type with decidable equality and any finite nonempty type , let with , and let be positive semidefinite complex matrices on , each with complex trace one, for every . Define
where the infimum is taken in the extended real numbers and is when the feasible set is empty. Then
No support inclusions are assumed, so the supremum may be . Zero weights are permitted, and the supremum includes every index, including those with zero weight.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.