Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 4 — S₂(ρ) ≤ Sₚ(ρ) ≤ S(ρ) for 1 ≤ p ≤ 2

Proved
WHAdditivity.Renyi.renyi_order_bounds

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

density-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renyi-entropyvon-neumann-entropy

Let ρ\rhoρ be a density matrix (positive semidefinite, trace one) on a finite-dimensional complex Hilbert space, and let 1≤p≤21\le p\le 21≤p≤2. With Sp(ρ)=−1p−1log⁡Tr⁡ρpS_p(\rho) = -\frac{1}{p-1}\log\operatorname{Tr}\rho^pSp​(ρ)=−p−11​logTrρp for p>1p>1p>1, S1=SS_1 = SS1​=S and S(ρ)=−Tr⁡ρlog⁡ρS(\rho) = -\operatorname{Tr}\rho\log\rhoS(ρ)=−Trρlogρ the von Neumann entropy (natural logarithm),

S2(ρ) ≤ Sp(ρ) ≤ S(ρ).S_2(\rho)\ \le\ S_p(\rho)\ \le\ S(\rho).S2​(ρ) ≤ Sp​(ρ) ≤ S(ρ).

This is the inequality relating the ppp-Rényi entropies, the 2-Rényi entropy and the von Neumann entropy that the paper takes from Rényi [5]; with it the bound (8) on the purity Tr⁡X2=e−S2(X)\operatorname{Tr}X^2 = e^{-S_2(X)}TrX2=e−S2​(X) becomes a lower bound on every SpS_pSp​, 1≤p≤21\le p\le21≤p≤2.

Formalization Note. The space is indexed by an arbitrary finite type ι\iotaι. Both entropies are defined by Mathlib's continuous functional calculus.

Differences from the source:

  • encoding: S_p for p > 1, extended to p = 1 by the limit → S_1 := S; reason: the limit's value is S, so at p = 1 the statement reads S_2 ≤ S ≤ S.
  • encoding: log unspecified → natural logarithm; reason: the inequality is invariant under the choice of base.
Preamble
import Mathlib
import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi

theorem renyi_order_bounds {ι : Type} [Fintype ι] [DecidableEq ι] (ρ : Matrix ι ι ℂ)
    (hρ : IsDensity ρ) (p : ℝ) (hp1 : 1 ≤ p) (hp2 : p ≤ 2) :
    renyiEntropy 2 ρ ≤ renyiEntropy p ρ ∧ renyiEntropy p ρ ≤ vonNeumannEntropy ρ := by sorry

end WHAdditivity.Renyi
Source
Alicki, Fannes, Note on multiple additivity of minimal Renyi entropy output of the Werner–Holevo channels, arXiv:quant-ph/0407033v2, p. 4, display after 'Finally, we use the inequality'
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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