Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Joint convexity of assemblage relative entropy

Open
QAlgorithms.Papers.Independent.Intakethird100.P36.assemblageEntropy_jointConvexity

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

prove2quantum

Let n>0n>0n>0, and let {ρj}j=1n\{\rho_j\}_{j=1}^n{ρj​}j=1n​ and {σj}j=1n\{\sigma_j\}_{j=1}^n{σj​}j=1n​ be normalized no-signaling assemblages with the same finite dimensions and alphabets. For positive real weights μj\mu_jμj​ satisfying ∑jμj=1\sum_j\mu_j=1∑j​μj​=1, the relative entropy SAS_ASA​ defined in (18) obeys

SA ⁣(∑jμjρj ∥ ∑jμjσj)≤∑jμjSA(ρj∥σj).S_A\!\left(\sum_j\mu_j\rho_j\,\middle\|\,\sum_j\mu_j\sigma_j\right) \le\sum_j\mu_jS_A(\rho_j\|\sigma_j).SA​(j∑​μj​ρj​​j∑​μj​σj​)≤j∑​μj​SA​(ρj​∥σj​).

Both mixtures use exactly the same weights and finite index family. Divergences may be infinite. This is joint convexity of the source’s adaptive-instrument assemblage divergence, used in proving convexity of the relative entropy of steering.

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 2, PDF p.11, (C2); proof pp.18–19. Positive weights on a
single nonempty finite family sum to one and mix both arguments identically. -/
theorem assemblageEntropy_jointConvexity {n : ℕ} (hn : 0 < n)
    (p : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hsum : ∑ j, p j = 1)
    (rho sigma : Fin n → AssemblageBlocks d r s)
    (hrho : ∀ j, IsNormalized (rho j)) (hsigma : ∀ j, IsNormalized (sigma j)) :
    assemblageEntropy (assemblageFamilyMixture p rho) (assemblageFamilyMixture p sigma) ≤
      ∑ j, ENNReal.ofReal (p j) * assemblageEntropy (rho j) (sigma j) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P36

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

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

Let d,r,sd,r,sd,r,s be natural numbers, let n>0n>0n>0 be a natural number, and let p0,…,pn−1p_0,\ldots,p_{n-1}p0​,…,pn−1​ be strictly positive real numbers with ∑j<npj=1\sum_{j<n}p_j=1∑j<n​pj​=1. For each j<nj<nj<n, let ρj,σj\rho^j,\sigma^jρj,σj be normalized families of complex d×dd\times dd×d matrices indexed by a<r,x<sa<r,x<sa<r,x<s: this means d,r,s>0d,r,s>0d,r,s>0, every block is positive semidefinite, the sum over aaa is independent of xxx, and the mass is one, where TA=s−1∑x,aAa∣xT_A=s^{-1}\sum_{x,a}A_{a|x}TA​=s−1∑x,a​Aa∣x​ and MA=Re⁡tr⁡TAM_A=\operatorname{Re}\operatorname{tr}T_AMA​=RetrTA​; the underlying assemblage condition also requires 0≤MA≤10\le M_A\le10≤MA​≤1. Define the mixtures blockwise by ρˉa∣x=∑j<npjρa∣xj\bar\rho_{a|x}=\sum_{j<n}p_j\rho^j_{a|x}ρˉ​a∣x​=∑j<n​pj​ρa∣xj​ and σˉa∣x=∑j<npjσa∣xj\bar\sigma_{a|x}=\sum_{j<n}p_j\sigma^j_{a|x}σˉa∣x​=∑j<n​pj​σa∣xj​. The entropy E(A,B)\mathcal E(A,B)E(A,B) used here is defined as follows. For square matrices X,YX,YX,Y of the same finite size, let D(X∥Y)=∞\mathcal D(X\Vert Y)=\inftyD(X∥Y)=∞ unless X,YX,YX,Y are both positive semidefinite with trace one and ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX; when those conditions hold, let it be the nonnegative part of Re⁡tr⁡(f(X)−Xlog⁡Y)\operatorname{Re}\operatorname{tr}(f(X)-X\log Y)Retr(f(X)−XlogY), where f(t)=tlog⁡tf(t)=t\log tf(t)=tlogt, matrix functions use functional calculus, and log⁡0=0\log0=0log0=0. Write Dcl(v∥w)=D(diag⁡v∥diag⁡w)\mathcal D_{\mathrm{cl}}(v\Vert w)=\mathcal D(\operatorname{diag}v\Vert\operatorname{diag}w)Dcl​(v∥w)=D(diagv∥diagw). For every entropy strategy consisting of a natural number hhh, matrices Lg∈Cd×dL_g\in\mathbb C^{d\times d}Lg​∈Cd×d 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, put vg=Re⁡tr⁡(LgTALg†)v_g=\operatorname{Re}\operatorname{tr}(L_gT_AL_g^\dagger)vg​=Retr(Lg​TA​Lg†​), wg=Re⁡tr⁡(LgTBLg†)w_g=\operatorname{Re}\operatorname{tr}(L_gT_BL_g^\dagger)wg​=Retr(Lg​TB​Lg†​), and let Fg,xA,Fg,xBF^A_{g,x},F^B_{g,x}Fg,xA​,Fg,xB​ be block diagonal matrices with respective outcome blocks LgAa∣xLg†L_gA_{a|x}L_g^\daggerLg​Aa∣x​Lg†​ and LgBa∣xLg†L_gB_{a|x}L_g^\daggerLg​Ba∣x​Lg†​. Put Cg,x=vgD(Fg,xA/vg∥Fg,xB/wg)C_{g,x}=v_g\mathcal D(F^A_{g,x}/v_g\Vert F^B_{g,x}/w_g)Cg,x​=vg​D(Fg,xA​/vg​∥Fg,xB​/wg​) when vg>0,wg>0v_g>0,w_g>0vg​>0,wg​>0, put Cg,x=∞C_{g,x}=\inftyCg,x​=∞ when vg>0,wg≤0v_g>0,w_g\le0vg​>0,wg​≤0, and put Cg,x=0C_{g,x}=0Cg,x​=0 when vg≤0v_g\le0vg​≤0. Then E(A,B)\mathcal E(A,B)E(A,B) is the supremum, over all such finite strategies, of Dcl(v∥w)+∑g<h,x<sug,xCg,x\mathcal D_{\mathrm{cl}}(v\Vert w)+\sum_{g<h,x<s}u_{g,x}C_{g,x}Dcl​(v∥w)+∑g<h,x<s​ug,x​Cg,x​. The declaration asserts

E(ρˉ,σˉ) ≤ ∑j<npj E(ρj,σj).\mathcal E(\bar\rho,\bar\sigma) \ \le\ \sum_{j<n}p_j\,\mathcal E(\rho^j,\sigma^j).E(ρˉ​,σˉ) ≤ j<n∑​pj​E(ρj,σj).

The inequality is in the extended nonnegative reals, real nonnegative weights are embedded into that space, and 0⋅∞=00\cdot\infty=00⋅∞=0; the entropies need not be finite. The hypotheses exclude both an empty mixture and zero mixture weights.

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