Remark 4.4
OpenQAlgorithms.Papers.Independent.Support50.P12.remark_4_4Let 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. Then
Support inclusion suffices without a separate nonnegative-slope assumption or global trace preservation.
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]
/-- Remark 4.4, PDF p.19: supported pairs replace the trace-A/nonnegative-slope alternative. -/
theorem remark_4_4 [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)
(hs : Supports X Y) (f : ℝ → ℝ) (hf : DivergenceGenerator f) (hconv : SemidefiniteOperatorConvex 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
For nonempty finite index types with decidable equality, let , be unital complex star subalgebras and let be complex linear. Its Hilbert–Schmidt adjoint is . Assume that maps all ambient matrices into , that maps all ambient matrices into , that is positive on positive semidefinite elements of , and that for every . Let be positive semidefinite, with and . Let be continuous on , with converging in the extended real line as , and suppose that for every matrix size, every , and every , using spectral functional calculus. For any matrices , define
Here is functional calculus with value zero at zero, is the distinct Hermitian spectrum and is empty for a non-Hermitian matrix, projects orthogonally onto the corresponding eigenspace, division by zero is zero, and the selected limit is the code’s total limit operation with values in the extended real line. Then . Zero and unnormalized are included; no additional trace-preservation hypothesis on or sign hypothesis on the limiting slope is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.