Corollary 3.4
ProvedQAlgorithms.Papers.Independent.Support50.P12.corollary_3_4Let 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 trace non-increasing, with . Then
Here . Both inequalities retain their distinct support/complement roles.
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]
/-- Corollary 3.4, PDF p.11: both support-overlap inequalities and Rényi-zero monotonicity. -/
theorem corollary_3_4 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : PositiveOnConcreteAlgebra A Phi) (ht : AlgebraTraceNonincreasing A Phi)
(X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A) (hXp : X.PosSemidef) (hYp : Y.PosSemidef)
(htr : tr (Phi X) = tr X) :
tr (Y * supp X) ≤ tr (Phi Y * supp (Phi X)) ∧
tr (Phi Y * (1 - supp (Phi X))) ≤ tr (Y * (1 - supp X)) ∧
petzRenyi 0 (Phi X) (Phi Y) ≤ petzRenyi 0 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 finite, nonempty index types with decidable equality, let be unital complex star subalgebras, and let be complex linear. Define , and assume that every ambient matrix is mapped by into and by into . Suppose is positive on and satisfies for every positive semidefinite , where . For positive semidefinite , assume , and let be the range projection of a positive semidefinite matrix . Then
where , with for and for . Thus a zero overlap gives . Zero and singular matrices are included; no density-matrix normalization is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.