Lemma B.2, p. 10 — lim_{α→1} H_α(A)_ρ = H(A)_ρ
ProvedIntuitiveDPI.Smooth.lemma_B_2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrenyi-entropyvon-neumann-entropy
Let be a density matrix on . The Rényi entropies converge to the von Neumann entropy as :
The limit is taken from above in the proof of Lemma 5.4 and from below for Lemma 5.5.
Formalization Note The limit is two-sided and over (the punctured neighbourhood 𝓝[≠] 1), so the value of renyiEntropy (of Dependency50.P35) at plays no role. is QAlgorithms.vnEntropy, in bits.
Preamble
import Mathlib import Definitions.Def_IntuitiveDPI_Smooth_Basic open QAlgorithms QAlgorithms.Papers.Independent.Information100.P67 open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAB renyiEntropy) open scoped ComplexOrder Matrix open Filter Topology
Formal statement
namespace IntuitiveDPI.Smooth
/-- Lemma B.2, (B.5), p. 10: `lim_{α→1} H_α(A)_ρ = H(A)_ρ` for a density matrix `ρ`. -/
theorem lemma_B_2 {A : Type} [Fintype A] [DecidableEq A]
(ρ : Matrix A A ℂ) (hρ : IsDensityMatrix ρ) :
Tendsto (fun α : ℝ => renyiEntropy α ρ) (𝓝[≠] 1) (𝓝 (vnEntropy ρ)) := by sorry
end IntuitiveDPI.Smooth
Source
Beaudry & Renner, An intuitive proof of the data processing inequality, arXiv:1107.0740v2, p. 10, Lemma B.2, (B.5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.