Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.iff_eventuallyEq
∀ {f g : ℝ → ℝ},
f =ᶠ[Filter.atTop] g → (AkraBazziRecurrence.GrowsPolynomially f ↔ AkraBazziRecurrence.GrowsPolynomially g)- Cited by
- 3 results in Mathlib
- Foundations
- Depth 107 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.atTopstatement and proof · cited by 2,405
- Filter.EventuallyEqstatement and proof · cited by 1,912
- Filter.EventuallyEq.symmproof · cited by 408
- AkraBazziRecurrence.GrowsPolynomiallystatement and proof · cited by 41
- AkraBazziRecurrence.GrowsPolynomially.congr_of_eventuallyEqproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.GrowsPolynomially.absproof · cited by 3
- AkraBazziRecurrence.GrowsPolynomially.invproof · cited by 3
- AkraBazziRecurrence.GrowsPolynomially.mulproof · cited by 2