Theorems · Theorem · approximation theory
Asymptotics.IsEquivalent.sub_isLittleO
∀ {α : Type u_1} {β : Type u_2} [inst : NormedAddCommGroup β] {u v w : α → β} {l : Filter α},
Asymptotics.IsEquivalent l u v → w =o[l] v → Asymptotics.IsEquivalent l (u - w) v- Cited by
- 3 results in Mathlib
- Foundations
- Depth 112 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- NormedAddCommGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- NormedAddCommGroupstatement and proof · cited by 15,752
- Filterstatement and proof · cited by 8,121
- sub_eq_add_negproof · cited by 1,023
- Asymptotics.IsLittleOstatement and proof · cited by 375
- Asymptotics.IsEquivalentstatement and proof · cited by 98
- Asymptotics.IsLittleO.neg_leftproof · cited by 9
- Asymptotics.IsEquivalent.add_isLittleOproof · cited by 7
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isEquivalent_one_sub_smoothingFn_oneproof · cited by 5
- Function.locallyFinsuppWithin.one_isLittleO_logCounting_singleproof · cited by 1
- Complex.IsExpCmpFilter.isLittleO_cpow_expproof · cited by 1