§4.2.2 (4.30)–(4.31): minimality bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_minimalityAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion.
Every additive CPTP-monotone quantum extension agreeing with classical Dα on commuting inputs dominates the sandwiched divergence given by the normalized-trace version of (4.31), in the source order domain.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#4.minimalbound
Equations (4.30)-(4.31), PDF p.58: an additive CPTP-monotone extension
is bounded below by the normalized-trace sandwiched divergence. The pinched regularization
converges to that same quantity, including the endpoint orders. -/
theorem sandwiched_minimality (D : paperDivergenceFamily) (a : ENNReal) (ha : 0 < a)
(hclassical : paperClassicalAgreement D a) (hadd : AdditiveDivergence D) (hdpi : paperDataProcessing D)
{I : Type} [Fintype I] [DecidableEq I] [Nonempty I] (r s : paperMat I)
(hr : r.PosSemidef) (hs : s.PosSemidef) (hne : r ≠ 0) (hc : paperSupported r s) :
paperRenyi true r s a ≤ D.value I r s ∧
Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*paperRenyi false
(paperPinch (paperTensorPower s n) (paperTensorPower r n)) (paperTensorPower s n) a)
atTop (nhds (paperRenyi true r s a)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let assign an extended real number to every pair of square complex matrices on each finite index type equipped with decidable equality, and let . The divergence expressions used here have the following literal definitions. Write when is positive semidefinite, and say that is supported in when . Let be continuous functional calculus applied to the scalar function that is at and elsewhere, and let be functional calculus applied to . Define
Put if , and , embedded in the extended reals, otherwise. For either or , the finite positive order expression is, at , if is not supported in , and otherwise
For , it is
if either and , or is supported in ; it is otherwise. For finite positive , set ; at infinite order set
with these infima and suprema taken in the extended reals. Assume that: for every finite nonempty index type with decidable equality and all nonnegative real vectors with , ; for all such index types , all positive semidefinite on and on , with and , one has ; and for every complex linear map between matrix spaces on such types that preserves the complex trace of every matrix and is completely positive, for positive semidefinite with . Here complete positivity means that, for every natural number , including , the map acting as on each matrix block indexed by a pair from preserves positive semidefiniteness. Then, for every finite nonempty with decidable equality and positive semidefinite matrices on , with and , both
hold, the limit being in the topology of the extended reals. The tensor power has entries , and , where the sum runs over the distinct eigenvalues of the Hermitian matrix and is functional calculus applied to the indicator of . No trace normalization is assumed for . Order is included; the sequence is defined also at , using the empty tensor product and the real convention . All scalar divisions and functional calculus expressions use their total definitions, including inverse , while is explicitly .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.