Theorems · Theorem · computer science
AkraBazziRecurrence.eventually_deriv_rpow_p_mul_one_add_smoothingFn
∀ (p : ℝ),
(deriv fun z => z ^ p * (1 + AkraBazziRecurrence.smoothingFn z)) =ᶠ[Filter.atTop] fun z =>
p * z ^ (p - 1) * (1 + AkraBazziRecurrence.smoothingFn z) - z ^ (p - 1) / Real.log z ^ 2- Cited by
- 1 results in Mathlib
- Foundations
- Depth 215 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
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
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement · cited by 2,405
- Filter.EventuallyEqstatement · cited by 1,912
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- sub_eq_add_negproof · cited by 1,023
- Real.logstatement and proof · cited by 939
- derivstatement and proof · cited by 676
- ne_of_gtproof · cited by 637
- mul_negproof · cited by 590
- lt_transproof · cited by 165
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_add_smoothingFnproof · cited by 1