Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.2, p. 10 — lim_{α→1} H_α(A)_ρ = H(A)_ρ

Proved
IntuitiveDPI.Smooth.lemma_B_2

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrenyi-entropyvon-neumann-entropy

Let ρ\rhoρ be a density matrix on HA\mathcal H_AHA​. The Rényi entropies Hα(A)ρ=11−αlog⁡Tr⁡ραH_\alpha(A)_\rho=\frac{1}{1-\alpha}\log\operatorname{Tr}\rho^\alphaHα​(A)ρ​=1−α1​logTrρα converge to the von Neumann entropy H(A)ρ=−Tr⁡ρlog⁡ρH(A)_\rho=-\operatorname{Tr}\rho\log\rhoH(A)ρ​=−Trρlogρ as α→1\alpha\to1α→1:

lim⁡α→1Hα(A)ρ=H(A)ρ.\lim_{\alpha\to1}H_\alpha(A)_\rho=H(A)_\rho.α→1lim​Hα​(A)ρ​=H(A)ρ​.

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 α≠1\alpha\ne1α=1 (the punctured neighbourhood 𝓝[≠] 1), so the value of renyiEntropy (of Dependency50.P35) at α=1\alpha=1α=1 plays no role. H(A)ρH(A)_\rhoH(A)ρ​ 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
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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