Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantum Sibson identity for the Petz divergence

Open
QAlgorithms.Papers.Independent.Intakenext100.P15.quantum_sibson_identity

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α​].

For every density σB\sigma_BσB​ and every α>1\alpha>1α>1, the normalization satisfies Zα>0Z_\alpha>0Zα​>0, the constructed σB∗\sigma_B^*σB∗​ is a density, and

Dα(ρAB∥ρA⊗σB)=Dα(σB∗∥σB)+Dα(ρAB∥ρA⊗σB∗).D_\alpha(\rho_{AB}\Vert\rho_A\otimes\sigma_B)=D_\alpha(\sigma_B^*\Vert\sigma_B)+D_\alpha(\rho_{AB}\Vert\rho_A\otimes\sigma_B^*).Dα​(ρAB​∥ρA​⊗σB​)=Dα​(σB∗​∥σB​)+Dα​(ρAB​∥ρA​⊗σB∗​).

The equality holds in the extended reals for singular comparisons as well. This decomposition supplies the explicit minimizing comparison state for Petz mutual information.

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 pp.14--15, Lemma 7, (6.7)--(6.8). Z>0 and normalization are conclusions;
the optimizer is constructed from the actual marginal and retains singular comparisons. -/
theorem quantum_sibson_identity
    {A B : Type} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
    [Nonempty A] [Nonempty B] (rho : NormalizedDensity (A × B)) (sigma : NormalizedDensity B)
    (alpha : ℝ) (ha : 1 < alpha) :
    0 < sibsonZ alpha rho.1 ∧ IsDensityMatrix (sibsonState alpha rho.1) ∧
    sibsonK alpha rho.1 =
      traceLeft (Matrix.kronecker (supportPower (traceRight rho.1) (1 - alpha))
        (1 : Matrix B B ℂ) * supportPower rho.1 alpha) ∧
    petzD alpha rho.1 (Matrix.kronecker (traceRight rho.1) sigma.1) =
      petzD alpha (sibsonState alpha rho.1) sigma.1 +
        petzD alpha rho.1 (Matrix.kronecker (traceRight rho.1) (sibsonState 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. 14, Lemma 7 (Quantum Sibson identity), (6.7)–(6.8)
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 matrix of trace 111 on A×BA\times BA×B, let σ\sigmaσ be a positive semidefinite matrix of trace 111 on BBB, and let α>1\alpha>1α>1. Write ρA=Tr⁡Bρ\rho_A=\operatorname{Tr}_B\rhoρA​=TrB​ρ, where (Tr⁡Bρ)a,a′=∑bρ(a,b),(a′,b)(\operatorname{Tr}_B\rho)_{a,a'}=\sum_b\rho_{(a,b),(a',b)}(TrB​ρ)a,a′​=∑b​ρ(a,b),(a′,b)​, and write (Tr⁡AX)b,b′=∑aX(a,b),(a,b′)(\operatorname{Tr}_A X)_{b,b'}=\sum_aX_{(a,b),(a,b')}(TrA​X)b,b′​=∑a​X(a,b),(a,b′)​. For a positive semidefinite matrix XXX, define X[t]X^{[t]}X[t] by spectral functional calculus using the scalar function that is 000 at 000 and xtx^txt at every nonzero eigenvalue; in particular, zero eigenvalues remain zero even for negative exponents. Define

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],\qquad Z_\alpha=\operatorname{Re}\operatorname{Tr}K_\alpha^{[1/\alpha]}, \qquad \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 matrices X,YX,YX,Y, the divergence used here is Dα(X∥Y)=+∞D_\alpha(X\|Y)=+\inftyDα​(X∥Y)=+∞ if ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX; otherwise it is

Dα(X∥Y)=1α−1 L ⁣(Re⁡Tr⁡[X[α]Y[1−α]]),D_\alpha(X\|Y)=\frac{1}{\alpha-1}\, \mathcal L\!\left(\operatorname{Re}\operatorname{Tr} [X^{[\alpha]}Y^{[1-\alpha]}]\right),Dα​(X∥Y)=α−11​L(ReTr[X[α]Y[1−α]]),

with arithmetic in the extended real numbers, where L(u)=log⁡2u\mathcal L(u)=\log_2uL(u)=log2​u for u>0u>0u>0 and L(u)=−∞\mathcal L(u)=-\inftyL(u)=−∞ for u≤0u\le0u≤0. The assertion is that Zα>0Z_\alpha>0Zα​>0, that τα\tau_\alphaτα​ is positive semidefinite with trace 111, and that

Kα=Tr⁡A[(ρA[1−α]⊗IB)ρ[α]],Dα(ρ∥ρA⊗σ)=Dα(τα∥σ)+Dα(ρ∥ρA⊗τα).K_\alpha=\operatorname{Tr}_A[(\rho_A^{[1-\alpha]}\otimes I_B)\rho^{[\alpha]}], \qquad D_\alpha(\rho\|\rho_A\otimes\sigma) = D_\alpha(\tau_\alpha\|\sigma) + D_\alpha(\rho\|\rho_A\otimes\tau_\alpha).Kα​=TrA​[(ρA[1−α]​⊗IB​)ρ[α]],Dα​(ρ∥ρA​⊗σ)=Dα​(τα​∥σ)+Dα​(ρ∥ρA​⊗τα​).

No invertibility of ρ\rhoρ or σ\sigmaσ is assumed; the equality uses the stated extended-real conventions.

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