Summing the errors of a sequence of increments #
If the increments G (k + 1) - G k of a sequence G are each within D of a prescribed value
g k for k < n, then G n - G 0 is within n • D of the sum ∑ k < n, g k. The increments
telescope, and the errors add up by the triangle inequality.
Likewise, if a subadditive function q is small on each step F (r + 1) - F r of a sequence,
relative to weights w r whose partial sums are at most 1, then it is small on the total
displacement F (N + 1) - F 0. This is how per-stage perturbation estimates, with weights such as
2⁻⁽ʳ⁺¹⁾, are combined into an estimate for the limit of the stages.
Main results #
TauCeti.abs_sub_sub_sum_range_le_of_forall_lt: the bound onG n - G 0 - ∑ k < n, g kfrom the bounds on the increments.TauCeti.lt_of_forall_sub_lt_mul: the telescoping bound for a subadditive function and weights with partial sums at most1.
If the increments G (k + 1) - G k of a sequence are within D of g k for k < n, then
G n - G 0 is within n • D of ∑ k ∈ range n, g k.
A telescoping bound. If a subadditive function q is small on each step F (r + 1) - F r of a
sequence, relative to weights w r summing to at most 1, then it is small on the total
displacement F (N + 1) - F 0.