Theorems · Theorem · approximation theory
Asymptotics.IsLittleO.inv_rev
∀ {α : Type u_1} {𝕜 : Type u_15} {𝕜' : Type u_16} [inst : NormedDivisionRing 𝕜] [inst_1 : NormedDivisionRing 𝕜']
{l : Filter α} {f : α → 𝕜} {g : α → 𝕜'},
f =o[l] g → (∀ᶠ (x : α) in l, f x = 0 → g x = 0) → (fun x => (g x)⁻¹) =o[l] fun x => (f x)⁻¹- Defined in
- Mathlib.Analysis.Asymptotics.Defs
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 119 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realproof · cited by 25,697
- Filterstatement and proof · cited by 8,121
- Filter.Eventuallystatement and proof · cited by 3,134
- Asymptotics.IsLittleOstatement and proof · cited by 375
- NormedDivisionRingstatement and proof · cited by 360
- Asymptotics.IsLittleO.of_isBigOWithproof · cited by 12
- Asymptotics.IsLittleO.def'proof · cited by 6
- Asymptotics.IsBigOWith.inv_revproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isLittleO_deriv_smoothingFnproof · cited by 2
- AkraBazziRecurrence.isLittleO_self_div_log_idproof · cited by 2
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_add_smoothingFnproof · cited by 1
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_sub_smoothingFnproof · cited by 1