Example 4.5
OpenQAlgorithms.Papers.Independent.Support50.P12.example_4_5Let 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 is substochastic and . For , the raw trace overlap increases; for and , it decreases. In particular,
Here the raw overlaps are and their mapped analogues; is Umegaki entropy. No density normalization or trace denominator is inserted.
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]
/-- Example 4.5, PDF p.19: raw trace-power comparisons, all Rényi orders in
[0,2]\{1}, and Umegaki entropy; no trace normalization is introduced. -/
theorem example_4_5 [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) :
(∀ a ∈ Ico (0 : ℝ) 1, tr (supportPower X a * supportPower Y (1 - a)) ≤
tr (supportPower (Phi X) a * supportPower (Phi Y) (1 - a))) ∧
(Supports X Y → ∀ a ∈ Ioc (1 : ℝ) 2,
tr (supportPower (Phi X) a * supportPower (Phi Y) (1 - a)) ≤
tr (supportPower X a * supportPower Y (1 - a))) ∧
(∀ a ∈ Icc (0 : ℝ) 2, a ≠ 1 → petzRenyi a (Phi X) (Phi Y) ≤ petzRenyi a X Y) ∧
relativeEntropy (Phi X) (Phi Y) ≤ relativeEntropy 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 . Assume that maps every ambient matrix into , its Hilbert–Schmidt adjoint maps every ambient matrix into , and is positive on and satisfies for every . Let be positive semidefinite and satisfy . Define by functional calculus using the scalar function that is zero at zero and otherwise, including when or ; define as an extended real value when , and otherwise. Set
where matrix logarithms use real spectral functional calculus, in that calculus, scalar division by zero is zero, and products in use extended real arithmetic. The declaration asserts all four conclusions:
The endpoint , singular matrices, and zero or unnormalized are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.