Lemma 3.7
ProvedQAlgorithms.Papers.Independent.Support50.P12.lemma_3_7Let 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 some nonzero positive has . Then
The nonzero condition excludes the zero-map degeneracy.
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.7, PDF p.13: the nonzero trace-preserved input forces both adjoint norms to one. -/
theorem lemma_3_7 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (X : Mat I) (hX : X ∈ A) (hXp : X.PosSemidef)
(hn : X ≠ 0) (ht : tr (Phi X) = tr X) :
snorm B (channelAdjoint Phi) = 1 ∧ pnorm (channelAdjoint Phi) = 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 its adjoint by
Assume that for every matrix , that for every matrix , that is positive on positive semidefinite elements of , and that for every , where denotes positive semidefinite order. For any nonzero positive semidefinite satisfying , the assertion is
in , and
Here positivity on means positivity on its positive semidefinite elements, and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.