Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Success bound about an arbitrary fixed center

Open
QAlgorithms.Papers.Independent.Support50.P19.fixedCenter_success

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 nonzero finite complex spaces, 1<α≤21<\alpha\le21<α≤2, and let σ\sigmaσ be any density operator on BBB. A uniform-message code of M≥1M\ge1M≥1 messages using n≥1n\ge1n≥1 channel uses has actual rate R=log⁡2M/nR=\log_2M/nR=log2​M/n and average success satisfying

psucc≤2−nα−1α(R−1nK~α[σ⊗n](N⊗n)),K~α[τ](M)=max⁡ρD~α(M(ρ)∥τ).p_{\rm succ}\le2^{-n\frac{\alpha-1}{\alpha}\left(R-\frac1n\widetilde K_\alpha^{[\sigma^{\otimes n}]}(\mathcal N^{\otimes n})\right)},\qquad\widetilde K_\alpha^{[\tau]}(\mathcal M)=\max_\rho\widetilde D_\alpha(\mathcal M(\rho)\Vert\tau).psucc​≤2−nαα−1​(R−n1​Kα[σ⊗n]​(N⊗n)),Kα[τ]​(M)=ρmax​Dα​(M(ρ)∥τ).

Input density operators and block encodings are unrestricted. If the fixed-center radius is infinite, the right side is +∞+\infty+∞, rather than an exponential computed from a totalized zero. This isolates the center-dependent quantity used in the Hadamard argument.

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 p.25, (26): arbitrary output center; infinite fixed-center radii stay infinite. -/
theorem fixedCenter_success [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
    (N : Superop I J) (hN : IsChannel N) (sigma : {X : Matrix J J ℂ // IsDensityMatrix X})
    (n M : ℕ) (hn : 0 < n) (hM : 0 < M) (C : UACode (Fin n → I) (Fin n → J) M) :
    ENNReal.ofReal (uaCodeSuccess (channelPower N n) C) ≤
      codingBound n a ((Real.logb 2 (M : ℝ) / (n : ℝ)))
        (((1 / (n : ℝ) : ℝ) : EReal) *
          fixedRadius true a (channelPower N n) (tensorPower n sigma.1)) := 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. 25, fixedCenterBound
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, let 1<a≤21<a\le21<a≤2, 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, and let σ\sigmaσ be any positive semidefinite matrix on JJJ of trace 111. For every positive integers n,Mn,Mn,M and every code with input density matrices ρm\rho_mρm​ on InI^nIn and positive semidefinite measurement matrices DmD_mDm​ on JnJ^nJn satisfying ∑mDm=1\sum_mD_m=1∑m​Dm​=1, put PC=M−1∑mRe⁡tr⁡[DmN⊗n(ρm)]P_C=M^{-1}\sum_m\operatorname{Re}\operatorname{tr}[D_mN^{\otimes n}(\rho_m)]PC​=M−1∑m​Retr[Dm​N⊗n(ρm​)]. Then

ofReal⁡(PC)≤E2 ⁣(−n(a−1)a[log⁡2Mn−1nsup⁡ρ a density matrix on InDa(N⊗n(ρ)∥σ⊗n)]).\operatorname{ofReal}(P_C)\le \mathcal E_2\!\left( -\frac{n(a-1)}a \left[\frac{\log_2M}{n} -\frac1n\sup_{\rho\text{ a density matrix on }I^n} D_a(N^{\otimes n}(\rho)\|\sigma^{\otimes n})\right]\right).ofReal(PC​)≤E2​(−an(a−1)​[nlog2​M​−n1​ρ a density matrix on Insup​Da​(N⊗n(ρ)∥σ⊗n)]).

Here N⊗nN^{\otimes n}N⊗n applies NNN independently to the factors, and (σ⊗n)x,y=∏i=0n−1σxi,yi(\sigma^{\otimes n})_{x,y}=\prod_{i=0}^{n-1}\sigma_{x_i,y_i}(σ⊗n)x,y​=∏i=0n−1​σxi​,yi​​. The supremum and exponent arithmetic are extended-real operations; ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) in the nonnegative extended reals, and E2\mathcal E_2E2​ equals 2x2^x2x for finite xxx, +∞+\infty+∞ at +∞+\infty+∞, and 000 at −∞-\infty−∞. For density matrices X,YX,YX,Y, 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)=\frac1{a-1}\log_2\operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]}\right)^{[a]}\right],Da​(X∥Y)=a−11​log2​Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]],

with zero eigenvalues sent to 000 by spectral powers and the extended logarithm equal to −∞-\infty−∞ at zero. The chosen σ\sigmaσ may be singular; no support-inclusion hypothesis is imposed.

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