Theorems · Theorem · computer science
AkraBazziRecurrence.T_nonneg
∀ {α : Type u_1} [inst : Fintype α] {T : ℕ → ℝ} {g : ℝ → ℝ} {a b : α → ℝ} {r : α → ℕ → ℕ} [inst_1 : Nonempty α]
(R : AkraBazziRecurrence T g a b r) (n : ℕ), 0 ≤ T n- Cited by
- 1 results in Mathlib
- Foundations
- Depth 106 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- Fintypestatement and proof · cited by 7,736
- le_of_ltproof · cited by 1,175
- AkraBazziRecurrencestatement and proof · cited by 55
- AkraBazziRecurrence.T_posproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.T_isBigO_smoothingFn_mul_asympBoundproof · cited by 1