Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict type-II rate gap forces exponentially vanishing success

Open
QAlgorithms.Papers.Independent.Gap48.P41.exponentially_fast_strong_converse

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

prove2quantum

Let III be a nonempty finite orthonormal basis, and let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices of trace one with supp⁡ρ⊆supp⁡σ\operatorname{supp}\rho\subseteq\operatorname{supp}\sigmasuppρ⊆suppσ. For a positive integer nnn, an arbitrary effect 0≤An≤I0\le A_n\le I0≤An​≤I accepts the null state ρ⊗n\rho^{\otimes n}ρ⊗n. Write αn(An)=Tr⁡[ρ⊗n(I−An)]\alpha_n(A_n)=\operatorname{Tr}[\rho^{\otimes n}(I-A_n)]αn​(An​)=Tr[ρ⊗n(I−An​)] and βn(An)=Tr⁡[σ⊗nAn]\beta_n(A_n)=\operatorname{Tr}[\sigma^{\otimes n}A_n]βn​(An​)=Tr[σ⊗nAn​]. All logarithms are natural, with log⁡0=−∞\log0=-\inftylog0=−∞ in rates. Write D(ρ∥σ)=Tr⁡[ρ(log⁡ρ−log⁡σ)]D(\rho\Vert\sigma)=\operatorname{Tr}[\rho(\log\rho-\log\sigma)]D(ρ∥σ)=Tr[ρ(logρ−logσ)], using support-restricted spectral logarithms inside the trace.

For every sequence of effects with

lim sup⁡n→∞1nlog⁡βn(An)<−D(ρ∥σ),\limsup_{n\to\infty}\frac1n\log\beta_n(A_n)<-D(\rho\Vert\sigma),n→∞limsup​n1​logβn​(An​)<−D(ρ∥σ),

there are c>0c>0c>0 and a positive threshold NNN such that

1−αn(An)≤e−cn(n≥N).1-\alpha_n(A_n)\le e^{-c n}\qquad(n\ge N).1−αn​(An​)≤e−cn(n≥N).

In particular, αn(An)→1\alpha_n(A_n)\to1αn​(An​)→1. This gives the paper's exponential strong converse, with the decay rate concluded from the strict gap.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P41

open scoped Matrix ComplexOrder BigOperators

open Filter QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28
  (tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
    scaled logNonnegativeExtended)

open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I : Type} [Fintype I] [DecidableEq I]

/-- PDF p.7, Corollary 1, (18): a strict type-II rate gap forces exponential
convergence of alpha to one. Constants are chosen before the block index. -/
theorem exponentially_fast_strong_converse [Nonempty I]
    (rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (hsupp : SupportLE rho sigma) (A : TestSequence I)
    (hrate : limsup (fun k => scaled k (logNonnegativeExtended
      (accept sigma (k + 1) (A k).1))) atTop < -relativeEntropy rho sigma) :
    (∃ c : ℝ, 0 < c ∧ ∃ K : ℕ, ∀ k ≥ K,
      1 - typeI rho (k + 1) (A k).1 ≤ Real.exp (-c * ((k + 1 : ℕ) : ℝ))) ∧
    Tendsto (fun k => typeI rho (k + 1) (A k).1) atTop (nhds 1) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P41

end
Source
Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing, arXiv:quant-ph/9906090v1, PDF p. 7, §4, Corollary 1, (18): exponentially fast strong converse
Read-back

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

Let III be a nonempty finite type with decidable equality, and let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices indexed by III, each of trace 111, with ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ. For every k≥0k\ge0k≥0, let AkA_kAk​ be a matrix indexed by Ik+1I^{k+1}Ik+1 with Ak≥0A_k\ge0Ak​≥0 and 1−Ak≥01-A_k\ge01−Ak​≥0. Define

ak=Re⁡Tr⁡ ⁣(ρ⊗(k+1)(1−Ak)),bk=Re⁡Tr⁡ ⁣(σ⊗(k+1)Ak),D=Re⁡Tr⁡ ⁣(ρ(log⁡ρ−log⁡σ))Re⁡Tr⁡ρ.a_k=\operatorname{Re}\operatorname{Tr}\!\left(\rho^{\otimes(k+1)}(1-A_k)\right),\qquad b_k=\operatorname{Re}\operatorname{Tr}\!\left(\sigma^{\otimes(k+1)}A_k\right),\qquad D=\frac{\operatorname{Re}\operatorname{Tr}\!\left(\rho(\log\rho-\log\sigma)\right)} {\operatorname{Re}\operatorname{Tr}\rho}.ak​=ReTr(ρ⊗(k+1)(1−Ak​)),bk​=ReTr(σ⊗(k+1)Ak​),D=ReTrρReTr(ρ(logρ−logσ))​.

Here tensor powers have entries ∏i=0n−1Xxi,yi\prod_{i=0}^{n-1}X_{x_i,y_i}∏i=0n−1​Xxi​,yi​​, and matrix logarithms use spectral functional calculus with the total real logarithm, including log⁡0=0\log0=0log0=0. Put ℓ(x)=log⁡x\ell(x)=\log xℓ(x)=logx for x>0x>0x>0 and −∞-\infty−∞ otherwise. If the extended real inequality lim sup⁡k→∞ℓ(bk)/(k+1)<−D\limsup_{k\to\infty}\ell(b_k)/(k+1)<-Dlimsupk→∞​ℓ(bk​)/(k+1)<−D holds, then there exist a real c>0c>0c>0 and a natural number KKK such that

1−ak≤e−c(k+1)for every k≥K,1-a_k\le e^{-c(k+1)}\quad\text{for every }k\ge K,1−ak​≤e−c(k+1)for every k≥K,

and ak→1a_k\to1ak​→1 as k→∞k\to\inftyk→∞.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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