Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Alpha-Holevo information equals alpha-information radius

Open
QAlgorithms.Papers.Independent.Support50.P19.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 channel on positive-dimensional finite complex spaces and 1<α≤21<\alpha\le21<α≤2. Optimize over all finite ensembles of mixed input density operators and all output density centers. Then

χ~α(N):=max⁡{px,ρx}min⁡σD~α(ωXB∥ωX⊗σ)=min⁡σmax⁡ρD~α(N(ρ)∥σ)=:K~α(N),\widetilde\chi_\alpha(\mathcal N):=\max_{\{p_x,\rho_x\}}\min_\sigma\widetilde D_\alpha(\omega_{XB}\Vert\omega_X\otimes\sigma)=\min_\sigma\max_\rho\widetilde D_\alpha(\mathcal N(\rho)\Vert\sigma)=:\widetilde K_\alpha(\mathcal N),χ​α​(N):={px​,ρx​}max​σmin​Dα​(ωXB​∥ωX​⊗σ)=σmin​ρmax​Dα​(N(ρ)∥σ)=:Kα​(N),

where ωXB=∑xpx∣x⟩⟨x∣⊗N(ρx)\omega_{XB}=\sum_xp_x|x\rangle\langle x|\otimes\mathcal N(\rho_x)ωXB​=∑x​px​∣x⟩⟨x∣⊗N(ρx​). The maximizing ensemble, minimizing center, and each fixed-center maximizing input are attained. The equality supplies the full min–max interface used in subadditivity.

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 pp.18–19, Lemma 14: mixed-ensemble max-min equals the full min-max radius. -/
theorem holevo_eq_radius [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
    (N : Superop I J) (hN : IsChannel N) :
    channelInformation true a N = informationRadius true a N ∧ InformationExtrema true 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. 18, lemma14
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 be a map admitting a finite Kraus representation N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​ for every matrix XXX, with ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Write D(H)\mathcal D(H)D(H) for the positive semidefinite complex matrices indexed by HHH with trace one. For density matrices X,YX,YX,Y, define Da(X∥Y)=+∞D_a(X\|Y)=+\inftyDa​(X∥Y)=+∞ if ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX, and otherwise

Da(X∥Y)=1a−1log⁡2Re⁡tr⁡[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]],D_a(X\|Y)=\frac{1}{a-1}\log_2\operatorname{Re}\operatorname{tr} \left[(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]})^{[a]}\right],Da​(X∥Y)=a−11​log2​Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]],

where spectral powers send zero eigenvalues to zero. For each finite ensemble e=(px,ρx)x<me=(p_x,\rho_x)_{x<m}e=(px​,ρx​)x<m​ of input density matrices, with px≥0p_x\ge0px​≥0 and ∑xpx=1\sum_xp_x=1∑x​px​=1, let Ωe=⨁xpxN(ρx)\Omega_e=\bigoplus_xp_xN(\rho_x)Ωe​=⨁x​px​N(ρx​), let Ωp,σ=⨁xpxσ\Omega_{p,\sigma}=\bigoplus_xp_x\sigmaΩp,σ​=⨁x​px​σ, and put χa(e)=inf⁡σ∈D(J)Da(Ωe∥Ωp,σ)\chi_a(e)=\inf_{\sigma\in\mathcal D(J)}D_a(\Omega_e\|\Omega_{p,\sigma})χa​(e)=infσ∈D(J)​Da​(Ωe​∥Ωp,σ​). Also put Fa(σ)=sup⁡ρ∈D(I)Da(N(ρ)∥σ)F_a(\sigma)=\sup_{\rho\in\mathcal D(I)}D_a(N(\rho)\|\sigma)Fa​(σ)=supρ∈D(I)​Da​(N(ρ)∥σ). Then

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

There exists a finite input ensemble attaining the supremum on the left, there exists an output density matrix attaining the infimum on the right, and for every output density matrix σ\sigmaσ there exists an input density matrix ρ\rhoρ with Fa(σ)=Da(N(ρ)∥σ)F_a(\sigma)=D_a(N(\rho)\|\sigma)Fa​(σ)=Da​(N(ρ)∥σ). Ensembles may have zero weights, and all density matrices may be singular; the asserted extrema are 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