Proposition 7.2
OpenQAlgorithms.Papers.Independent.Support50.P12.proposition_7_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. Write for the unnormalized Petz Rényi entropy, , , and . Logarithms are natural and . The Petz map is .
Let be trace preserving and two-positive. Let be a nonempty code of density operators, and let another density set have the same closed convex hull. Fix one density operator covering the support of . Put
If one rate satisfies and for every , then for every in the closed convex hull of . The infimum is extended and taken over exactly , with no attainment assumption. Nonorthogonality guards the derivative and follows from the state/support setting.
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]
/-- Proposition 7.2, PDF p.35: one rate lies strictly below the ACTUAL infimum
on exactly C0, with no attainment or pointwise-only replacement. -/
theorem proposition_7_2 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hc : AlgebraExtension A B Phi) (ht : AlgebraTracePreserving A Phi) (h2 : AlgebraKPositive A Phi 2)
(C C0 : Set (Mat I)) (hn : C.Nonempty) (hC : ∀ rho ∈ C, AlgebraDensity A rho)
(hC0 : ∀ rho ∈ C0, AlgebraDensity A rho) (hh : hull C0 = hull C)
(sigma : Mat I) (hs : AlgebraDensity A sigma) (hcover : Covers C sigma)
(hoverlap : ∀ rho ∈ C0, 0 < tr (supp (Phi rho) * supp (Phi sigma)))
(r : ℝ) (hr : 0 < r)
(hm : (r : EReal) < sInf {v : EReal | ∃ rho ∈ C0,
v = ((-psiReal (Phi rho) (Phi sigma) 0 - deriv (psiReal (Phi rho) (Phi sigma)) 0 : ℝ) : EReal)})
(heq : ∀ rho ∈ C0, hoeffding (Phi rho) (Phi sigma) r = hoeffding rho sigma r) :
∀ rho ∈ hull C, petz sigma Phi (Phi rho) = rho := 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 of their complex matrix algebras, and let be complex linear. Assume that maps every matrix into , its Hilbert–Schmidt adjoint maps every matrix into , preserves the trace on , and its amplification to block matrices preserves positive semidefiniteness whenever every block belongs to . Let , with , such that every member of either set belongs to , is positive semidefinite, and has real trace , and suppose
Let be positive semidefinite with real trace , and assume for every . Write for functional calculus with off zero and value at zero, and . Assume for every . Define for and otherwise, and set
where the real conversion in sends either infinite value to , and its derivative is the total real derivative. If ,
with the infimum taken in the extended reals, and for every , then every satisfies
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.