Theorems · Theorem · computer science
AkraBazziRecurrence.eventually_r_le_b
∀ {α : Type u_1} [inst : Fintype α] {T : ℕ → ℝ} {g : ℝ → ℝ} {a b : α → ℝ} {r : α → ℕ → ℕ} [inst_1 : Nonempty α]
(R : AkraBazziRecurrence T g a b r), ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (i : α), ↑(r i n) ≤ b i * ↑n + ↑n / Real.log ↑n ^ 2- Cited by
- 1 results in Mathlib
- Foundations
- Depth 171 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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
- Norm.normproof · cited by 5,413
- Filter.Eventuallystatement · cited by 3,134
- Filter.atTopstatement · cited by 2,405
- le_reflproof · cited by 2,061
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Real.logstatement and proof · cited by 939
- add_le_addproof · cited by 666
- AkraBazziRecurrencestatement and proof · cited by 55
- Real.le_norm_selfproof · cited by 16
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.exists_eventually_r_le_const_mulproof · cited by 1