Theorems · Theorem · approximation theory
Asymptotics.IsEquivalent.refl
∀ {α : Type u_1} {β : Type u_2} [inst : NormedAddCommGroup β] {u : α → β} {l : Filter α}, Asymptotics.IsEquivalent l u u- Cited by
- 15 results in Mathlib
- Foundations
- Depth 114 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
- sub_selfproof · cited by 996
- Asymptotics.IsLittleOproof · cited by 375
- Asymptotics.IsEquivalentstatement · cited by 98
- Asymptotics.isLittleO_zeroproof · cited by 7
Cited by15
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.isEquivalent_one_sub_smoothingFn_oneproof · cited by 5
- Polynomial.isEquivalent_atTop_leadproof · cited by 5
- AkraBazziRecurrence.isEquivalent_one_add_smoothingFn_oneproof · cited by 4
- isEquivalent_chooseproof · cited by 2
- Polynomial.isEquivalent_cobounded_leading_monomialproof · cited by 2
- ProbabilityTheory.tendsto_choose_mul_pow_atTopproof · cited by 1
- isEquivalent_descFactorialproof · cited by 1
- AkraBazziRecurrence.isBigO_symm_asympBoundproof · cited by 1
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_add_smoothingFnproof · cited by 1
- AkraBazziRecurrence.isEquivalent_deriv_rpow_p_mul_one_sub_smoothingFnproof · cited by 1
- AkraBazziRecurrence.isEquivalent_smoothingFn_sub_selfproof · cited by 1
- Complex.IsExpCmpFilter.isLittleO_cpow_expproof · cited by 1