Lemma 3.5
OpenQAlgorithms.Papers.Independent.Support50.P12.lemma_3_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.
For every positive ,
If , also . If, in addition, is trace non-increasing, then
The support hypothesis applies only to the latter two assertions. These comparisons underpin general monotonicity.
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 3.5, PDF p.11: unconditional compression inequality; (3.4) and (3.5)
inherit support inclusion, and only the final clause requires trace non-increase. -/
theorem lemma_3_5 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : PositiveOnConcreteAlgebra A Phi)
(X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A) (hXp : X.PosSemidef) (hYp : Y.PosSemidef) :
LE (Phi (supp Y * X * supp Y) * supportPower (Phi Y) (-1) * Phi (supp Y * X * supp Y))
(Phi (supp Y * X * supportPower Y (-1) * X * supp Y)) ∧
(Supports X Y → LE (Phi X * supportPower (Phi Y) (-1) * Phi X)
(Phi (X * supportPower Y (-1) * X))) ∧
(Supports X Y → AlgebraTraceNonincreasing A Phi →
div (supportScalarPower 2) (Phi X) (Phi Y) = (tr (Phi X ^ 2 * supportPower (Phi Y) (-1)) : EReal) ∧
tr (Phi X ^ 2 * supportPower (Phi Y) (-1)) ≤ tr (X ^ 2 * supportPower Y (-1)) ∧
(tr (X ^ 2 * supportPower Y (-1)) : EReal) = div (supportScalarPower 2) 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 finite, nonempty index types with decidable equality, let be unital complex star subalgebras, and let be complex linear. Define . Assume that maps every ambient matrix into , that maps every ambient matrix into , and that maps positive semidefinite members of to positive semidefinite matrices. For positive semidefinite , write for functional calculus assigning zero to eigenvalue zero and elsewhere, put , and interpret as positive semidefiniteness of . Then
If , then additionally
If this support inclusion holds and also satisfies for every positive semidefinite , where , then
Here is the extended-real quantity obtained from at and otherwise: it equals when , and otherwise uses the formal total extended-real limit-selection value of that expression with as ; spectra use distinct eigenvalues and division by zero is zero. The traces in the final chain are embedded into the extended real line where required. No invertibility or trace normalization is assumed, and zero matrices are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.