Theorems · Definition · approximation theory
Asymptotics.IsLittleO
{α : Type u_18} → {E : Type u_19} → {F : Type u_20} → [Norm E] → [Norm F] → Filter α → (α → E) → (α → F) → PropThe Landau notation f =o[l] g where f and g are two functions on a type α and l is
a filter on α, means that eventually for l, ‖f‖ is bounded by an arbitrarily small constant
multiple of ‖g‖. In other words, ‖f‖ / ‖g‖ tends to 0 along l, modulo division by zero
issues that are avoided by this definition.
- Defined in
- Mathlib.Analysis.Asymptotics.Defs
- Cited by
- 375 results in Mathlib
- Foundations
- Depth 102 from the axioms, rests on 1,969 definitions · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by381
Results whose statement or proof uses this declaration.
- Asymptotics.IsEquivalentproof · cited by 98
- Asymptotics.IsLittleO.isBigOstatement and proof · cited by 35
- Asymptotics.IsBigO.trans_isLittleOstatement and proof · cited by 32
- Asymptotics.isLittleO_iffstatement · cited by 23
- Asymptotics.IsLittleO.congr'statement and proof · cited by 20
- Asymptotics.isLittleO_one_iffstatement · cited by 20
- Asymptotics.IsLittleO.trans_isBigOstatement and proof · cited by 19
- Asymptotics.IsLittleO_defstatement · cited by 19
- Asymptotics.IsLittleO.comp_tendstostatement and proof · cited by 18
- Asymptotics.IsLittleO.addstatement and proof · cited by 17
- Asymptotics.IsBigO.mul_isLittleOstatement and proof · cited by 15
- Asymptotics.IsEquivalent.reflproof · cited by 15
Showing the 200 most cited of 381.