Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity of the log quasi-entropy moment

Proved
QAlgorithms.Papers.Independent.Advance50.P07.psi_convex

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ,σ≥0\rho,\sigma\ge0ρ,σ≥0 and 0≤P≤10\le P\le10≤P≤1 act on a nonzero finite-dimensional Hilbert space. Assume the trace below is strictly positive for every α>0\alpha>0α>0, as in the preceding paragraph of VI.B.2. With spectral powers supported on the operators' supports, define

ψαP(ρ∥σ)=log⁡2Tr⁡(PραPσ1−α).\psi_\alpha^P(\rho\Vert\sigma)=\log_2\operatorname{Tr}(\sqrt P\rho^\alpha\sqrt P\sigma^{1-\alpha}).ψαP​(ρ∥σ)=log2​Tr(P​ραP​σ1−α).

The real-valued function α↦ψαP(ρ∥σ)\alpha\mapsto\psi_\alpha^P(\rho\Vert\sigma)α↦ψαP​(ρ∥σ) is convex on (0,∞)(0,\infty)(0,∞). No trace normalization is required. This supplies the convex log-moment object used in the paper's entropy analysis.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P07
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Topology

open Filter

namespace QAlgorithms.Papers.Independent.Advance50.P07

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P09 (relativeD petzD)

open QAlgorithms.Papers.Independent.Dependency50.P35 (maxRelative Density elog)

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Dependency50.P19 (marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Support50.P21 (PositiveTensorBasis)

/-- Lemma 8, PDF pp.6–7. The preceding paragraph's nonorthogonality
assumption is strict positivity of every moment on alpha>0. -/
theorem psi_convex {I : Type} [Fintype I] [DecidableEq I] [Nonempty I]
    (rho sigma P : Mat I) (hrho : rho.PosSemidef) (hsigma : sigma.PosSemidef)
    (hP : IsEffect P) (hfinite : ∀ alpha : ℝ, 0 < alpha → 0 < quasiMoment rho sigma P alpha) :
    ConvexOn ℝ (Set.Ioi (0 : ℝ)) (quasiLogMoment rho sigma P) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P07

end
Source
The quantum capacity of channels with arbitrarily correlated noise, arXiv:0902.0158v5, PDF p. 6, Lemma 8, convexity of the log quasi-entropy moment
Read-back

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

Let III be any finite, nonempty type with decidable equality, and let ρ,σ,P\rho,\sigma,Pρ,σ,P be complex matrices indexed by III. Assume that ρ\rhoρ and σ\sigmaσ are positive semidefinite and that both PPP and 1−P1-P1−P are positive semidefinite. For a Hermitian matrix XXX, write X[t]X^{[t]}X[t] for the matrix obtained by spectral functional calculus from the function that is 000 at the eigenvalue 000 and is xtx^txt at every nonzero eigenvalue xxx; in particular, X[0]X^{[0]}X[0] is its support projection, including when XXX is singular. Define

Qα=Re⁡Tr⁡(P ρ[α]P σ[1−α]).Q_\alpha=\operatorname{Re}\operatorname{Tr} \bigl(\sqrt P\,\rho^{[\alpha]}\sqrt P\,\sigma^{[1-\alpha]}\bigr).Qα​=ReTr(P​ρ[α]P​σ[1−α]).

Assume Qα>0Q_\alpha>0Qα​>0 for every real α>0\alpha>0α>0. Then α↦log⁡2Qα\alpha\mapsto\log_2 Q_\alphaα↦log2​Qα​ is convex on (0,∞)(0,\infty)(0,∞): for all α,β>0\alpha,\beta>0α,β>0 and all real u,v≥0u,v\ge0u,v≥0 with u+v=1u+v=1u+v=1,

log⁡2Quα+vβ≤ulog⁡2Qα+vlog⁡2Qβ.\log_2 Q_{u\alpha+v\beta} \le u\log_2 Q_\alpha+v\log_2 Q_\beta.log2​Quα+vβ​≤ulog2​Qα​+vlog2​Qβ​.

There is no trace normalization assumption on ρ\rhoρ or σ\sigmaσ; the strict positivity hypothesis excludes any choice for which one of these moments vanishes.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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