Alpha-Holevo information equals alpha-information radius
OpenQAlgorithms.Papers.Independent.Support50.P19.holevo_eq_radiusLet be a channel on positive-dimensional finite complex spaces and . Optimize over all finite ensembles of mixed input density operators and all output density centers. Then
where . The maximizing ensemble, minimizing center, and each fixed-center maximizing input are attained. The equality supplies the full min–max interface used in subadditivity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index sets with decidable equality, let , and let be a map admitting a finite Kraus representation for every matrix , with . Write for the positive semidefinite complex matrices indexed by with trace one. For density matrices , define if , and otherwise
where spectral powers send zero eigenvalues to zero. For each finite ensemble of input density matrices, with and , let , let , and put . Also put . Then
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 there exists an input density matrix with . Ensembles may have zero weights, and all density matrices may be singular; the asserted extrema are in the extended real numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.