Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotonicity of fixed-reference Petz conditional entropies

Proved
QAlgorithms.Papers.Independent.Support50.P23.alphaMonotone

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ and σB\sigma_BσB​ be normalized states on finite-dimensional nonzero complex systems. For finite α>0\alpha>0α>0, α≠1\alpha\ne1α=1, use the regularized Petz conditional entropy Hα=(1−α)−1log⁡2tr⁡[ρABα(IA⊗σB)1−α]H_\alpha=(1-\alpha)^{-1}\log_2\operatorname{tr}[\rho_{AB}^{\alpha}(I_A\otimes\sigma_B)^{1-\alpha}]Hα​=(1−α)−1log2​tr[ρABα​(IA​⊗σB​)1−α]. Order one is the fixed-reference von Neumann entropy; zero and infinity are its order limits. For every 0≤α≤β≤∞0\le\alpha\le\beta\le\infty0≤α≤β≤∞,

Hβ(A∣B)ρ∣σ≤Hα(A∣B)ρ∣σ.H_\beta(A|B)_{\rho|\sigma}\le H_\alpha(A|B)_{\rho|\sigma}.Hβ​(A∣B)ρ∣σ​≤Hα​(A∣B)ρ∣σ​.

Singular references retain extended values. The reference is fixed throughout; this result compares orders within the same family.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
Formal statement
noncomputable section

open Filter

open scoped ENNReal ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Support50.P23

attribute [local instance] Classical.propDecidable

-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.

open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)

open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)

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

open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)

variable {A B C D I : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]

/-- Lemma 3, PDF p.4: decreasing fixed-reference entropy at all orders, including 0,1,infinity. -/
theorem alphaMonotone [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
    Antitone (alphaEntropy rho sigma) := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 4, Lemma 3: monotonicity of fixed-reference alpha entropy
Read-back

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

Let A,BA,BA,B be finite, nonempty index types with decidable equality, and let ρ\rhoρ on A×BA\times BA×B and σ\sigmaσ on BBB be positive semidefinite complex matrices of trace one. Put Q=IA⊗σQ=I_A\otimes\sigmaQ=IA​⊗σ, and say that ρ\rhoρ is supported by QQQ when ker⁡Q⊆ker⁡ρ\ker Q\subseteq\ker\rhokerQ⊆kerρ. Write S(ρ)=−Re⁡tr⁡[x↦xlog⁡2x](ρ)S(\rho)=-\operatorname{Re}\operatorname{tr}[x\mapsto x\log_2x](\rho)S(ρ)=−Retr[x↦xlog2​x](ρ), with matrix functions interpreted by continuous functional calculus, and set L(0)=−∞L(0)=-\inftyL(0)=−∞, L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise. For real t>0t>0t>0, define Ht(ρ,σ)H_t(\rho,\sigma)Ht​(ρ,σ) to be Re⁡tr⁡[ρlog⁡2Q]+S(ρ)\operatorname{Re}\operatorname{tr}[\rho\log_2Q]+S(\rho)Retr[ρlog2​Q]+S(ρ) if t=1t=1t=1 and the support condition holds, −∞-\infty−∞ if t=1t=1t=1 and it fails, −∞-\infty−∞ if t>1t>1t>1 and it fails, and otherwise

Ht(ρ,σ)=11−t L ⁣(Re⁡tr⁡[ρtgt(Q)]),gt(x)={0x=0,x1−tx≠0.H_t(\rho,\sigma)=\frac{1}{1-t}\, L\!\left(\operatorname{Re}\operatorname{tr}\bigl[\rho^t g_t(Q)\bigr]\right), \qquad g_t(x)= \begin{cases}0&x=0,\\x^{1-t}&x\ne0.\end{cases}Ht​(ρ,σ)=1−t1​L(Retr[ρtgt​(Q)]),gt​(x)={0x1−t​x=0,x=0.​

Extend this function to [0,+∞][0,+\infty][0,+∞] by H0=sup⁡t>0HtH_0=\sup_{t>0}H_tH0​=supt>0​Ht​, H∞=inf⁡t>0HtH_\infty=\inf_{t>0}H_tH∞​=inft>0​Ht​, and by the displayed finite-order definition at every positive finite order. The assertion is that this extended-real-valued function is antitone: for every α,β∈[0,+∞]\alpha,\beta\in[0,+\infty]α,β∈[0,+∞], α≤β\alpha\le\betaα≤β implies Hβ(ρ,σ)≤Hα(ρ,σ)H_\beta(\rho,\sigma)\le H_\alpha(\rho,\sigma)Hβ​(ρ,σ)≤Hα​(ρ,σ). This includes orders zero and +∞+\infty+∞ and singular density matrices.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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