Tannery's theorem
ProvedFamousTheorems.tannery_theoremTannery's theorem. Let be a family of terms in a Banach space, indexed by and by a parameter running along a filter. Suppose for each , and suppose that eventually for all , with . Then
This is the dominated convergence theorem for series. It justifies passing a limit through an infinite sum. A classical application is the proof that by expanding binomially and taking the limit term by term.
Formalization note. Mathlib's tendsto_tsum_of_dominated_convergence. The limit is taken along an arbitrary filter 𝓕, which covers sequences as the case Filter.atTop on ℕ. ∑' is the unconditional sum (tsum), and the domination hypothesis only has to hold eventually along 𝓕.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem tannery_theorem {α β G : Type*} {𝓕 : Filter α} [NormedAddCommGroup G] [CompleteSpace G] {f : α → β → G}
{g : β → G} {bound : β → ℝ} (h_sum : Summable bound)
(hab : ∀ k, Filter.Tendsto (fun x => f x k) 𝓕 (nhds (g k)))
(h_bound : ∀ᶠ n in 𝓕, ∀ k, ‖f n k‖ ≤ bound k) :
Filter.Tendsto (fun x => ∑' k, f x k) 𝓕 (nhds (∑' k, g k)) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `tendsto_tsum_of_dominated_convergence`. Proof here reduces to that Mathlib result.