Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Traditional Renyi Holevo information equals its radius

Open
QAlgorithms.Papers.Independent.Support50.P19.petz_holevo_eq_radius

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

prove2quantum

Let N:A→B\mathcal N:A\to BN:A→B be a finite-dimensional channel with nonzero registers and 1<α≤21<\alpha\le21<α≤2. Define χα\chi_\alphaχα​ and KαK_\alphaKα​ by the same ensemble and center optimizations as the sandwiched quantities, but use the unnormalized Petz divergence DαD_\alphaDα​. Then

χα(N)=Kα(N).\chi_\alpha(\mathcal N)=K_\alpha(\mathcal N).χα​(N)=Kα​(N).

The input ensembles contain arbitrary mixed states; extrema are attained. This is a separate identity for traditional relative Renyi entropy, in the range inherited from the preceding proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)

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

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

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

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.19, Remark 15: the same equality for the distinct traditional Petz divergence. -/
theorem petz_holevo_eq_radius [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
    (N : Superop I J) (hN : IsChannel N) :
    channelInformation false a N = informationRadius false a N ∧ InformationExtrema false a N := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 19, remark15
Read-back

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

Let I,JI,JI,J be finite nonempty index sets with decidable equality, let 1<a≤21<a\le21<a≤2, and let NNN admit a finite Kraus representation N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​ for every XXX, with ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Let D(H)\mathcal D(H)D(H) denote the positive semidefinite complex matrices indexed by HHH with trace one. For density matrices X,YX,YX,Y, define Pa(X∥Y)=+∞P_a(X\|Y)=+\inftyPa​(X∥Y)=+∞ when ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX, and otherwise

Pa(X∥Y)=1a−1log⁡2Re⁡tr⁡[X[a]Y[1−a]],P_a(X\|Y)=\frac{1}{a-1}\log_2\operatorname{Re}\operatorname{tr}[X^{[a]}Y^{[1-a]}],Pa​(X∥Y)=a−11​log2​Retr[X[a]Y[1−a]],

where spectral powers send zero eigenvalues to zero. For every finite ensemble e=(px,ρx)x<me=(p_x,\rho_x)_{x<m}e=(px​,ρx​)x<m​ of input density matrices with nonnegative weights summing to one, put Ωe=⨁xpxN(ρx)\Omega_e=\bigoplus_xp_xN(\rho_x)Ωe​=⨁x​px​N(ρx​), Ωp,σ=⨁xpxσ\Omega_{p,\sigma}=\bigoplus_xp_x\sigmaΩp,σ​=⨁x​px​σ, and χaP(e)=inf⁡σ∈D(J)Pa(Ωe∥Ωp,σ)\chi_a^P(e)=\inf_{\sigma\in\mathcal D(J)}P_a(\Omega_e\|\Omega_{p,\sigma})χaP​(e)=infσ∈D(J)​Pa​(Ωe​∥Ωp,σ​); put FaP(σ)=sup⁡ρ∈D(I)Pa(N(ρ)∥σ)F_a^P(\sigma)=\sup_{\rho\in\mathcal D(I)}P_a(N(\rho)\|\sigma)FaP​(σ)=supρ∈D(I)​Pa​(N(ρ)∥σ). Then

sup⁡eχaP(e)=inf⁡σ∈D(J)FaP(σ).\sup_e\chi_a^P(e)=\inf_{\sigma\in\mathcal D(J)}F_a^P(\sigma).esup​χaP​(e)=σ∈D(J)inf​FaP​(σ).

A finite input ensemble attains the left supremum, an output density matrix attains the right infimum, and for every output density matrix σ\sigmaσ, some input density matrix ρ\rhoρ satisfies FaP(σ)=Pa(N(ρ)∥σ)F_a^P(\sigma)=P_a(N(\rho)\|\sigma)FaP​(σ)=Pa​(N(ρ)∥σ). Zero ensemble weights and singular density matrices are allowed, and the extrema are interpreted in the extended real numbers.

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