Theorems · Theorem · computer science

AkraBazziRecurrence.sumCoeffsExp_p_eq_one

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

Defined in

Mathlib.Computability.AkraBazzi.SumTransform

Cited by

2 results in Mathlib

Foundations

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

Assumes

FintypeNonempty