4.16
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.measured_representation_implies_dpiAll 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.
A divergence with the asymptotic optimal measured representation (4.73) satisfies CPTP data processing; the representation is a hypothesis on the divergence family, not an extra premise on a constructed state.
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.16
Proposition 4.16, PDF pp.66-67: a quantum extension with the asymptotic
measured representation has DPI. DPI is a conclusion, not hidden in the extension hypothesis. -/
theorem measured_representation_implies_dpi (D : paperDivergenceFamily) (a : ℝ) (ha : 1 < a)
(hclassical : paperClassicalAgreement D (ENNReal.ofReal a))
(hrepresentation : MeasuredRepresentation D (ENNReal.ofReal a)) : paperDataProcessing D := 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 each pair of complex square matrices on every finite type with decidable equality, and let satisfy . Define by functional calculus for the function equal to at and elsewhere, and, for positive semidefinite and positive semidefinite , define
where , otherwise, and multiplication after is in the extended reals. Suppose first that, for every nonempty finite type with decidable equality and nonnegative functions with , . Suppose also that, for every such and every positive semidefinite , the following representation holds. Set on functions from to , and similarly for ; let be the extended real supremum of over all integers and all positive semidefinite families summing to the identity, where . Require both that
in the extended reals and that, for each , the supremum defining is attained by such a finite measurement. The sequence also has a value at , using empty products and the total real reciprocal . Then, for every pair of nonempty finite types with decidable equality, every complex linear map from -indexed matrices to -indexed matrices that preserves the complex trace of every matrix and for which applying blockwise preserves positive semidefiniteness on matrices indexed by for every natural number , including , and every positive semidefinite with , one has
Neither the hypotheses nor the conclusion require trace normalization or a support relation between and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.