Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform channel-radius estimate near one

Open
QAlgorithms.Papers.Independent.Support50.P19.radius_near_one

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

prove2quantum

Let NEB\mathcal N_{\rm EB}NEB​ be a finite-dimensional entanglement-breaking channel with nonzero registers. There exist a density operator σ∗\sigma_*σ∗​ and a finite real constant c>1c>1c>1 such that σ∗\sigma_*σ∗​ attains the ordinary information-radius minimum, contains every output support, and ν(NEB(ρ),σ∗)≤c\nu(\mathcal N_{\rm EB}(\rho),\sigma_*)\le cν(NEB​(ρ),σ∗​)≤c for every input density ρ\rhoρ. For every 1<α<1+log⁡23/(4log⁡2c)1<\alpha<1+\log_2 3/(4\log_2c)1<α<1+log2​3/(4log2​c),

K~α(NEB)≤χ(NEB)+4(α−1)(log⁡2c)2.\widetilde K_\alpha(\mathcal N_{\rm EB})\le\chi(\mathcal N_{\rm EB})+4(\alpha-1)(\log_2c)^2.Kα​(NEB​)≤χ(NEB​)+4(α−1)(log2​c)2.

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.

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.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
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 22, eq23
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, and let N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​ for a finite family with ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Assume that applying NNN to the second factor of every density matrix on {0,…,r−1}×I\{0,\ldots,r-1\}\times I{0,…,r−1}×I, for every positive integer rrr, gives a finite nonnegative linear combination of tensor products of density matrices, without a separately imposed coefficient-sum condition. There exist a density matrix σ\sigmaσ on JJJ and a real c>1c>1c>1 such that, for every input density matrix ρ\rhoρ, ker⁡σ⊆ker⁡N(ρ)\ker\sigma\subseteq\ker N(\rho)kerσ⊆kerN(ρ) and ν(N(ρ),σ)≤c\nu(N(\rho),\sigma)\le cν(N(ρ),σ)≤c, and

sup⁡ρ a density matrixD(N(ρ)∥σ)=χ1(N).\sup_{\rho\text{ a density matrix}}D(N(\rho)\|\sigma)=\chi_1(N).ρ a density matrixsup​D(N(ρ)∥σ)=χ1​(N).

For these same σ,c\sigma,cσ,c, every real aaa with 1<a<1+log⁡23/(4log⁡2c)1<a<1+\log_2 3/(4\log_2c)1<a<1+log2​3/(4log2​c) satisfies

inf⁡τ a density matrix  sup⁡ρ a density matrixDa(N(ρ)∥τ)≤χ1(N)+4(a−1)(log⁡2c)2.\inf_{\tau\text{ a density matrix}}\; \sup_{\rho\text{ a density matrix}}D_a(N(\rho)\|\tau) \le \chi_1(N)+4(a-1)(\log_2c)^2.τ a density matrixinf​ρ a density matrixsup​Da​(N(ρ)∥τ)≤χ1​(N)+4(a−1)(log2​c)2.

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 111, and χ1(N)\chi_1(N)χ1​(N) is the real supremum over finite ensembles (px,ρx)(p_x,\rho_x)(px​,ρx​), with px≥0p_x\ge0px​≥0, ∑xpx=1\sum_xp_x=1∑x​px​=1, of H(∑xpxN(ρx))−∑xpxH(N(ρx))H(\sum_xp_xN(\rho_x))-\sum_xp_xH(N(\rho_x))H(∑x​px​N(ρx​))−∑x​px​H(N(ρx​)), where H(X)=−Re⁡tr⁡(Xlog⁡2X)H(X)=-\operatorname{Re}\operatorname{tr}(X\log_2X)H(X)=−Retr(Xlog2​X). The function ν(X,Y)\nu(X,Y)ν(X,Y) is Re⁡tr⁡(X[3/2]Y[−1/2])+Re⁡tr⁡(X[1/2]Y[1/2])+1\operatorname{Re}\operatorname{tr}(X^{[3/2]}Y^{[-1/2]})+\operatorname{Re}\operatorname{tr}(X^{[1/2]}Y^{[1/2]})+1Retr(X[3/2]Y[−1/2])+Retr(X[1/2]Y[1/2])+1. Under ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, D(X∥Y)=Re⁡tr⁡(Xlog⁡2X−Xlog⁡2Y)D(X\|Y)=\operatorname{Re}\operatorname{tr}(X\log_2X-X\log_2Y)D(X∥Y)=Retr(Xlog2​X−Xlog2​Y) and Da(X∥Y)=(a−1)−1log⁡2Re⁡tr⁡[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]]D_a(X\|Y)=(a-1)^{-1}\log_2\operatorname{Re}\operatorname{tr}[(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]})^{[a]}]Da​(X∥Y)=(a−1)−1log2​Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]]; both are +∞+\infty+∞ when the inclusion fails. Spectral powers send zero eigenvalues to 000, matrix logarithms assign 000 there, and the extended logarithm in DaD_aDa​ assigns −∞-\infty−∞ at zero.

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