Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.pow
∀ {f : ℝ → ℝ} (p : ℕ),
AkraBazziRecurrence.GrowsPolynomially f →
(∀ᶠ (x : ℝ) in Filter.atTop, 0 ≤ f x) → AkraBazziRecurrence.GrowsPolynomially fun x => f x ^ p- Cited by
- 3 results in Mathlib
- Foundations
- Depth 204 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
- Filter.Eventuallystatement and proof · cited by 3,134
- Filter.atTopstatement and proof · cited by 2,405
- AkraBazziRecurrence.GrowsPolynomiallystatement and proof · cited by 41
- AkraBazziRecurrence.GrowsPolynomially.rpowproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.growsPolynomially_powproof · cited by 0