Joint high-loss asymptotic of a multiband chain
ProvedQAlgorithms.Papers.Independent.Advance50.P44.multiband_high_lossFix a nonnegative integer and positive integer bandwidths , with . Let the transmissivities approach zero jointly, each remaining in eventually. Define the expression from Eq. (122), in bits per chain use, by
For every such joint approach,
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 , printed approximately as 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.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P44
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any type, let be any nontrivial filter on , let be any natural number, and let be natural numbers with for every index. Let be any family such that, eventually along , every coordinate satisfies , and such that along for each index . Then
Here is the natural logarithm and is the base- 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 . The case is included, in which each minimum has one entry; eventually the denominator is strictly positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.