Theorem 5.1
OpenQAlgorithms.Papers.Independent.Support50.P12.theorem_5_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. Write for the unnormalized Petz Rényi entropy, , , and . Logarithms are natural and . The Petz map is .
Assume is substochastic and preserves the trace of . For , define ten conditions: (i) one stochastic map recovers both ; (ii) one substochastic map does so; (iii) every operator convex has its divergence preserved; (iv) one such does so with representing-measure support cardinal at least ; (v) one set of at least this cardinal has every preserved, where and , on their actual algebras. Conditions (vi), (vii), and (viii) are for all complex , for some real , and for all imaginary , respectively. Condition (ix) is ; (x) is . Then
Two-positivity of also gives . The implication needs no support inclusion. When recovery (i) exists, it can preserve every given -positivity level of , or complete positivity. These are equivalences only in the indicated stronger map regime.
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]
/-- Theorem 5.1, PDF pp.21–25: complete ten-condition chain and both positivity
refinements. Only the chain needs support inclusion; (ii)=>(iii) does not. -/
theorem theorem_5_1 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
(hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y) :
let c := pairConditions false A B Phi X Y
(Supports X Y → PairChain c) ∧ (c 1 → c 2) ∧
(Supports X Y → AlgebraKPositive A Phi 2 → c 9 → c 0) ∧
(Supports X Y → c 0 → RecoveryRefinement A B Phi {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 nonempty finite index types with decidable equality, let , be unital complex star subalgebras, and let be complex linear. Write , and let be the adjoint given by . For any complex-linear , call substochastic from to when its entire range lies in , the entire range of lies in , is positive on positive elements of , and for every ; call it stochastic when, additionally, for every . Assume is substochastic, are positive semidefinite, and . Use the following definitions: is functional calculus with value zero at zero and otherwise; ; is zero for a non-Hermitian , and otherwise is spectral calculus with value zero at zero and at nonzero eigenvalues; is the distinct Hermitian spectrum and is empty otherwise; is the orthogonal eigenspace projection; and
All divergence values lie in the extended real line, selected limits are total limit-selection operations, and scalar division by zero is zero. A permitted generator is continuous on , has converging in the extended real line at infinity, and is operator convex on positive semidefinite matrices in every size. Define to consist of the ratios , for , , for which some nonzero satisfies , and put . The richness requirement for a generator means that the support of its selected representing measure on has cardinality at least : this measure is selected to admit, when such a representation exists, real , with , integrability of for every , and
where away from zero and is its selected right limit; the measure selection is still a total choice if no representation exists. Define to be
and define . Let be, respectively: existence of a stochastic recovering both ; existence of a substochastic such ; equality for every permitted generator ; equality for some permitted generator satisfying the richness requirement; existence of a set of cardinality at least such that equality holds for each generator , ; for every complex ; for some real , ; for every real ;
and . The theorem states that, if , then
it also states without that support hypothesis. Under support inclusion, positivity of the block amplification of on positive block matrices whose blocks belong to , together with , implies . Finally, support inclusion and imply that, for every natural , positivity of the block amplification of on such matrices yields a stochastic recovery , positive under the corresponding amplification on blocks in , recovering both ; if has this positivity for every , there is one stochastic recovery having it for every and recovering both matrices. The amplification quantifiers include , and need not be nonzero or normalized.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.