AlexKontorovich/PrimeNumberTheoremAnd
Source indexedlemma · leanprover/lean4:v4.32.0
tendsto_tsum_of_monotone_convergence
PrimeNumberTheoremAnd.Wiener · PrimeNumberTheoremAnd/Wiener.lean:2573 to 2586
Mathematical statement
Exact Lean statement
lemma tendsto_tsum_of_monotone_convergence
{β : Type*} {f : ℕ → β → ENNReal} {g : β → ENNReal}
(hmono : ∀ k, Monotone (fun n => f n k))
(hlim : ∀ k, Tendsto (fun n => f n k) atTop (𝓝 (g k))) :
Tendsto (fun n => ∑' k, f n k) atTop (𝓝 (∑' k, g k))Complete declaration
Lean source
Full Lean sourceLean 4
lemma tendsto_tsum_of_monotone_convergence {β : Type*} {f : ℕ → β → ENNReal} {g : β → ENNReal} (hmono : ∀ k, Monotone (fun n => f n k)) (hlim : ∀ k, Tendsto (fun n => f n k) atTop (𝓝 (g k))) : Tendsto (fun n => ∑' k, f n k) atTop (𝓝 (∑' k, g k)) := by letI : MeasurableSpace β := ⊤ let μ : Measure β := Measure.count have hg_iSup (k : β) : (⨆ n : ℕ, f n k) = g k := iSup_eq_of_tendsto (hmono k) (hlim k) have h_tend_lint : Tendsto (fun n => ∫⁻ k, f n k ∂μ) atTop (𝓝 (∫⁻ k, (⨆ n, f n k) ∂μ)) := by have hmeas : ∀ n, Measurable fun k : β => f n k := fun _ _ _ ↦ trivial have hmono_fn : Monotone (fun n => fun k : β => f n k) := fun _ _ hnm k ↦ hmono k hnm simpa [lintegral_iSup hmeas hmono_fn] using tendsto_atTop_iSup fun _ _ hmn ↦ lintegral_mono fun k ↦ hmono k hmn simpa [μ, lintegral_count, hg_iSup] using h_tend_lint