p. 4 — S₂(ρ) ≤ Sₚ(ρ) ≤ S(ρ) for 1 ≤ p ≤ 2
ProvedWHAdditivity.Renyi.renyi_order_boundsdensity-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renyi-entropyvon-neumann-entropy
Let be a density matrix (positive semidefinite, trace one) on a finite-dimensional complex Hilbert space, and let . With for , and the von Neumann entropy (natural logarithm),
This is the inequality relating the -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 becomes a lower bound on every , .
Formalization Note. The space is indexed by an arbitrary finite type . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.