Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

4.16

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.measured_representation_implies_dpi

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.

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.

Dα(ρ∥σ)=lim⁡n→∞1nmax⁡MnDα(Mn(ρ⊗n)∥Mn(σ⊗n))⟹DPI.D_\alpha(\rho\|\sigma)=\lim_{n\to\infty}\frac1n\max_{\mathcal M_n}D_\alpha(\mathcal M_n(\rho^{\otimes n})\|\mathcal M_n(\sigma^{\otimes n}))\quad\Longrightarrow\quad\text{DPI}.Dα​(ρ∥σ)=n→∞lim​n1​Mn​max​Dα​(Mn​(ρ⊗n)∥Mn​(σ⊗n))⟹DPI.

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.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
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 66, 4.16
Read-back

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

Let DDD assign an extended real number to each pair of complex square matrices on every finite type with decidable equality, and let a∈Ra\in\mathbb Ra∈R satisfy a>1a>1a>1. Define Pt(A)P_t(A)Pt​(A) by functional calculus for the function equal to 000 at 000 and xtx^txt elsewhere, and, for positive semidefinite A≠0A\ne0A=0 and positive semidefinite BBB, define

Ra(A,B)={1a−1 ℓ ⁣(Re⁡tr⁡(Pa(A)P1−a(B))Re⁡tr⁡A),ker⁡B⊆ker⁡A,+∞,otherwise,R_a(A,B)= \begin{cases} \displaystyle\frac1{a-1}\, \ell\!\left( \frac{\operatorname{Re}\operatorname{tr}(P_a(A)P_{1-a}(B))} {\operatorname{Re}\operatorname{tr}A} \right),&\ker B\subseteq\ker A,\\ +\infty,&\text{otherwise}, \end{cases}Ra​(A,B)=⎩⎨⎧​a−11​ℓ(RetrARetr(Pa​(A)P1−a​(B))​),+∞,​kerB⊆kerA,otherwise,​

where ℓ(0)=−∞\ell(0)=-\inftyℓ(0)=−∞, ℓ(x)=log⁡2x\ell(x)=\log_2xℓ(x)=log2​x otherwise, and multiplication after ℓ\ellℓ is in the extended reals. Suppose first that, for every nonempty finite type III with decidable equality and nonnegative functions p,q:I→Rp,q:I\to\mathbb Rp,q:I→R with p≠0p\ne0p=0, DI(diag⁡p,diag⁡q)=Ra(diag⁡p,diag⁡q)D_I(\operatorname{diag}p,\operatorname{diag}q)=R_a(\operatorname{diag}p,\operatorname{diag}q)DI​(diagp,diagq)=Ra​(diagp,diagq). Suppose also that, for every such III and every positive semidefinite r≠0,sr\ne0,sr=0,s, the following representation holds. Set (r[n])x,y=∏i<nrxi,yi(r^{[n]})_{x,y}=\prod_{i<n}r_{x_i,y_i}(r[n])x,y​=∏i<n​rxi​,yi​​ on functions from {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1} to III, and similarly for s[n]s^{[n]}s[n]; let Ma(A,B)\mathfrak M_a(A,B)Ma​(A,B) be the extended real supremum of Ra(M(A),M(B))R_a(\mathcal M(A),\mathcal M(B))Ra​(M(A),M(B)) over all integers m>0m>0m>0 and all positive semidefinite families M0,…,Mm−1M_0,\ldots,M_{m-1}M0​,…,Mm−1​ summing to the identity, where M(A)=diag⁡(tr⁡(MiA))i<m\mathcal M(A)=\operatorname{diag}(\operatorname{tr}(M_iA))_{i<m}M(A)=diag(tr(Mi​A))i<m​. Require both that

1n Ma(r[n],s[n])⟶DI(r,s)(n→∞)\frac1n\,\mathfrak M_a(r^{[n]},s^{[n]})\longrightarrow D_I(r,s) \quad(n\to\infty)n1​Ma​(r[n],s[n])⟶DI​(r,s)(n→∞)

in the extended reals and that, for each n>0n>0n>0, the supremum defining Ma(r[n],s[n])\mathfrak M_a(r^{[n]},s^{[n]})Ma​(r[n],s[n]) is attained by such a finite measurement. The sequence also has a value at n=0n=0n=0, using empty products and the total real reciprocal 1/0=01/0=01/0=0. Then, for every pair of nonempty finite types I,JI,JI,J with decidable equality, every complex linear map EEE from III-indexed matrices to JJJ-indexed matrices that preserves the complex trace of every matrix and for which applying EEE blockwise preserves positive semidefiniteness on matrices indexed by {0,…,k−1}×I\{0,\ldots,k-1\}\times I{0,…,k−1}×I for every natural number kkk, including 000, and every positive semidefinite r,sr,sr,s with r≠0r\ne0r=0, one has

DJ(Er,Es)≤DI(r,s).D_J(Er,Es)\le D_I(r,s).DJ​(Er,Es)≤DI​(r,s).

Neither the hypotheses nor the conclusion require trace normalization or a support relation between rrr and sss.

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