Theorems · Theorem · approximation theory
Asymptotics.isLittleO_neg_left
∀ {α : Type u_1} {F : Type u_4} {E' : Type u_6} [inst : Norm F] [inst_1 : SeminormedAddCommGroup E'] {g : α → F}
{f' : α → E'} {l : Filter α}, (fun x => -f' x) =o[l] g ↔ f' =o[l] g- Defined in
- Mathlib.Analysis.Asymptotics.Defs
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 104 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- NormSeminormedAddCommGroup
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.
- Realproof · cited by 25,697
- Filterstatement and proof · cited by 8,121
- SeminormedAddCommGroupstatement and proof · cited by 2,671
- Normstatement and proof · cited by 512
- Asymptotics.IsLittleOstatement · cited by 375
- Asymptotics.IsLittleO_defproof · cited by 19
- Asymptotics.isBigOWith_neg_leftproof · cited by 4
Cited by3
Results whose statement or proof uses this declaration.
- Asymptotics.IsLittleO.neg_leftproof · cited by 9
- Asymptotics.IsLittleO.of_neg_leftproof · cited by 1
- AkraBazziRecurrence.isLittleO_deriv_one_sub_smoothingFnproof · cited by 1