Lemma 4.1
ProvedQAlgorithms.Papers.Independent.Support50.P12.lemma_4_1Let 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 define . Then
This connects the contraction vector identity with trace preservation on the reference input.
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.1, PDF p.16: the V identity is equivalent to preservation of this trace. -/
theorem lemma_4_1 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (Y : Mat I) (hY : Y ∈ A) (hYp : Y.PosSemidef) :
modularContraction Phi Y (supportPower (Phi Y) (1 / 2)) = supportPower Y (1 / 2) ↔
tr (Phi Y) = tr 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 nonempty finite types with decidable equality, let and be unital complex subalgebras closed under conjugate transpose, and let be complex linear. Define
Assume for every matrix , for every matrix , sends positive semidefinite elements of to positive semidefinite matrices, and for every . For every positive semidefinite , including , define by functional calculus with scalar function at and otherwise, and put
Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.