Theorems · Theorem · approximation theory
Asymptotics.IsEquivalent.add_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
- 7 results in Mathlib
- Foundations
- Depth 111 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.
Cites6
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
- Asymptotics.IsLittleOstatement and proof · cited by 375
- Asymptotics.IsEquivalentstatement and proof · cited by 98
- Asymptotics.IsLittleO.addproof · cited by 17
- add_sub_right_commproof · cited by 10
Cited by7
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isEquivalent_one_add_smoothingFn_oneproof · cited by 4
- Asymptotics.IsLittleO.add_isEquivalentproof · cited by 3
- Asymptotics.IsEquivalent.sub_isLittleOproof · cited by 3
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_add_smoothingFnproof · cited by 1
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_sub_smoothingFnproof · cited by 1
- Asymptotics.IsEquivalent.add_const_of_norm_tendsto_atTopproof · cited by 1
- AkraBazziRecurrence.isEquivalent_smoothingFn_sub_selfproof · cited by 1