Lemma 3.2
ProvedQAlgorithms.Papers.Independent.Support50.P12.lemma_3_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 positive and . Then , and the following five conditions are equivalent:
Under these conditions, every positive supported in has its trace preserved. The adjoint bound is local; global trace non-increase is not substituted for it.
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.2, PDF p.10: the local adjoint bound, all five equivalent criteria,
and trace preservation throughout the support corner. -/
theorem lemma_3_2 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : PositiveOnConcreteAlgebra A Phi)
(Y : Mat I) (hY : Y ∈ A) (hYp : Y.PosSemidef)
(hb : LE (channelAdjoint Phi (supp (Phi Y))) 1) :
let S := channelAdjoint Phi (supp (Phi Y))
let c1 := tr (Phi Y) = tr Y
let c2 := ∀ f : ℝ → ℂ, (0 ∈ spec Y → f 0 = 0) →
spectralFunction f Y * S = spectralFunction f Y ∧ S * spectralFunction f Y = spectralFunction f Y
let c3 := LE (supp Y) (spectralProjector S 1)
let c4 := CornerTP A Phi (supp Y)
let c5 := petz Y Phi (Phi Y) = Y
tr (Phi Y) ≤ tr Y ∧ (c1 ↔ c2) ∧ (c2 ↔ c3) ∧ (c3 ↔ c4) ∧ (c4 ↔ c5) ∧
(c1 → ∀ X ∈ A, X.PosSemidef → Supports X Y → tr (Phi X) = tr X) := 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 is positive on positive semidefinite members of . Let be positive semidefinite, put , and assume , where matrix inequalities mean that the difference is positive semidefinite and is the range projection of . Write , let be functional calculus with value zero at eigenvalue zero and elsewhere, and define
Then , and the following five conditions are equivalent: ; for every function satisfying if zero is an eigenvalue of , the spectral operator satisfies and ; , where is the orthogonal projection onto the eigenvalue-one eigenspace of ; for every ; and . Moreover, the first condition implies for every positive semidefinite with . The matrix is allowed, and the corner trace-preservation condition concerns all matrices in , not only positive ones.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.