Remark (2-decomposable special case) 5.8
OpenQAlgorithms.Papers.Independent.Support50.P12.remark_5_8Let 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. Write for the unnormalized Petz Rényi entropy, , , and . Logarithms are natural and . The Petz map is .
Assume , , and is a convex combination of two trace non-increasing maps, one two-positive and one two-copositive. Then
Only this expressly asserted two-decomposable special case is claimed; the wider Schwarz-decomposability question is left open.
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 5.8, PDF p.27: ONLY the asserted 2-decomposable special case;
the surrounding general decomposability question remains open. -/
theorem remark_5_8 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi)
(hd : ∃ (t : ℝ) (Phi1 Phi2 : MatrixMap I J), t ∈ Icc 0 1 ∧
AlgebraExtension A B Phi1 ∧ AlgebraExtension A B Phi2 ∧ AlgebraTraceNonincreasing A Phi1 ∧ AlgebraTraceNonincreasing A Phi2 ∧
AlgebraKPositive A Phi1 2 ∧ KCoPositive A Phi2 2 ∧
Phi = ((1 - t : ℝ) : ℂ) • Phi1 + (t : ℂ) • Phi2)
(X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A) (hXp : X.PosSemidef) (hYp : Y.PosSemidef)
(hs : Supports X Y) (htr : tr (Phi Y) = tr Y) (hr : petz Y Phi (Phi X) = X) :
∀ f, DivergenceGenerator f → 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
Let be nonempty finite index types with decidable equality, , unital complex star subalgebras, and complex linear. Write , and . Assume that maps all ambient matrices into and maps all ambient matrices into . Assume there exist and complex-linear , each having those same range properties, such that , each satisfies for positive semidefinite , the block amplification of preserves positivity for positive block matrices with all blocks in , and applying to the blocks preserves positivity whenever the original block matrix is positive and every transposed block lies in . Let be positive semidefinite, with and , and assume
where is spectral functional calculus using value zero at zero and otherwise. For every continuous on , with converging in the extended real line at infinity, and operator convex on positive semidefinite matrices in every finite size, one has , where, with the distinct Hermitian spectrum and empty otherwise and its orthogonal eigenspace projection,
Here real values are embedded in the extended real line, division by zero is zero, and the second branch is the total selected-limit operation. The endpoints and zero or unnormalized are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.