Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.add_isLittleO
∀ {f g : ℝ → ℝ},
AkraBazziRecurrence.GrowsPolynomially f →
g =o[Filter.atTop] f → AkraBazziRecurrence.GrowsPolynomially fun x => f x + g x- Cited by
- 1 results in Mathlib
- Foundations
- Depth 202 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites37
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
- Norm.normproof · cited by 5,413
- Filter.Eventuallyproof · cited by 3,134
- one_mulproof · cited by 2,841
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- le_reflproof · cited by 2,061
- Nat.cast_zeroproof · cited by 1,870
- Set.Iccproof · cited by 1,702
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Set.Iooproof · cited by 1,214
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.GrowsPolynomially.of_isEquivalentproof · cited by 1