Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit Petz mutual information and its minimizing state

Open
QAlgorithms.Papers.Independent.Intakenext100.P15.petz_mutual_information_formula

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

prove2quantum

All Hilbert spaces are finite-dimensional and nonzero. A density operator is positive semidefinite with trace one; singular states are included. All logarithms are base two. For real α>1\alpha>1α>1, D~α\widetilde D_\alphaDα​ denotes the sandwiched Rényi divergence and DαD_\alphaDα​ the traditional Petz divergence, with value +∞+\infty+∞ on support failure and negative spectral powers taken on the support.

For a bipartite density ρAB\rho_{AB}ρAB​, let ρA=Tr⁡BρAB\rho_A=\operatorname{Tr}_B\rho_{AB}ρA​=TrB​ρAB​ and put Kα=Tr⁡A[((ρA(1−α)/2)⊗IB)ρABα((ρA(1−α)/2)⊗IB)]K_\alpha=\operatorname{Tr}_A[((\rho_A^{(1-\alpha)/2})\otimes I_B)\rho_{AB}^\alpha((\rho_A^{(1-\alpha)/2})\otimes I_B)]Kα​=TrA​[((ρA(1−α)/2​)⊗IB​)ρABα​((ρA(1−α)/2​)⊗IB​)], Zα=Tr⁡Kα1/αZ_\alpha=\operatorname{Tr}K_\alpha^{1/\alpha}Zα​=TrKα1/α​, and σB∗=Kα1/α/Zα\sigma_B^*=K_\alpha^{1/\alpha}/Z_\alphaσB∗​=Kα1/α​/Zα​. Partial-trace cyclicity gives Kα=Tr⁡A[(ρA1−α⊗IB)ρABα]K_\alpha=\operatorname{Tr}_A[(\rho_A^{1-\alpha}\otimes I_B)\rho_{AB}^\alpha]Kα​=TrA​[(ρA1−α​⊗IB​)ρABα​].

The quantity Iα(A;B)ρ=inf⁡σBDα(ρAB∥ρA⊗σB)I_\alpha(A;B)_\rho=\inf_{\sigma_B}D_\alpha(\rho_{AB}\Vert\rho_A\otimes\sigma_B)Iα​(A;B)ρ​=infσB​​Dα​(ρAB​∥ρA​⊗σB​) has the finite explicit value

Iα(A;B)ρ=αα−1log⁡2Zα.I_\alpha(A;B)_\rho=\frac\alpha{\alpha-1}\log_2 Z_\alpha.Iα​(A;B)ρ​=α−1α​log2​Zα​.

Here Zα>0Z_\alpha>0Zα​>0 and σB∗\sigma_B^*σB∗​ is a density attaining that infimum. Thus the source minimum includes singular inputs. The formula expresses state mutual information through a single partial trace and spectral root.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P15
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate Topology

open Filter

namespace QAlgorithms.Papers.Independent.Intakenext100.P15

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

-- These are pinned accepted definitions, not other chunks from the current run.

open QAlgorithms.Papers.Independent.Bridge50.P43 (NormalizedDensity payoff)

open QAlgorithms.Papers.Independent.Dependency50.P09 (Divergence logExt sandwichedD petzD)

open QAlgorithms.Papers.Independent.Information100.P34 (choi)

open QAlgorithms.Papers.Independent.Information100.P63 (schatten)

open QAlgorithms.Papers.Independent.Information100.P71
  (supportPower SupportIncluded stateRelative channelPower diamond)

/-- PDF p.15, Corollary 8, (6.20)--(6.24). The minimum is attained by the
explicit normalized Sibson state, including rank-deficient inputs. -/
theorem petz_mutual_information_formula
    {A B : Type} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
    [Nonempty A] [Nonempty B] (rho : NormalizedDensity (A × B)) (alpha : ℝ) (ha : 1 < alpha) :
    0 < sibsonZ alpha rho.1 ∧ IsDensityMatrix (sibsonState alpha rho.1) ∧
    stateInfo (petzD alpha) rho.1 =
      ((alpha / (alpha - 1) * Real.logb 2 (sibsonZ alpha rho.1) : ℝ) : EReal) ∧
    petzD alpha rho.1 (Matrix.kronecker (traceRight rho.1) (sibsonState alpha rho.1)) =
      stateInfo (petzD alpha) rho.1 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P15

end
Source
Multiplicativity of completely bounded ppp-norms implies a strong converse for entanglement-assisted capacity, arXiv:1310.7028v3, PDF p. 15, Corollary 8: explicit Petz mutual information, (6.20)
Read-back

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

Let A,BA,BA,B be finite nonempty index sets with decidable equality, let ρ\rhoρ be a positive semidefinite trace-one matrix on A×BA\times BA×B, and let α>1\alpha>1α>1. Set ρA=Tr⁡Bρ\rho_A=\operatorname{Tr}_B\rhoρA​=TrB​ρ, with partial traces defined by summing the corresponding diagonal index. For a positive semidefinite matrix XXX, let X[t]X^{[t]}X[t] denote spectral functional calculus with value 000 at zero eigenvalues and value xtx^txt at nonzero eigenvalues, including when t<0t<0t<0. Put

Kα=Tr⁡A ⁣[(ρA[(1−α)/2]⊗IB)ρ[α](ρA[(1−α)/2]⊗IB)],Zα=Re⁡Tr⁡Kα[1/α],τα=Zα−1Kα[1/α].K_\alpha=\operatorname{Tr}_A\!\left[ (\rho_A^{[(1-\alpha)/2]}\otimes I_B)\rho^{[\alpha]} (\rho_A^{[(1-\alpha)/2]}\otimes I_B)\right],\quad Z_\alpha=\operatorname{Re}\operatorname{Tr}K_\alpha^{[1/\alpha]}, \quad \tau_\alpha=Z_\alpha^{-1}K_\alpha^{[1/\alpha]}.Kα​=TrA​[(ρA[(1−α)/2]​⊗IB​)ρ[α](ρA[(1−α)/2]​⊗IB​)],Zα​=ReTrKα[1/α]​,τα​=Zα−1​Kα[1/α]​.

For this α\alphaα, define Dα(X∥Y)=+∞D_\alpha(X\|Y)=+\inftyDα​(X∥Y)=+∞ when ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX, and otherwise define it as (α−1)−1L(Re⁡Tr⁡[X[α]Y[1−α]])(\alpha-1)^{-1}\mathcal L(\operatorname{Re}\operatorname{Tr}[X^{[\alpha]}Y^{[1-\alpha]}])(α−1)−1L(ReTr[X[α]Y[1−α]]), where L(u)=log⁡2u\mathcal L(u)=\log_2uL(u)=log2​u for u>0u>0u>0 and −∞-\infty−∞ for u≤0u\le0u≤0, using extended-real arithmetic. Define

Iα(ρ)=inf⁡σ≥0Tr⁡σ=1Dα(ρ∥ρA⊗σ),I_\alpha(\rho)= \inf_{\substack{\sigma\ge0\\ \operatorname{Tr}\sigma=1}} D_\alpha(\rho\|\rho_A\otimes\sigma),Iα​(ρ)=σ≥0Trσ=1​inf​Dα​(ρ∥ρA​⊗σ),

where σ\sigmaσ ranges over matrices on BBB. The assertion is that Zα>0Z_\alpha>0Zα​>0, that τα\tau_\alphaτα​ is positive semidefinite with trace 111, and that

Iα(ρ)=αα−1log⁡2Zα,Dα(ρ∥ρA⊗τα)=Iα(ρ).I_\alpha(\rho)=\frac{\alpha}{\alpha-1}\log_2Z_\alpha, \qquad D_\alpha(\rho\|\rho_A\otimes\tau_\alpha)=I_\alpha(\rho).Iα​(ρ)=α−1α​log2​Zα​,Dα​(ρ∥ρA​⊗τα​)=Iα​(ρ).

The real expression in the first equality is regarded as an extended real number, and singular density matrices are included.

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