Mathlib Map

Theorems · Theorem · computer science

AkraBazziRecurrence.GrowsPolynomially.eventually_atTop_zero_or_pos_or_neg

∀ {f : ℝ → ℝ},
  AkraBazziRecurrence.GrowsPolynomially f →
    (∀ᶠ (x : ℝ) in Filter.atTop, f x = 0) ∨ (∀ᶠ (x : ℝ) in Filter.atTop, 0 < f x) ∨ ∀ᶠ (x : ℝ) in Filter.atTop, f x < 0
Defined in
Mathlib.Computability.AkraBazzi.GrowsPolynomially
Cited by
2 results in Mathlib
Foundations
Depth 202 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

AkraBazziRecurrence.GrowsPolynomially.inv · cited by 3GrowsPolynomially.invAkraBazziRecurrence.GrowsPolynomially.rpow · cited by 3GrowsPolynomially.rpowReal · cited by 25697RealFilter.Eventually · cited by 3134Filter.EventuallyFilter.atTop · cited by 2405Filter.atTopFilter.univ_mem' · cited by 1672Filter.univ_mem'Filter.mp_mem · cited by 1537Filter.mp_memFilter.Frequently · cited by 414Filter.FrequentlyAkraBazziRecurrence.GrowsPolynomially · cited by 41AkraBazziRecurrence.Grows…Filter.eventually_and · cited by 5Filter.eventually_andAkraBazziRecurrence.GrowsPolynomially.eventually_atTop_nonneg_or_nonpos · cited by 4GrowsPolynomially.eventua…AkraBazziRecurrence.GrowsPolynomially.eventually_zero_of_frequently_zero · cited by 1GrowsPolynomially.eventua…GrowsPolynomially.eventually_…CITED BYCITES

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.