4.7
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.max_divergence_uniqueAll 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.
Among quantum extensions agreeing with classical max-divergence on commuting inputs, additivity and CPTP data processing uniquely fix D∞(ρ||σ)=inf{λ∈R:ρ≤exp(λ)σ}.
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.7
Proposition 4.7, PDF p.61: max-divergence is the unique additive,
CPTP-monotone quantum extension of the classical max-divergence. -/
theorem max_divergence_unique :
paperClassicalAgreement paperMaxFamily ⊤ ∧ AdditiveDivergence paperMaxFamily ∧ paperDataProcessing paperMaxFamily ∧
∀ D : paperDivergenceFamily, paperClassicalAgreement D ⊤ → AdditiveDivergence D → paperDataProcessing D →
∀ (I : Type) [Fintype I] [DecidableEq I] [Nonempty I], ∀ r s : paperMat I,
r.PosSemidef → s.PosSemidef → r ≠ 0 → D.value I r s = maxD r s := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For each finite type with decidable equality, define
as an extended real infimum. The assertion first says that this assignment has all three following properties, and then says that any extended real-valued assignment on pairs of matrices over all finite types with decidable equality having these properties agrees with on every positive semidefinite pair on a nonempty such type, provided . The three properties are: for every nonempty finite with decidable equality and all nonnegative functions with , ; for every pair of nonempty finite types with decidable equality and positive semidefinite , indexed respectively by , with ,
and for every complex linear trace-preserving completely positive map from -indexed to -indexed matrices and every positive semidefinite with , . In the first property, put at and otherwise, , and when for all . With and otherwise, if , and otherwise; for , if or , and otherwise, using the total real logarithm with inside . Complete positivity in the third property means that for every natural number , including , applying separately to each block of a positive semidefinite matrix indexed by yields a positive semidefinite matrix indexed by . Trace preservation is required on every matrix. No matrices in these properties are required to have trace ; the second argument may be zero. The asserted uniqueness is precisely on the stated positive semidefinite, nonzero-first-argument domain.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.