Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Consequence 27

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.relative_entropy_recovery

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.

Assume Conjecture 26, namely parameter monotonicity of both actual relativeEntropyDifference functionals (6.12)–(6.13), including their value at one. Let ρ,σ\rho,\sigmaρ,σ be positive definite density operators and N\mathcal NN a strict CPTP map. Define T(Z)=σ1/2N†[N(σ)−1/2ZN(σ)−1/2]σ1/2\mathcal T(Z)=\sigma^{1/2}\mathcal N^\dagger[\mathcal N(\sigma)^{-1/2}Z\mathcal N(\sigma)^{-1/2}]\sigma^{1/2}T(Z)=σ1/2N†[N(σ)−1/2ZN(σ)−1/2]σ1/2. This map is CPTP and

D(ρ∥σ)−D(N(ρ)∥N(σ))≥−log⁡F(ρ,T(N(ρ))).D(\rho\|\sigma)-D(\mathcal N(\rho)\|\mathcal N(\sigma))\ge-\log F(\rho,\mathcal T(\mathcal N(\rho))).D(ρ∥σ)−D(N(ρ)∥N(σ))≥−logF(ρ,T(N(ρ))).

The relative entropy is Umegaki entropy in nats, and FFF is squared fidelity. This retains the normalization of the headline (6.24).

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.26, Consequence 27, (6.23)–(6.24).
Squared fidelity follows the headline; (6.26) drops a factor two by typo. -/
theorem relative_entropy_recovery (hconjecture : DifferenceParameterConjecture)
    (rho sigma : Op A) (N : Superop A B)
    (hrho : IsDensityMatrix rho) (hprho : rho.PosDef)
    (hsigma : IsDensityMatrix sigma) (hpsigma : sigma.PosDef) (hN : StrictChannel N) :
    IsChannel (petz sigma N) ∧
      -extendedLog (squaredFidelity rho (petz sigma N (N rho))) ≤ (relativeEntropyDifference rho sigma N : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 26, Consequence 27
Read-back

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

Assume the following global conjecture. For every pair of finite nonempty register types, every positive definite trace-one pair ρ,σ\rho,\sigmaρ,σ, and every channel NNN whose extension idr⊗N\mathrm{id}_r\otimes Nidr​⊗N sends positive definite matrices to positive definite matrices for every natural rrr, two functions Δu,Δ~u\Delta_u,\widetilde\Delta_uΔu​,Δu​ satisfy Δs≤Δt\Delta_s\le\Delta_tΔs​≤Δt​ and Δ~s≤Δ~t\widetilde\Delta_s\le\widetilde\Delta_tΔs​≤Δt​ whenever 0<s≤t0<s\le t0<s≤t. Their common value at u=1u=1u=1 is

d(ρ,σ;N)=Re⁡Tr⁡ρ(log⁡ρ−log⁡σ)−Re⁡Tr⁡Nρ(log⁡(Nρ)−log⁡(Nσ)).d(\rho,\sigma;N)= \operatorname{Re}\operatorname{Tr}\rho(\log\rho-\log\sigma) -\operatorname{Re}\operatorname{Tr}N\rho(\log(N\rho)-\log(N\sigma)).d(ρ,σ;N)=ReTrρ(logρ−logσ)−ReTrNρ(log(Nρ)−log(Nσ)).

For u≠1u\ne1u=1, their definitions are

Δu=log⁡Re⁡Tr⁡[Pu(ρ)S N∗(TP1−u(Nρ)T)S]u−1,S=P(1−u)/2(σ),T=P(u−1)/2(Nσ),\Delta_u= \frac{\log\operatorname{Re}\operatorname{Tr} \left[P_u(\rho)S\,N^*(T P_{1-u}(N\rho)T)S\right]}{u-1}, \quad S=P_{(1-u)/2}(\sigma),\quad T=P_{(u-1)/2}(N\sigma),Δu​=u−1logReTr[Pu​(ρ)SN∗(TP1−u​(Nρ)T)S]​,S=P(1−u)/2​(σ),T=P(u−1)/2​(Nσ), Δ~u=log⁡Re⁡Tr⁡Pu ⁣[RS′ N∗(T′P(1−u)/u(Nρ)T′)S′R]u−1,R=P1/2(ρ),S′=P(1−u)/(2u)(σ),T′=P(u−1)/(2u)(Nσ).\widetilde\Delta_u= \frac{\log\operatorname{Re}\operatorname{Tr} P_u\!\left[R S'\,N^*(T'P_{(1-u)/u}(N\rho)T')S'R\right]}{u-1}, \quad R=P_{1/2}(\rho),\quad S'=P_{(1-u)/(2u)}(\sigma),\quad T'=P_{(u-1)/(2u)}(N\sigma).Δu​=u−1logReTrPu​[RS′N∗(T′P(1−u)/u​(Nρ)T′)S′R]​,R=P1/2​(ρ),S′=P(1−u)/(2u)​(σ),T′=P(u−1)/(2u)​(Nσ).

Here PtP_tPt​ is spectral functional calculus with scalar value 000 at 000 and xtx^txt elsewhere, and N∗(Y)ij=∑k,lN(∣i⟩⟨j∣)kl‾YklN^*(Y)_{ij}=\sum_{k,l}\overline{N(|i\rangle\langle j|)_{kl}}Y_{kl}N∗(Y)ij​=∑k,l​N(∣i⟩⟨j∣)kl​​Ykl​. Under this conjecture, for every such ρ,σ,N\rho,\sigma,Nρ,σ,N on the particular finite registers A,BA,BA,B, the map

Pσ,N(Z)=σ1/2N∗ ⁣((Nσ)−1/2Z(Nσ)−1/2)σ1/2\mathcal P_{\sigma,N}(Z)= \sigma^{1/2}N^*\!\left((N\sigma)^{-1/2}Z(N\sigma)^{-1/2}\right)\sigma^{1/2}Pσ,N​(Z)=σ1/2N∗((Nσ)−1/2Z(Nσ)−1/2)σ1/2

is a channel and satisfies

−ℓ ⁣(F(ρ,Pσ,N(Nρ)))≤d(ρ,σ;N).-\ell\!\left(F(\rho,\mathcal P_{\sigma,N}(N\rho))\right) \le d(\rho,\sigma;N).−ℓ(F(ρ,Pσ,N​(Nρ)))≤d(ρ,σ;N).

A channel here means a map with a finite Kraus representation whose Kraus operators satisfy ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I; inverse square roots vanish on zero eigenvalues. The squared fidelity is F(X,Y)=(Re⁡Tr⁡X YX)2F(X,Y)=(\operatorname{Re}\operatorname{Tr}\sqrt{\sqrt X\,Y\sqrt X})^2F(X,Y)=(ReTrX​YX​​)2, and ℓ(f)=−∞\ell(f)=-\inftyℓ(f)=−∞ for f≤0f\le0f≤0, otherwise ℓ(f)=log⁡f\ell(f)=\log fℓ(f)=logf. The inequality is in the extended reals, with the real entropy difference embedded there; a nonpositive fidelity makes its left-hand side +∞+\infty+∞. 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