Theorems · Theorem · computer science
AkraBazziRecurrence.isLittleO_deriv_smoothingFn
deriv AkraBazziRecurrence.smoothingFn =o[Filter.atTop] fun x => x⁻¹
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 214 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
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
- mul_oneproof · cited by 3,885
- Filter.atTopstatement and proof · cited by 2,405
- MulZeroClass.mul_zeroproof · cited by 2,091
- Filter.univ_mem'proof · cited by 1,672
- Real.logproof · cited by 939
- div_eq_mul_invproof · cited by 715
- derivstatement · cited by 676
- neg_mulproof · cited by 654
- Filter.Tendsto.compproof · cited by 560
- neg_zeroproof · cited by 542
- Filter.Eventually.of_forallproof · cited by 526
Cited by2
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isLittleO_deriv_one_add_smoothingFnproof · cited by 1
- AkraBazziRecurrence.isLittleO_deriv_one_sub_smoothingFnproof · cited by 1