Uniform channel-radius estimate near one
OpenQAlgorithms.Papers.Independent.Support50.P19.radius_near_oneLet be a finite-dimensional entanglement-breaking channel with nonzero registers. There exist a density operator and a finite real constant such that attains the ordinary information-radius minimum, contains every output support, and for every input density . For every ,
The center and constant precede alpha and all input data. This is a uniform approximation by the single-letter Holevo information, not an assumption about arbitrary comparison states.
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.22–23, (23): an attained center and finite c chosen before all alpha and input data. -/
theorem radius_near_one [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N) (hEB : IsEB N) :
∃ sigma : Matrix J J ℂ, ∃ c : ℝ, CenterControl N sigma c ∧
∀ a : ℝ, 1 < a → a < 1 + Real.logb 2 3 / (4 * Real.logb 2 c) →
informationRadius true a N ≤
(((QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N) + 4 * (a - 1) * (Real.logb 2 c) ^ 2 : ℝ) : EReal) := 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 types with decidable equality, and let for a finite family with . Assume that applying to the second factor of every density matrix on , for every positive integer , gives a finite nonnegative linear combination of tensor products of density matrices, without a separately imposed coefficient-sum condition. There exist a density matrix on and a real such that, for every input density matrix , and , and
For these same , every real with satisfies
All suprema and infima involving divergences are in the extended reals; the right-hand real expression is embedded there. A density matrix is positive semidefinite with trace , and is the real supremum over finite ensembles , with , , of , where . The function is . Under , and ; both are when the inclusion fails. Spectral powers send zero eigenvalues to , matrix logarithms assign there, and the extended logarithm in assigns at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.