Theorems · Theorem · computer science

AkraBazziRecurrence.tendsto_atTop_sumCoeffsExp

∀ {α : Type u_1} [inst : Fintype α] {T : ℕ → ℝ} {g : ℝ → ℝ} {a b : α → ℝ} {r : α → ℕ → ℕ} [inst_1 : Nonempty α]
  (R : AkraBazziRecurrence T g a b r), Filter.Tendsto (fun p => ∑ i, a i * b i ^ p) Filter.atBot Filter.atTop

Defined in

Mathlib.Computability.AkraBazzi.SumTransform

Cited by

1 results in Mathlib

Foundations

Depth 196 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FintypeNonempty