Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.2 (7.13): Maassen–Uffink relation

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.maassen_uffink

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. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation H(A∣B)=H(AB)−H(B)H(A|B)=H(AB)-H(B)H(A∣B)=H(AB)−H(B) denotes conditional von Neumann entropy. In hypothesis testing, αn(T;ρ)=Tr⁡((I−T)ρ⊗n)\alpha_n(T;\rho)=\operatorname{Tr}((I-T)\rho^{\otimes n})αn​(T;ρ)=Tr((I−T)ρ⊗n) and βn(T;σ)=Tr⁡(Tσ⊗n)\beta_n(T;\sigma)=\operatorname{Tr}(T\sigma^{\otimes n})βn​(T;σ)=Tr(Tσ⊗n), with 0≤T≤I0\le T\le I0≤T≤I. The value αn∗(u)\alpha_n^*(u)αn∗​(u) minimizes the first error subject to the second being at most uuu.

For two ONBs of A, normalized state ρ_A, conjugate orders α,β≥1/2 with 1/α+1/β=2, the actual basis outcome Rényi entropies obey Hα(X)+Hβ(Y)≥−log max_{x,y}|<φx|θy>|².

Hα(X)MX(ρ)+Hβ(Y)MY(ρ)≥−log⁡2c,c=max⁡x,y∣⟨φx,ϑy⟩∣2.H_\alpha(X)_{\mathcal M_X(\rho)}+H_\beta(Y)_{\mathcal M_Y(\rho)}\ge-\log_2c,\qquad c=\max_{x,y}|\langle\varphi_x,\vartheta_y\rangle|^2.Hα​(X)MX​(ρ)​+Hβ​(Y)MY​(ρ)​≥−log2​c,c=x,ymax​∣⟨φx​,ϑy​⟩∣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#7.maassenuffink
§7.2 (7.13): Maassen–Uffink relation, arXiv:1504.00233v5, PDF p.116. -/
theorem maassen_uffink [Nonempty I] (r U V : paperMat I) (hr : IsDensityMatrix r)
    (hU : Uᴴ*U = 1) (hV : Vᴴ*V = 1) (a b : ℝ) (ha : 1/2 ≤ a) (hb : 1/2 ≤ b) (hab : 1/a+1/b = 2) :
    -paperRenyi false (basisLaw U r) 1 (ENNReal.ofReal a)-paperRenyi false (basisLaw V r) 1 (ENNReal.ofReal b) ≥ -paperLogE (basisOverlap U V) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 116, §7.2 (7.13): Maassen–Uffink relation
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, let r,U,Vr,U,Vr,U,V be complex square matrices on III, assume r⪰0r\succeq0r⪰0 and tr⁡r=1\operatorname{tr}r=1trr=1, and assume U†U=IU^\dagger U=IU†U=I and V†V=IV^\dagger V=IV†V=I. Let a,b∈Ra,b\in\mathbb Ra,b∈R satisfy a,b≥12a,b\ge\tfrac12a,b≥21​ and 1/a+1/b=21/a+1/b=21/a+1/b=2. Define the diagonal matrices

(XU)i,j={(U†rU)i,i,i=j,0,i≠j,(XV)i,j={(V†rV)i,i,i=j,0,i≠j,(X_U)_{i,j}= \begin{cases}(U^\dagger rU)_{i,i},&i=j,\\0,&i\ne j,\end{cases} \qquad (X_V)_{i,j}= \begin{cases}(V^\dagger rV)_{i,i},&i=j,\\0,&i\ne j,\end{cases}(XU​)i,j​={(U†rU)i,i​,0,​i=j,i=j,​(XV​)i,j​={(V†rV)i,i​,0,​i=j,i=j,​

and the real number c=sup⁡{∣(U†V)i,j∣2:i,j∈I}c=\sup\{|(U^\dagger V)_{i,j}|^2:i,j\in I\}c=sup{∣(U†V)i,j​∣2:i,j∈I}. Write X[t]=cfc⁡(ft,X)X^{[t]}=\operatorname{cfc}(f_t,X)X[t]=cfc(ft​,X), where ft(0)=0f_t(0)=0ft​(0)=0 and ft(x)=xtf_t(x)=x^tft​(x)=xt otherwise, let log⁡2X=cfc⁡(log⁡2,X)\log_2X=\operatorname{cfc}(\log_2,X)log2​X=cfc(log2​,X) using the total real logarithm, and let L(0)=−∞L(0)=-\inftyL(0)=−∞, L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise. For the positive orders used here, define

Rt(X)={Re⁡tr⁡(Xlog⁡2X)Re⁡tr⁡X,t=1,1t−1L ⁣(Re⁡tr⁡(X[t])Re⁡tr⁡X),t≠1,\mathcal R_t(X)= \begin{cases} \dfrac{\operatorname{Re}\operatorname{tr}(X\log_2X)} {\operatorname{Re}\operatorname{tr}X},&t=1,\\[6pt] \dfrac1{t-1}L\!\left( \dfrac{\operatorname{Re}\operatorname{tr}(X^{[t]})} {\operatorname{Re}\operatorname{tr}X}\right),&t\ne1, \end{cases}Rt​(X)=⎩⎨⎧​RetrXRetr(Xlog2​X)​,t−11​L(RetrXRetr(X[t])​),​t=1,t=1,​

as an extended-real quantity; this is the stated divergence with second argument the identity matrix, whose kernel is zero. Then

−Ra(XU)−Rb(XV)≥−L(c).-\mathcal R_a(X_U)-\mathcal R_b(X_V)\ge -L(c).−Ra​(XU​)−Rb​(XV​)≥−L(c).

The order-one cases use the separate first branch rather than division by t−1t-1t−1, and all subtraction and comparison in the asserted inequality take place in the extended reals.

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