Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3.3 (4.84): measured endpoint representation

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.measured_endpoints

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.

For α=1/2 or ∞, Dtildeα(ρ||σ)=max over single-copy measurements Dα(Mρ||Mσ); hence positivity-preserving trace-preserving maps suffice for DPI at these endpoints.

D~α(ρ∥σ)=max⁡MDα(M(ρ)∥M(σ)),α∈{1/2,∞}.\widetilde D_\alpha(\rho\|\sigma)=\max_{\mathcal M}D_\alpha(\mathcal M(\rho)\|\mathcal M(\sigma)),\qquad\alpha\in\{1/2,\infty\}.Dα​(ρ∥σ)=Mmax​Dα​(M(ρ)∥M(σ)),α∈{1/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.measuredendpoints
Equation (4.84) and following remarks, PDF p.68. Printed: M(rho) twice.
Changed: M(sigma) in the second argument. Why: the left side and its DPI application require sigma. -/
theorem measured_endpoints [Nonempty I] [Nonempty J] (r s : paperMat I)
    (hr : r.PosSemidef) (hne : r ≠ 0) (hs : s.PosSemidef) (a : ENNReal) (ha : a = 1/2 ∨ a = ⊤) :
    (∃ m : ℕ, 0 < m ∧ ∃ M : Fin m → paperMat I, IsPOVM M ∧
      paperRenyi true r s a = paperRenyi false (measureOutput M r) (measureOutput M s) a ∧
      ∀ k : ℕ, 0 < k → ∀ N : Fin k → paperMat I, IsPOVM N →
        paperRenyi false (measureOutput N r) (measureOutput N s) a ≤ paperRenyi true r s a) ∧
    (∀ E : paperMat I →ₗ[ℂ] paperMat J, (∀ R : paperMat I, R.PosSemidef → (E R).PosSemidef) →
      (∀ R : paperMat I, (E R).trace = R.trace) → paperRenyi true (E r) (E s) a ≤ paperRenyi true r s a) ∧
    (∀ b : ENNReal, 1/2 ≤ b → ∀ E : paperMat I →ₗ[ℂ] paperMat J,
      (∀ n : ℕ, ∀ R : paperMat (Fin n → I), R.PosSemidef → (piSuperop (fun _ : Fin n => E) R).PosSemidef) →
      (∀ R : paperMat I, (E R).trace = R.trace) → paperRenyi true (E r) (E s) b ≤ paperRenyi true r s b) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 68, §4.3.3 (4.84): measured endpoint representation
Read-back

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

Let I,JI,JI,J be nonempty finite types with decidable equality, and let r,sr,sr,s be complex square matrices indexed by III, with r,sr,sr,s positive semidefinite and r≠0r\ne0r=0. Let a∈[0,∞]a\in[0,\infty]a∈[0,∞] satisfy a=12a=\tfrac12a=21​ or a=∞a=\inftya=∞. The following notation specifies the divergences used in the assertion. Write A⪯BA\preceq BA⪯B when B−AB-AB−A is positive semidefinite, and A≪BA\ll BA≪B when ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA. Let Pt(A)P_t(A)Pt​(A) be the real continuous functional calculus applied to the function that is 000 at 000 and xtx^txt elsewhere, and let L(A)L(A)L(A) be the functional calculus of the total real function log⁡2x\log_2 xlog2​x, whose value at 000 is 000. Put ℓ(0)=−∞\ell(0)=-\inftyℓ(0)=−∞ and ℓ(x)=log⁡2x\ell(x)=\log_2 xℓ(x)=log2​x otherwise, as an extended real number. For a positive finite order ttt, define

QtS(A,B)=Re⁡tr⁡Pt ⁣(P(1−t)/(2t)(B) A P(1−t)/(2t)(B)),QtP(A,B)=Re⁡tr⁡ ⁣(Pt(A)P1−t(B)).Q_t^{\mathrm S}(A,B)=\operatorname{Re}\operatorname{tr} P_t\!\left(P_{(1-t)/(2t)}(B)\,A\,P_{(1-t)/(2t)}(B)\right), \qquad Q_t^{\mathrm P}(A,B)=\operatorname{Re}\operatorname{tr}\!\left(P_t(A)P_{1-t}(B)\right).QtS​(A,B)=RetrPt​(P(1−t)/(2t)​(B)AP(1−t)/(2t)​(B)),QtP​(A,B)=Retr(Pt​(A)P1−t​(B)).

For either choice q∈{S,P}q\in\{\mathrm S,\mathrm P\}q∈{S,P}, define D1q(A,B)D_1^q(A,B)D1q​(A,B) to be Re⁡tr⁡(A(L(A)−L(B)))/Re⁡tr⁡A\operatorname{Re}\operatorname{tr}(A(L(A)-L(B)))/\operatorname{Re}\operatorname{tr}ARetr(A(L(A)−L(B)))/RetrA if A≪BA\ll BA≪B, and +∞+\infty+∞ otherwise; for t≠1t\ne1t=1, define Dtq(A,B)D_t^q(A,B)Dtq​(A,B) to be

1t−1 ℓ ⁣(Qtq(A,B)Re⁡tr⁡A)\frac1{t-1}\,\ell\!\left(\frac{Q_t^q(A,B)}{\operatorname{Re}\operatorname{tr}A}\right)t−11​ℓ(RetrAQtq​(A,B)​)

if (t<1 and Qtq(A,B)>0)(t<1\ \text{and}\ Q_t^q(A,B)>0)(t<1 and Qtq​(A,B)>0) or A≪BA\ll BA≪B, and +∞+\infty+∞ otherwise. All arithmetic in this expression after applying ℓ\ellℓ is extended real arithmetic. Define

D∞S(A,B)=inf⁡{l∈R:A⪯2lB},D∞P(A,B)=sup⁡t>0DtP(A,B),D_\infty^{\mathrm S}(A,B) =\inf\{l\in\mathbb R:A\preceq 2^lB\}, \qquad D_\infty^{\mathrm P}(A,B)=\sup_{t>0}D_t^{\mathrm P}(A,B),D∞S​(A,B)=inf{l∈R:A⪯2lB},D∞P​(A,B)=t>0sup​DtP​(A,B),

where real lll is embedded into the extended reals, so an empty first set has infimum +∞+\infty+∞. Then there exist an integer m>0m>0m>0 and positive semidefinite matrices M0,…,Mm−1M_0,\ldots,M_{m-1}M0​,…,Mm−1​ summing to the identity such that, writing 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​,

DaS(r,s)=DaP(M(r),M(s)),D_a^{\mathrm S}(r,s)=D_a^{\mathrm P}(\mathcal M(r),\mathcal M(s)),DaS​(r,s)=DaP​(M(r),M(s)),

and every integer k>0k>0k>0 and every positive semidefinite family N0,…,Nk−1N_0,\ldots,N_{k-1}N0​,…,Nk−1​ summing to the identity satisfy DaP(N(r),N(s))≤DaS(r,s)D_a^{\mathrm P}(\mathcal N(r),\mathcal N(s))\le D_a^{\mathrm S}(r,s)DaP​(N(r),N(s))≤DaS​(r,s). Moreover, every complex linear map EEE from III-indexed matrices to JJJ-indexed matrices that preserves positive semidefiniteness and preserves the complex trace of every matrix satisfies DaS(Er,Es)≤DaS(r,s)D_a^{\mathrm S}(Er,Es)\le D_a^{\mathrm S}(r,s)DaS​(Er,Es)≤DaS​(r,s). Finally, for every b∈[0,∞]b\in[0,\infty]b∈[0,∞] with b≥12b\ge\tfrac12b≥21​, every such complex linear trace-preserving map EEE satisfies DbS(Er,Es)≤DbS(r,s)D_b^{\mathrm S}(Er,Es)\le D_b^{\mathrm S}(r,s)DbS​(Er,Es)≤DbS​(r,s), provided that for every natural number nnn, including 000, the map defined entrywise by

(E[n]R)y,y′=∑x,x′: {0,…,n−1}→IRx,x′∏i<n(E(exi,xi′))yi,yi′(E^{[n]}R)_{y,y'} =\sum_{x,x':\,\{0,\ldots,n-1\}\to I} R_{x,x'}\prod_{i<n}\bigl(E(e_{x_i,x_i'})\bigr)_{y_i,y_i'}(E[n]R)y,y′​=x,x′:{0,…,n−1}→I∑​Rx,x′​i<n∏​(E(exi​,xi′​​))yi​,yi′​​

preserves positive semidefiniteness; here eu,ve_{u,v}eu,v​ is the matrix unit, y,y′y,y'y,y′ range over functions into JJJ, and the empty product for n=0n=0n=0 is 111.

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