Corollary 6.10
OpenQAlgorithms.Papers.Independent.Support50.P12.corollary_6_10Let 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 . Then
This replaces, rather than inherits, the interior-preservation disjunction. The zero pair is included.
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 6.10, PDF p.32: equal supports and traces replace the interior
hypothesis; the zero pair is included. -/
theorem corollary_6_10 [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) (hs : supp X = supp Y)
(htrace : tr X = tr Y) (htr : tr (Phi Y) = tr Y)
(heq : chernoff (Phi X) (Phi Y) = chernoff X Y) :
petz Y Phi (Phi X) = 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 and be unital complex star subalgebras, and let be complex linear. Write for its Hilbert–Schmidt adjoint and . Assume that for every matrix , that for every matrix , and that is positive on and satisfies
where matrix inequalities mean that the difference is positive semidefinite. For a positive semidefinite matrix , write for functional calculus with the scalar function equal to when and equal to at ; thus is its support projection. Define
If are positive semidefinite, have equal support projections and equal real traces, satisfy , and satisfy , then
There is no trace-one or nonzero hypothesis on ; in particular, their simultaneous zero case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.