Proposition A.4
OpenQAlgorithms.Papers.Independent.Support50.P12.proposition_A_4Let be positive semidefinite operators on a nonzero finite-dimensional complex Hilbert space. Let be continuous on with signed extended recession slope . Write for the paper's quantum divergence, , and for the support projection. All powers vanish on the kernel, including exponent zero. Traces are representation traces.
Assume and is convex on . Let be the spectral pinching. Then
If and is strictly convex, equality in the first inequality is equivalent to ; equality in the second is equivalent to being a nonnegative multiple of ; equality between the extreme terms is equivalent to being a nonnegative multiple of . Both additional hypotheses govern every equality characterization.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Proposition A.4, PDF pp.44–45: all inequalities, the pinching identity,
and ALL equality characterizations, each retaining strict convexity and support inclusion. -/
theorem proposition_A_4 [Nonempty I] (X Y : Mat I) (hX : X.PosSemidef) (hY : Y.PosSemidef)
(hn : Y ≠ 0) (f : ℝ → ℝ) (hf : DivergenceGenerator f) (hc : ConvexOn ℝ (Ici 0) f) :
div f (pinch Y X) (pinch Y Y) ≤ div f X Y ∧
div f (pinch Y X) (pinch Y Y) = div f (pinch Y X) Y ∧
((tr Y * f (tr X / tr Y) : ℝ) : EReal) ≤ div f (pinch Y X) Y ∧
(Supports X Y → StrictConvexOn ℝ (Ici 0) f →
(div f X Y = div f (pinch Y X) Y ↔ Commute X Y) ∧
(div f (pinch Y X) Y = ((tr Y * f (tr X / tr Y) : ℝ) : EReal) ↔
∃ c : ℝ, 0 ≤ c ∧ pinch Y X = (c : ℂ) • Y) ∧
(div f X Y = ((tr Y * f (tr X / tr Y) : ℝ) : EReal) ↔
∃ c : ℝ, 0 ≤ c ∧ X = (c : ℂ) • Y)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P12
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index type with decidable equality, let be positive semidefinite with , and let be convex on , continuous on , and such that , regarded as extended real, converges at infinity to its totalized limit. Write , and let
where the sum is over distinct eigenvalues, including zero. For positive semidefinite , set
using , and define to be when , and otherwise the totalized extended-real limit of as . Then
Moreover, if and is strictly convex on , then
Neither matrix is required to have trace , and is allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.