Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2.4 (4.40)–(4.43): max-divergence pinching attainment

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.max_divergence_pinching

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.

D∞(Pσρ||σ)≤D∞(ρ||σ)≤D∞(Pσρ||σ)+log|specσ|. After tensor powers and division by n the correction vanishes because |spec(σ^⊗n)|≤(n+1)^(d−1); obtain the limit representation.

Dmax⁡(Pσρ∥σ)≤Dmax⁡(ρ∥σ)≤Dmax⁡(Pσρ∥σ)+log⁡2∣spec⁡σ∣,∣spec⁡(σ⊗n)∣≤(n+1)d−1.D_{\max}(\mathcal P_\sigma\rho\|\sigma)\le D_{\max}(\rho\|\sigma)\le D_{\max}(\mathcal P_\sigma\rho\|\sigma)+\log_2|\operatorname{spec}\sigma|,\quad|\operatorname{spec}(\sigma^{\otimes n})|\le(n+1)^{d-1}.Dmax​(Pσ​ρ∥σ)≤Dmax​(ρ∥σ)≤Dmax​(Pσ​ρ∥σ)+log2​∣specσ∣,∣spec(σ⊗n)∣≤(n+1)d−1.

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.maxpinching
§4.2.4 (4.40)–(4.43): max-divergence pinching attainment, arXiv:1504.00233v5, PDF p.60,61. -/
theorem max_divergence_pinching [Nonempty I] (r s : paperMat I) (hr : r.PosSemidef)
    (hne : r ≠ 0) (hs : s.PosSemidef) :
    maxD (paperPinch s r) s ≤ maxD r s ∧ maxD r s ≤ maxD (paperPinch s r) s+(Real.logb 2 (spectralValues s).card:EReal) ∧
    (∀ n : ℕ, 0 < n → (spectralValues (paperTensorPower s n)).card ≤ (n+1)^(Fintype.card I-1)) ∧
    Tendsto (fun n : ℕ => Real.logb 2 (spectralValues (paperTensorPower s n)).card/(n:ℝ)) atTop (nhds 0) ∧
    Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*maxD (paperTensorPower r n) (paperTensorPower s n)) atTop (nhds (maxD r s)) ∧
    Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*maxD (paperPinch (paperTensorPower s n) (paperTensorPower r n)) (paperTensorPower s n))
      atTop (nhds (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. 60, §4.2.4 (4.40)–(4.43): max-divergence pinching attainment
Read-back

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

Let III be a finite, nonempty index type with decidable equality, and let r,sr,sr,s be complex matrices indexed by III, where rrr is positive semidefinite and nonzero and sss is positive semidefinite. Define the extended-real quantity

Dmax⁡(X∥Y)=inf⁡{ ℓ∈R:X≤2ℓY },D_{\max}(X\|Y)=\inf\{\,\ell\in\mathbb R:X\le 2^\ell Y\,\},Dmax​(X∥Y)=inf{ℓ∈R:X≤2ℓY},

where X≤YX\le YX≤Y means that Y−XY-XY−X is positive semidefinite and the infimum is taken in the extended real line, so an empty feasible set has infimum +∞+\infty+∞. Let Λ(Y)\Lambda(Y)Λ(Y) be the set of distinct eigenvalues of a Hermitian matrix YYY, including zero if present, and let PY(X)=∑λ∈Λ(Y)PλXPλ\mathcal P_Y(X)=\sum_{\lambda\in\Lambda(Y)}P_\lambda XP_\lambdaPY​(X)=∑λ∈Λ(Y)​Pλ​XPλ​, where PλP_\lambdaPλ​ is functional calculus of the indicator of {λ}\{\lambda\}{λ} applied to YYY. For n∈Nn\in\mathbb Nn∈N, define X⊗nX^{\otimes n}X⊗n, indexed by functions {0,…,n−1}→I\{0,\ldots,n-1\}\to I{0,…,n−1}→I, by (X⊗n)x,y=∏i=0n−1Xxi,yi(X^{\otimes n})_{x,y}=\prod_{i=0}^{n-1}X_{x_i,y_i}(X⊗n)x,y​=∏i=0n−1​Xxi​,yi​​. Then all of the following hold:

Dmax⁡(Ps(r)∥s)≤Dmax⁡(r∥s)≤Dmax⁡(Ps(r)∥s)+log⁡2∣Λ(s)∣,D_{\max}(\mathcal P_s(r)\|s)\le D_{\max}(r\|s) \le D_{\max}(\mathcal P_s(r)\|s)+\log_2|\Lambda(s)|,Dmax​(Ps​(r)∥s)≤Dmax​(r∥s)≤Dmax​(Ps​(r)∥s)+log2​∣Λ(s)∣, ∣Λ(s⊗n)∣≤(n+1)∣I∣−1(n>0),lim⁡n→∞log⁡2∣Λ(s⊗n)∣n=0,|\Lambda(s^{\otimes n})|\le(n+1)^{|I|-1}\quad(n>0), \qquad \lim_{n\to\infty}\frac{\log_2|\Lambda(s^{\otimes n})|}{n}=0,∣Λ(s⊗n)∣≤(n+1)∣I∣−1(n>0),n→∞lim​nlog2​∣Λ(s⊗n)∣​=0, lim⁡n→∞1nDmax⁡(r⊗n∥s⊗n)=Dmax⁡(r∥s),lim⁡n→∞1nDmax⁡(Ps⊗n(r⊗n)∥s⊗n)=Dmax⁡(r∥s).\lim_{n\to\infty}\frac1nD_{\max}(r^{\otimes n}\|s^{\otimes n}) =D_{\max}(r\|s), \qquad \lim_{n\to\infty}\frac1nD_{\max}(\mathcal P_{s^{\otimes n}}(r^{\otimes n})\|s^{\otimes n}) =D_{\max}(r\|s).n→∞lim​n1​Dmax​(r⊗n∥s⊗n)=Dmax​(r∥s),n→∞lim​n1​Dmax​(Ps⊗n​(r⊗n)∥s⊗n)=Dmax​(r∥s).

The last two limits are in the extended real line. Neither trace normalization nor support inclusion is assumed, and sss may be zero. The sequences are defined also at n=0n=0n=0: the tensor power is the one-dimensional matrix with entry 111, and real division by zero is assigned value zero; the eigenvalue-count bound itself is asserted only for n>0n>0n>0.

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