Theorems · Inductive type · computer science
AkraBazziRecurrence
{α : Type u_1} → [Fintype α] → [Nonempty α] → (ℕ → ℝ) → (ℝ → ℝ) → (α → ℝ) → (α → ℝ) → (α → ℕ → ℕ) → TypeAn Akra-Bazzi recurrence is a function that satisfies the recurrence
T n = (∑ i, a i * T (r i n)) + g n.
- Cited by
- 55 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by62
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.b_posstatement and proof · cited by 18
- AkraBazziRecurrence.b_lt_onestatement and proof · cited by 9
- AkraBazziRecurrence.n₀statement and proof · cited by 9
- AkraBazziRecurrence.g_nonnegstatement and proof · cited by 6
- AkraBazziRecurrence.a_posstatement and proof · cited by 5
- AkraBazziRecurrence.r_lt_nstatement and proof · cited by 5
- AkraBazziRecurrence.eventually_bi_mul_le_rstatement and proof · cited by 4
- AkraBazziRecurrence.tendsto_atTop_rstatement and proof · cited by 4
- AkraBazziRecurrence.dist_r_bstatement and proof · cited by 3
- AkraBazziRecurrence.eventually_asympBound_posstatement and proof · cited by 3
- AkraBazziRecurrence.exists_eventually_const_mul_le_rstatement and proof · cited by 3
- AkraBazziRecurrence.T_posstatement and proof · cited by 2