Theorems · Theorem · approximation theory

Asymptotics.IsEquivalent.neg

∀ {α : Type u_1} {β : Type u_2} [inst : NormedAddCommGroup β] {u v : α → β} {l : Filter α},
  Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l (fun x => -u x) fun x => -v x

Defined in

Mathlib.Analysis.Asymptotics.AsymptoticEquivalent

Cited by

1 results in Mathlib

Foundations

Depth 106 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NormedAddCommGroup