Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

5.9

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_up_additive

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.

For independent normalized bipartite states, Htilde_α↑(AAprime|BBprime) is the sum of the two conditional entropies for 1/2≤α<∞, with the actual regrouped tensor product.

H~α↑(AA′∣BB′)ρ⊗τ=H~α↑(A∣B)ρ+H~α↑(A′∣B′)τ.\widetilde H_\alpha^\uparrow(AA^\prime|BB^\prime)_{\rho\otimes\tau}=\widetilde H_\alpha^\uparrow(A|B)_\rho+\widetilde H_\alpha^\uparrow(A^\prime|B^\prime)_\tau.Hα↑​(AA′∣BB′)ρ⊗τ​=Hα↑​(A∣B)ρ​+Hα↑​(A′∣B′)τ​.

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#5.9
5.9, arXiv:1504.00233v5, PDF p.84. -/
theorem sandwiched_up_additive [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
    (r : paperMat (A × B)) (s : paperMat (C × D)) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
    (a : ENNReal) (ha : 1/2 ≤ a) (hfin : a < ⊤) :
    conditionalUp true a (paperIndependentProduct r s) = conditionalUp true a r+conditionalUp true a s := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 84, 5.9
Read-back

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

Let A,B,C,DA,B,C,DA,B,C,D be finite, nonempty index types with decidable equality, let rrr and sss be positive semidefinite complex matrices on A×BA\times BA×B and C×DC\times DC×D, respectively, each with trace 111, and let α\alphaα be an extended nonnegative real number satisfying 12≤α<+∞\tfrac12\le\alpha<+\infty21​≤α<+∞. For positive semidefinite X,YX,YX,Y, let M[p]M^{[p]}M[p] denote functional calculus of xpx^pxp off zero with value zero at zero, including for zero or negative exponents, let L(M)L(M)L(M) be functional calculus of the total real log⁡2\log_2log2​ with value zero at zero, and define D(X∥Y)=Re⁡tr⁡(X(L(X)−L(Y)))/Re⁡tr⁡XD(X\|Y)=\operatorname{Re}\operatorname{tr}(X(L(X)-L(Y)))/\operatorname{Re}\operatorname{tr}XD(X∥Y)=Retr(X(L(X)−L(Y)))/RetrX if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise. For the finite real value ttt of α\alphaα, put

Qt(X,Y)=Re⁡tr⁡[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].Q_t(X,Y)=\operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-t)/(2t)]}XY^{[(1-t)/(2t)]}\right)^{[t]}\right].Qt​(X,Y)=Retr[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].

Define D1(X∥Y)=D(X∥Y)\mathcal D_1(X\|Y)=D(X\|Y)D1​(X∥Y)=D(X∥Y); when t≠1t\ne1t=1, define Dt(X∥Y)=(t−1)−1L(Qt(X,Y)/Re⁡tr⁡X)\mathcal D_t(X\|Y)=(t-1)^{-1}\mathcal L(Q_t(X,Y)/\operatorname{Re}\operatorname{tr}X)Dt​(X∥Y)=(t−1)−1L(Qt​(X,Y)/RetrX) if (t<1 and Qt(X,Y)>0)(t<1\ \text{and}\ Q_t(X,Y)>0)(t<1 and Qt​(X,Y)>0) or ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise, where L(0)=−∞\mathcal L(0)=-\inftyL(0)=−∞ and L(x)=log⁡2x\mathcal L(x)=\log_2 xL(x)=log2​x otherwise. For a matrix zzz on H×KH\times KH×K, define Hα↑(z)=sup⁡τ≥0, tr⁡τ=1[−Dt(z∥1H⊗τ)]H_\alpha^\uparrow(z)=\sup_{\tau\ge0,\ \operatorname{tr}\tau=1}[-\mathcal D_t(z\|1_H\otimes\tau)]Hα↑​(z)=supτ≥0, trτ=1​[−Dt​(z∥1H​⊗τ)], with τ\tauτ indexed by KKK and the supremum taken in the extended reals. Define r⊠sr\boxtimes sr⊠s, indexed by (A×C)×(B×D)(A\times C)\times(B\times D)(A×C)×(B×D), by

(r⊠s)((i,k),(j,l)),((i′,k′),(j′,l′))=r(i,j),(i′,j′) s(k,l),(k′,l′).(r\boxtimes s)_{((i,k),(j,l)),((i',k'),(j',l'))} =r_{(i,j),(i',j')}\,s_{(k,l),(k',l')}.(r⊠s)((i,k),(j,l)),((i′,k′),(j′,l′))​=r(i,j),(i′,j′)​s(k,l),(k′,l′)​.

Then

Hα↑(r⊠s)=Hα↑(r)+Hα↑(s)H_\alpha^\uparrow(r\boxtimes s) = H_\alpha^\uparrow(r)+H_\alpha^\uparrow(s)Hα↑​(r⊠s)=Hα↑​(r)+Hα↑​(s)

as an equality in the extended reals. The combined quantity uses a supremum over all density matrices on B×DB\times DB×D; the hypotheses include α=12\alpha=\tfrac12α=21​ and α=1\alpha=1α=1, and exclude infinite order.

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