Theorems · Theorem · computer science
AkraBazziRecurrence.T_pos
∀ {α : 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
- 2 results in Mathlib
- Foundations
- Depth 105 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Finset.univproof · cited by 3,473
- mul_posproof · cited by 374
- lt_or_geproof · cited by 182
- add_pos_of_pos_of_nonnegproof · cited by 63
- AkraBazziRecurrencestatement and proof · cited by 55
- Finset.univ_nonemptyproof · cited by 50
- Finset.sum_posproof · cited by 15
- AkraBazziRecurrence.n₀proof · cited by 9
- AkraBazziRecurrence.g_nonnegproof · cited by 6
- AkraBazziRecurrence.r_lt_nproof · cited by 5
Cited by2
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.smoothingFn_mul_asympBound_isBigO_Tproof · cited by 1
- AkraBazziRecurrence.T_nonnegproof · cited by 1