Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1: extending subexponential coding sequences

Proved
QAlgorithms.Papers.Independent.Gap20.P07.subexponentialSequence_extension

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

prove2quantum

Let Δ\DeltaΔ be a finite nonnegative function on pairs of positive integers, decreasing in its first argument and increasing in its second. Suppose Nμ→∞N_\mu\to\inftyNμ​→∞, Nμ+1/Nμ→1N_{\mu+1}/N_\mu\to1Nμ+1​/Nμ​→1, and Δ(Nμ,Mμ)→0\Delta(N_\mu,M_\mu)\to0Δ(Nμ​,Mμ​)→0. For any positive sequences nν,mνn_\nu,m_\nunν​,mν​ with nν→∞n_\nu\to\inftynν​→∞ and

lim sup⁡νmνnν<lim inf⁡μMμNμ,\limsup_\nu\frac{m_\nu}{n_\nu}<\liminf_\mu\frac{M_\mu}{N_\mu},νlimsup​nν​mν​​<μliminf​Nμ​Mμ​​,

one has Δ(nν,mν)→0\Delta(n_\nu,m_\nu)\to0Δ(nν​,mν​)→0. Rate limits are interpreted in the extended nonnegative reals. No monotonicity of the sequence NμN_\muNμ​ itself is assumed. This extends reliable subexponential code sequences using only resource wasting.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.26--27, Lemma 7.1: subexponential means divergence AND successive
ratio tending to one; the rate comparison is strict limsup < liminf. Extended
rate limits retain unbounded rates; the error itself is finite nonnegative. -/
theorem subexponentialSequence_extension (delta : ℕ+ → ℕ+ → ℝ≥0)
    (hmono : ErrorMonotone (fun n m => (delta n m : ℝ≥0∞)))
    (N M : ℕ → ℕ+)
    (hN : Tendsto (fun a => (N a : ℕ)) atTop atTop)
    (hratio : Tendsto (fun a => (N (a + 1) : ℝ) / (N a : ℝ)) atTop (𝓝 1))
    (herror : Tendsto (fun a => delta (N a) (M a)) atTop (𝓝 0))
    (n m : ℕ → ℕ+) (hn : Tendsto (fun a => (n a : ℕ)) atTop atTop)
    (hrate : Filter.limsup (rateRatio n m) atTop < Filter.liminf (rateRatio N M) atTop) :
    Tendsto (fun a => delta (n a) (m a)) atTop (𝓝 0) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 26, Lemma 7.1: extending subexponential coding sequences
Read-back

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

Let δ:N>0×N>0→[0,∞)\delta:\mathbb N_{>0}\times\mathbb N_{>0}\to[0,\infty)δ:N>0​×N>0​→[0,∞) be any function satisfying, for all positive integers u,vu,vu,v,

δ(u+1,v)≤δ(u,v)≤δ(u,v+1),\delta(u+1,v)\le\delta(u,v)\le\delta(u,v+1),δ(u+1,v)≤δ(u,v)≤δ(u,v+1),

where these inequalities are formally taken after embedding the finite nonnegative values into [0,∞][0,\infty][0,∞]. Let Na,Ma,na,maN_a,M_a,n_a,m_aNa​,Ma​,na​,ma​ be four sequences of positive integers, indexed by all a∈Na\in\mathbb Na∈N, such that Na→∞N_a\to\inftyNa​→∞, Na+1/Na→1N_{a+1}/N_a\to1Na+1​/Na​→1 as real numbers, δ(Na,Ma)→0\delta(N_a,M_a)\to0δ(Na​,Ma​)→0, and na→∞n_a\to\inftyna​→∞. Define the rate sequences Ma/NaM_a/N_aMa​/Na​ and ma/nam_a/n_ama​/na​ by division in [0,∞][0,\infty][0,∞]. If

lim sup⁡a→∞mana<lim inf⁡a→∞MaNa,\limsup_{a\to\infty}\frac{m_a}{n_a} < \liminf_{a\to\infty}\frac{M_a}{N_a},a→∞limsup​na​ma​​<a→∞liminf​Na​Ma​​,

then δ(na,ma)→0\delta(n_a,m_a)\to0δ(na​,ma​)→0 in the nonnegative real numbers. The sequences themselves may oscillate; their stated limits and the strict comparison of extended-real rates are the imposed sequence conditions.

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