Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered: Definition 25 convergence at alpha=1

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.difference_limit_one

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

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.

Let ρ,σ\rho,\sigmaρ,σ be positive definite density operators and N\mathcal NN a strict CPTP map. Let Δα\Delta_\alphaΔα​ and Δ~α\widetilde\Delta_\alphaΔα​ be the actual trace formulas (6.12) and the well-typed Schatten formula (6.13)/(6.18). Then

lim⁡α→1, α≠1Δα(ρ,σ,N)=lim⁡α→1, α≠1Δ~α(ρ,σ,N)=D(ρ∥σ)−D(N(ρ)∥N(σ)).\lim_{\alpha\to1,\,\alpha\ne1}\Delta_\alpha(\rho,\sigma,\mathcal N)=\lim_{\alpha\to1,\,\alpha\ne1}\widetilde\Delta_\alpha(\rho,\sigma,\mathcal N)=D(\rho\|\sigma)-D(\mathcal N(\rho)\|\mathcal N(\sigma)).α→1,α=1lim​Δα​(ρ,σ,N)=α→1,α=1lim​Δα​(ρ,σ,N)=D(ρ∥σ)−D(N(ρ)∥N(σ)).

The punctured positive-order limit is two-sided near one and assumes no parameter-monotonicity conjecture. It fixes the continuous endpoint of both generalizations.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
Formal statement
noncomputable section

open Filter Topology

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P56

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)

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

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)

open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)

variable {A B C D E X : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]

variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]

open scoped Matrix.Norms.L2Operator

/-- arXiv:1410.1443v3, PDF p.25: both Definition 25 functionals converge
at one; this assertion is unconditional and is not Conjecture 26. -/
theorem difference_limit_one (rho sigma : Op A) (N : Superop A B)
    (hrho : IsDensityMatrix rho) (hprho : rho.PosDef)
    (hsigma : IsDensityMatrix sigma) (hpsigma : sigma.PosDef) (hN : StrictChannel N) :
    Tendsto (fun a : ℝ => differencePetz a rho sigma N)
      (nhdsWithin 1 {a : ℝ | 0 < a ∧ a ≠ 1}) (nhds (relativeEntropyDifference rho sigma N)) ∧
    Tendsto (fun a : ℝ => differenceSandwiched a rho sigma N)
      (nhdsWithin 1 {a : ℝ | 0 < a ∧ a ≠ 1}) (nhds (relativeEntropyDifference rho sigma N)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 25, Unnumbered: Definition 25 convergence at alpha=1
Read-back

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

Let A,BA,BA,B be finite index types with decidable equality, and let ρ,σ\rho,\sigmaρ,σ be positive definite complex matrices on AAA, each positive semidefinite with trace 111. Let NNN map matrices on AAA to matrices on BBB, admit a finite representation N(X)=∑jKjXKj†N(X)=\sum_jK_jXK_j^\daggerN(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=IA\sum_jK_j^\dagger K_j=I_A∑j​Kj†​Kj​=IA​, and satisfy the additional condition that (id{0,…,r−1}⊗N)(Z)(\mathrm{id}_{\{0,\ldots,r-1\}}\otimes N)(Z)(id{0,…,r−1}​⊗N)(Z) is positive definite for every natural number rrr and every positive definite matrix ZZZ on {0,…,r−1}×A\{0,\ldots,r-1\}\times A{0,…,r−1}×A. Define

N∗(Y)ij=∑k,lN(Eij)kl‾Ykl,d=Re⁡tr⁡ ⁣(ρ(log⁡ρ−log⁡σ))−Re⁡tr⁡ ⁣(N(ρ)(log⁡N(ρ)−log⁡N(σ))),N^*(Y)_{ij}=\sum_{k,l}\overline{N(E_{ij})_{kl}}Y_{kl}, \qquad d=\operatorname{Re}\operatorname{tr}\!\bigl(\rho(\log\rho-\log\sigma)\bigr) -\operatorname{Re}\operatorname{tr}\!\bigl(N(\rho)(\log N(\rho)-\log N(\sigma))\bigr),N∗(Y)ij​=k,l∑​N(Eij​)kl​​Ykl​,d=Retr(ρ(logρ−logσ))−Retr(N(ρ)(logN(ρ)−logN(σ))),

where EijE_{ij}Eij​ is the matrix unit. Write Z[t]Z^{[t]}Z[t] for continuous functional calculus with scalar value 000 at zero and utu^tut otherwise. Set D1=D~1=dD_1=\widetilde D_1=dD1​=D1​=d, and, for t≠1t\ne1t=1, set

Dt=1t−1log⁡Re⁡tr⁡(ρ[t]StN∗ ⁣(TtN(ρ)[1−t]Tt)St),St=σ[(1−t)/2],Tt=N(σ)[(t−1)/2],D~t=1t−1log⁡Re⁡tr⁡[(ρ[1/2]S~tN∗ ⁣(T~tN(ρ)[(1−t)/t]T~t)S~tρ[1/2])[t]],S~t=σ[(1−t)/(2t)],T~t=N(σ)[(t−1)/(2t)].\begin{aligned} D_t&=\frac{1}{t-1}\log\operatorname{Re}\operatorname{tr} \left(\rho^{[t]}S_tN^*\!\left(T_tN(\rho)^{[1-t]}T_t\right)S_t\right), & S_t&=\sigma^{[(1-t)/2]},& T_t&=N(\sigma)^{[(t-1)/2]},\\ \widetilde D_t&=\frac{1}{t-1}\log\operatorname{Re}\operatorname{tr} \left[\left(\rho^{[1/2]}\widetilde S_t N^*\!\left(\widetilde T_tN(\rho)^{[(1-t)/t]}\widetilde T_t\right) \widetilde S_t\rho^{[1/2]}\right)^{[t]}\right], &\widetilde S_t&=\sigma^{[(1-t)/(2t)]},& \widetilde T_t&=N(\sigma)^{[(t-1)/(2t)]}. \end{aligned}Dt​Dt​​=t−11​logRetr(ρ[t]St​N∗(Tt​N(ρ)[1−t]Tt​)St​),=t−11​logRetr[(ρ[1/2]St​N∗(Tt​N(ρ)[(1−t)/t]Tt​)St​ρ[1/2])[t]],​St​St​​=σ[(1−t)/2],=σ[(1−t)/(2t)],​Tt​Tt​​=N(σ)[(t−1)/2],=N(σ)[(t−1)/(2t)].​

Then Dt→dD_t\to dDt​→d and D~t→d\widetilde D_t\to dDt​→d as t→1t\to1t→1 through positive real values different from 111; both sides of 111 are included in this limiting domain. All logarithms are natural.

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

    Confirmed by the moderator at approval.

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