Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

4.7

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.max_divergence_unique

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All 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 Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ 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(λ)σ}.

D(ρ∥σ)=Dmax⁡(ρ∥σ)=inf⁡{λ∈R:ρ≤2λσ}.D(\rho\|\sigma)=D_{\max}(\rho\|\sigma)=\inf\{\lambda\in\mathbb R:\rho\le2^\lambda\sigma\}.D(ρ∥σ)=Dmax​(ρ∥σ)=inf{λ∈R:ρ≤2λσ}.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
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
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 61, 4.7
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For each finite type III with decidable equality, define

Dmax⁡,I(r,s)=inf⁡{l∈R:2ls−r⪰0}D_{\max,I}(r,s) =\inf\{l\in\mathbb R:2^ls-r\succeq0\}Dmax,I​(r,s)=inf{l∈R:2ls−r⪰0}

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 DDD on pairs of matrices over all finite types with decidable equality having these properties agrees with Dmax⁡D_{\max}Dmax​ on every positive semidefinite pair r,sr,sr,s on a nonempty such type, provided r≠0r\ne0r=0. The three properties are: for every nonempty finite III with decidable equality and all nonnegative functions p,q:I→Rp,q:I\to\mathbb Rp,q:I→R with p≠0p\ne0p=0, DI(diag⁡p,diag⁡q)=sup⁡t>0Ft(p,q)D_I(\operatorname{diag}p,\operatorname{diag}q)=\sup_{t>0}F_t(p,q)DI​(diagp,diagq)=supt>0​Ft​(p,q); for every pair of nonempty finite types I,JI,JI,J with decidable equality and positive semidefinite r,s,t,ur,s,t,ur,s,t,u, indexed respectively by I,I,J,JI,I,J,JI,I,J,J, with r,t≠0r,t\ne0r,t=0,

DI×J(r⊗t,s⊗u)=DI(r,s)+DJ(t,u);D_{I\times J}(r\otimes t,s\otimes u)=D_I(r,s)+D_J(t,u);DI×J​(r⊗t,s⊗u)=DI​(r,s)+DJ​(t,u);

and for every complex linear trace-preserving completely positive map EEE from III-indexed to JJJ-indexed matrices and every positive semidefinite r,sr,sr,s with r≠0r\ne0r=0, DJ(Er,Es)≤DI(r,s)D_J(Er,Es)\le D_I(r,s)DJ​(Er,Es)≤DI​(r,s). In the first property, put zt(x)=0z_t(x)=0zt​(x)=0 at x=0x=0x=0 and zt(x)=xtz_t(x)=x^tzt​(x)=xt otherwise, Qt=∑izt(pi)z1−t(qi)Q_t=\sum_i z_t(p_i)z_{1-t}(q_i)Qt​=∑i​zt​(pi​)z1−t​(qi​), and p≪qp\ll qp≪q when qi=0⇒pi=0q_i=0\Rightarrow p_i=0qi​=0⇒pi​=0 for all iii. With ℓ(0)=−∞\ell(0)=-\inftyℓ(0)=−∞ and ℓ(x)=log⁡2x\ell(x)=\log_2xℓ(x)=log2​x otherwise, F1=∑ipi(log⁡2pi−log⁡2qi)/∑ipiF_1=\sum_i p_i(\log_2p_i-\log_2q_i)/\sum_i p_iF1​=∑i​pi​(log2​pi​−log2​qi​)/∑i​pi​ if p≪qp\ll qp≪q, and +∞+\infty+∞ otherwise; for t≠1t\ne1t=1, Ft=(t−1)−1ℓ(Qt/∑ipi)F_t=(t-1)^{-1}\ell(Q_t/\sum_i p_i)Ft​=(t−1)−1ℓ(Qt​/∑i​pi​) if (t<1 and Qt>0)(t<1\text{ and }Q_t>0)(t<1 and Qt​>0) or p≪qp\ll qp≪q, and +∞+\infty+∞ otherwise, using the total real logarithm with log⁡20=0\log_2 0=0log2​0=0 inside F1F_1F1​. Complete positivity in the third property means that for every natural number kkk, including 000, applying EEE separately to each I×II\times II×I block of a positive semidefinite matrix indexed by {0,…,k−1}×I\{0,\ldots,k-1\}\times I{0,…,k−1}×I yields a positive semidefinite matrix indexed by {0,…,k−1}×J\{0,\ldots,k-1\}\times J{0,…,k−1}×J. Trace preservation is required on every matrix. No matrices in these properties are required to have trace 111; the second argument may be zero. The asserted uniqueness is precisely DI(r,s)=Dmax⁡,I(r,s)D_I(r,s)=D_{\max,I}(r,s)DI​(r,s)=Dmax,I​(r,s) on the stated positive semidefinite, nonzero-first-argument domain.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me