Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5): quantitative entropy concavity

Open
QAlgorithms.Papers.Independent.Gap48.P18.entropy_strong_concavity

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

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be density states on a nonzero separable complex Hilbert space and t∈[0,1]t\in[0,1]t∈[0,1]. Entropy is measured in nats and may be infinite. Then

H(tρ+(1−t)σ)≥tH(ρ)+(1−t)H(σ)+t(1−t)2∥ρ−σ∥12.H(t\rho+(1-t)\sigma)\ge tH(\rho)+(1-t)H(\sigma)+\frac{t(1-t)}2\|\rho-\sigma\|_1^2.H(tρ+(1−t)σ)≥tH(ρ)+(1−t)H(σ)+2t(1−t)​∥ρ−σ∥12​.

The endpoint products 0⋅∞0\cdot\infty0⋅∞ are zero. This is quantitative entropy concavity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState traceSize traceClosure IsTraceClassChannel productCoeff)

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

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

namespace QAlgorithms.Papers.Independent.Gap48.P18

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Equation (5): quantitative entropy concavity, arXiv:quant-ph/0510073v2, PDF pp.6.
 -/
theorem entropy_strong_concavity {I : Type} [Countable I] [Nonempty I]
    (rho sigma : State I) (t : ℝ) (ht0 : 0 ≤ t) (ht1 : t ≤ 1) :
    ENNReal.ofReal t * stateEntropyNats rho + ENNReal.ofReal (1 - t) * stateEntropyNats sigma +
        ENNReal.ofReal (t * (1 - t) / 2) * distanceSquared sigma rho ≤
      extendedEntropyNats ((t : ℂ) • rho.coefficients +
        ((1 - t : ℝ) : ℂ) • sigma.coefficients) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 6, Equation (5): quantitative entropy concavity
Read-back

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

For any countable, nonempty index type III, states ρ,σ\rho,\sigmaρ,σ with coefficient matrices R,SR,SR,S, and real ttt satisfying 0≤t≤10\le t\le10≤t≤1, one has

tH(R)+(1−t)H(S)+t(1−t)2 τ(S−R)2≤H(tR+(1−t)S)tH(R)+(1-t)H(S)+\frac{t(1-t)}2\,\tau(S-R)^2 \le H\bigl(tR+(1-t)S\bigr)tH(R)+(1−t)H(S)+2t(1−t)​τ(S−R)2≤H(tR+(1−t)S)

in [0,∞][0,\infty][0,∞]. Here a state matrix XXX admits an expansion Xij=∑nan(i)bn(j)‾X_{ij}=\sum_n a_n(i)\overline{b_n(j)}Xij​=∑n​an​(i)bn​(j)​ with an,bn∈ℓ2(I;C)a_n,b_n\in\ell^2(I;\mathbb C)an​,bn​∈ℓ2(I;C) and ∑n∥an∥∥bn∥<∞\sum_n\|a_n\|\|b_n\|<\infty∑n​∥an​∥∥bn​∥<∞, has real nonnegative quadratic forms on every finite coordinate subset, and has summable real diagonal entries totaling 111; τ(Y)\tau(Y)τ(Y) is the infimum of ∑n∥an∥∥bn∥\sum_n\|a_n\|\|b_n\|∑n​∥an​∥∥bn​∥ over those expansions of YYY, with empty infimum ∞\infty∞. For any complex matrix XXX, the entropy used in the inequality is exactly

H(X)=sup⁡s⊆I, s finitemax⁡ ⁣{Re⁡tr⁡(Xs) log⁡ ⁣(Re⁡tr⁡(Xs))−Re⁡tr⁡(Xslog⁡Xs), 0},H(X)= \sup_{s\subseteq I,\ s\text{ finite}} \max\!\left\{ \operatorname{Re}\operatorname{tr}(X_s)\, \log\!\bigl(\operatorname{Re}\operatorname{tr}(X_s)\bigr) - \operatorname{Re}\operatorname{tr}\bigl(X_s\log X_s\bigr),\,0 \right\},H(X)=s⊆I, s finitesup​max{Retr(Xs​)log(Retr(Xs​))−Retr(Xs​logXs​),0},

where Xs=X∣s×sX_s=X|_{s\times s}Xs​=X∣s×s​, and log⁡Xs\log X_slogXs​ is defined by continuous functional calculus using the total real logarithm with log⁡0=0\log0=0log0=0. The real coefficients in the inequality are embedded into [0,∞][0,\infty][0,∞] by taking their nonnegative parts; these equal the displayed coefficients under the hypotheses on ttt. The supremum includes the empty compression, which contributes 000. No entropy-finiteness hypothesis is required, the endpoints t=0,1t=0,1t=0,1 are included, and extended multiplication uses 0⋅∞=00\cdot\infty=00⋅∞=0.

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