Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered result: concavity of finite quantum conditional entropy

Open
QAlgorithms.Papers.Independent.Gap48.P45.finiteConditionalEntropy_concavity

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Let e={πi,ρi}e=\{\pi_i,\rho_i\}e={πi​,ρi​} be a finite or countable ensemble on HA⊗HBH_A\otimes H_BHA​⊗HB​, with average ρˉ\bar\rhoρˉ​ such that H(ρˉ)H(\bar\rho)H(ρˉ​) and H(Tr⁡HAρˉ)H(\operatorname{Tr}_{H_A}\bar\rho)H(TrHA​​ρˉ​) are finite. Put HA∣B(τ)=H(τ)−H(Tr⁡HAτ)H_{A|B}(\tau)=H(\tau)-H(\operatorname{Tr}_{H_A}\tau)HA∣B​(τ)=H(τ)−H(TrHA​​τ) on this finite-entropy domain. Then the weighted series is absolutely convergent and

∑iπiHA∣B(ρi)≤HA∣B(ρˉ).\sum_i\pi_iH_{A|B}(\rho_i)\le H_{A|B}(\bar\rho).i∑​πi​HA∣B​(ρi​)≤HA∣B​(ρˉ​).

No faithful-average or rank restriction is needed.

This result expresses partial-trace information monotonicity as conditional-entropy concavity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap48.P45

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)

open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)

open QAlgorithms.Papers.Independent.Frontier18.P18
  (operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
   IsParsevalFrame IsKrausRepresentation)

open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)

open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)

open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)

/-- PDF p.22 after (21): concavity on the finite joint/marginal entropy domain.
No faithful-average assumption; absolute summability is a conclusion. -/
theorem finiteConditionalEntropy_concavity
    {I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
    (e : DiscreteEnsemble (I × J))
    (hJoint : extendedEntropyNats (discreteAverageCoefficients e) < ⊤)
    (hMarginal : extendedEntropyNats (traceFirst (discreteAverageCoefficients e)) < ⊤) :
    Summable (fun i => e.weight i * separableConditionalEntropyNats (e.state i).coefficients) ∧
    (∑' i, e.weight i * separableConditionalEntropyNats (e.state i).coefficients) ≤
      separableConditionalEntropyNats (discreteAverageCoefficients e) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 22, Unnumbered result: concavity of finite quantum conditional entropy
Read-back

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

Let I,JI,JI,J be countable, nonempty types and HA=ℓ2(A;C)H_A=\ell^2(A;\mathbb C)HA​=ℓ2(A;C). A state on I×JI\times JI×J is a coefficient matrix admitting Xab=∑nun(a)vn(b)‾X_{ab}=\sum_nu_n(a)\overline{v_n(b)}Xab​=∑n​un​(a)vn​(b)​, with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, whose quadratic forms on every finite coordinate set are real and nonnegative and whose real diagonal is summable with sum 111. Let e=(wi,ρi)i≥0e=(w_i,\rho_i)_{i\ge0}e=(wi​,ρi​)i≥0​ be an ensemble of such states, with wi≥0w_i\ge0wi​≥0 and a convergent weight series of sum 111. For any coefficient matrix XXX, let B(X)B(X)B(X) be a chosen bounded operator with coordinate matrix XXX, or 000 if none exists, and write C(T)ab=(Teb)aC(T)_{ab}=(Te_b)_aC(T)ab​=(Teb​)a​. The average used in the declaration is

ρˉ=C ⁣(B ⁣((∑iwiC(B(ρi))ab)a,b)).\bar\rho=C\!\left(B\!\left( \left(\sum_iw_iC(B(\rho_i))_{ab}\right)_{a,b} \right)\right).ρˉ​=C​B​(i∑​wi​C(B(ρi​))ab​)a,b​​​.

For a matrix XXX on any relevant index type, define

H(X)=sup⁡s finite[(Re⁡tr⁡Xs)log⁡(Re⁡tr⁡Xs)−Re⁡tr⁡(Xslog⁡fcXs)]+,H(X)=\sup_{s\text{ finite}} \left[(\operatorname{Re}\operatorname{tr}X_s) \log(\operatorname{Re}\operatorname{tr}X_s) -\operatorname{Re}\operatorname{tr}(X_s\log_{\mathrm{fc}}X_s)\right]_+,H(X)=s finitesup​[(RetrXs​)log(RetrXs​)−Retr(Xs​logfc​Xs​)]+​,

where XsX_sXs​ is the finite coordinate compression, [a]+=max⁡(a,0)[a]_+=\max(a,0)[a]+​=max(a,0), and log⁡0=0\log0=0log0=0. Define the JJJ-marginal by

XJ(j,j′)=∑a∈IX(a,j),(a,j′),X_J(j,j')=\sum_{a\in I}X_{(a,j),(a,j')},XJ​(j,j′)=a∈I∑​X(a,j),(a,j′)​,

and put SI∣J(X)=H(X)♭−H(XJ)♭S_{I|J}(X)=H(X)^\flat-H(X_J)^\flatSI∣J​(X)=H(X)♭−H(XJ​)♭, where a♭a^\flata♭ is the ordinary real value when a<∞a<\inftya<∞ and is 000 when a=∞a=\inftya=∞. If H(ρˉ)<∞H(\bar\rho)<\inftyH(ρˉ​)<∞ and H(ρˉJ)<∞H(\bar\rho_J)<\inftyH(ρˉ​J​)<∞, then the real series ∑iwiSI∣J(ρi)\sum_iw_iS_{I|J}(\rho_i)∑i​wi​SI∣J​(ρi​) is summable and

∑iwiSI∣J(ρi)≤SI∣J(ρˉ).\sum_iw_iS_{I|J}(\rho_i)\le S_{I|J}(\bar\rho).i∑​wi​SI∣J​(ρi​)≤SI∣J​(ρˉ​).

The states at zero-weight indices are included, and the displayed definition of the conditional quantity remains total even when an individual entropy is infinite.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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