Theorems · Theorem · approximation theory
Filter.EventuallyEq.trans_isEquivalent
∀ {α : Type u_1} {β : Type u_2} [inst : NormedAddCommGroup β] {l : Filter α} {f g₁ g₂ : α → β},
f =ᶠ[l] g₁ → Asymptotics.IsEquivalent l g₁ g₂ → Asymptotics.IsEquivalent l f g₂- Cited by
- 0 results in Mathlib
- Foundations
- Depth 120 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
- Filter.EventuallyEqstatement and proof · cited by 1,912
- Asymptotics.IsEquivalentstatement and proof · cited by 98
- Asymptotics.IsEquivalent.transproof · cited by 5
- Filter.EventuallyEq.isEquivalentproof · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.