Theorems · Theorem · approximation theory
Asymptotics.IsLittleO.eventuallyLE
∀ {α : Type u_1} {E : Type u_3} {F : Type u_4} [inst : Norm E] [inst_1 : Norm F] {f : α → E} {g : α → F} {l : Filter α},
f =o[l] g → ∀ᶠ (x : α) in l, ‖f x‖ ≤ ‖g x‖- Defined in
- Mathlib.Analysis.Asymptotics.Defs
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 110 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement · cited by 25,697
- Filterstatement and proof · cited by 8,121
- Norm.normstatement and proof · cited by 5,413
- Filter.Eventuallystatement and proof · cited by 3,134
- one_mulproof · cited by 2,841
- zero_lt_oneproof · cited by 598
- Normstatement and proof · cited by 512
- Asymptotics.IsLittleOstatement and proof · cited by 375
- Asymptotics.IsLittleO.defproof · cited by 9
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.dist_r_b'proof · cited by 2
- AkraBazziRecurrence.rpow_p_mul_one_sub_smoothingFn_leproof · cited by 1
- AkraBazziRecurrence.rpow_p_mul_one_add_smoothingFn_geproof · cited by 1