Lemma 4.2
OpenQAlgorithms.Papers.Independent.Support50.P12.lemma_4_2Let 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 put . With Hilbert–Schmidt adjoints and order,
The draft expresses the operator inequality through every quadratic form on . If is a -morphism, is isometric when is invertible, and the operator comparison is equality when is invertible. The two invertibility assumptions have different roles.
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]
/-- Lemma 4.2, PDF pp.16–17: operator comparison is stated through every
Hilbert–Schmidt quadratic form; the two invertibility refinements are separate. -/
theorem lemma_4_2 [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) :
(∀ Z ∈ B, (hs (modularContraction Phi Y Z) (modularContraction Phi Y Z)).re ≤ (hs Z Z).re) ∧
(∀ Z ∈ B, tr ((modularContraction Phi Y Z)ᴴ * X * modularContraction Phi Y Z * supportPower Y (-1)) ≤
tr (Zᴴ * Phi X * Z * supportPower (Phi Y) (-1))) ∧
((∀ Z ∈ B, ∀ W ∈ B, channelAdjoint Phi (Z * W) = channelAdjoint Phi Z * channelAdjoint Phi W ∧
channelAdjoint Phi (Zᴴ) = (channelAdjoint Phi Z)ᴴ) →
(IsUnit (Phi Y) → ∀ Z ∈ B, (hs (modularContraction Phi Y Z) (modularContraction Phi Y Z)).re = (hs Z Z).re) ∧
(IsUnit Y → ∀ Z ∈ B, tr ((modularContraction Phi Y Z)ᴴ * X * modularContraction Phi Y Z * supportPower Y (-1)) =
tr (Zᴴ * Phi X * Z * supportPower (Phi Y) (-1)))) := 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 types with decidable equality, let and be unital complex subalgebras closed under conjugate transpose, and let be complex linear. Define , and assume that sends every matrix into , sends every matrix into , is positive on positive semidefinite elements of , and for every . Let be positive semidefinite, with zero matrices allowed. Write for functional calculus using the scalar function , for , and define
Then, for every ,
and
Moreover, if for every one has and , then invertibility of implies for every , and invertibility of implies equality in the second displayed inequality for every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.