Lemma 3.8
OpenQAlgorithms.Papers.Independent.Support50.P12.lemma_3_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.
The class of Schwarz maps is closed under composition, Hilbert–Schmidt adjoints, and nonnegative linear combinations. With the extended Schwarz norm,
Here . Composed maps have compatible concrete domain and range algebras. These properties hold beyond two-positive maps.
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.8, PDF pp.13–14: closure under composition, adjoints and nonnegative
linear combinations, with the extended homogeneous and triangle bounds. -/
theorem lemma_3_8 [Nonempty I] [Nonempty J] [Nonempty K]
(A : Alg I) (B : Alg J) (C : Alg K) (Phi Phi1 Phi2 : MatrixMap I J) (Psi : MatrixMap J K)
(hc : AlgebraExtension A B Phi) (hc1 : AlgebraExtension A B Phi1) (hc2 : AlgebraExtension A B Phi2)
(hd : AlgebraExtension B C Psi) :
(AlgebraSchwarzMap A Phi → AlgebraSchwarzMap B Psi → AlgebraSchwarzMap A (Psi.comp Phi)) ∧
(AlgebraSchwarzMap A Phi → AlgebraSchwarzMap B (channelAdjoint Phi)) ∧
(∀ a b : ℝ, 0 ≤ a → 0 ≤ b → AlgebraSchwarzMap A Phi1 → AlgebraSchwarzMap A Phi2 →
AlgebraSchwarzMap A ((a : ℂ) • Phi1 + (b : ℂ) • Phi2)) ∧
(∀ a : ℝ, 0 ≤ a → snorm A ((a : ℂ) • Phi) = ENNReal.ofReal a * snorm A Phi) ∧
snorm A (Phi1 + Phi2) ≤ snorm A Phi1 + snorm A Phi2 := 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 be unital complex subalgebras of , respectively, closed under conjugate transpose, and let and be complex linear. For any such map , write for the map with entries . Assume each of sends every input matrix into , each of their adjoints sends every matrix into , sends every matrix into , and sends every matrix into . For a source algebra , let be the set of real for which is positive on positive semidefinite elements of and
and set . Then nonemptiness of and implies nonemptiness of ; nonemptiness of implies nonemptiness of ; for every real , nonemptiness of and implies nonemptiness of ; for every real ,
and
The last two assertions require no additional Schwarz-bound assumptions on the maps; and are included, and the displayed norm arithmetic is in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.