Weighted-norm representation of the sandwiched radius
OpenQAlgorithms.Papers.Independent.Support50.P19.radius_normLet be a finite-dimensional channel with nonzero registers and let . For write , where is the Schatten alpha-norm. Let consist of density centers whose support contains every channel output support. Then
Input optimizations range over density operators. Incompatible centers have infinite divergence and are excluded from this finite inverse-support expression; singular compatible centers remain allowed. This form links the radius to output-norm multiplicativity.
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 p.19, (16): both norm orders, using the finite inverse-support domain. -/
theorem radius_norm [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (N : Superop I J) (hN : IsChannel N) :
informationRadius true a N = normRadiusBefore a N ∧
normRadiusBefore a N = normRadiusAfter a N ∧ NormExtrema 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 be real, and let admit a finite Kraus representation for every , with . Let be the positive semidefinite complex matrices indexed by with trace one, and let
For positive semidefinite , define , where spectral powers send zero eigenvalues to zero, and define . Define if , and otherwise , where for and otherwise. Then the following three extended-real quantities are equal:
The inner supremum inside the last logarithm is a supremum in . There exists attaining the last infimum, and for every there exists attaining . Compatible centers may be singular; their required kernel inclusion concerns every input density matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.