Theorems · Theorem · real analysis
Polynomial.isEquivalent_atBot_lead
∀ {𝕜 : Type u_1} [inst : NormedField 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (P : Polynomial 𝕜)
[OrderTopology 𝕜],
Asymptotics.IsEquivalent Filter.atBot (fun x => Polynomial.eval x P) fun x => P.leadingCoeff * x ^ P.natDegree- Defined in
- Mathlib.Analysis.Polynomial.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 122 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Filterproof · cited by 8,121
- Polynomialstatement and proof · cited by 5,681
- mul_oneproof · cited by 3,885
- one_mulproof · cited by 2,841
- SeminormedAddCommGroupproof · cited by 2,671
- IsStrictOrderedRingstatement and proof · cited by 2,490
- mul_commproof · cited by 2,262
- Polynomial.Xproof · cited by 1,639
- OrderTopologystatement and proof · cited by 1,355
- Polynomial.natDegreestatement and proof · cited by 1,105
- NormedFieldstatement and proof · cited by 1,084
Cited by1
Results whose statement or proof uses this declaration.
- Polynomial.isEquivalent_atBot_divproof · cited by 1