Joint quasi-convexity on positive operators
OpenQAlgorithms.Papers.Independent.Support50.P19.jointQuasiConvexityLet , let be a finite nonempty index set, let with , and let act on one nonzero finite complex space. Write and . Then
The maximum is taken in the extended real line, so infinite values and zero probabilities are allowed. The operators are not assumed normalized. This controls a mixture by its worst constituent pair.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF p.15, Corollary 9: finite nonempty family of arbitrary positive operators. -/
theorem jointQuasiConvexity [Nonempty I] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(m : ℕ) (hm : 0 < m) (p : Fin m → ℝ) (hp : ∀ x, 0 ≤ p x) (hs : ∑ x, p x = 1)
(A B : Fin m → Matrix I I ℂ) (hA : ∀ x, (A x).PosSemidef) (hB : ∀ x, (B x).PosSemidef) :
sandwichedD a (average p A) (average p B) ≤ ⨆ x : Fin m, sandwichedD a (A x) (B x) := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index set with decidable equality, let , let be a natural number, and let be nonnegative real weights summing to one. For every pair of families of positive semidefinite complex matrices indexed by , with no trace normalization or nonzero requirements,
The supremum includes every index, including indices with . For positive semidefinite , the extended-real quantity is if , and otherwise is
where spectral powers send zero eigenvalues to zero and for and otherwise. Thus zero first matrices, which give , and support failures, which give , are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.