Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Assemblage relative entropy does not increase on average

Open
QAlgorithms.Papers.Independent.Intakethird100.P36.assemblageEntropy_averageMonotonicity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be normalized finite-dimensional no-signaling assemblages with identical alphabets and Bob space, and let {Mw}\{M_w\}{Mw​} be the same complete Bob-to-Alice 1W-LOCC instrument applied to both. Write pw=Tr⁡Mw(ρ)p_w=\operatorname{Tr}M_w(\rho)pw​=TrMw​(ρ) and qw=Tr⁡Mw(σ)q_w=\operatorname{Tr}M_w(\sigma)qw​=TrMw​(σ). For the assemblage relative entropy SAS_ASA​ of (18),

∑wpwSA ⁣(Mw(ρ)pw ∥ Mw(σ)qw)≤SA(ρ∥σ).\sum_wp_w S_A\!\left(\frac{M_w(\rho)}{p_w}\,\middle\|\,\frac{M_w(\sigma)}{q_w}\right) \le S_A(\rho\|\sigma).w∑​pw​SA​(pw​Mw​(ρ)​​qw​Mw​(σ)​)≤SA​(ρ∥σ).

A summand is zero for pw=0p_w=0pw​=0, and is +∞+\infty+∞ for pw>0=qwp_w>0=q_wpw​>0=qw​. The quantities are extended nonnegative reals, and no support-inclusion assumption is imposed. This conditional average contraction is the distinguishability result used to obtain steering monotonicity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P36
Formal statement
noncomputable section

open scoped BigOperators ENNReal ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P36

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

attribute [local instance] Classical.propDecidable

variable {d r s df rf sf m : ℕ}

/-- Appendix C, Lemma 1, PDF p.11, (C1); proof pp.16–18. The two denominators
and the averaging law are kept distinct, with homogeneous zero-assemblageMass handling. -/
theorem assemblageEntropy_averageMonotonicity (P : SteeringProtocol d r s df rf sf m)
    (hcomplete : P.Complete) (rho sigma : AssemblageBlocks d r s)
    (hrho : IsNormalized rho) (hsigma : IsNormalized sigma) :
    ∑ w, entropyBranch P rho sigma w ≤ assemblageEntropy rho sigma := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P36

end
Source
The resource theory of steering, arXiv:1409.5804v3, PDF p. 11, Appendix C, Lemma 1, (C1)
Read-back

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

Let d,r,s,df,rf,sf,md,r,s,d_f,r_f,s_f,md,r,s,df​,rf​,sf​,m be natural numbers, and let PPP be a protocol whose six dimensions d,r,s,df,rf,sfd,r,s,d_f,r_f,s_fd,r,s,df​,rf​,sf​ are positive. It supplies matrices Kw:Cd→CdfK_w:\mathbb C^d\to\mathbb C^{d_f}Kw​:Cd→Cdf​, w<mw<mw<m, with I−∑wKw†KwI-\sum_wK_w^\dagger K_wI−∑w​Kw†​Kw​ positive semidefinite, probability vectors iw,xf,xi_{w,x_f,x}iw,xf​,x​ over x<sx<sx<s, and probability vectors ow,af,a,x,xfo_{w,a_f,a,x,x_f}ow,af​,a,x,xf​​ over af<rfa_f<r_faf​<rf​. Assume also that it is complete, ∑wKw†Kw=I\sum_wK_w^\dagger K_w=I∑w​Kw†​Kw​=I. Let ρ,σ\rho,\sigmaρ,σ be normalized input assemblages: their blocks are positive semidefinite, their sums over outcomes are independent of the setting, and each has mass one, where for a family AAA of dimensions D,R,SD,R,SD,R,S one sets TA=S−1∑x<S,a<RAa∣xT_A=S^{-1}\sum_{x<S,a<R}A_{a|x}TA​=S−1∑x<S,a<R​Aa∣x​ and MA=Re⁡tr⁡TAM_A=\operatorname{Re}\operatorname{tr}T_AMA​=RetrTA​; an assemblage additionally requires positive dimensions and 0≤MA≤10\le M_A\le10≤MA​≤1. To specify the entropy used in the conclusion, define D(A∥B)∈[0,∞]\mathcal D(A\Vert B)\in[0,\infty]D(A∥B)∈[0,∞] to be infinity unless both matrices are positive semidefinite with trace one and ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA; otherwise it is the nonnegative part of Re⁡tr⁡(f(A)−Alog⁡B)\operatorname{Re}\operatorname{tr}(f(A)-A\log B)Retr(f(A)−AlogB), with f(t)=tlog⁡tf(t)=t\log tf(t)=tlogt, using matrix functional calculus and the convention log⁡0=0\log0=0log0=0. For probability-sized real vectors p,qp,qp,q, define Dcl(p∥q)=D(diag⁡p∥diag⁡q)\mathcal D_{\mathrm{cl}}(p\Vert q)=\mathcal D(\operatorname{diag}p\Vert\operatorname{diag}q)Dcl​(p∥q)=D(diagp∥diagq), using this same definition even if the vectors fail to define density matrices. An entropy strategy on dimensions D,SD,SD,S consists of a natural number hhh, square matrices LgL_gLg​ with ∑g<hLg†Lg=I\sum_{g<h}L_g^\dagger L_g=I∑g<h​Lg†​Lg​=I, and nonnegative numbers ug,xu_{g,x}ug,x​ with ∑x<Sug,x=1\sum_{x<S}u_{g,x}=1∑x<S​ug,x​=1. For a family AAA, put pgA=Re⁡tr⁡(LgTALg†)p_g^A=\operatorname{Re}\operatorname{tr}(L_gT_AL_g^\dagger)pgA​=Retr(Lg​TA​Lg†​) and let Fg,xAF^A_{g,x}Fg,xA​ be the block diagonal matrix whose outcome block aaa is LgAa∣xLg†L_gA_{a|x}L_g^\daggerLg​Aa∣x​Lg†​. Define C(p,q;A,B)C(p,q;A,B)C(p,q;A,B) to be p D(A/p∥B/q)p\,\mathcal D(A/p\Vert B/q)pD(A/p∥B/q) if p>0,q>0p>0,q>0p>0,q>0, infinity if p>0,q≤0p>0,q\le0p>0,q≤0, and zero if p≤0p\le0p≤0, where nonnegative real factors are embedded into [0,∞][0,\infty][0,∞]. Define

E(A,B)=sup⁡(h,L,u)[Dcl(pA∥pB)+∑g<h∑x<Sug,x C(pgA,pgB;Fg,xA,Fg,xB)].\mathcal E(A,B)= \sup_{(h,L,u)} \left[ \mathcal D_{\mathrm{cl}}(p^A\Vert p^B) +\sum_{g<h}\sum_{x<S}u_{g,x}\, C(p_g^A,p_g^B;F^A_{g,x},F^B_{g,x}) \right].E(A,B)=(h,L,u)sup​​Dcl​(pA∥pB)+g<h∑​x<S∑​ug,x​C(pgA​,pgB​;Fg,xA​,Fg,xB​)​.

For each protocol branch put Bw(A)af∣xf=∑x,aiw,xf,xow,af,a,x,xfKwAa∣xKw†B_w(A)_{a_f|x_f}=\sum_{x,a}i_{w,x_f,x}o_{w,a_f,a,x,x_f}K_wA_{a|x}K_w^\daggerBw​(A)af​∣xf​​=∑x,a​iw,xf​,x​ow,af​,a,x,xf​​Kw​Aa∣x​Kw†​, pw=Re⁡tr⁡(KwTρKw†)p_w=\operatorname{Re}\operatorname{tr}(K_wT_\rho K_w^\dagger)pw​=Retr(Kw​Tρ​Kw†​), and qw=Re⁡tr⁡(KwTσKw†)q_w=\operatorname{Re}\operatorname{tr}(K_wT_\sigma K_w^\dagger)qw​=Retr(Kw​Tσ​Kw†​), and normalize a branch family BBB as B/MBB/M_BB/MB​, using inverse zero equal to zero. The conclusion is

∑w<m{pw E ⁣(Bw(ρ)/MBw(ρ), Bw(σ)/MBw(σ)),pw>0, qw>0,∞,pw>0, qw≤0,0,pw≤0 ≤ E(ρ,σ).\sum_{w<m} \begin{cases} p_w\,\mathcal E\!\left(B_w(\rho)/M_{B_w(\rho)},\,B_w(\sigma)/M_{B_w(\sigma)}\right), & p_w>0,\ q_w>0,\\ \infty,&p_w>0,\ q_w\le0,\\ 0,&p_w\le0 \end{cases} \ \le\ \mathcal E(\rho,\sigma).w<m∑​⎩⎨⎧​pw​E(Bw​(ρ)/MBw​(ρ)​,Bw​(σ)/MBw​(σ)​),∞,0,​pw​>0, qw​>0,pw​>0, qw​≤0,pw​≤0​ ≤ E(ρ,σ).

All sums, suprema, and inequalities involving E\mathcal EE are in the extended nonnegative reals, with 0⋅∞=00\cdot\infty=00⋅∞=0; no finiteness assumption is imposed on either entropy.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me