Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.eventually_atTop_nonneg_or_nonpos
∀ {f : ℝ → ℝ},
AkraBazziRecurrence.GrowsPolynomially f → (∀ᶠ (x : ℝ) in Filter.atTop, 0 ≤ f x) ∨ ∀ᶠ (x : ℝ) in Filter.atTop, f x ≤ 0- Cited by
- 4 results in Mathlib
- Foundations
- Depth 201 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites29
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Filter.Eventuallystatement and proof · cited by 3,134
- Set.Nonemptyproof · cited by 2,627
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- Nat.cast_zeroproof · cited by 1,870
- Set.Iccproof · cited by 1,702
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Set.Iooproof · cited by 1,214
- le_of_ltproof · cited by 1,175
- Set.Icoproof · cited by 799
Cited by4
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.GrowsPolynomially.absproof · cited by 3
- AkraBazziRecurrence.GrowsPolynomially.mulproof · cited by 2
- AkraBazziRecurrence.GrowsPolynomially.add_isLittleOproof · cited by 1