Theorem 4.3
OpenQAlgorithms.Papers.Independent.Support50.P12.theorem_4_3Let and be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let be complex linear. The adjoint is for . A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let . Powers are zero on kernels and traces are not normalized.
Assume is substochastic, , and is operator convex on the full positive semidefinite half-line. If or , then
The trace/slope alternative is essential outside the reference support. This is the paper's precise monotonicity theorem.
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]
/-- Theorem 4.3, PDF pp.17–19: condition (4.10) is retained, including its disjunction. -/
theorem theorem_4_3 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
(hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y)
(f : ℝ → ℝ) (hf : DivergenceGenerator f) (hconv : SemidefiniteOperatorConvex f)
(halt : tr (Phi X) = tr X ∨ 0 ≤ recessionSlope f) :
div f (Phi X) (Phi Y) ≤ div f X 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 nonempty finite index types with decidable equality, let and be unital complex star subalgebras, and let be complex linear. Write , and let be the Hilbert–Schmidt adjoint, explicitly . Assume that sends every ambient matrix into , that sends every ambient matrix into , and that, for every positive semidefinite , is positive semidefinite, while for every ,
Let be positive semidefinite, with . Let be continuous on , with converging as in the extended real line to its selected limit . Assume that, in every finite matrix size, including size zero, is operator convex on positive semidefinite matrices: for and . Define by spectral functional calculus with scalar value at eigenvalue zero and otherwise; let be the distinct eigenvalues of a Hermitian matrix, and the empty set otherwise, and let be the orthogonal projection onto its -eigenspace. Put
where real values are embedded into the extended real line, the second branch uses the total limit-selection operation, and scalar division by zero has value zero. If either or , then . Neither nor is required to be nonzero or normalized.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.