Theorems · Theorem · functional analysis
tendsto_tprod_one_add_of_dominated_convergence
∀ {α : Type u_1} {R : Type u_2} {β : Type u_3} [inst : NormedCommRing R] [NormOneClass R] [CompleteSpace R] {g : β → R}
{bound : β → ℝ} {𝓕 : Filter α} {f : α → β → R},
Summable bound →
(∀ (k : β), Filter.Tendsto (fun x => f x k) 𝓕 (nhds (g k))) →
(∀ᶠ (n : α) in 𝓕, ∀ (k : β), ‖f n k‖ ≤ bound k) →
Filter.Tendsto (fun n => ∏' (k : β), (1 + f n k)) 𝓕 (nhds (∏' (k : β), (1 + g k)))Dominated convergence for infinite products: if f n k → g k for all k and
‖f n k‖ ≤ bound k eventually with bound summable,
then ∏' k, (1 + f n k) → ∏' k, (1 + g k).
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 169 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Finsetproof · cited by 13,712
- Filterstatement and proof · cited by 8,121
- nhdsstatement and proof · cited by 5,554
- Norm.normstatement and proof · cited by 5,413
- Bot.botproof · cited by 4,720
- Filter.Tendstostatement and proof · cited by 3,814
- LE.le.transproof · cited by 3,151
- Filter.Eventuallystatement and proof · cited by 3,134
- CompleteSpacestatement and proof · cited by 2,532
- Finset.prodproof · cited by 2,356
- SummationFilter.unconditionalstatement and proof · cited by 2,068
Cited by1
Results whose statement or proof uses this declaration.
- ModularForm.tendsto_atImInfty_tprod_one_sub_eta_q_powproof · cited by 3