Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Joint high-loss asymptotic of a multiband chain

Proved
QAlgorithms.Papers.Independent.Advance50.P44.multiband_high_loss

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix a nonnegative integer NNN and positive integer bandwidths MiM_iMi​, with i=0,…,Ni=0,\ldots,Ni=0,…,N. Let the transmissivities ηi(t)\eta_i(t)ηi​(t) approach zero jointly, each remaining in (0,1)(0,1)(0,1) eventually. Define the expression from Eq. (122), in bits per chain use, by

G(t)=min⁡0≤i≤N{−Milog⁡2(1−ηi(t))}.G(t)=\min_{0\le i\le N}\{-M_i\log_2(1-\eta_i(t))\}.G(t)=0≤i≤Nmin​{−Mi​log2​(1−ηi​(t))}.

For every such joint approach,

G(t)(min⁡0≤i≤NMiηi(t))/ln⁡2⟶1.\frac{G(t)}{\bigl(\min_{0\le i\le N}M_i\eta_i(t)\bigr)/\ln2}\longrightarrow1.(min0≤i≤N​Mi​ηi​(t))/ln2G(t)​⟶1.

Different links may approach zero at different rates. The finite link set and its bandwidths are fixed. In nats the leading coefficient is one; in bits it is exactly 1/ln⁡21/\ln21/ln2, printed approximately as 1.441.441.44 in Eq. (123).

Formalization Note An arbitrary nontrivial filter represents the joint approach. Each minimum is over the same nonempty finite set of actual link labels. This node concerns the explicit scalar expression, not a replacement definition of operational capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P44
Formal statement
namespace QAlgorithms.Papers.Independent.Advance50.P44

noncomputable section

open Filter

/-- PDF p.20, Eq.(123): for a fixed finite link set and fixed positive
bandwidths, the multiband expression is asymptotic to min_i(M_i eta_i)/ln 2.
An arbitrary nontrivial filter expresses every joint high-loss approach,
including unequal rates of decay of the link transmissivities. No uniformity
in a varying repeater count or varying bandwidths is asserted. -/
theorem multiband_high_loss {A : Type*} (l : Filter A) [NeBot l]
    (N : ℕ) (M : Fin (N + 1) → ℕ) (hM : ∀ i, 0 < M i)
    (eta : A → Fin (N + 1) → ℝ)
    (heta : ∀ᶠ t in l, ∀ i, 0 < eta t i ∧ eta t i < 1)
    (hlim : ∀ i, Tendsto (fun t => eta t i) l (nhds 0)) :
    Tendsto (fun t => multibandLossExpression N M (eta t) /
      (sInf (Set.range (fun i : Fin (N + 1) => (M i : ℝ) * eta t i)) /
        Real.log 2)) l (nhds 1) := by sorry

end

end QAlgorithms.Papers.Independent.Advance50.P44
Source
End-to-end capacities of a quantum communication network, arXiv:1905.12674v1, PDF p. 20, Unnumbered high-loss multiband scaling, Eq. (123)
Read-back

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

Let AAA be any type, let F\mathcal FF be any nontrivial filter on AAA, let NNN be any natural number, and let (Mi)i=0N(M_i)_{i=0}^{N}(Mi​)i=0N​ be natural numbers with Mi>0M_i>0Mi​>0 for every index. Let η:A→RN+1\eta:A\to\mathbb R^{N+1}η:A→RN+1 be any family such that, eventually along F\mathcal FF, every coordinate satisfies 0<ηi(t)<10<\eta_i(t)<10<ηi​(t)<1, and such that ηi(t)→0\eta_i(t)\to0ηi​(t)→0 along F\mathcal FF for each index iii. Then

min⁡0≤i≤N[−Milog⁡2 ⁣(1−ηi(t))](min⁡0≤i≤NMiηi(t))/ln⁡2⟶1along F.\frac{ \min_{0\le i\le N}\left[-M_i\log_2\!\left(1-\eta_i(t)\right)\right] }{ \left(\min_{0\le i\le N}M_i\eta_i(t)\right)/\ln2 } \longrightarrow 1 \qquad\text{along }\mathcal F.(min0≤i≤N​Mi​ηi​(t))/ln2min0≤i≤N​[−Mi​log2​(1−ηi​(t))]​⟶1along F.

Here ln⁡\lnln is the natural logarithm and log⁡2\log_2log2​ is the base-222 logarithm. Both minima are the infima of the displayed finite, nonempty sets. The assumptions on the coordinates need hold only eventually; outside that eventual set, the expression still uses total real logarithms and division, with logarithm at zero and division by zero both defined to be 000. The case N=0N=0N=0 is included, in which each minimum has one entry; eventually the denominator is strictly positive.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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