Theorems · Theorem · computer science
AkraBazziRecurrence.eventually_asympBound_pos
∀ {α : Type u_1} [inst : Fintype α] {T : ℕ → ℝ} {g : ℝ → ℝ} {a b : α → ℝ} {r : α → ℕ → ℕ} [inst_1 : Nonempty α]
(R : AkraBazziRecurrence T g a b r), ∀ᶠ (n : ℕ) in Filter.atTop, 0 < AkraBazziRecurrence.asympBound g a b n- Cited by
- 3 results in Mathlib
- Foundations
- Depth 200 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- Filter.Eventuallystatement · cited by 3,134
- Filter.atTopstatement · cited by 2,405
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Filter.eventually_gt_atTopproof · cited by 90
- AkraBazziRecurrencestatement and proof · cited by 55
- AkraBazziRecurrence.asympBoundstatement · cited by 10
- AkraBazziRecurrence.asympBound_posproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.smoothingFn_mul_asympBound_isBigO_Tproof · cited by 1
- AkraBazziRecurrence.T_isBigO_smoothingFn_mul_asympBoundproof · cited by 1
- AkraBazziRecurrence.eventually_asympBound_r_posproof · cited by 0